{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:16:09Z","timestamp":1781518569343,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the National Natural Science Foundation of China","award":["No. 62022077 and 61976198"],"award-info":[{"award-number":["No. 62022077 and 61976198"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599406","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:10:58Z","timestamp":1691172658000},"page":"1353-1362","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Learning Balanced Tree Indexes for Large-Scale Vector Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8789-2319","authenticated-orcid":false,"given":"Wuchao","family":"Li","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5440-9758","authenticated-orcid":false,"given":"Chao","family":"Feng","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3507-9607","authenticated-orcid":false,"given":"Defu","family":"Lian","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4677-6118","authenticated-orcid":false,"given":"Yuxin","family":"Xie","sequence":"additional","affiliation":[{"name":"Guangdong OPPO Mobile Telecommunications Corp., Ltd, Dongguan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2922-3898","authenticated-orcid":false,"given":"Haifeng","family":"Liu","sequence":"additional","affiliation":[{"name":"Guangdong OPPO Mobile Telecommunications Corp., Ltd, Dongguan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9630-795X","authenticated-orcid":false,"given":"Yong","family":"Ge","sequence":"additional","affiliation":[{"name":"University of Arizona, Tucson, AZ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4835-4102","authenticated-orcid":false,"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"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.1145\/116873.116880"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"e_1_3_2_2_4_1","volume-title":"The inverted multi-index","author":"Babenko Artem","year":"2014","unstructured":"Artem Babenko and Victor Lempitsky . 2014. The inverted multi-index . IEEE transactions on pattern analysis and machine intelligence 37, 6 ( 2014 ), 1247--1260. Artem Babenko and Victor Lempitsky. 2014. The inverted multi-index. IEEE transactions on pattern analysis and machine intelligence 37, 6 (2014), 1247--1260."},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055--2063","author":"Babenko Artem","year":"2016","unstructured":"Artem Babenko and Victor Lempitsky . 2016 . Efficient indexing of billion-scale datasets of deep descriptors . In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055--2063 . Artem Babenko and Victor Lempitsky. 2016. Efficient indexing of billion-scale datasets of deep descriptors. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2055--2063."},{"key":"e_1_3_2_2_6_1","volume-title":"International Conference on Machine Learning. PMLR, 475--484","author":"Baranchuk Dmitry","year":"2019","unstructured":"Dmitry Baranchuk , Dmitry Persiyanov , Anton Sinitsin , and Artem Babenko . 2019 . Learning to route in similarity graphs . In International Conference on Machine Learning. PMLR, 475--484 . Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, and Artem Babenko. 2019. Learning to route in similarity graphs. In International Conference on Machine Learning. PMLR, 475--484."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234200"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_3_2_2_10_1","first-page":"5199","article-title":"Spann: Highly-efficient billion-scale approximate nearest neighborhood search","volume":"34","author":"Chen Qi","year":"2021","unstructured":"Qi Chen , Bing Zhao , Haidong Wang , Mingqin Li , Chuanjie Liu , Zengzhong Li , Mao Yang , and Jingdong Wang . 2021 . Spann: Highly-efficient billion-scale approximate nearest neighborhood search . Advances in Neural Information Processing Systems 34 (2021), 5199 -- 5212 . Qi Chen, Bing Zhao, Haidong Wang, Mingqin Li, Chuanjie Liu, Zengzhong Li, Mao Yang, and Jingdong Wang. 2021. Spann: Highly-efficient billion-scale approximate nearest neighborhood search. Advances in Neural Information Processing Systems 34 (2021), 5199--5212.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_11_1","volume-title":"Conference on learning theory. PMLR, 317--337","author":"Dasgupta Sanjoy","year":"2013","unstructured":"Sanjoy Dasgupta and Kaushik Sinha . 2013 . Randomized partition trees for exact nearest neighbor search . In Conference on learning theory. PMLR, 317--337 . Sanjoy Dasgupta and Kaushik Sinha. 2013. Randomized partition trees for exact nearest neighbor search. In Conference on learning theory. PMLR, 317--337."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_2_13_1","volume-title":"Learning Space Partitions for Nearest Neighbor Search. In 8th International Conference on Learning Representations, ICLR 2020","author":"Dong Yihe","year":"2020","unstructured":"Yihe Dong , Piotr Indyk , Ilya P. Razenshteyn , and Tal Wagner . 2020 . Learning Space Partitions for Nearest Neighbor Search. In 8th International Conference on Learning Representations, ICLR 2020 , Addis Ababa, Ethiopia, April 26--30 , 2020. OpenReview.net. https:\/\/openreview.net\/forum?id=rkenmREFDr Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, and Tal Wagner. 2020. Learning Space Partitions for Nearest Neighbor Search. In 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26--30, 2020. OpenReview.net. https:\/\/openreview.net\/forum?id=rkenmREFDr"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3512767"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525302"},{"key":"e_1_3_2_2_17_1","volume-title":"Smola","author":"Gupta Gaurav","year":"2022","unstructured":"Gaurav Gupta , Tharun Medini , Anshumali Shrivastava , and Alexander J . Smola . 2022 . BLISS : A Billion Scale Index Using Iterative Re-Partitioning (KDD '22). Association for Computing Machinery , New York, NY, USA, 486--495. https: \/\/doi.org\/10.1145\/3534678.3539414 10.1145\/3534678.3539414 Gaurav Gupta, Tharun Medini, Anshumali Shrivastava, and Alexander J. Smola. 2022. BLISS: A Billion Scale Index Using Iterative Re-Partitioning (KDD '22). Association for Computing Machinery, New York, NY, USA, 486--495. https: \/\/doi.org\/10.1145\/3534678.3539414"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290979"},{"key":"e_1_3_2_2_19_1","volume-title":"Ravishankar Krishnawamy, and Rohan Kadekodi.","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya , Fnu Devvrit , Harsha Vardhan Simhadri , Ravishankar Krishnawamy, and Rohan Kadekodi. 2019 . Diskann : Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019). Suhas Jayaram Subramanya, Fnu Devvrit, Harsha Vardhan Simhadri, Ravishankar Krishnawamy, and Rohan Kadekodi. 2019. Diskann: Fast accurate billion-point nearest neighbor search on a single node. Advances in Neural Information Processing Systems 32 (2019)."},{"key":"e_1_3_2_2_20_1","volume-title":"Product quantization for nearest neighbor search","author":"Jegou Herve","year":"2010","unstructured":"Herve Jegou , Matthijs Douze , and Cordelia Schmid . 2010. Product quantization for nearest neighbor search . IEEE transactions on pattern analysis and machine intelligence 33, 1 ( 2010 ), 117--128. Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence 33, 1 (2010), 117--128."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401075"},{"key":"e_1_3_2_2_24_1","unstructured":"Shaishav Kumar and Raghavendra Udupa. 2011. Learning hash functions for cross-view similarity search. In Twenty-second international joint conference on artificial intelligence.  Shaishav Kumar and Raghavendra Udupa. 2011. Learning hash functions for cross-view similarity search. In Twenty-second international joint conference on artificial intelligence."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00977785"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401088"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3489496.3489506"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"e_1_3_2_2_29_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov Yu A","year":"2018","unstructured":"Yu A Malkov and Dmitry A 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--836. Yu A Malkov and Dmitry A 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--836."},{"key":"e_1_3_2_2_30_1","unstructured":"Microsoft. 2021. SpaceV1B. https:\/\/github.com\/microsoft\/SPTAG\/tree\/main\/ datasets\/SPACEV1B.  Microsoft. 2021. SpaceV1B. https:\/\/github.com\/microsoft\/SPTAG\/tree\/main\/ datasets\/SPACEV1B."},{"key":"e_1_3_2_2_31_1","volume-title":"Non-metric similarity graphs for maximum inner product search. Advances in Neural Information Processing Systems 31","author":"Morozov Stanislav","year":"2018","unstructured":"Stanislav Morozov and Artem Babenko . 2018. Non-metric similarity graphs for maximum inner product search. Advances in Neural Information Processing Systems 31 ( 2018 ). Stanislav Morozov and Artem Babenko. 2018. Non-metric similarity graphs for maximum inner product search. Advances in Neural Information Processing Systems 31 (2018)."},{"key":"e_1_3_2_2_32_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Neyshabur Behnam","year":"2015","unstructured":"Behnam Neyshabur and Nathan Srebro . 2015 . On symmetric and asymmetric lshs for inner product search . In International Conference on Machine Learning. PMLR , 1926--1934. Behnam Neyshabur and Nathan Srebro. 2015. On symmetric and asymmetric lshs for inner product search. In International Conference on Machine Learning. PMLR, 1926--1934."},{"key":"e_1_3_2_2_33_1","volume-title":"Five balltree construction algorithms","author":"Omohundro Stephen M","unstructured":"Stephen M Omohundro . 1989. Five balltree construction algorithms . International Computer Science Institute Berkeley . Stephen M Omohundro. 1989. Five balltree construction algorithms. International Computer Science Institute Berkeley."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2577348"},{"key":"e_1_3_2_2_36_1","volume-title":"Weinberger (Eds.)","volume":"27","author":"Shrivastava Anshumali","year":"2014","unstructured":"Anshumali Shrivastava and Ping Li . 2014 . Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). In Advances in Neural Information Processing Systems, Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K.Q . Weinberger (Eds.) , Vol. 27 . Curran Associates, Inc. https:\/\/proceedings.neurips. cc\/paper\/ 2014\/file\/310ce61c90f3a46e340ee8257bc70e93-Paper.pdf Anshumali Shrivastava and Ping Li. 2014. Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). In Advances in Neural Information Processing Systems, Z. Ghahramani, M. Welling, C. Cortes, N. Lawrence, and K.Q. Weinberger (Eds.), Vol. 27. Curran Associates, Inc. https:\/\/proceedings.neurips. cc\/paper\/2014\/file\/310ce61c90f3a46e340ee8257bc70e93-Paper.pdf"},{"key":"e_1_3_2_2_37_1","volume-title":"Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS) (UAI'15)","author":"Shrivastava Anshumali","unstructured":"Anshumali Shrivastava and Ping Li. 2015. Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS) (UAI'15) . AUAI Press , Arlington, Virginia, USA , 812--821. Anshumali Shrivastava and Ping Li. 2015. Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS) (UAI'15). AUAI Press, Arlington, Virginia, USA, 812--821."},{"key":"e_1_3_2_2_38_1","volume-title":"Attention is all you need. Advances in neural information processing systems 30","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani , Noam Shazeer , Niki Parmar , Jakob Uszkoreit , Llion Jones , Aidan N Gomez , \u0141ukasz Kaiser , and Illia Polosukhin . 2017. Attention is all you need. Advances in neural information processing systems 30 ( 2017 ). Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_2_39_1","volume-title":"Heng Tao Shen, et al","author":"Wang Jingdong","year":"2017","unstructured":"Jingdong Wang , Ting Zhang , Nicu Sebe , Heng Tao Shen, et al . 2017 . A survey on learning to hash. IEEE transactions on pattern analysis and machine intelligence 40, 4 (2017), 769--790. Jingdong Wang, Ting Zhang, Nicu Sebe, Heng Tao Shen, et al. 2017. A survey on learning to hash. IEEE transactions on pattern analysis and machine intelligence 40, 4 (2017), 769--790."},{"key":"e_1_3_2_2_40_1","volume-title":"Spectral hashing. Advances in neural information processing systems 21","author":"Weiss Yair","year":"2008","unstructured":"Yair Weiss , Antonio Torralba , and Rob Fergus . 2008. Spectral hashing. Advances in neural information processing systems 21 ( 2008 ). Yair Weiss, Antonio Torralba, and Rob Fergus. 2008. Spectral hashing. Advances in neural information processing systems 21 (2008)."},{"key":"e_1_3_2_2_41_1","volume-title":"Garnett (Eds.)","volume":"30","author":"Wu Xiang","year":"2017","unstructured":"Xiang Wu , Ruiqi Guo , Ananda Theertha Suresh , Sanjiv Kumar , Daniel N Holtmann-Rice , David Simcha , and Felix Yu . 2017 . Multiscale Quantization for Fast Similarity Search. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R . Garnett (Eds.) , Vol. 30 . Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/ paper\/ 2017\/file\/b6617980ce90f637e68c3ebe8b9be745-Paper.pdf Xiang Wu, Ruiqi Guo, Ananda Theertha Suresh, Sanjiv Kumar, Daniel N Holtmann-Rice, David Simcha, and Felix Yu. 2017. Multiscale Quantization for Fast Similarity Search. In Advances in Neural Information Processing Systems, I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett (Eds.), Vol. 30. Curran Associates, Inc. https:\/\/proceedings.neurips.cc\/ paper\/2017\/file\/b6617980ce90f637e68c3ebe8b9be745-Paper.pdf"},{"key":"e_1_3_2_2_42_1","unstructured":"Yandex. 2021. Text-to-Image-1B. https:\/\/research.yandex.com\/datasets\/bigannsB  Yandex. 2021. Text-to-Image-1B. https:\/\/research.yandex.com\/datasets\/bigannsB"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599406","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:36Z","timestamp":1750178256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":42,"alternative-id":["10.1145\/3580305.3599406","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599406","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}