Postgres Pro
Downloads
Home   >   mailing lists

Re: [WIP] [B-Tree] Keep indexes sorted by heap physical location - Mailing list pgsql-hackers

From Robert Haas
Subject Re: [WIP] [B-Tree] Keep indexes sorted by heap physical location
Date
Msg-id CA+TgmoZqpuFGV=-Fu69PM05wZsr7muQSCs_J__Kif6SSHhNuYw@mail.gmail.com
Whole thread Raw
In response to [WIP] [B-Tree] Keep indexes sorted by heap physical location  (Claudio Freire <klaussfreire@gmail.com>)
Responses Re: [WIP] [B-Tree] Keep indexes sorted by heap physical location
List pgsql-hackers
Tree view 
On Wed, Aug 17, 2016 at 10:54 PM, Claudio Freire <klaussfreire@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

pgsql-hackers by date:

Previous
From: Christian Convey
Date:
Subject: Re: WIP: About CMake v2
Next
From: Alvaro Herrera
Date:
Subject: Re: WIP: About CMake v2