{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:22:16Z","timestamp":1750220536066,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,9]],"date-time":"2021-06-09T00:00:00Z","timestamp":1623196800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2008602,1745925,1937143,1942913,2007935,1814595"],"award-info":[{"award-number":["2008602,1745925,1937143,1942913,2007935,1814595"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141812838"],"award-info":[{"award-number":["N000141812838"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,9]]},"DOI":"10.1145\/3448016.3457303","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T17:22:37Z","timestamp":1624036957000},"page":"142-154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems"],"prefix":"10.1145","author":[{"given":"Jees","family":"Augustine","sequence":"first","affiliation":[{"name":"The University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suraj","family":"Shetiya","sequence":"additional","affiliation":[{"name":"The University of Texas at Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadreza","family":"Esfandiari","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Senjuti","family":"Basu Roy","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas Arlington, Arlington, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.2001.976774"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58094-8_18"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63343-X_48"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_2_6_1","volume-title":"Proc. 1996 Int. Conf. Very Large Data Bases. 28--39","author":"Berchtold S","year":"1996","unstructured":"S Berchtold , D Keim , and HP Kriegel . 1996 . The X-tree: An efficient and robust access method for points and rectangles . In Proc. 1996 Int. Conf. Very Large Data Bases. 28--39 . S Berchtold, D Keim, and HP Kriegel. 1996. The X-tree: An efficient and robust access method for points and rectangles. In Proc. 1996 Int. Conf. Very Large Data Bases. 28--39."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.333855"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.1999.0772"},{"key":"e_1_3_2_2_9_1","unstructured":"Sergey Brin. 1995. Near neighbor search in large metric spaces. (1995).  Sergey Brin. 1995. Near neighbor search in large metric spaces. (1995)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011343115154"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2005.846906"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 23rd VLDB conference","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia , Marco Patella , and Pavel Zezula . 1997 . M-tree: An E cient Access Method for Similarity Search in Metric Spaces . In Proceedings of the 23rd VLDB conference , Athens, Greece. Citeseer, 426--435. Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An E cient Access Method for Similarity Search in Metric Spaces. In Proceedings of the 23rd VLDB conference, Athens, Greece. Citeseer, 426--435."},{"volume-title":"Introduction to algorithms","author":"Cormen Thomas H","key":"e_1_3_2_2_14_1","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2009. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms .MIT press."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.5.420"},{"volume-title":"Handbook of data visualization","author":"Cox Michael AA","key":"e_1_3_2_2_16_1","unstructured":"Michael AA Cox and Trevor F Cox . 2008. Multidimensional scaling . In Handbook of data visualization . Springer , 315--347. Michael AA Cox and Trevor F Cox. 2008. Multidimensional scaling. In Handbook of data visualization. Springer, 315--347."},{"key":"e_1_3_2_2_17_1","volume-title":"A note on two problems in connexion with graphs. Numerische mathematik","author":"Dijkstra Edsger W","year":"1959","unstructured":"Edsger W Dijkstra . 1959. A note on two problems in connexion with graphs. Numerische mathematik , Vol. 1 , 1 ( 1959 ), 269--271. Edsger W Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische mathematik, Vol. 1, 1 (1959), 269--271."},{"key":"e_1_3_2_2_18_1","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"Gionis Aristides","year":"1999","unstructured":"Aristides Gionis , Piotr Indyk , Rajeev Motwani , 1999 . Similarity search in high dimensions via hashing . In Vldb , Vol. 99. 518 -- 529 . Aristides Gionis, Piotr Indyk, Rajeev Motwani, et al. 1999. Similarity search in high dimensions via hashing. In Vldb, Vol. 99. 518--529.","journal-title":"Vldb"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"e_1_3_2_2_20_1","volume-title":"THE RADON AND FOURIER TRANSFORMS: THE MATHEMATICS OF X-RAYS AND CT-SCANS.","author":"Heilman Steven","year":"2010","unstructured":"Steven Heilman . 2010 . THE RADON AND FOURIER TRANSFORMS: THE MATHEMATICS OF X-RAYS AND CT-SCANS. (2010). Steven Heilman. 2010. THE RADON AND FOURIER TRANSFORMS: THE MATHEMATICS OF X-RAYS AND CT-SCANS. (2010)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2008.4761288"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.232073"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258656"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253347"},{"key":"e_1_3_2_2_26_1","unstructured":"Leonard Kaufman and Peter Rousseeuw. 1987. Clustering by means of medoids .North-Holland.  Leonard Kaufman and Peter Rousseeuw. 1987. Clustering by means of medoids .North-Holland."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2871543.2871545"},{"key":"e_1_3_2_2_28_1","first-page":"159","article-title":"How good is the simplex algorithm","volume":"3","author":"Klee Victor","year":"1972","unstructured":"Victor Klee and George J Minty . 1972 . How good is the simplex algorithm . Inequalities , Vol. 3 , 3 (1972), 159 -- 175 . Victor Klee and George J Minty. 1972. How good is the simplex algorithm. Inequalities, Vol. 3, 3 (1972), 159--175.","journal-title":"Inequalities"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"e_1_3_2_2_30_1","volume-title":"International conference on machine learning. PMLR, 671--679","author":"Li Ke","year":"2016","unstructured":"Ke Li and Jitendra Malik . 2016 . Fast k-nearest neighbour search via dynamic continuous indexing . In International conference on machine learning. PMLR, 671--679 . Ke Li and Jitendra Malik. 2016. Fast k-nearest neighbour search via dynamic continuous indexing. In International conference on machine learning. PMLR, 671--679."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"e_1_3_2_2_32_1","volume-title":"Accuracy of the morphology enabled dipole inversion (MEDI) algorithm for quantitative susceptibility mapping in MRI","author":"Liu Tian","year":"2012","unstructured":"Tian Liu , Weiyu Xu , Pascal Spincemaille , A Salman Avestimehr , and Yi Wang . 2012. Accuracy of the morphology enabled dipole inversion (MEDI) algorithm for quantitative susceptibility mapping in MRI . IEEE transactions on medical imaging, Vol. 31 , 3 ( 2012 ), 816--824. Tian Liu, Weiyu Xu, Pascal Spincemaille, A Salman Avestimehr, and Yi Wang. 2012. Accuracy of the morphology enabled dipole inversion (MEDI) algorithm for quantitative susceptibility mapping in MRI. IEEE transactions on medical imaging, Vol. 31, 3 (2012), 816--824."},{"volume-title":"Lectures on discrete geometry. Graduate texts in mathematics","author":"Matousek Jiri","key":"e_1_3_2_2_33_1","unstructured":"Jiri Matousek . 2002. Lectures on discrete geometry. Graduate texts in mathematics , Vol. 212 . Springer . Jiri Matousek. 2002. Lectures on discrete geometry. Graduate texts in mathematics, Vol. 212. Springer."},{"key":"e_1_3_2_2_34_1","volume-title":"Dynamic Insertions in TLAESA Fast NN Search Algorithm. In 2014 22nd International Conference on Pattern Recognition. IEEE, 3828--3833","author":"Mic\u00f3 Luisa","year":"2014","unstructured":"Luisa Mic\u00f3 and Jose Oncina . 2014 . Dynamic Insertions in TLAESA Fast NN Search Algorithm. In 2014 22nd International Conference on Pattern Recognition. IEEE, 3828--3833 . Luisa Mic\u00f3 and Jose Oncina. 2014. Dynamic Insertions in TLAESA Fast NN Search Algorithm. In 2014 22nd International Conference on Pattern Recognition. IEEE, 3828--3833."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(96)00032-3"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)90095-7"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/263479.263482"},{"key":"e_1_3_2_2_38_1","volume-title":"Ng and Jiawei Han","author":"Raymond","year":"2002","unstructured":"Raymond T. Ng and Jiawei Han . 2002 . CLARANS : A method for clustering objects for spatial data mining. IEEE transactions on knowledge and data engineering, Vol. 14 , 5 (2002), 1003--1016. Raymond T. Ng and Jiawei Han. 2002. CLARANS: A method for clustering objects for spatial data mining. IEEE transactions on knowledge and data engineering, Vol. 14, 5 (2002), 1003--1016."},{"volume-title":"WEA","author":"Paredes Rodrigo","key":"e_1_3_2_2_39_1","unstructured":"Rodrigo Paredes , Edgar Ch\u00e1vez , Karina Figueroa , and Gonzalo Navarro . 2006. Practical construction of k-nearest neighbor graphs in metric spaces . In WEA , Vol. 6 . Springer , 85--97. Rodrigo Paredes, Edgar Ch\u00e1vez, Karina Figueroa, and Gonzalo Navarro. 2006. Practical construction of k-nearest neighbor graphs in metric spaces. In WEA, Vol. 6. Springer, 85--97."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(86)90013-9"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/96105.96111"},{"key":"e_1_3_2_2_43_1","volume-title":"Cluster analysis of fMRI data using dendrogram sharpening. Human brain mapping","author":"Stanberry Larissa","year":"2003","unstructured":"Larissa Stanberry , Rajesh Nandy , and Dietmar Cordes . 2003. Cluster analysis of fMRI data using dendrogram sharpening. Human brain mapping , Vol. 20 , 4 ( 2003 ), 201--219. Larissa Stanberry, Rajesh Nandy, and Dietmar Cordes. 2003. Cluster analysis of fMRI data using dendrogram sharpening. Human brain mapping, Vol. 20, 4 (2003), 201--219."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2016.08.003"},{"key":"e_1_3_2_2_45_1","first-page":"602","article-title":"Query Processing for Distance Metrics","volume":"90","author":"Tsong-Li Wang Jason","year":"1990","unstructured":"Jason Tsong-Li Wang and Dennis E Shasha . 1990 . Query Processing for Distance Metrics .. In VLDB , Vol. 90. 602 -- 613 . Jason Tsong-Li Wang and Dennis E Shasha. 1990. Query Processing for Distance Metrics.. In VLDB, Vol. 90. 602--613.","journal-title":"VLDB"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655573"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313789"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2014.05.043"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.9133"},{"volume-title":"Methods of feasible directions: a study in linear and non-linear programming","author":"Zoutendijk Guus","key":"e_1_3_2_2_50_1","unstructured":"Guus Zoutendijk . 1960. Methods of feasible directions: a study in linear and non-linear programming . Elsevier . Guus Zoutendijk. 1960. Methods of feasible directions: a study in linear and non-linear programming. Elsevier."}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Virtual Event China","acronym":"SIGMOD\/PODS '21"},"container-title":["Proceedings of the 2021 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457303","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3448016.3457303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:03Z","timestamp":1750195503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3448016.3457303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,9]]},"references-count":50,"alternative-id":["10.1145\/3448016.3457303","10.1145\/3448016"],"URL":"https:\/\/doi.org\/10.1145\/3448016.3457303","relation":{},"subject":[],"published":{"date-parts":[[2021,6,9]]},"assertion":[{"value":"2021-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}