On Tue, Jun 17, 2014 at 1:04 PM, Andres Freund <andres@2ndquadrant.com> wrote:
> For me minmax indexes are helpful because they allow to generate *small*
> 'coarse' indexes over large volumes of data. From my pov that's possible
> possible because they don't contain item pointers for every contained
> row.
But minmax is just a specific form of bloom filter.
This could certainly be generalized to a bloom filter index with some
set of bloom&hashing operators (minmax being just one).
