Indexing vs Hashing

• Hashing is more efficient for probes given key

  • SELECT … FROM R WHERE R.A=5

• Indexing (conventional and B+trees) handles range searches

  • SELECT … FROM R WHERE R.Aɱ AND R.A᝺

• NOTE: Can not specify type of index and parameters in SQL

  • system decides

Previous slide

Next slide

Back to first slide

View graphic version