On 11/29/2013 07:13 PM, Tom Lane wrote:
Andreas Karlsson <andr...@proxel.se> writes:
I decided to look into how much work implementing the todo item about
supporting amgettuple in GIN would be, since exclusion constraints on
GIN would be neat. Robert Haas suggested a solution, but to fix it we
also need to look into why the commit message mentions that it did not
work anyway with the partial matches.
This TIDBitmap becomes lossy if it too many TIDs are added to it, and
this case is what broke amgettuple for partial matches.
Note that fixing the potential lossiness in scanning is not the only
roadblock to re-enabling amgettuple. Fast updates also pose problems:
Half of that is basically the same lossiness problem, but the other
half is that we're relying on the bitmap to suppress duplicate reports
of the same TID. It's fairly hard to see how you'd avoid that without
creating other problems.
Note that Robert's proposed solution is no solution, because it just
puts you right back in the bind of needing guaranteed non-lossy
storage of a TID set that might be too big to fit in memory.
You can always call amgetbitmap, and return the tuples from the bitmap
one by one. For a lossy result, re-check all tuples on the page. IOW, do
a bitmap index + heap scan. You could do that within indexam.c, and
present the familiar index_getnext() interface for callers. Or you could
modify the exclusion constraint code to do that if amgettuple is not
Sent via pgsql-hackers mailing list (email@example.com)
To make changes to your subscription: