Tag
index-structures
- May 7, 2026 Radix Trees over Fixed-Width Integer Keys Indexing by bit fields instead of by bytes turns a trie into a fixed-height array of tables. Why integer radix trees need no rebalancing, how their height is computed, and where they lose to hash tables. data structures
- Jul 24, 2025 Learned Indexes: Fitting a Function Instead of Storing Keys How a model that predicts a key position can replace a B-tree search, what the error bound guarantees, and why the last mile is always a search. algorithms