Page Header Logo
TEI of Athens eJournals

Improving Query Efficiency in High Dimensional Point Indexes

Evangelos Outsios, Georgios Evangelidis

Abstract


In this paper, we focus on the leaf level nodes of tree-like k-dimensional indexes that store the data entries, since those nodes represent the majority of the nodes in the index. We propose a generic node splitting approach that defers splitting when possible and instead favors merging of a full node with an appropriate sibling and then re-splitting of the resulting node. Our experiments with the hB-tree, show that the proposed splitting approach achieves high average node storage utilization regardless of data distribution, data insertion patterns and dimensionality

Keywords


K-dimensional point indexing, Optimizing data node storage utilization, Range query performance

Full Text: PDF

Refbacks

  • There are currently no refbacks.

The application for presenting electronic journals TEI developed within subproject 2 "electronic publishing service" the Act "Development Services Digital Library of TEI" and financed by the operational program "Digital Convergence", NSRF 2007-2013.