BRIN (Block Range INdex) is useful for very large tables where data is naturally ordered (e.g., time‑series). It stores summaries per block range, so it’s tiny and fast to build, but less precise than B‑tree.