On Wed, Aug 17, 2016 at 10: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 have two pretty important questions that doesn't seem to be addressed in your email. 1. How does it do that? 2. What's the benefit? -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
