Re: Double sorting split patch

Heikki Linnakangas <heikki.linnakangas@enterprisedb.com>

From: Heikki Linnakangas <heikki.linnakangas@enterprisedb.com>

To: Alexander Korotkov <aekorotkov@gmail.com>

Cc: pgsql-hackers <pgsql-hackers@postgresql.org>

Date: 2011-09-15T15:27:55Z

Lists: pgsql-hackers

Commits

Same data as JSON: GET /api/v1/messages/:b64id/commits the thread's linked commits as JSON, with link sources. API reference →

Fix contrib/seg's GiST picksplit method.
- 2a6ebe70fb2f 9.1.0 cited
Some copy editing of pg_read_binary_file() patch.
- 290f1603b420 9.1.0 cited

On 11.09.2011 22:30, Alexander Korotkov wrote:
> Hackers,
>
> I've got my patch with double sorting picksplit impementation for GiST into
> more acceptable form. A little of testing is below. Index creation time is
> slightly higher, but search is much faster. The testing datasets were
> following:
> 1) uniform dataset - 10M rows
> 2) geonames points - 7.6M rows

I've looked at the patch, and took a brief look at the paper - but I 
still don't understand the algorithm. I just can't get my head around 
the concepts of split pairs and left/right groups. Can you explain that 
in layman's terms? Perhaps an example would help?

-- 
   Heikki Linnakangas
   EnterpriseDB   http://www.enterprisedb.com