Re: GSOC 2018 Project - A New Sorting Routine

From: Tomas Vondra <tomas(dot)vondra(at)2ndquadrant(dot)com>
To: Kefan Yang <starordust(at)gmail(dot)com>
Cc: Andrey Borodin <x4mmm(at)yandex-team(dot)ru>, Peter Geoghegan <pg(at)bowt(dot)ie>, "alvherre(at)2ndquadrant(dot)com" <alvherre(at)2ndquadrant(dot)com>, PostgreSQL Hackers <pgsql-hackers(at)lists(dot)postgresql(dot)org>
Subject: Re: GSOC 2018 Project - A New Sorting Routine
Date: 2018-07-24 15:16:03
Message-ID: fbfd760c-2c6d-e38d-86dc-c58b8b0304e3@2ndquadrant.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 07/24/2018 12:21 AM, Kefan Yang wrote:
> Hi Tomas!
>
> I did a few tests on my own Linux machine, but the problem is that my
> resources on AWS(CPU, RAM and even Disk space) are very limited. I
> considered establishing virtual machine on my own PC but the performance
> is even worse.
>
> My original patch has two main optimizations: (1) switch to heap sort
> when depth limit exceeded (2) check whether the array is presorted only
> once at the beginning. Now I want to test these optimizations
> separately. On AWS EC2 instance, regressions on CREATE INDEX cases seems
> to be less significant if we use (1) only, but I can only test up to
> 100000 records and 512MB memory using your scripts.
>
> So would you mind re-running the tests using the two patches I provided
> in the attachment? That will be very helpful
>

I can do that, but it'll have to wait a couple of days. I'm currently
using the boxes for some other tests.

regards

--
Tomas Vondra http://www.2ndQuadrant.com
PostgreSQL Development, 24x7 Support, Remote DBA, Training & Services

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Alvaro Herrera 2018-07-24 15:20:56 Re: How can we submit code patches that implement our (pending) patents?
Previous Message David Rowley 2018-07-24 14:14:34 Re: FailedAssertion on partprune