Обсуждение: re:re :tsearch2 problem

teodor:

         thanks very much for your kindness.

i have a question about the compare operation which is between the query word and the  node in the tree which i have dipicated in the mail already sent to you.

i'm puzzing now:

   the node contains a compressed tsvector,and how would himself kown that the query word is likely to ==,how would it kown wether or not to pick itself up to the user..

will all the nodes in the tree first decompressed before the @@ operation? 

what will happen for the tsvector @@ tsquery operation?i mean between the gist tree and the query tree