Re: [PATCH] we have added support for box type in SP-GiST index

From: Teodor Sigaev <teodor(at)sigaev(dot)ru>
To: pgsql-hackers(at)postgresql(dot)org
Cc: Alexander Lebedev <a(dot)lebedev(at)postgrespro(dot)ru>
Subject: Re: [PATCH] we have added support for box type in SP-GiST index
Date: 2016-02-15 15:29:13
Views: Raw Message | Whole Thread | Download mbox | Resend email
Lists: pgsql-hackers

It's very pity but author is not able to continue work on this patch, and I
would like to raise this flag.

I'd like to add some comments about patches:

traversalValue patch adds arbitrary value assoсiated with branch in SP-GiST tree
walk. Unlike to recostructedValue it could be just pointer, it havn't to be a
regular pgsql type. Also, it could be used independly from reconstructedValue.
This patch is used both following attached patches.

range patch just switchs using reconstructedValue to traversalValue in range
opclasses. reconstructedValue was used just because it was an acceptable
workaround in case of range type. Range opclase stores a full value in leafs and
doesn't need to use reconstructedValue to return tuple in index only scan.

q4d patch implements index over boxes using SP-GiST. Basic idea was an
observation, range opclass thinks about one-dimensional ranges as 2D points.
Following this idea, we can think that 2D box (what is 2 points or 4 numbers)
could represent a 4D point. We hoped that this approach will be much more
effective than traditional R-Tree in case of many overlaps in box's collection.
Performance results are coming shortly.

In near future (say, tommorrow) I hope to suggest a opclass over polygons based
on this approach.

Alexander Lebedev wrote:
> Hello, Hacker.
> * [PATCH] add a box index to sp-gist
> We have extended sp-gist with an index that keeps track of boxes
> We have used ideas underlying sp-gist range implementation to
> represent 2D boxes as points in 4D space. We use quad tree
> analogue, but in 4-dimensional space. We call this tree q4d. Each
> node of this tree is a box (a point in 4D space) which splits space
> in 16 hyperrectangles.
> Rationale: r-tree assumes that boxes we're trying to index don't
> overlap much. When this assumption fails, r-tree performs badly,
> while our proposal to represent a rectangle as a point in 4D space
> solves this problem.
> NB: the index uses traversalValue introduced in a separate patch.
> * [PATCH] add traversalValue in sp-gist
> During implementation of box index for sp-gist we saw that we only
> keep rectangles, but to determine traversal direction we may need
> to know boundaries of a hyperrectangle. So we calculate them
> on the fly and store them in traversalValue, available
> when traversing child nodes, because otherwise we would't be able to
> calculate them from inside the inner_consistent function call.
> This patch was written by Teodor Sigaev.
> * [PATCH] change reconstructValue -> traversalValue in range_spgist.c
> During traversal, local context is
> insufficient to pick traversal direction. As of now, this is worked
> around with the help of reconstructValue. reconstructValue only
> stores data of the same type as a tree node, that is, a range.
> We have written a patch that calculates auxillary values and makes
> them accessible during traversal.
> We then use traversalValue in a new box index and change
> range_spgist.c to use it in place of reconstructValue.
> NB: apply this patch after traversalValue patch.

Teodor Sigaev E-mail: teodor(at)sigaev(dot)ru

Attachment Content-Type Size
traversalValue-1.patch.gz application/x-gzip 1.9 KB
range-1.patch.gz application/x-gzip 1.1 KB
q4d-1.patch.gz application/x-gzip 6.9 KB

In response to


Browse pgsql-hackers by date

  From Date Subject
Next Message Stephen Frost 2016-02-15 15:41:03 GetExistingLocalJoinPath() vs. the docs
Previous Message Tom Lane 2016-02-15 15:02:12 Re: Small PATCH: check of 2 Perl modules