{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T03:03:12Z","timestamp":1761102192113,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,10,29]],"date-time":"2015-10-29T00:00:00Z","timestamp":1446076800000},"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":[],"published-print":{"date-parts":[[2015,10,29]]},"DOI":"10.1145\/2835043.2835050","type":"proceedings-article","created":{"date-parts":[[2015,12,30]],"date-time":"2015-12-30T13:13:44Z","timestamp":1451481224000},"page":"123-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A concurrent k-NN search algorithm for R-tree"],"prefix":"10.1145","author":[{"given":"Jagat Sesh","family":"Challa","sequence":"first","affiliation":[{"name":"Advanced Data Analytics and Parallel Technologies Laboratory, Department of Computer Science & Information Systems, Birla Institute of Technology & Science - Pilani, Pilani Campus, Pilani, India"}]},{"given":"Poonam","family":"Goyal","sequence":"additional","affiliation":[{"name":"Advanced Data Analytics and Parallel Technologies Laboratory, Department of Computer Science & Information Systems, Birla Institute of Technology & Science - Pilani, Pilani Campus, Pilani, India"}]},{"given":"S.","family":"Nikhil","sequence":"additional","affiliation":[{"name":"Advanced Data Analytics and Parallel Technologies Laboratory, Department of Computer Science & Information Systems, Birla Institute of Technology & Science - Pilani, Pilani Campus, Pilani, India"}]},{"given":"Sundar","family":"Balasubramaniam","sequence":"additional","affiliation":[{"name":"Advanced Data Analytics and Parallel Technologies Laboratory, Department of Computer Science & Information Systems, Birla Institute of Technology & Science - Pilani, Pilani Campus, Pilani, India"}]},{"given":"Navneet","family":"Goyal","sequence":"additional","affiliation":[{"name":"Advanced Data Analytics and Parallel Technologies Laboratory, Department of Computer Science & Information Systems, Birla Institute of Technology & Science - Pilani, Pilani Campus, Pilani, India"}]}],"member":"320","published-online":{"date-parts":[[2015,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"key":"e_1_3_2_1_2_1","volume-title":"International Journal of Computer Science & Information Security (IJCSIS'10) 8, 2","author":"Bhatia N.","year":"2010","unstructured":"N. Bhatia and Vandana. 2010. Survey of Nearest Neighbor Techniques . International Journal of Computer Science & Information Security (IJCSIS'10) 8, 2 ( 2010 ), 302--305. N. Bhatia and Vandana. 2010. Survey of Nearest Neighbor Techniques. International Journal of Computer Science & Information Security (IJCSIS'10) 8, 2 (2010), 302--305."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Y. Manolopoulos etal 2005. R-Trees: Theory and Applications (Advanced Information and Knowledge Processing). Springer-Verlag New York Inc. NJ USA.   Y. Manolopoulos et al. 2005. R-Trees: Theory and Applications (Advanced Information and Knowledge Processing). Springer-Verlag New York Inc. NJ USA.","DOI":"10.1007\/978-1-84628-293-5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223794"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/290593.290596"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"R. F. Sproull. 1991. Refinements to Nearest-Neighbor Search in k-Dimensional Trees. Algorithmica 6 (1991) 579--589.  R. F. Sproull. 1991. Refinements to Nearest-Neighbor Search in k-Dimensional Trees. Algorithmica 6 (1991) 579--589.","DOI":"10.1007\/BF01759061"},{"volume-title":"Proceedings of 2012 IEEE Conference on High Performance Extreme Computing (HPEC), IEEE Computer Society, Washington D.C., USA, 1--6.","author":"Sismanis N.","key":"e_1_3_2_1_11_1","unstructured":"N. Sismanis , N. Pitsianis , and X. Sun . 2012. Parallel search of k-nearest neighbors with synchronous operations . In Proceedings of 2012 IEEE Conference on High Performance Extreme Computing (HPEC), IEEE Computer Society, Washington D.C., USA, 1--6. N. Sismanis, N. Pitsianis, and X. Sun. 2012. Parallel search of k-nearest neighbors with synchronous operations. In Proceedings of 2012 IEEE Conference on High Performance Extreme Computing (HPEC), IEEE Computer Society, Washington D.C., USA, 1--6."},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. of 31st International Conference on Machine Learning","author":"Gieseke F.","year":"2014","unstructured":"F. Gieseke , 2014 . Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs . In Proc. of 31st International Conference on Machine Learning , Beijing, China , 2014, 1--9. F. Gieseke, et al. 2014. Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs. In Proc. of 31st International Conference on Machine Learning, Beijing, China, 2014, 1--9."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of 15th GI Symposium on Business, Technology & Web (BTW'13)","author":"Hering T.","year":"2013","unstructured":"T. Hering . 2013 . Parallel Execution of kNN-Queries on in-memory K-D Trees . In Proc. of 15th GI Symposium on Business, Technology & Web (BTW'13) , Magdeburg, Germany, 257--266. T. Hering. 2013. Parallel Execution of kNN-Queries on in-memory K-D Trees. In Proc. of 15th GI Symposium on Business, Technology & Web (BTW'13), Magdeburg, Germany, 257--266."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276325"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11751649_5"},{"volume-title":"Proc. of IEEE International Conf. on Data Mining (ICDM), Japan, 43--50","author":"Bohm C.","key":"e_1_3_2_1_16_1","unstructured":"C. Bohm and F. Krebs . 2002. High Performance Data Mining Using the Nearest Neighbor Join . In Proc. of IEEE International Conf. on Data Mining (ICDM), Japan, 43--50 . C. Bohm and F. Krebs. 2002. High Performance Data Mining Using the Nearest Neighbor Join. In Proc. of IEEE International Conf. on Data Mining (ICDM), Japan, 43--50."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2012.42"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688523"},{"key":"e_1_3_2_1_19_1","unstructured":"M. Herlihy and N. Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc. San Francisco CA USA.   M. Herlihy and N. Shavit. 2008. The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc. San Francisco CA USA."},{"key":"e_1_3_2_1_20_1","unstructured":"VampirTrace Library http:\/\/www.tudresden.de\/die_tu_dresden\/zentrale_einrichtungen\/zih\/forschung\/projekte\/vampirtrace  VampirTrace Library http:\/\/www.tudresden.de\/die_tu_dresden\/zentrale_einrichtungen\/zih\/forschung\/projekte\/vampirtrace"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"V. Springel etal 2005. Simulations of the formation evolution and clustering of galaxies and quasars. Nature 435 7042 629--636.  V. Springel et al. 2005. Simulations of the formation evolution and clustering of galaxies and quasars. Nature 435 7042 629--636.","DOI":"10.1038\/nature03597"},{"key":"e_1_3_2_1_22_1","unstructured":"SUVnet-Trace data http:\/\/wirelesslab.sjtu.edu.cn.  SUVnet-Trace data http:\/\/wirelesslab.sjtu.edu.cn."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2013.24"}],"event":{"name":"Compute '15: 8th Annual ACM India Conference","sponsor":["ACM India ACM India"],"location":"Ghaziabad India","acronym":"Compute '15"},"container-title":["Proceedings of the 8th Annual ACM India Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2835043.2835050","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2835043.2835050","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:09Z","timestamp":1750225689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2835043.2835050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,29]]},"references-count":23,"alternative-id":["10.1145\/2835043.2835050","10.1145\/2835043"],"URL":"https:\/\/doi.org\/10.1145\/2835043.2835050","relation":{},"subject":[],"published":{"date-parts":[[2015,10,29]]},"assertion":[{"value":"2015-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}