Re: [WIP] Effective storage of duplicates in B-tree index.

From: Anastasia Lubennikova <a(dot)lubennikova(at)postgrespro(dot)ru>
To: pgsql-hackers(at)postgresql(dot)org
Subject: Re: [WIP] Effective storage of duplicates in B-tree index.
Date: 2016-02-18 17:29:36
Message-ID: 56C5FF80.5050905@postgrespro.ru
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

18.02.2016 20:18, Anastasia Lubennikova:
> 04.02.2016 20:16, Peter Geoghegan:
>> On Fri, Jan 29, 2016 at 8:50 AM, Anastasia Lubennikova
>> <a(dot)lubennikova(at)postgrespro(dot)ru> wrote:
>>> I fixed it in the new version (attached).
>
> Thank you for the review.
> At last, there is a new patch version 3.0. After some refactoring it
> looks much better.
> I described all details of the compression in this document
> https://goo.gl/50O8Q0 (the same text without pictures is attached in
> btc_readme_1.0.txt).
> Consider it as a rough copy of readme. It contains some notes about
> tricky moments of implementation and questions about future work.
> Please don't hesitate to comment it.
>
Sorry, previous patch was dirty. Hotfix is attached.

--
Anastasia Lubennikova
Postgres Professional: http://www.postgrespro.com
The Russian Postgres Company

Attachment Content-Type Size
btc_readme_1.0.patch text/x-patch 8.4 KB
btree_compression_3.1.patch text/x-patch 40.1 KB

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Kevin Wooten 2016-02-18 17:33:13 Re: JDBC behaviour
Previous Message Tom Lane 2016-02-18 17:23:48 Re: JDBC behaviour