[Solved] Why is a BRIN index particularly efficient for columns with physically sorted data in PostgreSQL? — Ans: Because it summarizes ranges of pages instead of indexing individual rows | PostgreSQL

PostgreSQL - Indexing Strategies

Why is a BRIN index particularly efficient for columns with physically sorted data in PostgreSQL?

ABecause it summarizes ranges of pages instead of indexing individual rows

BBecause it stores a full copy of the indexed column data

CBecause it uses hash functions to speed up lookups

DBecause it automatically partitions the table into smaller chunks

Step-by-Step Solution

Solution:

Step 1: Understand BRIN indexing
BRIN indexes store summaries of block ranges rather than individual row pointers.
Step 2: Consider data ordering
When data is physically sorted, BRIN can efficiently filter blocks that may contain matching rows.
Final Answer:
Because it summarizes ranges of pages instead of indexing individual rows -> Option A
Quick Check:
BRIN indexes summarize block ranges [OK]

Quick Trick: BRIN indexes summarize page ranges, ideal for sorted data [OK]

Common Mistakes:

Master "Indexing Strategies" in PostgreSQL

9 interactive learning modes - each teaches the same concept differently

Why is a BRIN index particularly efficient for columns with physically sorted data in PostgreSQL?