Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin)
От | Claudio Freire |
---|---|
Тема | Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin) |
Дата | |
Msg-id | CAGTBQpZsCW_MwfNuj=mOgjv6yA83bUe-Qox+Pet1T9Sh1N2-Ug@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin) (Robert Haas <robertmhaas@gmail.com>) |
Ответы |
Re: posting tree compression (WAS: Proposal: fix range queries in btree_gin)
|
Список | pgsql-hackers |
On Mon, Mar 31, 2014 at 6:21 PM, Robert Haas <robertmhaas@gmail.com> wrote: > On Fri, Mar 28, 2014 at 11:30 AM, Alexander Korotkov > <aekorotkov@gmail.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.
В списке pgsql-hackers по дате отправления: