Main memory indexing: the case for BD-tree

We adapt and optimize the BD-tree for main memory data processing. We compare the memory-based BD-tree against the B⁺-tree and CSB⁺-tree. We present cost models for exact match query for these indexes, including L2 cache and translation lookahead buffer (TLB) miss model and execution time model. We also implemented these structures and conducted experimental study. Our analytical and experimental results show that a well-tuned BD-tree is superior in most cases.