| From: | Claudio Freire <klaussfreire(at)gmail(dot)com> |
|---|---|
| To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
| Cc: | Alexander Korotkov <aekorotkov(at)gmail(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin) |
| Date: | 2014-03-31 21:29:06 |
| Message-ID: | CAGTBQpZsCW_MwfNuj=mOgjv6yA83bUe-Qox+Pet1T9Sh1N2-Ug@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Mon, Mar 31, 2014 at 6:21 PM, Robert Haas <robertmhaas(at)gmail(dot)com> wrote:
> On Fri, Mar 28, 2014 at 11:30 AM, Alexander Korotkov
> <aekorotkov(at)gmail(dot)com> wrote:
>> after reading Heikki Linnakangas presentation about GIN from Nordic PGDay, I
>> figure out that btree_gin became much more attractive.
>> http://hlinnaka.iki.fi/presentations/NordicPGDay2014-GIN.pdf
>
> This is a mighty interesting presentation. Could the posting tree
> compression described on the "posting tree page format" slides (pp.
> 16-17, I think) be used for btree also? Would we get similar
> benefits? How much more expensive are updates with the new system?
I'd believe so, but it can make updates quite complicated.
I was going to take a stab at prefix-compression in b-tree, I could
explore delta compression of the tids as well.
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2014-03-31 21:37:21 | Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin) |
| Previous Message | Robert Haas | 2014-03-31 21:21:35 | Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin) |