A Novel Index Structure For Multi-Key Search

The linear storage model is widely used to support in-memory multi-key search running on small devices of limited computing capacity, simply because it avoids the maintenance of space-costly and energy-costly indexing structures. However, it only supports sequential multi-key scan which is slow and energy-consuming. We design an index structure called D-Tree to address the problem.