Sergey Slotin personal blog

Static B-Trees: A data structure for faster binary search

en.algorithmica.org

This section is a follow-up to the previous one , where we optimized binary search by the means of removing branching and improving the memory layout. Here, we will also be searching in sorted arrays, but this time we are not limited to fetching and comparing only one element at a time.

Points

306

HN comments

49

Submissions

1

Cited by

0 commenters

Databases & DataSoftware Engineering2022

Related posts from the same era

Hosting SQLite databases on GitHub Pages or any static file hoster

Pphiresky20211,812 points314 commentscited by 26 details

I'm all-in on server-side SQLite

Fly.io Blog20221,353 points565 commentscited by 16 details

AWS announces forks of Elasticsearch and Kibana

AWS Blog20211,314 points935 comments details

Datomic is Free

DDatomic Blog20231,099 points368 commentscited by 5 details

My favourite API is a zipfile on the European Central Bank's website

csvbase Blog20231,024 points265 comments details

SQLite is not a toy database

Anton Zhiyanov2021986 points484 comments details