|From:||Hannu Krosing <hannu(at)tm(dot)ee>|
|To:||Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us>|
|Cc:||Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org>|
|Views:||Raw Message | Whole Thread | Download mbox|
Bruce Momjian wrote:
> > Bruce Momjian <pgman(at)candle(dot)pha(dot)pa(dot)us> writes:
> > > Is lossy and partial indexes the same?
> > No.
> > > I can't see how they were
> > > supposed to be used. The _only_ mention of this field I see in
> > > indexcmd.c, around line 132.
> > You missed a few then --- the most critical being in createplan.c.
> > AFAIK this is a working feature, and I am going to insist that you
> > keep your hands off it ...
> Really, it actually works? What are they?
rom the readme of contrib/intarray/README.intarray
This is an implementation of RD-tree data structure using GiST interface
of PostgreSQL. It has built-in lossy compression - must be declared
in index creation - with (islossy). Current implementation provides
support for one-dimensional array of int4's - gist__int_ops, suitable
small and medium size of arrays (used on default), and gist__intbig_ops
indexing large arrays (we use superimposed signature with length of 4096
bits to represent sets).
|Next Message||Bruce Momjian||2001-05-15 04:40:54||SCHEMA idea|
|Previous Message||Lamar Owen||2001-05-15 04:15:23||Re: [PORTS] 7.1.1-2.PGDG RPMset.|