On Sat, 8 Mar 2008, Tom Lane wrote:
Oleg Bartunov <[EMAIL PROTECTED]> 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 ...
yes, given that the most popular queries are just one-word long.
Regards,
Oleg
_____________________________________________________________
Oleg Bartunov, Research Scientist, Head of AstroNet (www.astronet.ru),
Sternberg Astronomical Institute, Moscow University, Russia
Internet: [EMAIL PROTECTED], http://www.sai.msu.su/~megera/
phone: +007(495)939-16-83, +007(495)939-23-83
--
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers
