3 ms·

If you can keep all the data in core memory why not just use you favorite balanced binary search tree (BST) like a red-black tree. B-Trees only help performance

If you can keep all the data in core memory why not just use you favorite balanced binary search tree (BST) like a red-black tree. B-Trees only help performance, at least in common understanding, when all the data can not be in core memory (which is why databases use them).

ismailmaj 2y ago
For cache locality, if the layout is more wide instead of deep, you can avoid many cache misses.
- winwang 2y ago
  Yep -- and more generally, sequential access > random access, just a bit less so in memory than on SSD, not even mentioning spinning disk.