Skip to content
hpcnotes
Loading…
HPC·Data Structures Case Studies
2026.09.11· 1 min

Static B-Trees

A search tree laid out for cache, not for malloc. Build once, probe many.
Binary Search........................................................................................................................................................................................................Previous
Search Trees........................................................................................................................................................................................................Next
#hpc
Binary Search........................................................................................................................................................................................................2026.09.11
Search Trees........................................................................................................................................................................................................2026.09.11
Segment Trees........................................................................................................................................................................................................2026.09.11
Bitmaps........................................................................................................................................................................................................2026.09.11
Hash Tables........................................................................................................................................................................................................2026.09.11
Suggest an editMarkdownHistory