Horton

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

Alexander Korotkov <aekorotkov@gmail.com>

View thread
From: Alexander Korotkov <aekorotkov@gmail.com>
To: Jeff Davis <pgsql@j-davis.com>
Cc: pgsql-hackers <pgsql-hackers@postgresql.org>
Date: 2012-07-03T22:09:00Z
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 →

  1. Teach SP-GiST to do index-only scans.

On Tue, Jul 3, 2012 at 10:51 AM, Jeff Davis <pgsql@j-davis.com> wrote:

> 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.
>

Thank you for review! Now I'm working on detailed performance benchmarks
for different opclasses. I hope to finish it in this week. Then we would
see which opclasses we're really need and nail down issues you've pointed.

------
With best regards,
Alexander Korotkov.