mediumMicrosoftLow-Level Design2023

Explain database indexing and B-trees

Q: Explain database indexing and B-trees

An index is a sorted auxiliary structure mapping column values to row locations, turning O(n) scans into O(log n) lookups. **B-trees** keep data balanced and shallow with high fan-out, minimising disk reads; great for range queries.

533 views

Understand the problem

How do indexes speed up queries, and why are B-trees used?

databasesindexing

Attempt it yourself

Sketch your approach before reading the solution — that's what interviews test.

Stuck? AI Nudge Available

Get a conceptual hint to guide your logic without spoiling the final implementation.

Study the solution

The solution is waiting

Give it an honest attempt first — then compare your thinking with the full walkthrough.

Join the discussion

Discussion (0)

No responses yet. Be the first to share what you think.

Why prefer stateless services and how do you handle sessions?

What is database replication?