CSE Roadmap

Common tier · about 2 hours · 5 parts

Part 1 of 5 · 1 min read

Why this page comes first

In this module you will

  • Explain how a hash index locates a value, and how that differs from a B+-tree's search tree.
  • Explain why a hash index answers exact-match lookups very fast.
  • Explain why a hash index cannot support range queries at all.
  • Decide, for a given query pattern, whether a hash index or a B+-tree fits better.

The previous page showed a B+-tree earning range-query support by keeping its keys sorted. This page shows the alternative: give up that ordering entirely, in exchange for a different kind of speed.