Please use this identifier to cite or link to this item:
|Title:||Generalized multidimensional data mapping and query processing||Authors:||Zhang, R.
|Issue Date:||2005||Citation:||Zhang, R., Kalnis, P., Ooi, B.C., Tan, K.-L. (2005). Generalized multidimensional data mapping and query processing. ACM Transactions on Database Systems 30 (3) : 661-697. ScholarBank@NUS Repository. https://doi.org/10.1145/1093382.1093383||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. © 2005 ACM.||Source Title:||ACM Transactions on Database Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/39489||ISSN:||03625915||DOI:||10.1145/1093382.1093383|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 15, 2019
WEB OF SCIENCETM
checked on Sep 6, 2019
checked on Sep 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.