{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:30Z","timestamp":1759205310860,"version":"3.41.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2005,9]]},"abstract":"<jats:p>\n            Multidimensional data points can be mapped to one-dimensional space to exploit single dimensional indexing structures such as the B\n            <jats:sup>+<\/jats:sup>\n            -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\n            <jats:italic>mapping redundancy<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.1145\/1093382.1093383","type":"journal-article","created":{"date-parts":[[2005,11,7]],"date-time":"2005-11-07T16:00:45Z","timestamp":1131379245000},"page":"661-697","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Generalized multidimensional data mapping and query processing"],"prefix":"10.1145","volume":"30","author":[{"given":"Rui","family":"Zhang","sequence":"first","affiliation":[{"name":"National University of Singapore, Kent Ridge, Singapore"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[{"name":"National University of Singapore, Kent Ridge, Singapore"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[{"name":"National University of Singapore, Kent Ridge, Singapore"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Kent Ridge, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2005,9]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"10","article-title":"The universal B-tree for multidimensional indexing: General concepts","volume":"97","author":"Bayer R.","year":"1997","unstructured":"Bayer , R. 1997 . The universal B-tree for multidimensional indexing: General concepts . World-Wide Computing and Its Applications 97 , 10 -- 11 . Bayer, R. 1997. The universal B-tree for multidimensional indexing: General concepts. World-Wide Computing and Its Applications 97, 10--11.","journal-title":"World-Wide Computing and Its Applications"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263671"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276318"},{"key":"e_1_2_1_5_1","first-page":"28","article-title":"The x-tree: An index structure for high-dimensional data","volume":"1996","author":"Berchtold S.","year":"1996","unstructured":"Berchtold , S. , Keim , D. , and Kriegel , H.-P. 1996 . The x-tree: An index structure for high-dimensional data . In VLDB , 1996. 28 -- 39 . Berchtold, S., Keim, D., and Kriegel, H.-P. 1996. The x-tree: An index structure for high-dimensional data. In VLDB, 1996. 28--39.","journal-title":"VLDB"},{"key":"e_1_2_1_6_1","volume-title":"VLDB","author":"Bercken J.","year":"2001","unstructured":"Bercken , J. , Blohsfeld , B. , Dittrich , J.-P. , Kramer , J. , Schafer , T. , Schneider , M. , and Seeger , B . 2001. XXL - a library approach to supporting efficient implementations of advanced database queries . In VLDB 2001 . 39--48. Bercken, J., Blohsfeld, B., Dittrich, J.-P., Kramer, J., Schafer, T., Schneider, M., and Seeger, B. 2001. XXL - a library approach to supporting efficient implementations of advanced database queries. In VLDB 2001. 39--48."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/357775.357776"},{"key":"e_1_2_1_8_1","unstructured":"corel image U. http:\/\/kdd.ics.uci.edu\/databases\/corelfeatures\/corelfeatures.html.  corel image U. http:\/\/kdd.ics.uci.edu\/databases\/corelfeatures\/corelfeatures.html."},{"key":"e_1_2_1_9_1","volume-title":"H., and Swart, H. d.","author":"Dalen D.","year":"1978","unstructured":"Dalen , D. v., Doets , H., and Swart, H. d. 1978 . Sets : Naive, Axiomatic and Applied. Pergamon Press . Dalen, D. v., Doets, H., and Swart, H. d. 1978. Sets: Naive, Axiomatic and Applied. Pergamon Press."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73721.73746"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/182591.182593"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223812"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191925"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263688"},{"key":"e_1_2_1_16_1","first-page":"562","article-title":"Generalized search trees for database systems","volume":"1995","author":"Hellerstein J.","year":"1995","unstructured":"Hellerstein , J. , Naughton , J. , and Pfeffer , A. 1995 . Generalized search trees for database systems . In VLDB , 1995. 562 -- 573 . Hellerstein, J., Naughton, J., and Pfeffer, A. 1995. Generalized search trees for database systems. In VLDB, 1995. 562--573.","journal-title":"VLDB"},{"key":"e_1_2_1_17_1","volume-title":"International Symposium on Large Spatial Databases","author":"Hjaltason G.","year":"1995","unstructured":"Hjaltason , G. and Samet , H . 1995. Ranking in spatial databases . In International Symposium on Large Spatial Databases , 1995 . 83--95. Hjaltason, G. and Samet, H. 1995. Ranking in spatial databases. In International Symposium on Large Spatial Databases, 1995. 83--95."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Jagadish H. Ooi B. C. Tan K.-L. Yu C. and Zhang R. 2004. iDistance: An adaptive B&plus;-tree based indexing method for nearest neighbor search. Tech. Rep. www.comp.nus.edu.sg\/~ooibc National University of Singapore.  Jagadish H. Ooi B. C. Tan K.-L. Yu C. and Zhang R. 2004. iDistance: An adaptive B&plus;-tree based indexing method for nearest neighbor search. Tech. Rep. www.comp.nus.edu.sg\/~ooibc National University of Singapore.","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_2_1_20_1","first-page":"525","article-title":"Analyzing range queries on spatial data","volume":"2000","author":"Jin J.","year":"2000","unstructured":"Jin , J. , An , N. , and Sivasubramaniam , A. 2000 . Analyzing range queries on spatial data . In ICDE , 2000. 525 -- 534 . Jin, J., An, N., and Sivasubramaniam, A. 2000. Analyzing range queries on spatial data. In ICDE, 2000. 525--534.","journal-title":"ICDE"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/354871.354874"},{"key":"e_1_2_1_23_1","unstructured":"Kolmogorov A. N. and Fomin S. V. 1970. Introductory real analysis. Prentice-Hall.  Kolmogorov A. N. and Fomin S. V. 1970. Introductory real analysis. Prentice-Hall."},{"key":"e_1_2_1_24_1","unstructured":"Michael S. 1967. Calculus. W. A. Benjamin.  Michael S. 1967. Calculus. W. A. Benjamin."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335219"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/16894.16886"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/588011.588037"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253264"},{"key":"e_1_2_1_30_1","first-page":"263","article-title":"Integrating the UB-tree into a database system kernel","volume":"2000","author":"Ramsak F.","year":"2000","unstructured":"Ramsak , F. , Markl , V. , Fenk , R. , Zirkel , M. , Elhardt , K. , and Bayer , R. 2000 . Integrating the UB-tree into a database system kernel . In VLDB , 2000. 263 -- 272 . Ramsak, F., Markl, V., Fenk, R., Zirkel, M., Elhardt, K., and Bayer, R. 2000. Integrating the UB-tree into a database system kernel. In VLDB, 2000. 263--272.","journal-title":"VLDB"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276319"},{"key":"e_1_2_1_33_1","first-page":"507","article-title":"The R&plus;-tree: A dynamic index for multidimensional objects","volume":"1987","author":"Sellis T. K.","year":"1987","unstructured":"Sellis , T. K. , Roussopoulos , N. , and Faloutsos , C. 1987 . The R&plus;-tree: A dynamic index for multidimensional objects . In VLDB , 1987. 507 -- 518 . Sellis, T. K., Roussopoulos, N., and Faloutsos, C. 1987. The R&plus;-tree: A dynamic index for multidimensional objects. In VLDB, 1987. 507--518.","journal-title":"VLDB"},{"key":"e_1_2_1_34_1","first-page":"516","article-title":"Similarity indexing with the ss-tree","volume":"1996","author":"White D.","year":"1996","unstructured":"White , D. and Jain , R. 1996 . Similarity indexing with the ss-tree . In ICDE , 1996. 516 -- 523 . White, D. and Jain, R. 1996. Similarity indexing with the ss-tree. In ICDE, 1996. 516--523.","journal-title":"ICDE"},{"key":"e_1_2_1_35_1","first-page":"421","article-title":"Indexing the distance: An efficient method to knn processing","volume":"2001","author":"Yu C.","year":"2001","unstructured":"Yu , C. , Ooi , B. , Tan , K. , and Jagadish , H. 2001 . Indexing the distance: An efficient method to knn processing . In VLDB , 2001. 421 -- 430 . Yu, C., Ooi, B., Tan, K., and Jagadish, H. 2001. Indexing the distance: An efficient method to knn processing. In VLDB, 2001. 421--430.","journal-title":"VLDB"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1093382.1093383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1093382.1093383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:12Z","timestamp":1750278132000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1093382.1093383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["10.1145\/1093382.1093383"],"URL":"https:\/\/doi.org\/10.1145\/1093382.1093383","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2005,9]]},"assertion":[{"value":"2005-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}