Allegro Tech Blog company blog
How does a B-tree make queries fast?
B-tree is a structure that helps to search through great amounts of data. It was invented over 40 years ago, yet it is still employed by the majority of modern databases. Although there are newer index structures, like LSM trees, B-tree is unbeaten when handling most of the database queries.
- Points
- 269
- HN comments
- 77
- Submissions
- 1
- Cited by
- 0 commenters
Databases & DataSoftware Engineering2023
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Dec 23, 2023 | How does a B-tree make queries fast? by jaycox2931 | 269 | 77 |
