On Tue, Nov 27, 2018 at 5:43 AM Andrey Borodin wrote:
> > 31 авг. 2018 г., в 2:40, Thomas Munro
> > написал(а):
> > [1] https://arxiv.org/pdf/1509.05053.pdf
>
> I've implemented all of the strategies used in that paper.
> On a B-tree page we have a line pointers ordered in key order and tuples
Hi, Thomas!
> 31 авг. 2018 г., в 2:40, Thomas Munro
> написал(а):
>
> [1] https://arxiv.org/pdf/1509.05053.pdf
I've implemented all of the strategies used in that paper.
On a B-tree page we have a line pointers ordered in key order and tuples
residing at the end of the page. Tuples at the end
> 15 окт. 2018 г., в 2:38, Thomas Munro
> написал(а):
>
> On Mon, Oct 15, 2018 at 12:03 AM Andrey Borodin wrote:
>> 31 авг. 2018 г., в 2:40, Thomas Munro
>> написал(а):
>> A related topic is the cache-unfriendliness of traditional binary
>> searches of sorted data. Check out "Array Layout
On Mon, Oct 15, 2018 at 12:03 AM Andrey Borodin wrote:
> 31 авг. 2018 г., в 2:40, Thomas Munro
> написал(а):
> A related topic is the cache-unfriendliness of traditional binary
> searches of sorted data. Check out "Array Layouts for
> Comparison-Based Searching"[1] if you haven't already. It s
Hello!
> 31 авг. 2018 г., в 2:40, Thomas Munro
> написал(а):
> A related topic is the cache-unfriendliness of traditional binary
> searches of sorted data. Check out "Array Layouts for
> Comparison-Based Searching"[1] if you haven't already. It says that
> if your array fits in L2 cache, as ou
On Thu, Aug 30, 2018 at 2:40 PM, Thomas Munro
wrote:
> A related topic is the cache-unfriendliness of traditional binary
> searches of sorted data. Check out "Array Layouts for
> Comparison-Based Searching"[1] if you haven't already. It says that
> if your array fits in L2 cache, as our btree pa
On Fri, Aug 31, 2018 at 5:53 AM Andrey Borodin wrote:
> Hi hackers!
>
> I've been at the database conference and here everyone is talking about cache
> prefetches.
>
> I've tried simple hack
>
> diff --git a/src/backend/access/nbtree/nbtsearch.c
> b/src/backend/access/nbtree/nbtsearch.c
> index
On Thu, Aug 30, 2018 at 10:53 AM, Andrey Borodin wrote:
> The idea is pretty simple - our search are cache erasing anyway, let's try to
> get at least some of it by prefetching possible ways of binary search.
> And it seems to me that on a simple query
>> insert into x select (random()*100)::
