Evan Jones personal blog
Why databases use ordered indexes but programming uses hash tables
I think it is safe to state that hash tables (e.g. maps in Go, dicts in Python, HashMap in Java, etc.) are far more common than ordered data structures such as trees for in-memory data structures. One data point is that in a talk about C++ hash table optimization at Google ( available in Abseil ), the speaker noted…
- Points
- 429
- HN comments
- 197
- Submissions
- 1
- Cited by
- 0 commenters
Databases & DataSystems & Performance2019
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Dec 8, 2019 | Why databases use ordered indexes but programming uses hash tables by matt_d | 429 | 197 |
