Generalized multidimensional data mapping and query processing
Authors:
Open Access
- 1 September 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 30 (3) , 661-697
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.Keywords
This publication has 26 references indexed in Scilit:
- A cost model for query processing in high dimensional data spacesACM Transactions on Database Systems, 2000
- The pyramid-technique1998
- A cost model for nearest neighbor search in high-dimensional data space1997
- On the analysis of indexing schemes1997
- FastMap1995
- Fast subsequence matching in time-series databases1994
- Beyond uniformity and independence1994
- The R*-tree: an efficient and robust access method for points and rectangles1990
- Fractals for secondary key retrieval1989
- R-trees1984