On Wed, Aug 17, 2016 at 7:54 PM, Claudio Freire <klaussfre...@gmail.com> wrote: > The attached patch tries to maintain the initial status of B-Tree > indexes, which are created with equal-key runs in physical order, > during the whole life of the B-Tree, and make key-tid pairs > efficiently searchable in the process.
I don't see an entry for this in the next CF. Do you have a plan for it? BTW, I did post some remarks on this patch on another thread recently [1]. Not sure if any of what I said there is news to you at this point. [1] postgr.es/m/CAH2-Wzn=6Lc3OVA88x=E6SKG72ojNUE6ut6RZAqNnQx-YLcw=q...@mail.gmail.com -- Peter Geoghegan -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
