Theoretically, B-trees/ISAM. That's pretty much all you need to know. Most algorithms aren't optimized for their storage layer(s), they exist primarily in big-

Theoretically, B-trees/ISAM. That's pretty much all you need to know. Most algorithms aren't optimized for their storage layer(s), they exist primarily in big-O notation that ignores latencies, and especially non-uniform latencies. On most systems RAM is the 5th level of storage (registers,l1 cache,l2 cache,l3 cache, ram). Just because L1-3 cache isn't addressable doesn't mean it won't have a serious effect on the performance of your code.