{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:42Z","timestamp":1773481962754,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T00:00:00Z","timestamp":1699747200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3624062.3625132","type":"proceedings-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T13:53:39Z","timestamp":1699624419000},"page":"730-738","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards A Massive-scale Distributed Neighborhood Graph Construction"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9395-0843","authenticated-orcid":false,"given":"Keita","family":"Iwabuchi","sequence":"first","affiliation":[{"name":"Lawrence Livermore National Laboratory, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1174-1846","authenticated-orcid":false,"given":"Trevor","family":"Steil","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3806-7369","authenticated-orcid":false,"given":"Benjamin","family":"Priest","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6449-6568","authenticated-orcid":false,"given":"Roger","family":"Pearce","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, United States of America"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9145-1226","authenticated-orcid":false,"given":"Geoffrey","family":"Sanders","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,11,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3583140.3583166"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583318"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006219"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547308"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3408889"},{"key":"e_1_3_2_2_9_1","volume-title":"EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph. arxiv:1609.07228\u00a0[cs.CV]","author":"Fu Cong","year":"2016","unstructured":"Cong Fu and Deng Cai. 2016. EFANNA : An Extremely Fast Approximate Nearest Neighbor Search Algorithm Based on kNN Graph. arxiv:1609.07228\u00a0[cs.CV]"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671516"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2016.189"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2022.102905"},{"key":"e_1_3_2_2_14_1","volume-title":"Advances in Neural Information Processing Systems, H.\u00a0Wallach, H.\u00a0Larochelle, A.\u00a0Beygelzimer, F.\u00a0d'Alch\u00e9-Buc, E.\u00a0Fox, and R.\u00a0Garnett (Eds.). Vol.\u00a032. Curran Associates","author":"Jayaram\u00a0Subramanya Suhas","year":"2019","unstructured":"Suhas Jayaram\u00a0Subramanya, Fnu Devvrit, Harsha\u00a0Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019. DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. In Advances in Neural Information Processing Systems, H.\u00a0Wallach, H.\u00a0Larochelle, A.\u00a0Beygelzimer, F.\u00a0d'Alch\u00e9-Buc, E.\u00a0Fox, and R.\u00a0Garnett (Eds.). Vol.\u00a032. Curran Associates, Inc.https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2019\/file\/09853c7fb1d3f8ee67a61b6bf4a7f8e6-Paper.pdf"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_2_17_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov A","year":"2018","unstructured":"Yu\u00a0A Malkov and Dmitry\u00a0A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence 42, 4 (2018), 824\u2013836."},{"key":"e_1_3_2_2_18_1","unstructured":"PyNNDescent. [n. d.]. GitHub - lmcinnes\/pynndescent: A Python nearest neighbor descent for approximate nearest neighbors \u2014 github.com. https:\/\/github.com\/lmcinnes\/pynndescent. [Accessed 24-Jun-2023]."},{"key":"e_1_3_2_2_19_1","unstructured":"Harsha\u00a0Vardhan Simhadri George Williams Martin Aum\u00fcller Artem Babenko Dmitry Baranchuk Qi Chen Matthijs Douze Lucas Hosseini Ravishankar Krishnaswamy Gopal Srinivasa Suhas\u00a0Jayaram Subramanya and Jingdong Wang. [n. d.]. Billion-Scale Approximate Nearest Neighbor Search Challenge: NeurIPS\u201921 competition track. http:\/\/big-ann-benchmarks.com\/neurips21.html. [Accessed 30-Jun-2023]."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476200"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607103"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482344"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2014EDP7108"},{"key":"e_1_3_2_2_25_1","unstructured":"YGM. [n. d.]. GitHub - LLNL\/ygm \u2014 github.com. https:\/\/github.com\/LLNL\/ygm. [Accessed 28-Jun-2023]."}],"event":{"name":"SC-W 2023: Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis","location":"Denver CO USA","acronym":"SC-W 2023"},"container-title":["Proceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624062.3625132","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624062.3625132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T03:01:54Z","timestamp":1755745314000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624062.3625132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,12]]},"references-count":25,"alternative-id":["10.1145\/3624062.3625132","10.1145\/3624062"],"URL":"https:\/\/doi.org\/10.1145\/3624062.3625132","relation":{},"subject":[],"published":{"date-parts":[[2023,11,12]]},"assertion":[{"value":"2023-11-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}