D-stree：A Bi-Level Technique for Indexing Rectangle Data in Spatial Database Systems

Abstract

This paper shows how a domain-decomposition hierarch can be organized as a paginated tree with a balance height, which can be further extended to index the data subsets (i.e., first-level indexing). The data in each subset can be indexed using any existing access support structure. (i.e., second-level indexing). We call this bi-level indexing structure "D-tree". D-tree has many desirable properties includ-ing its good data clustering characteristics, its insusceptibility to the insertion order of the data set, and its immunity to the skew in the access patterns and data distributions. We provide experimental results to demonstrate these benefits. They show that D-trees sunig R-trees as the second-level in-dices provide savings averaging 90% over usnig R-tree alone. In general, the proposed technique can be used to boost the performance of any existing spatial indexing methods(e.g., R*-tree, R+-tree, etc.)