Re: Proposal: GiST constraints

>> In theory, any indexed value in index (for GiST, after compression) should fit 
>> into page at least.
> So are you saying we should dedicate one page multiplied by
> max_connections in shared memory? It's possible to do it that way, but

Yes, we could. Storing index keys in shared memory allows minimize access to 
heap. So, when new key is coming, you should check overlap with each stored keys 
in shared memory. For each check result will be one of the following points:
- keys are not overlapped: you don't need to go to the heap. Suppose, this will  be most frequent result in typical
usecases.
- keys may be overlapped (consistentFn returns true and needRecheck flag is  true): you should go to the heap to
consultwith original value (may be  visibility too)
 
- keys are overlapped (consistentFn returns true and needRecheck flag is false):  heap visit is needed only for
checkingvisibility
 


If you don't store keys in shared memory, then you should consult with heap for 
each stored key.
-- 
Teodor Sigaev                                   E-mail: teodor@sigaev.ru
  WWW: http://www.sigaev.ru/