B-tree index (default) behavior in PostgreSQL - Time & Space Complexity

Time Complexity: B-tree index (default) behavior

O(log n)

Understanding Time Complexity

We want to understand how fast a B-tree index helps find data in a database as the data grows.

How does the time to search change when we add more rows?

Scenario Under Consideration

Analyze the time complexity of the following SQL query using a B-tree index.

-- Assume a table 'users' with a B-tree index on 'email'
SELECT * FROM users WHERE email = '[e-mail]';
    

This query looks up a user by email using the B-tree index to speed up the search.

Identify Repeating Operations

In a B-tree search, the main repeating operation is moving down tree levels.

• Primary operation: Comparing the search key with node keys at each tree level.
• How many times: Once per tree level, which grows slowly as data grows.

How Execution Grows With Input

As the number of rows grows, the tree gets taller but only slowly.

Input Size (n)	Approx. Operations
10	About 2 comparisons
100	About 3 comparisons
1000	About 4 comparisons

Pattern observation: The number of steps grows very slowly, roughly adding one step for every tenfold increase in data.

Final Time Complexity

Time Complexity: O(log n)

This means the search time grows slowly as data grows, making lookups efficient even for large tables.

Common Mistake

[X] Wrong: "Searching with a B-tree index takes the same time as scanning every row one by one."

[OK] Correct: A B-tree index narrows down the search quickly by jumping through tree levels, so it does not check every row.

Interview Connect

Knowing how B-tree indexes scale helps you explain why databases stay fast as data grows, a key skill for working with real systems.

Self-Check

"What if the index was a hash index instead? How would the time complexity change for exact match searches?"

Practice

1. What is the primary purpose of a B-tree index in PostgreSQL?

easy

A. To speed up searching and sorting operations

B. To store large binary objects

C. To manage user permissions

D. To backup the database automatically

Solution

1. Step 1: Understand the role of indexes

   Indexes help databases find data faster without scanning the entire table.

2. Step 2: Identify B-tree index function

   B-tree indexes organize data to speed up searching and sorting efficiently.

3. Final Answer:

   To speed up searching and sorting operations -> Option A

4. Quick Check:

   B-tree index = speed up search/sort [OK]

Hint: B-tree indexes speed up search and sort operations [OK]

Common Mistakes:

• Confusing B-tree with storing large objects
• Thinking indexes manage permissions
• Assuming indexes handle backups

2. Which of the following is the correct syntax to create a B-tree index on the column username of table users?

easy

A. CREATE BTREE INDEX idx_username ON users (username);

B. CREATE INDEX idx_username ON users USING bitmap (username);

C. CREATE INDEX idx_username ON users (username) USING hash;

D. CREATE INDEX idx_username ON users USING btree (username);

Solution

1. Step 1: Recall correct CREATE INDEX syntax

   The syntax is CREATE INDEX index_name ON table_name USING index_type (column);

2. Step 2: Identify correct index type and syntax

   B-tree is default and specified as USING btree; CREATE INDEX idx_username ON users USING btree (username); matches this exactly.

3. Final Answer:

   CREATE INDEX idx_username ON users USING btree (username); -> Option D

4. Quick Check:

   Correct syntax uses USING btree [OK]

Hint: Use 'USING btree' in CREATE INDEX for B-tree indexes [OK]

Common Mistakes:

• Using incorrect index type like hash or bitmap
• Wrong keyword order in CREATE INDEX
• Omitting USING clause or misspelling it

3. Given a table products(id SERIAL PRIMARY KEY, price NUMERIC) with a B-tree index on price, what will the query SELECT * FROM products WHERE price > 100 ORDER BY price; most likely use?

medium

A. A sequential scan ignoring the index

B. A B-tree index scan to quickly find rows with price > 100

C. A hash index scan on price

D. A bitmap index scan on price

Solution

1. Step 1: Understand query conditions and index type

   The query filters with price > 100 and orders by price; B-tree indexes support range queries and sorting.

2. Step 2: Identify index usage

   PostgreSQL will use the B-tree index to efficiently find and order matching rows.

3. Final Answer:

   A B-tree index scan to quickly find rows with price > 100 -> Option B

4. Quick Check:

   Range query + order = B-tree index scan [OK]

Hint: Range queries with ORDER BY use B-tree index scans [OK]

Common Mistakes:

• Assuming sequential scan always used
• Confusing hash or bitmap index usage
• Ignoring index benefits for range queries

4. You created a B-tree index on column email but notice queries filtering by LOWER(email) are slow. What is the likely problem?

medium

A. B-tree indexes only work on numeric columns

B. The index was created on the wrong table

C. B-tree indexes do not support functions like LOWER() by default

D. The database needs to be restarted to use the index

Solution

1. Step 1: Understand function usage in WHERE clause

   Using LOWER(email) means the query filters on a transformed value, not the raw column.

2. Step 2: Recognize index limitations

   Regular B-tree indexes do not support functions unless a functional index is created.

3. Final Answer:

   B-tree indexes do not support functions like LOWER() by default -> Option C

4. Quick Check:

   Function in filter needs functional index [OK]

Hint: Use functional indexes for queries with functions like LOWER() [OK]

Common Mistakes:

• Thinking B-tree only works on numbers
• Assuming index applies automatically after restart
• Mistaking wrong table for index issue

5. You want to enforce uniqueness on a column serial_number and speed up queries filtering by it. Which is the best approach using B-tree indexes?

hard

A. Create a UNIQUE B-tree index on serial_number

B. Create a non-unique B-tree index and a separate UNIQUE constraint

C. Create a hash index and a UNIQUE constraint

D. Create a UNIQUE constraint without an index

Solution

1. Step 1: Understand uniqueness enforcement

   PostgreSQL enforces UNIQUE constraints using unique indexes, usually B-tree by default.

2. Step 2: Combine uniqueness and performance

   Creating a UNIQUE B-tree index both enforces uniqueness and speeds up lookups on that column.

3. Final Answer:

   Create a UNIQUE B-tree index on serial_number -> Option A

4. Quick Check:

   Unique B-tree index = uniqueness + speed [OK]

Hint: Use UNIQUE B-tree index to enforce uniqueness and speed queries [OK]

Common Mistakes:

• Creating separate index and constraint unnecessarily
• Using hash index which doesn't enforce uniqueness
• Assuming UNIQUE constraint works without an index