HOT: A Height Optimized Trie Index for Main-Memory Database Systems


We present the Height Optimized Trie (HOT), a fast and spaceefficient in-memory index structure. The core algorithmic idea of HOT is to dynamically vary the number of bits considered at each node, which enables a consistently high fanout and thereby good cache efficiency. The layout of each node is carefully engineered for compactness and fast search using… (More)


11 Figures and Tables

Slides referencing similar topics