Skip site navigation (1) Skip section navigation (2)

Re: Index AM change proposals, redux

From: ITAGAKI Takahiro <itagaki(dot)takahiro(at)oss(dot)ntt(dot)co(dot)jp>
To: Simon Riggs <simon(at)2ndquadrant(dot)com>
Cc: Bruce Momjian <bruce(at)momjian(dot)us>, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, pgsql-hackers(at)postgresql(dot)org
Subject: Re: Index AM change proposals, redux
Date: 2008-04-24 12:11:37
Message-ID: 20080424205254.65B2.52131E4D@oss.ntt.co.jp (view raw or flat)
Thread:
Lists: pgsql-hackers
Simon Riggs <simon(at)2ndquadrant(dot)com> wrote:

> * For Highly Non-Unique Data we can use Duplicate Compression
> The latter is the technique used by Bitmap Indexes. Efficient, but not
> useful for unique/nearly-unique data

I heard that GIN has already had duplicate-compression feature.

http://www.sai.msu.su/~megera/oddmuse/index.cgi/Gin
| Gin consists of a B-tree index constructed over entries (ET, entries tree),
| where each entry is an element of the indexed value (element of array,
| lexeme for tsvector) and where each tuple in a leaf page is either a
| pointer to a B-tree over item pointers (PT, posting tree), or a list of
| item pointers (PL, posting list) if the tuple is small enough.

If GIT comes, can we merge or share some modules between btree and gin?
I guess the page layout of GIT is better than ET/PT pair when the index
size are larger than main memory because the key and item pointers are
placed in near pages. Gin-over-btree might be useful some usages of
inverted indexes.

Regards,
---
ITAGAKI Takahiro
NTT Open Source Software Center



In response to

pgsql-hackers by date

Next:From: Gregory StarkDate: 2008-04-24 12:13:02
Subject: Re: Index AM change proposals, redux
Previous:From: Gregory StarkDate: 2008-04-24 12:05:35
Subject: Re: Proposed patch - psql wraps at window width

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group