Re: Google Summer of Code 2008 - Mailing list pgsql-hackers

From Tom Lane
Subject Re: Google Summer of Code 2008
Date
Msg-id 6430.1205007198@sss.pgh.pa.us
Whole thread Raw
In response to Re: Google Summer of Code 2008  (Oleg Bartunov <oleg@sai.msu.su>)
Responses Re: Google Summer of Code 2008
List pgsql-hackers
Oleg Bartunov <oleg@sai.msu.su> writes:
> On Sat, 8 Mar 2008, Jan Urbaski wrote:
>> I have a feeling that in many cases identifying the top 50 to 300 lexemes 
>> would be enough to talk about text search selectivity with a degree of 
>> confidence. At least we wouldn't give overly low estimates for queries 
>> looking for very popular words, which I believe is worse than givng an overly 
>> high estimate for a obscure query (am I wrong here?).

> Unfortunately, selectivity estimation for query is much difficult than 
> just estimate frequency of individual word.

It'd be an oversimplification, sure, but almost any degree of smarts
would be a huge improvement over what we have now ...
        regards, tom lane


pgsql-hackers by date:

Previous
From: Oleg Bartunov
Date:
Subject: Re: Google Summer of Code 2008
Next
From: "Michał Zaborowski"
Date:
Subject: constraint with no check