Re: Minmax indexes

From: Greg Stark <stark(at)mit(dot)edu>
To: Andres Freund <andres(at)2ndquadrant(dot)com>
Cc: Robert Haas <robertmhaas(at)gmail(dot)com>, Heikki Linnakangas <hlinnakangas(at)vmware(dot)com>, Alvaro Herrera <alvherre(at)2ndquadrant(dot)com>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Minmax indexes
Date: 2014-06-17 15:25:52
Message-ID: CAM-w4HN4L3Uwo=0V6tyf1YoP2xCFvkWFDUGq+p9p5if=WkUc4Q@mail.gmail.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Tue, Jun 17, 2014 at 3:31 PM, Andres Freund <andres(at)2ndquadrant(dot)com> wrote:
> Is there actually a significant usecase behind that wish or just a
> general demand for being generic? To me it seems fairly unlikely you'd
> end up with something useful by doing a minmax index over bounding
> boxes.

Isn't min/max just a 2d bounding box? If you do a bulk data load of
something like the census data then sure, every page will have data
points for some geometrically clustered set of data.

I had in mind to do a small bloom filter per block. In general any
kind of predicate like bounding box should work.

--
greg

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Andres Freund 2014-06-17 15:26:07 Re: Wait free LW_SHARED acquisition - v0.2
Previous Message Amit Kapila 2014-06-17 15:17:51 Re: Wait free LW_SHARED acquisition - v0.2