Databaseshard

B-Tree vs Hash Index?

Answer

B‑tree indexes keep keys ordered, so they support equality lookups, range scans, prefix queries and ORDER BY efficiently. Hash indexes map keys to buckets for fast equality lookups, but they don’t support ranges or ordering.

Related questions

Databases

Denormalization: when might you do it and what’s the trade‑off?

#database#denormalization#performance

Databases

What is a covering index (index‑only scan) and why can it be faster?

#database#indexes#covering-index

Databases

Why can the optimizer choose a bad query plan and how do statistics help?

#optimizer#statistics#cardinality

Databases

Index selectivity: what is it and why does it matter?

#indexes#selectivity#performance

Databases

What is write amplification and why do many indexes make writes slower?

#performance#indexes#write-amplification

Databases

What is a materialized view and when would you use it?

#views#materialized-view#performance