Generalized Inverted Index an Inverted Index is an Index

Embed Doc
Copy Link
Readcast
Collections

CommentGo Back

Download

Oleg Bartunov, Teodor Sigaev PostgreSQL Summit, Toronto, July 8-9, 2006

Generalized Inverted Index

●

An inverted index is an index structurestoring a set of (key, posting list) pairs,where 'posting list' is a set of documents inwhich the key occurs.

●

Generalized means that the index does notknow which operation it accelerates. Itworks with custom strategies, defined forspecific data types. GIN is similar to GiSTand differs from B-Tree indices, which havepredefined, comparison-based operations.

Oleg Bartunov, Teodor Sigaev PostgreSQL Summit, Toronto, July 8-9, 2006Posting page, level 0 (leaf)Right bound14:171:33Entry page, level N: keywordsabcbarfooEntry page, level 0baabar Entry page, level 0 (leaf)aaaabcPointer to postingtree: B-Tree over ItemPointer to heapPosting list: sortedarray of ItemPointer to heapPosting page, level N: ItemPointer Posting page, level 0 (leaf)14:17218:11021:6Right bound218:1158:182:714:17123:1Right link

GIN

Structure

Oleg Bartunov, Teodor Sigaev PostgreSQL Summit, Toronto, July 8-9, 2006

GIN features

●

Concurrency

–

Lehman and Yao's high-concurrency B-treemanagement algorithm

●

WAL

–

Recovery

●

User-defined opclasses

–

The scheme is similar to GiST

of 00

Leave a Comment