PostgreSQL
Indexing shown as a table-first walkthrough: compare access methods, then step through the matching dataset and structure for each query shape.
PostgreSQL: Indexing Overview
Pick a modetable-first overviewmanual step only
| Index Type | Best For | Typical Operators | Strength | Tradeoff |
|---|---|---|---|---|
B-Treeoverview | Range filters, sorting, prefix lookups, and ordered scans | =, <, <=, >, >=, BETWEEN, ORDER BY | Keeps keys ordered, so one walk can filter and preserve sort order. | More maintenance work on writes and no direct help for arbitrary text search. |
GINoverview | Full-text search, array membership, and JSON/tsvector lookups | @@, @>, ?, ?|, ?& | Maps terms to posting lists, which makes multi-token matches fast. | Heavier index maintenance and no natural ordering for range queries. |
Hashoverview | Exact equality matches on a single key | = | Direct bucket lookup keeps equality probes compact and simple. | No range or ordering support, so it is narrow by design. |
Dataset Table
Choose a mode to load the matching rows and internal structure.
The table stays dominant here. Select Compare All, B-Tree Query, GIN Full-Text Query, or Hash Equality Query to load the matching dataset.
Internal Structure
Select a mode to load the matching index internals.
Candidates / Results
Candidate and result rows will appear once you choose a mode and start stepping.
Decision Trace
The trace stays compact so the table remains the dominant visual.
Query
No query loaded yet
Predicate
Pick a mode to see the predicate
Status
idle
→ Pick a mode, then press Next Step to move through the index choice one state at a time.