Postgres Pro
Downloads
Home   >   mailing lists

Re: [WIP] Effective storage of duplicates in B-tree index. - Mailing list pgsql-hackers

From Peter Geoghegan
Subject Re: [WIP] Effective storage of duplicates in B-tree index.
Date
Msg-id CAM3SWZSdoPrWy_CZgMSub_f7beZpHmVCD_-TO_TaZ1Kepubpuw@mail.gmail.com
Whole thread Raw
In response to Re: [WIP] Effective storage of duplicates in B-tree index.  (Thom Brown <thom@linux.com>)
Responses Re: [WIP] Effective storage of duplicates in B-tree index.  (Thom Brown <thom@linux.com>)
List pgsql-hackers
Tree view 
On Thu, Jan 28, 2016 at 9:03 AM, Thom Brown <thom@linux.com> wrote:
> I'm surprised that efficiencies can't be realised beyond this point.  Your results show a sweet spot at around 1000 /
10000000,with it getting slightly worse beyond that.  I kind of expected a lot of efficiency where all the values are
thesame, but perhaps that's due to my lack of understanding regarding the way they're being stored. 

I think that you'd need an I/O bound workload to see significant
benefits. That seems unsurprising. I believe that random I/O from
index writes is a big problem for us.



--
Peter Geoghegan

pgsql-hackers by date:

Previous
From: Thom Brown
Date:
Subject: Re: [WIP] Effective storage of duplicates in B-tree index.
Next
From: Thom Brown
Date:
Subject: Re: [WIP] Effective storage of duplicates in B-tree index.