{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T04:43:03Z","timestamp":1762144983314,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001457","name":"Media Development Authority - Singapore","doi-asserted-by":"publisher","award":["R-252-300-001-490"],"award-info":[{"award-number":["R-252-300-001-490"]}],"id":[{"id":"10.13039\/501100001457","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,29]]},"DOI":"10.1145\/2484838.2484866","type":"proceedings-article","created":{"date-parts":[[2013,8,1]],"date-time":"2013-08-01T15:13:48Z","timestamp":1375370028000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Nearest group queries"],"prefix":"10.1145","author":[{"given":"Dongxiang","family":"Zhang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chee-Yong","family":"Chan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,29]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"299","volume-title":"Estimating the selectivity of spatial queries using the 'correlation' fractal dimension","author":"Belussi A.","year":"1995","unstructured":"A. Belussi and C. Faloutsos . Estimating the selectivity of spatial queries using the 'correlation' fractal dimension . In U. Dayal, P. M. D. Gray, and S. Nishio, editors, VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, September 11--15, 1995 , Zurich, Switzerland, pages 299 -- 310 . Morgan Kaufmann , 1995. A. Belussi and C. Faloutsos. Estimating the selectivity of spatial queries using the 'correlation' fractal dimension. In U. Dayal, P. M. D. Gray, and S. Nishio, editors, VLDB'95, Proceedings of 21th International Conference on Very Large Data Bases, September 11--15, 1995, Zurich, Switzerland, pages 299--310. Morgan Kaufmann, 1995."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.5555\/846219.847319"},{"key":"e_1_3_2_1_3_1","first-page":"28","volume-title":"The x-tree: An index structure for high-dimensional data","author":"Berchtold S.","year":"1996","unstructured":"S. Berchtold , D. A. Keim , and H.-P. Kriegel . The x-tree: An index structure for high-dimensional data . In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3--6, 1996 , Mumbai (Bombay), India, pages 28 -- 39 . Morgan Kaufmann , 1996. S. Berchtold, D. A. Keim, and H.-P. Kriegel. The x-tree: An index structure for high-dimensional data. In T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, VLDB'96, Proceedings of 22th International Conference on Very Large Data Bases, September 3--6, 1996, Mumbai (Bombay), India, pages 28--39. Morgan Kaufmann, 1996."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/s10115-003-0122-9"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/170035.170075"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/1989323.1989363"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ICDE.2007.368964"},{"key":"e_1_3_2_1_8_1","first-page":"426","volume-title":"VLDB","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula . M-tree: An efficient access method for similarity search in metric spaces . In VLDB , pages 426 -- 435 , 1997 . P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426--435, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.14778\/1687627.1687666"},{"key":"e_1_3_2_1_10_1","first-page":"137","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . Mapreduce: Simplified data processing on large clusters . In OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, pages 137--150, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/182591.182593"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.5555\/2021911.2021928"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/ICDE.2008.4497474"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/1881195.1881222"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/j.ipl.2011.07.015"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/280277.280279"},{"key":"e_1_3_2_1_17_1","first-page":"518","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In VLDB , pages 518 -- 529 , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518--529, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_1_19_1","volume-title":"Morgan Kaufmann","author":"Han J.","year":"2000","unstructured":"J. Han and M. Kamber . Data Mining: Concepts and Techniques . Morgan Kaufmann , 2000 . J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/320248.320255"},{"key":"e_1_3_2_1_21_1","first-page":"396","volume-title":"Spatial joins using r-trees: Breadth-first traversal with global optimizations","author":"Huang Y.-W.","year":"1997","unstructured":"Y.-W. Huang , N. Jing , and E. A. Rundensteiner . Spatial joins using r-trees: Breadth-first traversal with global optimizations . In M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25--29, 1997 , Athens, Greece, pages 396 -- 405 . Morgan Kaufmann , 1997. Y.-W. Huang, N. Jing, and E. A. Rundensteiner. Spatial joins using r-trees: Breadth-first traversal with global optimizations. In M. Jarke, M. J. Carey, K. R. Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25--29, 1997, Athens, Greece, pages 396--405. Morgan Kaufmann, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1206049.1206056"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/1071610.1071612"},{"key":"e_1_3_2_1_24_1","first-page":"500","volume-title":"VLDB","author":"Kamel I.","year":"1994","unstructured":"I. Kamel and C. Faloutsos . Hilbert r-tree: An improved r-tree using fractals . In VLDB , pages 500 -- 509 , 1994 . I. Kamel and C. Faloutsos. Hilbert r-tree: An improved r-tree using fractals. In VLDB, pages 500--509, 1994."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/1557019.1557074"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/11535331_16"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.5555\/615204.615210"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.14778\/2336664.2336674"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/503099.503101"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1145\/303976.303981"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/645502.656242"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/582318.582321"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1145\/223784.223794"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1145\/1559845.1559905"},{"key":"e_1_3_2_1_35_1","first-page":"194","volume-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"Weber R.","year":"1998","unstructured":"R. Weber , H.-J. Schek , and S. Blott . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24--27, 1998 , New York City, New York, USA, pages 194 -- 205 . Morgan Kaufmann , 1998. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In A. Gupta, O. Shmueli, and J. Widom, editors, VLDB'98, Proceedings of 24rd International Conference on Very Large Data Bases, August 24--27, 1998, New York City, New York, USA, pages 194--205. Morgan Kaufmann, 1998."},{"key":"e_1_3_2_1_36_1","first-page":"756","volume-title":"VLDB","author":"Xia C.","year":"2004","unstructured":"C. Xia , H. Lu , B. C. Ooi , and J. Hu . Gorder: An efficient method for knn join processing . In VLDB , pages 756 -- 767 , 2004 . C. Xia, H. Lu, B. C. Ooi, and J. Hu. Gorder: An efficient method for knn join processing. In VLDB, pages 756--767, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1109\/ICDE.2010.5447837"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/2247596.2247602"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1109\/ICDE.2009.77"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1109\/ICDE.2010.5447897"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.5555\/998688.1007132"}],"event":{"acronym":"SSDBM '13","name":"SSDBM '13: Conference on Scientific and Statistical Database Management","location":"Baltimore Maryland USA"},"container-title":["Proceedings of the 25th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484838.2484866","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484838.2484866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:52Z","timestamp":1750235752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484838.2484866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,29]]},"references-count":41,"alternative-id":["10.1145\/2484838.2484866","10.1145\/2484838"],"URL":"https:\/\/doi.org\/10.1145\/2484838.2484866","relation":{},"subject":[],"published":{"date-parts":[[2013,7,29]]},"assertion":[{"value":"2013-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}