PostgreSQL 8.3.19 Documentation
Prev | Fast Backward | Chapter 52. GIN Indexes | Fast Forward | Next

# 52.3. Implementation

Internally, a GIN index contains a B-tree index constructed over keys, where each key is an element of the indexed value (a member of an array, for example) and where each tuple in a leaf page is either a pointer to a B-tree over heap pointers (PT, posting tree), or a list of heap pointers (PL, posting list) if the list is small enough.

Prev | Home | Next
Extensibility | Up | GIN tips and tricks