Skip site navigation (1) Skip section navigation (2)

Re: SP-GiST for ranges based on 2d-mapping and quad-tree

From: Jeff Davis <pgsql(at)j-davis(dot)com>
To: Alexander Korotkov <aekorotkov(at)gmail(dot)com>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: SP-GiST for ranges based on 2d-mapping and quad-tree
Date: 2012-07-03 06:51:08
Message-ID: 1341298268.6857.16.camel@jdavis (view raw or flat)
Thread:
Lists: pgsql-hackers
On Mon, 2012-07-02 at 23:47 -0700, Jeff Davis wrote:
> On Thu, 2012-06-14 at 02:56 +0400, Alexander Korotkov wrote:
> > Hackers,
> > 
> > 
> > attached patch implements quad-tree on ranges. Some performance
> > results in comparison with current GiST indexing.
> > Index creation is slightly slower. Probably, it need some
> > investigation. Search queries on SP-GiST use much more pages. However
> > this comparison can be not really correct, because SP-GiST can pin
> > same buffer several times during one scan. In CPU search queries on
> > SP-GiST seems to be slightly faster. Dramatical difference in "column
> > <@ const" query is thanks to 2d-mapping.
> > 

Also, it would be helpful to add a couple tests to rangetypes.sql.

Regards,
	Jeff Davis


In response to

Responses

pgsql-hackers by date

Next:From: Dean RasheedDate: 2012-07-03 06:53:02
Subject: Re: Proof of concept: auto updatable views
Previous:From: Jeff DavisDate: 2012-07-03 06:47:58
Subject: Re: SP-GiST for ranges based on 2d-mapping and quad-tree

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group