Bitmap index scan behavior in PostgreSQL - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a Bitmap Index Scan in PostgreSQL?

A Bitmap Index Scan is a method PostgreSQL uses to quickly find rows matching a condition by creating a bitmap of matching row locations, which it then uses to fetch the actual rows efficiently.

intermediate

How does PostgreSQL use a bitmap during a Bitmap Index Scan?

PostgreSQL builds a bitmap where each bit represents a row in the table. Bits set to 1 indicate rows that match the index condition. This bitmap helps combine multiple index scans and reduces random disk access.

intermediate

Why is Bitmap Index Scan more efficient than a normal Index Scan for multiple conditions?

Because it can combine multiple bitmaps from different indexes using bitwise operations, reducing the number of rows to fetch and minimizing random disk reads.

beginner

What happens after PostgreSQL creates the bitmap in a Bitmap Index Scan?

PostgreSQL performs a Bitmap Heap Scan, which uses the bitmap to fetch the actual rows from the table in an efficient order, reducing disk seeks.

intermediate

When might PostgreSQL choose a Bitmap Index Scan over a Sequential Scan?

When the query filters on indexed columns and the number of matching rows is moderate, so using the bitmap reduces the cost of fetching rows compared to scanning the whole table.

What does a Bitmap Index Scan create to represent matching rows?

A A hash table of values

B A list of row IDs

C A bitmap with bits for matching rows

D A sorted array of indexes

A Bitmap Index Scan creates a bitmap where each bit corresponds to a row, set to 1 if the row matches the condition.

Which step follows after building the bitmap in a Bitmap Index Scan?

A Sequential Scan

B Bitmap Heap Scan

C Index Only Scan

D Hash Join

After building the bitmap, PostgreSQL performs a Bitmap Heap Scan to fetch the actual rows efficiently.

Why is Bitmap Index Scan useful for queries with multiple conditions on different indexes?

A It combines bitmaps using bitwise operations

B It avoids using indexes

C It sorts the results automatically

D It caches all rows in memory

Bitmap Index Scan can combine multiple bitmaps from different indexes using bitwise AND/OR to find matching rows efficiently.

When is Bitmap Index Scan less efficient than a Sequential Scan?

A When very few rows match

B When the table is empty

C When no indexes exist

D When most rows match

If most rows match, scanning the whole table sequentially is often faster than building and using a bitmap.

What does each bit in the bitmap represent in a Bitmap Index Scan?

A A table row

B A query plan step

C An index page

D A column value

Each bit corresponds to a specific row in the table, indicating if it matches the index condition.

Explain how PostgreSQL uses a Bitmap Index Scan to improve query performance.

Think about how bits represent rows and how combining them helps.

Describe when PostgreSQL might choose a Bitmap Index Scan instead of a Sequential Scan or a normal Index Scan.

Consider query filtering and index availability.

Practice

1. What is the main purpose of a Bitmap Index Scan in PostgreSQL?

easy

A. To delete rows using bitmap operations

B. To create a bitmap of matching row locations from indexes for efficient retrieval

C. To update rows in the table based on index values

D. To directly fetch rows from the table without using indexes

Solution

1. Step 1: Understand Bitmap Index Scan role

   Bitmap Index Scan creates a bitmap representing matching row positions using indexes.

2. Step 2: Differentiate from other scans

   It does not fetch rows directly but prepares a bitmap for efficient row retrieval later.

3. Final Answer:

   To create a bitmap of matching row locations from indexes for efficient retrieval -> Option B

4. Quick Check:

   Bitmap Index Scan = bitmap of row locations [OK]

Hint: Bitmap Index Scan builds a map of rows to fetch [OK]

Common Mistakes:

• Confusing bitmap scan with direct table scan
• Thinking bitmap scan updates or deletes rows
• Assuming bitmap scan fetches rows immediately

2. Which of the following is the correct syntax to perform a Bitmap Index Scan in a PostgreSQL EXPLAIN query output?

easy

A. Index Scan on table_name (cost=0.29..8.31 rows=5 width=12)

B. Bitmap Heap Scan on index_name (cost=0.29..8.31 rows=5 width=12)

C. Bitmap Index Scan on index_name (cost=0.29..8.31 rows=5 width=12)

D. Seq Scan on index_name (cost=0.29..8.31 rows=5 width=12)

Solution

1. Step 1: Identify Bitmap Index Scan syntax

   Bitmap Index Scan appears as "Bitmap Index Scan on index_name" in EXPLAIN output.

2. Step 2: Differentiate from other scans

   Bitmap Heap Scan fetches rows using bitmap, Index Scan and Seq Scan are different methods.

3. Final Answer:

   Bitmap Index Scan on index_name (cost=0.29..8.31 rows=5 width=12) -> Option C

4. Quick Check:

   Bitmap Index Scan syntax = Bitmap Index Scan on index_name (cost=0.29..8.31 rows=5 width=12) [OK]

Hint: Look for 'Bitmap Index Scan on' in EXPLAIN output [OK]

Common Mistakes:

• Confusing Bitmap Heap Scan with Bitmap Index Scan
• Choosing Index Scan or Seq Scan syntax incorrectly
• Misreading EXPLAIN output keywords

3. Given a table employees with an index on department_id, what will the Bitmap Index Scan do when you run:
EXPLAIN SELECT * FROM employees WHERE department_id = 5;?

medium

A. It creates a bitmap of row locations where department_id = 5, then fetches those rows efficiently

B. It scans the entire table sequentially without using the index

C. It updates the rows where department_id = 5

D. It deletes rows where department_id = 5

Solution

1. Step 1: Understand Bitmap Index Scan on condition

   The scan uses the index on department_id to find matching rows and creates a bitmap of their locations.

2. Step 2: Explain how rows are fetched

   Using the bitmap, it fetches only those rows efficiently from the table, avoiding full scan.

3. Final Answer:

   It creates a bitmap of row locations where department_id = 5, then fetches those rows efficiently -> Option A

4. Quick Check:

   Bitmap Index Scan finds matching rows then fetches [OK]

Hint: Bitmap Index Scan finds and fetches matching rows efficiently [OK]

Common Mistakes:

• Thinking it scans the whole table sequentially
• Confusing scan with update or delete operations
• Assuming it fetches rows without bitmap

4. You see a query plan with Bitmap Index Scan followed by Bitmap Heap Scan, but the query is running very slowly. What could be a likely cause?

medium

A. The index does not exist on the queried column

B. The table is empty, so no rows are fetched

C. The query is missing a WHERE clause

D. The bitmap is too large because the condition matches too many rows, causing inefficient heap fetch

Solution

1. Step 1: Analyze Bitmap Index Scan and Bitmap Heap Scan behavior

   Bitmap Index Scan creates a bitmap of matching rows; Bitmap Heap Scan fetches rows using that bitmap.

2. Step 2: Understand performance impact of large bitmap

   If too many rows match, the bitmap is large, causing many random disk accesses and slowing the query.

3. Final Answer:

   The bitmap is too large because the condition matches too many rows, causing inefficient heap fetch -> Option D

4. Quick Check:

   Large bitmap = slow Bitmap Heap Scan [OK]

Hint: Large bitmap means many rows matched, slowing fetch [OK]

Common Mistakes:

• Assuming missing index causes Bitmap Index Scan
• Thinking missing WHERE clause causes Bitmap Index Scan
• Believing empty table causes slow scan

5. You want to optimize a query that uses Bitmap Index Scan but runs slowly because it matches many rows. Which approach can improve performance?

hard

A. Add more selective WHERE conditions to reduce matching rows before Bitmap Index Scan

B. Drop the index to force a sequential scan

C. Increase the work_mem setting to allow larger bitmaps in memory

D. Rewrite the query to use a JOIN instead of WHERE clause

Solution

1. Step 1: Understand Bitmap Index Scan memory usage

   Bitmap Index Scan builds a bitmap in memory; if too large, it spills to disk, slowing performance.

2. Step 2: Improve performance by adding selective conditions

   Adding more selective WHERE conditions reduces matching rows, making bitmap smaller and faster.

3. Step 3: Evaluate other options

   Increasing work_mem helps but may not be sufficient; dropping index or rewriting query may not improve bitmap scan efficiency.

4. Final Answer:

   Add more selective WHERE conditions to reduce matching rows before Bitmap Index Scan -> Option A

5. Quick Check:

   More selective WHERE = smaller bitmap = faster scan [OK]

Hint: Add selective WHERE clauses to reduce bitmap size [OK]

Common Mistakes:

• Dropping index thinking it helps performance
• Assuming increasing work_mem always solves slowness
• Believing rewriting query always improves bitmap scan