Affiliation:
1. National University of Singapore, Kent Ridge, Singapore
Abstract
Multidimensional data points can be mapped to one-dimensional space to exploit single dimensional indexing structures such as the B
+
-tree. In this article we present a Generalized structure for data Mapping and query Processing (GiMP), which supports extensible mapping methods and query processing. GiMP can be easily customized to behave like many competent indexing mechanisms for multi-dimensional indexing, such as the UB-Tree, the Pyramid technique, the iMinMax, and the iDistance. Besides being an extendible indexing structure, GiMP also serves as a framework to study the characteristics of the mapping and hence the efficiency of the indexing scheme. Specifically, we introduce a metric called
mapping redundancy
to characterize the efficiency of a mapping method in terms of disk page accesses and analyze its behavior for point, range and kNN queries. We also address the fundamental problem of whether an efficient mapping exists and how to define such a mapping for a given data set.
Publisher
Association for Computing Machinery (ACM)
Reference35 articles.
1. The universal B-tree for multidimensional indexing: General concepts;Bayer R.;World-Wide Computing and Its Applications,1997
2. The R*-tree: an efficient and robust access method for points and rectangles
3. A cost model for nearest neighbor search in high-dimensional data space
4. The pyramid-technique
5. The x-tree: An index structure for high-dimensional data;Berchtold S.;VLDB,1996
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献