If you are interested in an overview of B-Trees, similar data structures, and how well they work on modern hardware, you may also find the survey bit of my mast

If you are interested in an overview of B-Trees, similar data structures, and how well they work on modern hardware, you may also find the survey bit of my master thesis interesting: See here: https://www.researchgate.net/profile/Florian_Gross/publicati.. https://www.researchgate.net/profile/Florian_Gross/publicati.... Along those lines: * CSS Trees: Pointerless b-Trees with a layout optimized for cache lines (http://www.vldb.org/conf/1999/P7.pdf http://www.vldb.org/conf/1999/P7.pdf) * Intel & Oracle's fast architecture-sensitive tree search (combines huge pages, cache line blocking, and SIMD in an optimal layout): http://www.researchgate.net/profile/Jatin_Chhugani/publication/221213860_FAST_fast_architecture_sensitive_tree_search_on_modern_CPUs_and_GPUs/links/0c96051f5d2990770d000000.pdf http://www.researchgate.net/profile/Jatin_Chhugani/publicati... * Adaptive radix trees (http://codematch.muehe.org/~leis/papers/ART.pdf http://codematch.muehe.org/~leis/papers/ART.pdf)