{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:48:08Z","timestamp":1774986488024,"version":"3.50.1"},"reference-count":81,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100006374","name":"Oracle","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>Analytical tasks in various domains increasingly encode complex information as dense vector data (e.g., embeddings), often requiring filtered vector search (i.e., vector search with attribute filtering). This search is challenging due to the volume and dimensionality of the data, the number and variety of filters, and the difference in distribution and\/or update frequency between vectors and filters. Besides, many real applications require answers in a few milliseconds with high recall on large collections. Graph-based methods are considered the best choice for such applications, despite a lack of theoretical guarantees on query accuracy. Existing solutions for filtered vector search are either: 1) ad-hoc, using existing techniques with no or minor modifications; or 2) hybrid, providing specialized indexing and\/or search algorithms. We show that neither is satisfactory and propose RWalks, an index-agnostic graph-based filtered vector search method that efficiently supports both filtered and unfiltered vector search. We demonstrate its scalability and robustness against the state-of-the-art with an exhaustive experimental evaluation on four real datasets (up to 100 million vectors), using query workloads with filters of different types (unique\/composite), and varied specificity (proportion of points that satisfy a filter). The results show that RWalks can perform filtered search up to 2x faster than the second-best competitor (ACORN), while building the index 76x faster and answering unfiltered search 13x faster.<\/jats:p>","DOI":"10.1145\/3725349","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-26","source":"Crossref","is-referenced-by-count":2,"title":["RWalks: Random Walks as Attribute Diffusers for Filtered Vector Search"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0665-7949","authenticated-orcid":false,"given":"Anas","family":"Ait Aomar","sequence":"first","affiliation":[{"name":"Mohammed VI Polytechnic University, Benguerir, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8095-6608","authenticated-orcid":false,"given":"Karima","family":"Echihabi","sequence":"additional","affiliation":[{"name":"Mohammed VI Polytechnic University, Benguerir, Morocco"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2452-8470","authenticated-orcid":false,"given":"Marco","family":"Arnaboldi","sequence":"additional","affiliation":[{"name":"Oracle Labs, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9394-0635","authenticated-orcid":false,"given":"Ioannis","family":"Alagiannis","sequence":"additional","affiliation":[{"name":"Oracle Labs, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8013-1616","authenticated-orcid":false,"given":"Damien","family":"Hilloulin","sequence":"additional","affiliation":[{"name":"Oracle Labs, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2079-4536","authenticated-orcid":false,"given":"Manal","family":"Cherkaoui","sequence":"additional","affiliation":[{"name":"Mohammed VI Polytechnic University, Benguerir, Morocco"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2019. Hnswlib - fast approximate nearest neighbor search. https:\/\/github.com\/nmslib\/hnswlib."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204034"},{"key":"e_1_2_2_3_1","volume-title":"ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems","author":"Aumuller Martin","year":"2020","unstructured":"Martin Aumuller, Erik Bernhardsson, and Alexander Faithfull. 2020. ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems (2020)."},{"key":"e_1_2_2_4_1","volume-title":"Elpis: Graph-Based Similarity Search for Scalable Data Science. PVLDB 16, 6","author":"Azizi Ilias","year":"2023","unstructured":"Ilias Azizi, Karima Echihabi, and Themis Palpanas. 2023. Elpis: Graph-Based Similarity Search for Scalable Data Science. PVLDB 16, 6 (2023)."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709693"},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"A. Babenko and V. Lempitsky. 2015. The Inverted Multi-Index. TPAMI 37 6 (2015).","DOI":"10.1109\/TPAMI.2014.2361319"},{"key":"e_1_2_2_7_1","unstructured":"Big ANN Benchmarks. 2024. YFCC100M 10M Slice for Filtered Vector Search Benchmarking. https:\/\/github.com\/harsha-simhadri\/big-ann-benchmarks\/tree\/main\/neurips23\/filter. Accessed: 2024-07--23."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.52202\/068431-1114"},{"key":"e_1_2_2_9_1","volume-title":"SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/SPTAG","author":"Chen Qi","year":"2018","unstructured":"Qi Chen, Haidong Wang, Mingqin Li, Gang Ren, Scarlett Li, Jeffery Zhu, Jason Li, Chuanjie Liu, Lintao Zhang, and Jingdong Wang. 2018. SPTAG: A library for fast approximate nearest neighbor search. https:\/\/github.com\/Microsoft\/SPTAG"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839417"},{"key":"e_1_2_2_11_1","volume-title":"M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB.","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In VLDB."},{"key":"e_1_2_2_12_1","volume-title":"Cosma Rohilla Shalizi, and Mark EJ Newman","author":"Clauset Aaron","year":"2009","unstructured":"Aaron Clauset, Cosma Rohilla Shalizi, and Mark EJ Newman. 2009. Power-law distributions in empirical data. SIAM review 51, 4 (2009), 661--703."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_2_2_14_1","unstructured":"cppreference.com. 2024. C Reference: std::unordered_map Container. https:\/\/en.cppreference.com\/w\/cpp\/container\/unordered_map. Accessed: 2024-07--23."},{"key":"e_1_2_2_15_1","unstructured":"Wei Dong. 2022. KGraph: Open-Source Library for k-NN Graph Construction and Nearest Neighbor Search. http:\/\/www.kgraph.org. Accessed: 2024-07--23."},{"key":"e_1_2_2_16_1","unstructured":"Matthijs Douze. 2024. YFCC - FAISS baseline. https:\/\/github.com\/harsha-simhadri\/big-ann-benchmarks\/tree\/main\/neurips23\/filter\/faiss."},{"key":"e_1_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Karima Echihabi. 2020. High-Dimensional Similarity Search: From Time Series to Deep Network Embeddings. In SIGMOD.","DOI":"10.1145\/3318464.3384402"},{"key":"e_1_2_2_18_1","volume-title":"Hercules Against Data Series Similarity Search. PVLDB 15, 10","author":"Echihabi Karima","year":"2022","unstructured":"Karima Echihabi, Panagiota Fatourou, Kostas Zoumpatianos, Themis Palpanas, and Houda Benbrahim. 2022. Hercules Against Data Series Similarity Search. PVLDB 15, 10 (2022)."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476407"},{"key":"e_1_2_2_20_1","volume-title":"Big Sequence Management: on Scalability","author":"Echihabi Karima","unstructured":"Karima Echihabi, Kostas Zoumpatianos, and Themis Palpanas. 2020. Big Sequence Management: on Scalability. In IEEE BigData."},{"key":"e_1_2_2_21_1","unstructured":"Karima Echihabi Kostas Zoumpatianos and Themis Palpanas. 2021. Big Sequence Management: Scaling up and Out. In EDBT."},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Karima Echihabi Kostas Zoumpatianos and Themis Palpanas. 2021. High-Dimensional Similarity Search for Scalable Data Science (ICDE).","DOI":"10.1109\/ICDE51399.2021.00268"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282498"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368303"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-004-2268-6"},{"key":"e_1_2_2_26_1","volume-title":"Faiss Wiki: Guidelines for Choosing an Index. https:\/\/github.com\/facebookresearch\/faiss\/wiki\/Guidelines-to-choose-an-index. Accessed: 2024-07--23.","year":"2024","unstructured":"Faiss. 2024. Faiss Wiki: Guidelines for Choosing an Index. https:\/\/github.com\/facebookresearch\/faiss\/wiki\/Guidelines-to-choose-an-index. Accessed: 2024-07--23."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/354756.354820"},{"key":"e_1_2_2_28_1","volume-title":"Efanna: An extremely fast approximate nearest neighbor search algorithm based on knn graph. arXiv preprint arXiv:1609.07228","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 preprint arXiv:1609.07228 (2016)."},{"key":"e_1_2_2_29_1","volume-title":"High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility","author":"Fu Cong","year":"2021","unstructured":"Cong Fu, Changxu Wang, and Deng Cai. 2021. High Dimensional Similarity Search with Satellite System Graph: Efficiency, Scalability, and Unindexed Query Compatibility. IEEE Transactions on Pattern Analysis and Machine Intelligence (2021)."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_2_2_31_1","volume-title":"A new statistical approach to geographic variation analysis. Systematic zoology 18, 3","author":"Ruben Gabriel K","year":"1969","unstructured":"K Ruben Gabriel and Robert R Sokal. 1969. A new statistical approach to geographic variation analysis. Systematic zoology 18, 3 (1969), 259--278."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583552"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00521"},{"key":"e_1_2_2_35_1","volume-title":"Khandker Mushfiqul Islam, and Chidambaram Crushev","author":"Jafari Omid","year":"2021","unstructured":"Omid Jafari, Preeti Maurya, Parth Nagarkar, Khandker Mushfiqul Islam, and Chidambaram Crushev. 2021. A survey on locality sensitive hashing algorithms and their applications. arXiv preprint arXiv:2102.08942 (2021)."},{"key":"e_1_2_2_36_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. In Advances in Neural Information Processing Systems, Vol. 32."},{"key":"e_1_2_2_37_1","volume-title":"Product Quantization for Nearest Neighbor Search. TPAMI 33, 1","author":"Jegou Herve","year":"2011","unstructured":"Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2011. Product Quantization for Nearest Neighbor Search. TPAMI 33, 1 (2011)."},{"key":"e_1_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Herve Jegou Romain Tavenard Matthijs Douze and Laurent Amsaleg. 2011. Searching in one billion vectors: Re-rank with source coding. In ICASSP.","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2302018"},{"key":"e_1_2_2_40_1","volume-title":"Billion-scale similarity search with gpus","author":"Johnson Jeff","year":"2017","unstructured":"Jeff Johnson, Matthijs Douze, and Herv\u00e9 J\u00e9gou. 2017. Billion-scale similarity search with gpus. IEEE Transactions on Big Data (2017)."},{"key":"e_1_2_2_41_1","volume-title":"Dense passage retrieval for open-domain question answering. arXiv preprint arXiv:2004.04906","author":"Karpukhin Vladimir","year":"2020","unstructured":"Vladimir Karpukhin, Barlas Oguz, Sewon Min, Patrick Lewis, Ledell Wu, Sergey Edunov, Danqi Chen, and Wen-tau Yih. 2020. Dense passage retrieval for open-domain question answering. arXiv preprint arXiv:2004.04906 (2020)."},{"key":"e_1_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Jon Kleinberg et al. 2002. Small-world phenomena and the dynamics of information. Advances in neural information processing systems 1 (2002) 431--438.","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"e_1_2_2_43_1","first-page":"18470","article-title":"Pre-training via paraphrasing","volume":"33","author":"Lewis Mike","year":"2020","unstructured":"Mike Lewis, Marjan Ghazvininejad, Gargi Ghosh, Armen Aghajanyan, Sida Wang, and Luke Zettlemoyer. 2020. Pre-training via paraphrasing. Advances in Neural Information Processing Systems 33 (2020), 18470--18481.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_44_1","first-page":"9459","article-title":"Retrieval-augmented generation for knowledge-intensive nlp tasks","volume":"33","author":"Lewis Patrick","year":"2020","unstructured":"Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich K\u00fcttler, Mike Lewis, Wen-tau Yih, Tim Rockt\u00e4schel, et al. 2020. Retrieval-augmented generation for knowledge-intensive nlp tasks. Advances in Neural Information Processing Systems 33 (2020), 9459--9474.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.10.006"},{"key":"e_1_2_2_47_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov Yury","year":"2018","unstructured":"Yury 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 (2018), 824--836."},{"key":"e_1_2_2_48_1","unstructured":"Microsoft. 2024. DiskANN code base. https:\/\/github.com\/microsoft\/DiskANN. Accessed: 2024-07--23."},{"key":"e_1_2_2_49_1","unstructured":"MingYang. 2024. YFCC10M Filtered Search Benchmark: DISKANN Baseline Configuration. https:\/\/github.com\/harsha-simhadri\/big-ann-benchmarks\/blob\/main\/neurips23\/filter\/fdufilterdiskann\/config.yaml. Accessed: 2024-07--23."},{"key":"e_1_2_2_50_1","volume-title":"VISAPP International Conference on Computer Vision Theory and Applications. 331--340","author":"Muja Marius","unstructured":"Marius Muja and David G. Lowe. 2009. Fast approximate nearest neighbors with automatic algorithm configuration. In VISAPP International Conference on Computer Vision Theory and Applications. 331--340."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.106970"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44900-1_5"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654923"},{"key":"e_1_2_2_54_1","volume-title":"International Conference on Information and Communication Technologies & Applications","volume":"17","author":"Ponomarenko Alexander","year":"2011","unstructured":"Alexander Ponomarenko, Yury Malkov, Andrey Logvinov, and Vladimir Krylov. 2011. Approximate nearest neighbor search small world approach. In International Conference on Information and Communication Technologies & Applications, Vol. 17."},{"key":"e_1_2_2_55_1","volume-title":"Qdrant: Benchmark Datasets for Filtered Approximate Nearest Neighbor Search. https:\/\/github.com\/qdrant\/ann-filtering-benchmark-datasets. Accessed: 2024-07--23.","year":"2024","unstructured":"Qdrant. 2024. Qdrant: Benchmark Datasets for Filtered Approximate Nearest Neighbor Search. https:\/\/github.com\/qdrant\/ann-filtering-benchmark-datasets. Accessed: 2024-07--23."},{"key":"e_1_2_2_56_1","unstructured":"D. Raj. Reddy. 1977. Speech Understanding Systems: A Summary of Results of the Five-Year Research Effort. Department of Computer Science Technical Report. Carnegie Mellon University (1977)."},{"key":"e_1_2_2_57_1","unstructured":"Facebook AI Research. [n. d.]. Searching in a subset of elements. https:\/\/github.com\/facebookresearch\/faiss\/wiki\/Setting-search-parameters-for-one-query#searching-in-a-subset-of-elements. Accessed: 2024-06--26."},{"key":"e_1_2_2_58_1","unstructured":"RWalks. 2024. RWalks additional material and codebase. https:\/\/github.com\/anon-sigmod\/RWalks\/tree\/main. Accessed: 2024-07--23."},{"key":"e_1_2_2_59_1","volume-title":"The Design and Analysis of Spatial Data Structures","author":"Samet Hanan","unstructured":"Hanan Samet. 1990. The Design and Analysis of Spatial Data Structures. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA."},{"key":"e_1_2_2_60_1","volume-title":"Psychology of learning and motivation.","author":"Schvaneveldt Roger W","unstructured":"Roger W Schvaneveldt, Francis T Durso, and Donald W Dearholt. 1989. Network structures in proximity data. In Psychology of learning and motivation. Vol. 24. Elsevier, 249--284."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507165"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2205.03763"},{"key":"e_1_2_2_63_1","unstructured":"Skoltech Computer Vision. 2018. Deep billion-scale indexing. http:\/\/sites.skoltech.ru\/compvision\/noimi."},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403342"},{"key":"e_1_2_2_65_1","volume-title":"Proceedings of the 33rd International Conference on Neural Information Processing Systems. 13766--13776","author":"Subramanya Suhas Jayaram","year":"2019","unstructured":"Suhas Jayaram Subramanya, Rohan Kadekodi, Ravishankar Krishaswamy, and Harsha Vardhan Simhadri. 2019. Diskann: Fast accurate billion-point nearest neighbor search on a single node. In Proceedings of the 33rd International Conference on Neural Information Processing Systems. 13766--13776."},{"key":"e_1_2_2_66_1","unstructured":"TAG-Research. [n. d.]. ACORN codebase. https:\/\/github.com\/TAG-Research\/ACORN. Accessed: 2024--10-02."},{"key":"e_1_2_2_67_1","unstructured":"TEXMEX Research Team. 2018. Datasets for approximate nearest neighbor search. http:\/\/corpus-texmex.irisa.fr\/."},{"key":"e_1_2_2_68_1","volume-title":"The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4","author":"Toussaint Godfried T","year":"1980","unstructured":"Godfried T Toussaint. 1980. The relative neighbourhood graph of a finite planar set. Pattern recognition 12, 4 (1980), 261--268."},{"key":"e_1_2_2_69_1","volume-title":"Proximity graphs for nearest neighbor decision rules: recent progress. Interface 34","author":"Toussaint Godfried T","year":"2002","unstructured":"Godfried T Toussaint. 2002. Proximity graphs for nearest neighbor decision rules: recent progress. Interface 34 (2002)."},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"e_1_2_2_71_1","volume-title":"Xiaoliang Xu, Yuxiang Wang, Qiang Yue, and Jiongkang Ni.","author":"Wang Mengzhao","year":"2022","unstructured":"Mengzhao Wang, Li ang Lv, Xiaoliang Xu, Yuxiang Wang, Qiang Yue, and Jiongkang Ni. 2022. Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints. arXiv:2203.13601"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536206.2536208"},{"key":"e_1_2_2_74_1","volume-title":"Collective dynamics of 'small-world'networks. nature 393, 6684","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world'networks. nature 393, 6684 (1998), 440--442."},{"key":"e_1_2_2_75_1","volume-title":"Proc. VLDB. 194--205","author":"Weber Roger","year":"1998","unstructured":"Roger Weber, Hans-J\u00f6rg Schek, and Stephen Blott. 1998. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In Proc. VLDB. 194--205."},{"key":"e_1_2_2_76_1","unstructured":"Elmar Wolfstetter Uwe Dulleck Roman Inderst Peter Kuhbier and M Lands-Berger. 1993. Stochastic dominance: theory and applications. Humboldt-Univ. Wirtschaftswiss. Fak."},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557610"},{"key":"e_1_2_2_78_1","volume-title":"Joint Inverted Indexing. ICCV","author":"Xia Yan","year":"2013","unstructured":"Yan Xia, Kaiming He, Fang Wen, and Jian Sun. 2013. Joint Inverted Indexing. ICCV (2013)."},{"key":"e_1_2_2_79_1","unstructured":"Yury Malkov. [n. d.]. Header-only C\/python library for fast approximate nearest neighbors. https:\/\/github.com\/nmslib\/hnswlib. Accessed: 2024-07--23."},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098063"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.14778\/3594512.3594527"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:50:39Z","timestamp":1774983039000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":81,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725349"],"URL":"https:\/\/doi.org\/10.1145\/3725349","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}