X-Original-To: pgsql-sql-postgresql.org@postgresql.org
Received: from localhost (wm.hub.org [200.46.204.128])
	by postgresql.org (Postfix) with ESMTP id A62B39FA621
	for <pgsql-sql-postgresql.org@postgresql.org>;
	Fri, 18 Aug 2006 12:07:42 -0300 (ADT)
Received: from postgresql.org ([200.46.204.71])
	by localhost (mx1.hub.org [200.46.204.128]) (amavisd-new, port 10024)
	with ESMTP id 76028-07 for <pgsql-sql-postgresql.org@postgresql.org>;
	Fri, 18 Aug 2006 15:07:26 +0000 (UTC)
X-Greylist: domain auto-whitelisted by SQLgrey-
Received: from ug-out-1314.google.com (ug-out-1314.google.com [66.249.92.171])
	by postgresql.org (Postfix) with ESMTP id DFF759FA4F0
	for <pgsql-sql@postgresql.org>; Fri, 18 Aug 2006 12:07:25 -0300 (ADT)
Received: by ug-out-1314.google.com with SMTP id m3so894271ugc
	for <pgsql-sql@postgresql.org>; Fri, 18 Aug 2006 08:07:24 -0700 (PDT)
DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com;
	h=received:message-id:date:from:to:subject:cc:in-reply-to:mime-version:content-type:references;
	b=erRjNsFmFX3MvrKy0P2CKODs5Amtjq9/9IkWXSw7i5vF6GoEhKVC6MPqDBotP4n1ChnpZ5H74DC26bNonJsXdcOFZ780nHmuCLd2K19hJ7HV1M5vFamcunjegDPdh/DnYrC1+E5JnkYYRwMjrv6nytT2ZpaYl3UMBo9tA13J9k0=
Received: by 10.67.100.12 with SMTP id c12mr1823406ugm;
	Fri, 18 Aug 2006 08:07:24 -0700 (PDT)
Received: by 10.66.248.13 with HTTP; Fri, 18 Aug 2006 08:07:24 -0700 (PDT)
Message-ID: <7539aebb0608180807j4ca4da62l4e464f4ea4eaa984@mail.gmail.com>
Date: Fri, 18 Aug 2006 11:07:24 -0400
From: Sumeet <asumeet@gmail.com>
To: "Andrew Sullivan" <ajs@crankycanuck.ca>
Subject: Re: Multiple DB join
Cc: pgsql-sql@postgresql.org
In-Reply-To: <20060815144539.GE21939@phlogiston.dyndns.org>
MIME-Version: 1.0
Content-Type: multipart/alternative;
	boundary="----=_Part_52294_30313324.1155913644620"
References: <44E0EA72.2090505@indiana.edu>
	<20060815103624.GA21634@phlogiston.dyndns.org>
	<44E1D61D.4020400@indiana.edu>
	<20060815141712.GB21939@phlogiston.dyndns.org>
	<7539aebb0608150735l34e59630m25487549c8e6de2d@mail.gmail.com>
	<20060815144539.GE21939@phlogiston.dyndns.org>
X-Virus-Scanned: Maia Mailguard 1.0.1
X-Spam-Status: No, hits=3.974 tagged_above=0 required=5 tests=FUZZY_MILLION,
	HTML_30_40, HTML_MESSAGE, SPF_PASS
X-Spam-Level: ***
X-Archive-Number: 200608/142
X-Sequence-Number: 26100

------=_Part_52294_30313324.1155913644620
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

On 8/15/06, Andrew Sullivan <ajs@crankycanuck.ca> wrote:

> > I previously thought of doing the full text search indexing thing...but
> i
> > had a intution that the full text search thing is for fields which have
> very
> > large strings.......but in my case the  strings are not above 200 chars
> in
>
> No, it's for data where you're going to be searching in random pieces
> of the text.  I think you should look at tsearch2, probably.


Will the full text search indexing help me achive a good speed in searching
keywords???

If you had any way to enforce bounded searches, it'd be a different
> matter: strings with initial matches but an unbound end are fast.
> (You can do it the other way, too, by some tricks with reversing the
> strings.)



can someone plz ellaborate a little about ways we can enforce bounded
searches?. I'm basically trying a simple search
i.e. trying to find name of authors user enters into a interface against the
20 miliions records in my db. Can anyone suggest a good way to perform this
kind of search ?.


Thanks,
Sumeet.

------=_Part_52294_30313324.1155913644620
Content-Type: text/html; charset=ISO-8859-1
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

On 8/15/06, <b class="gmail_sendername">Andrew Sullivan</b> &lt;<a href="mailto:ajs@crankycanuck.ca">ajs@crankycanuck.ca</a>&gt; wrote:<div><span class="gmail_quote"></span><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
&gt; I previously thought of doing the full text search indexing thing...but i<br>&gt; had a intution that the full text search thing is for fields which have very<br>&gt; large strings.......but in my case the&nbsp;&nbsp;strings are not above 200 chars in
<br><br>No, it's for data where you're going to be searching in random pieces<br>of the text.&nbsp;&nbsp;I think you should look at tsearch2, probably.</blockquote><div><br><span style="font-weight: bold;">Will the full text search indexing help me achive a good speed in searching keywords???&nbsp;
</span></div><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">If you had any way to enforce bounded searches, it'd be a different<br>matter: strings with initial matches but an unbound end are fast.
<br>(You can do it the other way, too, by some tricks with reversing the<br>strings.)</blockquote><div><br><br><span style="font-weight: bold;">can someone plz ellaborate a little about ways we can enforce bounded searches?. I'm basically trying a simple search
<br>i.e. trying to find name of authors user enters into a interface against the 20 miliions records in my db. Can anyone suggest a good way to perform this kind of search ?.<br></span>&nbsp;</div><br></div>Thanks,<br>Sumeet.<br>


------=_Part_52294_30313324.1155913644620--