Efficiency of hybrid index structuresTheoretical analysis and a practical application ?
We define a theory to evaluate indices combining different data types. We design and validate a hybrid index based on B+-Trees, a R-Tree and bitlists. The hybrid index focusses on efficiently combining single- and multi-valued data. The hybrid access structure can achieve a logarithmic time complexity. Furthermore the new indexing mechanism guarantees a linear space complexity.
hybrid index structures theoretical analysis experimental validation