Btree now works by follow: find the max/min tuple which satisfies condtions and
then executes forward/backward scan over leaf pages. For complicated clauses
it's not obvious how to find min/max tuple. Scanning whole index isn't an option
from preformance point of view.
This is great. I got a question, is it possible make btree index to support OR
as well? Is btree supports more invasive, in the sense that we need to do
enhance ScanKey to supports an array of values?
Teodor Sigaev E-mail: teo...@sigaev.ru
Sent via pgsql-hackers mailing list (firstname.lastname@example.org)
To make changes to your subscription: