{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:50:28Z","timestamp":1755802228750,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T00:00:00Z","timestamp":1741564800000},"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":[[2025,3,10]]},"DOI":"10.1145\/3701551.3703482","type":"proceedings-article","created":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T12:30:16Z","timestamp":1740573016000},"page":"995-997","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Advances in Vector Search"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2469-8242","authenticated-orcid":false,"given":"Sebastian","family":"Bruch","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,3,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Sparterm: Learning term-based sparse representation for fast text retrieval","author":"Bai Y.","year":"2020","unstructured":"Y. Bai, X. Li, G. Wang, C. Zhang, L. Shang, J. Xu, Z. Wang, F. Wang, and Q. Liu. Sparterm: Learning term-based sparse representation for fast text retrieval, 2020."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-55182-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3596512"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000071"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3609797"},{"key":"e_1_3_2_1_6_1","volume-title":"Optimistic query routing in clusteringbased approximate maximum inner product search","author":"Bruch S.","year":"2024","unstructured":"S. Bruch, A. Krishnan, and F. M. Nardini. Optimistic query routing in clusteringbased approximate maximum inner product search, 2024."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3665324"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the 19th ACM Conference on Information and Knowledge Management","author":"Bruch S.","year":"2024","unstructured":"S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. Pairing clustered inverted indexes with knn graphs for fast approximate retrieval over learned sparse representations. In Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2024."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657769"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99736-6_7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401204"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463098"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531857"},{"key":"e_1_3_2_1_14_1","article-title":"Towards effective and efficient sparse neural information retrieval","author":"Formal T.","year":"2023","unstructured":"T. Formal, C. Lassance, B. Piwowarski, and S. Clinchant. Towards effective and efficient sparse neural information retrieval. ACM Transactions on Information Systems, December 2023.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.241"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_17_1","volume-title":"Leveraging semantic and lexical matching to improve the recall of document retrieval systems: A hybrid approach","author":"Kuzi S.","year":"2020","unstructured":"S. Kuzi, M. Zhang, C. Li, M. Bendersky, and M. Najork. Leveraging semantic and lexical matching to improve the recall of document retrieval systems: A hybrid approach. 2020."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591941"},{"key":"e_1_3_2_1_19_1","volume-title":"Splade-v3: New baselines for splade","author":"Lassance C.","year":"2024","unstructured":"C. Lassance, H. D\u00e9jean, T. Formal, and S. Clinchant. Splade-v3: New baselines for splade, 2024."},{"key":"e_1_3_2_1_20_1","volume-title":"A few brief notes on deepimpact, coil, and a conceptual framework for information retrieval techniques","author":"Lin J.","year":"2021","unstructured":"J. Lin and X. Ma. A few brief notes on deepimpact, coil, and a conceptual framework for information retrieval techniques, 2021."},{"key":"e_1_3_2_1_21_1","volume-title":"Pretrained transformers for text ranking: Bert and beyond","author":"Lin J.","year":"2021","unstructured":"J. Lin, R. Nogueira, and A. Yates. Pretrained transformers for text ranking: Bert and beyond, 2021."},{"key":"e_1_3_2_1_22_1","volume-title":"CLEF","author":"Ma J.","year":"2020","unstructured":"J. Ma, I. Korotkov, K. Hall, and R. T. McDonald. Hybrid first-stage retrieval models for biomedical literature. In CLEF, 2020."},{"key":"e_1_3_2_1_23_1","volume-title":"A replication study of dense passage retriever","author":"Ma X.","year":"2021","unstructured":"X. Ma, K. Sun, R. Pradeep, and J. J. Lin. A replication study of dense passage retriever. 2021."},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"9","article-title":"Anytime ranking on document-ordered indexes","volume":"40","author":"Mackenzie J.","year":"2021","unstructured":"J. Mackenzie, M. Petri, and A. Moffat. Anytime ranking on document-ordered indexes. ACM Transactions on Information Systems, 40(1), 9 2021.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_1_25_1","volume-title":"Wacky weights in learned sparse representations and the revenge of score-at-a-time query evaluation","author":"Mackenzie J.","year":"2021","unstructured":"J. Mackenzie, A. Trotman, and J. Lin. Wacky weights in learned sparse representations and the revenge of score-at-a-time query evaluation, 2021."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-emnlp.205"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576922"},{"key":"e_1_3_2_1_28_1","volume-title":"Efficient document-at-a-time and score-at-a-time query evaluation for learned sparse representations. ACM Transactions on Information Systems, 41(4), mar","author":"Mackenzie J.","year":"2023","unstructured":"J. Mackenzie, A. Trotman, and J. Lin. Efficient document-at-a-time and score-at-a-time query evaluation for learned sparse representations. ACM Transactions on Information Systems, 41(4), mar 2023."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463030"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531774"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531774"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657906"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-56060-6_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2017.2705068"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583497"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"S. E. Robertson S.Walker S. Jones M. Hancock-Beaulieu and M. Gatford. Okapi at trec-3. In D. K. Harman editor TREC volume 500--225 of NIST Special Publication pages 109--126. National Institute of Standards and Technology (NIST) 1994.","DOI":"10.6028\/NIST.SP.500-225.routing-city"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361220"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557325"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.272"},{"key":"e_1_3_2_1_41_1","volume-title":"Efficient query processing for scalable web search. Foundations and Trends in Information Retrieval, 12(4--5):319--500, dec","author":"Tonellotto N.","year":"2018","unstructured":"N. Tonellotto, C. Macdonald, and I. Ounis. Efficient query processing for scalable web search. Foundations and Trends in Information Retrieval, 12(4--5):319--500, dec 2018. ISSN 1554-0669."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3626772.3657931"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472233"},{"key":"e_1_3_2_1_44_1","volume-title":"Efficient inner product approximation in hybrid spaces","author":"Wu X.","year":"2019","unstructured":"X. Wu, R. Guo, D. Simcha, D. Dopson, and S. Kumar. Efficient inner product approximation in hybrid spaces. 2019."},{"key":"e_1_3_2_1_45_1","volume-title":"Sparsifying sparse representations for passage retrieval by top-k masking","author":"Yang J.-H.","year":"2021","unstructured":"J.-H. Yang, X. Ma, and J. Lin. Sparsifying sparse representations for passage retrieval by top-k masking, 2021."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271800"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591746"},{"key":"e_1_3_2_1_48_1","volume-title":"Recent advance in content-based image retrieval: A literature survey","author":"Zhou W.","year":"2017","unstructured":"W. Zhou, H. Li, and Q. Tian. Recent advance in content-based image retrieval: A literature survey, 2017."},{"key":"e_1_3_2_1_49_1","volume-title":"Workshop on Reaching Efficiency in Neural Information Retrieval, the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Zhuang S.","year":"2022","unstructured":"S. Zhuang and G. Zuccon. Fast passage re-ranking with contextualized exact term matching and efficient passage expansion. In Workshop on Reaching Efficiency in Neural Information Retrieval, the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2022."}],"event":{"name":"WSDM '25: The Eighteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Hannover Germany","acronym":"WSDM '25"},"container-title":["Proceedings of the Eighteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3701551.3703482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T09:09:22Z","timestamp":1755767362000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3701551.3703482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,10]]},"references-count":49,"alternative-id":["10.1145\/3701551.3703482","10.1145\/3701551"],"URL":"https:\/\/doi.org\/10.1145\/3701551.3703482","relation":{},"subject":[],"published":{"date-parts":[[2025,3,10]]},"assertion":[{"value":"2025-03-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}