Re: gsoc, oprrest function for text search take 2
От | Jan Urbański |
---|---|
Тема | Re: gsoc, oprrest function for text search take 2 |
Дата | |
Msg-id | 48A4A6CE.5010406@students.mimuw.edu.pl обсуждение исходный текст |
Ответ на | Re: gsoc, oprrest function for text search take 2 (Alvaro Herrera <alvherre@commandprompt.com>) |
Ответы |
Re: gsoc, oprrest function for text search take 2
|
Список | pgsql-hackers |
Alvaro Herrera wrote: > Jan Urbański wrote: >> Heikki Linnakangas wrote: > >>> Sounds like a plan. In (2), it's even better to detoast the values >>> lazily. For a typical one-word tsquery, the binary search will only >>> look at a small portion of the elements. >> Hm, how can I do that? Toast is still a bit black magic to me... Do you >> mean I should stick to having Datums in TextFreq? > > Store both the Datum and the text *. If the latter is NULL, then grab > the datum, detoast and store the result in the text *. Next time you > need to look at it, it's already detoasted. Yeah, I got that idea, but then I thought the chances of touching the same element during binary search twice were very small. Especially now when the detoasting occurs only when we hit a text Datum that has the same length as the sought lexeme. Still, I can do it if people feel like it. Cheers, Jan -- Jan Urbanski GPG key ID: E583D7D2 ouden estin
В списке pgsql-hackers по дате отправления: