{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:36:18Z","timestamp":1780346178830,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T00:00:00Z","timestamp":1682812800000},"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":[[2023,4,30]]},"DOI":"10.1145\/3543507.3583552","type":"proceedings-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T23:30:25Z","timestamp":1682551825000},"page":"3406-3416","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["Filtered-DiskANN: Graph Algorithms for Approximate Nearest Neighbor Search with Filters"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0943-449X","authenticated-orcid":false,"given":"Siddharth","family":"Gollapudi","sequence":"first","affiliation":[{"name":"Microsoft Research, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2751-9526","authenticated-orcid":false,"given":"Neel","family":"Karia","sequence":"additional","affiliation":[{"name":"Columbia University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0785-4474","authenticated-orcid":false,"given":"Varun","family":"Sivashankar","sequence":"additional","affiliation":[{"name":"Microsoft Research, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5765-0843","authenticated-orcid":false,"given":"Ravishankar","family":"Krishnaswamy","sequence":"additional","affiliation":[{"name":"Microsoft Research, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4133-0001","authenticated-orcid":false,"given":"Nikit","family":"Begwani","sequence":"additional","affiliation":[{"name":"Microsoft, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0791-5476","authenticated-orcid":false,"given":"Swapnil","family":"Raz","sequence":"additional","affiliation":[{"name":"Microsoft, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7293-7279","authenticated-orcid":false,"given":"Yiyong","family":"Lin","sequence":"additional","affiliation":[{"name":"Microsoft, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9682-720X","authenticated-orcid":false,"given":"Yin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6135-7933","authenticated-orcid":false,"given":"Neelam","family":"Mahapatro","sequence":"additional","affiliation":[{"name":"Microsoft, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6064-8234","authenticated-orcid":false,"given":"Premkumar","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"Microsoft, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0669-5283","authenticated-orcid":false,"given":"Amit","family":"Singh","sequence":"additional","affiliation":[{"name":"Microsoft, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9323-2227","authenticated-orcid":false,"given":"Harsha Vardhan","family":"Simhadri","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2022. GRANN ANNS Library. https:\/\/github.com\/rakri\/grann\/commit\/bce52e83896bb5af27942e9f20f117fa27db6ad4."},{"key":"e_1_3_2_1_2_1","unstructured":"2022. Milvus-docs: Conduct a Hybrid Search. https:\/\/github.com\/milvus-io\/milvus-docs\/blob\/v2.1.x\/site\/en\/userGuide\/search\/hybridsearch.md"},{"key":"e_1_3_2_1_3_1","unstructured":"2022. Milvus Repository (Commit: 8ac30397dd7eef84251bf1e9bdb988a8f3946b75). https:\/\/github.com\/milvus-io\/milvus"},{"key":"e_1_3_2_1_4_1","unstructured":"2022. NHQ. https:\/\/github.com\/AshenOn3\/NHQ"},{"key":"e_1_3_2_1_5_1","unstructured":"2022. Vearch Doc Operation: Search. https:\/\/vearch.readthedocs.io\/en\/latest\/use_op\/op_doc.html?highlight=filter#search"},{"key":"e_1_3_2_1_6_1","unstructured":"2022. Vespa use cases: Semi-structured navigation. https:\/\/docs.vespa.ai\/en\/attributes.html"},{"key":"e_1_3_2_1_7_1","unstructured":"2022. Weaviate Documentation: Filters. https:\/\/weaviate.io\/developers\/weaviate\/current\/graphql-references\/filters.html"},{"key":"e_1_3_2_1_8_1","unstructured":"2022. Weaviate: Filtered Vector Search. https:\/\/weaviate.io\/developers\/weaviate\/current\/architecture\/prefiltering.html"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems -","volume":"1","author":"Andoni Alexandr","year":"2015","unstructured":"Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, and Ludwig Schmidt. 2015. Practical and Optimal LSH for Angular Distance. In Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume 1 (Montreal, Canada) (NIPS\u201915). MIT Press, Cambridge, MA, USA, 1225\u20131233. http:\/\/dl.acm.org\/citation.cfm?id=2969239.2969376"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746553"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313768"},{"key":"e_1_3_2_1_13_1","volume-title":"ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems 87","author":"Aum\u00fcller Martin","year":"2020","unstructured":"Martin Aum\u00fcller, Erik Bernhardsson, and Alexander Faithfull. 2020. ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms. Information Systems 87 (2020). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306437918303685"},{"key":"e_1_3_2_1_14_1","volume-title":"2012 IEEE Conference on Computer Vision and Pattern Recognition. 3069\u20133076","author":"Babenko A.","unstructured":"A. Babenko and V. Lempitsky. 2012. The inverted multi-index. In 2012 IEEE Conference on Computer Vision and Pattern Recognition. 3069\u20133076."},{"key":"e_1_3_2_1_15_1","volume-title":"Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors. CoRR abs\/1802.02422","author":"Baranchuk Dmitry","year":"2018","unstructured":"Dmitry Baranchuk, Artem Babenko, and Yury Malkov. 2018. Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors. CoRR abs\/1802.02422 (2018). arxiv:1802.02422http:\/\/arxiv.org\/abs\/1802.02422"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_3_2_1_17_1","volume-title":"Annoy: Approximate Nearest Neighbors in C++\/Python. https:\/\/pypi.org\/project\/annoy\/ Python package version 1.13.0.","author":"Bernhardsson Erik","year":"2018","unstructured":"Erik Bernhardsson. 2018. Annoy: Approximate Nearest Neighbors in C++\/Python. https:\/\/pypi.org\/project\/annoy\/ Python package version 1.13.0."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_3_2_1_19_1","unstructured":"James Briggs. 2022. The Missing WHERE Clause in Vector Search. https:\/\/www.microsoft.com\/en-us\/research\/blog\/turing-bletchley-a-universal-image-language-representation-model-by-microsoft\/"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177609"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"e_1_3_2_1_22_1","volume-title":"Faiss: A library for efficient similarity search. [Online","author":"Douze Matthijs","year":"2017","unstructured":"Matthijs Douze, Jeff Johnson, and Herv\u00e9 Jegou. 2017. Faiss: A library for efficient similarity search. [Online; accessed 29-March-2017]."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368303"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3486250"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832415.2832561"},{"key":"e_1_3_2_1_29_1","volume-title":"Billion-scale similarity search with GPUs. arXiv preprint arXiv:1702.08734","author":"Johnson Jeff","year":"2017","unstructured":"Jeff Johnson, Matthijs Douze, and Herv\u00e9 J\u00e9gou. 2017. Billion-scale similarity search with GPUs. arXiv preprint arXiv:1702.08734 (2017)."},{"key":"e_1_3_2_1_30_1","unstructured":"Wei Liu Jun Wang Sanjiv Kumar and Shih-Fu Chang. 2011. Hashing with graphs. In ICML."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412747"},{"key":"e_1_3_2_1_32_1","volume-title":"Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. CoRR abs\/1603.09320","author":"Malkov A.","year":"2016","unstructured":"Yury\u00a0A. Malkov and D.\u00a0A. Yashunin. 2016. Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs. CoRR abs\/1603.09320 (2016). arxiv:1603.09320http:\/\/arxiv.org\/abs\/1603.09320"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850589"},{"key":"e_1_3_2_1_35_1","volume-title":"Hardness of Approximate Nearest Neighbor Search. CoRR abs\/1803.00904","author":"Rubinstein Aviad","year":"2018","unstructured":"Aviad Rubinstein. 2018. Hardness of Approximate Nearest Neighbor Search. CoRR abs\/1803.00904 (2018). arXiv:1803.00904http:\/\/arxiv.org\/abs\/1803.00904"},{"key":"e_1_3_2_1_36_1","unstructured":"Harsha\u00a0Vardhan Simhadri Ravishankar Krishnaswamy Gopal Srinivasa Suhas\u00a0Jayaram Subramanya Andrija Antonijevic Dax Pryce David Kaczynski Shane Williams Siddarth Gollapudi Varun Sivashankar Neel Karia Aditi Singh Shikhar Jaiswal Neelam Mahapatro Philip Adams and Bryan Tower. 2023. DiskANN: Scalable Efficient and Feature-rich Approximate Nearest Neighbor Search. https:\/\/github.com\/Microsoft\/DiskANN"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","unstructured":"Harsha\u00a0Vardhan Simhadri George Williams Martin Aum\u00fcller Matthijs Douze Artem Babenko Dmitry Baranchuk Qi Chen Lucas Hosseini Ravishankar Krishnaswamy Gopal Srinivasa Suhas\u00a0Jayaram Subramanya and Jingdong Wang. 2022. Results of the NeurIPS\u201921 Challenge on Billion-Scale Approximate Nearest Neighbor Search. https:\/\/doi.org\/10.48550\/ARXIV.2205.03763","DOI":"10.48550\/ARXIV.2205.03763"},{"key":"e_1_3_2_1_38_1","volume-title":"FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. CoRR abs\/2105.09613","author":"Singh Aditi","year":"2021","unstructured":"Aditi Singh, Suhas\u00a0Jayaram Subramanya, Ravishankar Krishnaswamy, and Harsha\u00a0Vardhan Simhadri. 2021. FreshDiskANN: A Fast and Accurate Graph-Based ANN Index for Streaming Similarity Search. CoRR abs\/2105.09613 (2021). arXiv:2105.09613https:\/\/arxiv.org\/abs\/2105.09613"},{"key":"e_1_3_2_1_39_1","volume-title":"Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019","author":"Subramanya Suhas\u00a0Jayaram","year":"2019","unstructured":"Suhas\u00a0Jayaram Subramanya, Fnu Devvrit, Rohan Kadekodi, Ravishankar Krishnawamy, and Harsha\u00a0Vardhan Simhadri. 2019. DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8-14 December 2019, Vancouver, BC, Canada, Hanna\u00a0M. Wallach, Hugo Larochelle, Alina Beygelzimer, Florence d\u2019Alch\u00e9-Buc, Emily\u00a0B. Fox, and Roman Garnett (Eds.). 13748\u201313758. http:\/\/papers.nips.cc\/paper\/9527-rand-nsg-fast-accurate-billion-point-nearest-neighbor-search-on-a-single-node"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556574"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457550"},{"key":"e_1_3_2_1_42_1","volume-title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints. arXiv preprint arXiv:2203.13601","author":"Wang Mengzhao","year":"2022","unstructured":"Mengzhao Wang, Lingwei Lv, Xiaoliang Xu, Yuxiang Wang, Qiang Yue, and Jiongkang Ni. 2022. Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints. arXiv preprint arXiv:2203.13601 (2022)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3415478.3415541"},{"key":"e_1_3_2_1_45_1","volume-title":"HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints. arXiv preprint arXiv:2207.07940","author":"Wu Wei","year":"2022","unstructured":"Wei Wu, Junlin He, Yu Qiao, Guoheng Fu, Li Liu, and Jin Yu. 2022. HQANN: Efficient and Robust Similarity Search for Hybrid Queries with Structured and Unstructured Constraints. arXiv preprint arXiv:2207.07940 (2022)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3377369.3377374"}],"event":{"name":"WWW '23: The ACM Web Conference 2023","location":"Austin TX USA","acronym":"WWW '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2023"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543507.3583552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:03Z","timestamp":1750178823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543507.3583552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,30]]},"references-count":46,"alternative-id":["10.1145\/3543507.3583552","10.1145\/3543507"],"URL":"https:\/\/doi.org\/10.1145\/3543507.3583552","relation":{},"subject":[],"published":{"date-parts":[[2023,4,30]]},"assertion":[{"value":"2023-04-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}