B-trees for databases in Data Structures Theory - Time & Space Complexity

Time Complexity: B-trees for databases

O(log n)

Understanding Time Complexity

When using B-trees in databases, it is important to understand how the time to find, insert, or delete data grows as the database gets bigger.

We want to know how the number of steps changes when the amount of data increases.

Scenario Under Consideration

Analyze the time complexity of searching for a key in a B-tree.

function searchBTree(node, key) {
  if (node == null) return null;
  let i = 0;
  while (i < node.keys.length && key > node.keys[i]) {
    i++;
  }
  if (i < node.keys.length && key === node.keys[i]) {
    return node.values[i];
  } else if (node.isLeaf) {
    return null;
  } else {
    return searchBTree(node.children[i], key);
  }
}

This code searches for a key by checking keys in nodes and moving down the tree until it finds the key or reaches a leaf.

Identify Repeating Operations

• Primary operation: Comparing the key with keys in a node (loop inside each node).
• How many times: This happens once per tree level, moving down from root to leaf.

How Execution Grows With Input

As the database grows, the B-tree grows taller slowly because each node holds many keys.

Input Size (n)	Approx. Operations
10	About 2-3 node checks
100	About 3-4 node checks
1000	About 4-5 node checks

Pattern observation: The number of steps grows slowly, roughly with the height of the tree, which increases very slowly as data grows.

Final Time Complexity

Time Complexity: O(log n)

This means the time to find or insert data grows slowly, roughly proportional to the logarithm of the data size.

Common Mistake

[X] Wrong: "Searching a B-tree takes time proportional to the number of keys because it checks all keys."

[OK] Correct: Each node holds many keys, but the search only checks a few keys per node and moves down the tree levels, so it does not check all keys in the whole tree.

Interview Connect

Understanding B-tree time complexity shows you can reason about how databases keep searches fast even with lots of data, a useful skill in many real-world systems.

Self-Check

"What if each B-tree node could hold twice as many keys? How would the time complexity change?"

Practice

1. What is the main purpose of a B-tree in databases?

easy

A. To compress data to save disk space

B. To keep data sorted and balanced for fast searching and updating

C. To encrypt data for security

D. To store data in a linear list for quick access

Solution

1. Step 1: Understand B-tree structure

   B-trees organize data in a sorted and balanced tree structure.

2. Step 2: Identify the purpose in databases

   This structure allows fast searching, insertion, and deletion by minimizing tree height and disk reads.

3. Final Answer:

   To keep data sorted and balanced for fast searching and updating -> Option B

4. Quick Check:

   B-tree purpose = fast, balanced data access [OK]

Hint: B-trees balance data for speed, not encryption or compression [OK]

Common Mistakes:

• Confusing B-trees with simple lists
• Thinking B-trees encrypt data
• Assuming B-trees compress data

2. Which of the following correctly describes a property of B-tree nodes?

easy

A. Each node can contain multiple keys and multiple children

B. Nodes contain only keys but no children

C. Each node contains exactly one key and two children

D. Nodes are always leaf nodes without children

Solution

1. Step 1: Recall B-tree node structure

   B-tree nodes hold multiple keys to reduce tree height.

2. Step 2: Understand children count

   Each node has one more child than the number of keys it holds.

3. Final Answer:

   Each node can contain multiple keys and multiple children -> Option A

4. Quick Check:

   Multiple keys and children per node = C [OK]

Hint: B-tree nodes hold many keys and children, not just one [OK]

Common Mistakes:

• Thinking nodes have only one key
• Assuming nodes have no children
• Confusing B-trees with binary trees

3. Consider a B-tree of order 3 (each node can have at most 2 keys). If a node currently has keys [10, 20] and a new key 15 is inserted, what will happen?

medium

A. The key 15 will be discarded as duplicates are not allowed

B. The node will hold keys [10, 15, 20] without splitting

C. The node will split because it exceeds the max keys, promoting a key up

D. The tree will become unbalanced and require rebalancing later

Solution

1. Step 1: Check node capacity for order 3 B-tree

   Max keys per node = 2. Current keys are [10, 20]. Inserting 15 adds a third key.

2. Step 2: Understand insertion rules

   When a node exceeds max keys, it splits and promotes the middle key to the parent.

3. Final Answer:

   The node will split because it exceeds the max keys, promoting a key up -> Option C

4. Quick Check:

   Node over capacity causes split and promotion [OK]

Hint: If keys exceed max, node splits and middle key moves up [OK]

Common Mistakes:

• Thinking node can hold 3 keys without splitting
• Assuming duplicates are discarded here
• Believing tree becomes unbalanced without immediate fix

4. A B-tree node is supposed to split when it exceeds its maximum keys. Which of the following is a common mistake that can cause the tree to become unbalanced after insertion?

medium

A. Not promoting the middle key to the parent node after splitting

B. Always inserting keys in sorted order

C. Using nodes with multiple keys and children

D. Searching for keys before insertion

Solution

1. Step 1: Understand node splitting in B-trees

   When a node splits, the middle key must be promoted to keep the tree balanced.

2. Step 2: Identify the error impact

   If the middle key is not promoted, the tree structure breaks and becomes unbalanced.

3. Final Answer:

   Not promoting the middle key to the parent node after splitting -> Option A

4. Quick Check:

   Missing promotion causes imbalance [OK]

Hint: Always promote middle key on split to keep balance [OK]

Common Mistakes:

• Skipping promotion step after split
• Thinking sorted insertion causes imbalance
• Confusing node structure rules

5. You have a B-tree of order 4 (max 3 keys per node). After several insertions, a leaf node has keys [5, 10, 15] and you want to insert 12. Describe the sequence of steps the B-tree will perform to maintain balance.

hard

A. Insert 12 and increase the node capacity temporarily

B. Discard 12 because the node is full

C. Insert 12 and rebalance by merging with sibling nodes without splitting

D. Insert 12 into the leaf node, then split the node and promote the middle key to the parent

Solution

1. Step 1: Attempt to insert 12 into leaf node

   The leaf node has max 3 keys [5, 10, 15]. Inserting 12 adds a 4th key, exceeding capacity.

2. Step 2: Split the node and promote middle key

   The node splits into two nodes, and the middle key (10) is promoted to the parent to maintain balance.

3. Final Answer:

   Insert 12 into the leaf node, then split the node and promote the middle key to the parent -> Option D

4. Quick Check:

   Insert, split, promote middle key = balanced B-tree [OK]

Hint: Insert, then split and promote middle key if node is full [OK]

Common Mistakes:

• Discarding keys when node is full
• Merging instead of splitting on insertion
• Temporarily increasing node capacity