Static B-Trees: A data structure for faster binary search
An interesting resource.<p>Just this past day, I prototyped a Skip List backing a sorted key/value store, and it was super simple to do so (as compared to AVL / Red Black).<p>B-Trees are notorious for their complexity, and so SingleStore (memSQL) reasoned that their move to use Skip Lists to back their tables was justified: <a href="https://archive.is/Qhpgn" rel="nofollow">https://archive.is/Qhpgn</a><p>It would be interesting to see the author attempt faster Skip Lists, as their expertise in this topic seems deep enough.