Re: Google Summer of Code 2008

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: Google Summer of Code 2008
Дата
Msg-id 6430.1205007198@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: Google Summer of Code 2008  (Oleg Bartunov <oleg@sai.msu.su>)
Ответы Re: Google Summer of Code 2008
Список 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 по дате отправления:

Предыдущее
От: Oleg Bartunov
Дата:
Сообщение: Re: Google Summer of Code 2008
Следующее
От: "Michał Zaborowski"
Дата:
Сообщение: constraint with no check