Generalized multidimensional data mapping and query processing
AuthorZhang, R; Kalnis, P; Ooi, BC; Tan, KL
Source TitleACM Transactions on Database Systems
PublisherASSOC COMPUTING MACHINERY
University of Melbourne Author/sZhang, Rui
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsZhang, R., Kalnis, P., Ooi, B. C. & Tan, K. L. (2005). Generalized multidimensional data mapping and query processing. ACM TRANSACTIONS ON DATABASE SYSTEMS, 30 (3), pp.661-697. https://doi.org/10.1145/1093382.1093383.
Access StatusThis item is currently not available from this repository
<jats:p> Multidimensional data points can be mapped to one-dimensional space to exploit single dimensional indexing structures such as the B <jats:sup>+</jats:sup> -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 <jats:italic>mapping redundancy</jats:italic> 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. </jats:p>
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References