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

On Thu, Sep 3, 2015 at 8:35 AM, Anastasia Lubennikova wrote: >> * Since everything is aligned within B-Tree, it's probably worth >> considering the alignment boundaries when doing prefix compression, if >> you want to go that way. We can probably imagine a world

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

On Sun, Sep 27, 2015 at 4:11 PM, Peter Geoghegan wrote: > Debugging this stuff is sometimes like keyhole surgery. If you could > just see at/get to the structure that you care about, it would be 10 > times easier. Hopefully this tool makes it easier to identify problems. I

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

01.09.2015 21:23, Peter Geoghegan: On Mon, Aug 31, 2015 at 12:41 AM, Anastasia Lubennikova wrote: Now new B-tree index tuple must be inserted for each table row that we index. It can possibly cause page split. Because of MVCC even unique index could contain

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

On Mon, Aug 31, 2015 at 12:41 AM, Anastasia Lubennikova wrote: > Now new B-tree index tuple must be inserted for each table row that we > index. > It can possibly cause page split. Because of MVCC even unique index could > contain duplicates. > Storing duplicates in

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

Hi, Tomas! On Mon, Aug 31, 2015 at 6:26 PM, Tomas Vondra wrote: > On 08/31/2015 09:41 AM, Anastasia Lubennikova wrote: > >> I'm going to begin work on effective storage of duplicate keys in B-tree >> index. >> The main idea is to implement posting lists and posting

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

On 09/01/2015 11:31 AM, Alexander Korotkov wrote: ... Yes, In general GIN is a btree with effective duplicates handling + support of splitting single datums into multiple keys. This proposal is mostly porting duplicates handling from GIN to btree. Sure, there are differences - GIN

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

Hi, On 08/31/2015 09:41 AM, Anastasia Lubennikova wrote: Hi, hackers! I'm going to begin work on effective storage of duplicate keys in B-tree index. The main idea is to implement posting lists and posting trees for B-tree index pages as it's already done for GIN. In a nutshell, effective

[HACKERS] [PROPOSAL] Effective storage of duplicates in B-tree index.

Hi, hackers! I'm going to begin work on effective storage of duplicate keys in B-tree index. The main idea is to implement posting lists and posting trees for B-tree index pages as it's already done for GIN. In a nutshell, effective storing of duplicates in GIN is organised as follows. Index