{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T13:28:15Z","timestamp":1792070895331,"version":"4.4.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["2017K7XPAN_003,20229BCXNW"],"award-info":[{"award-number":["2017K7XPAN_003,20229BCXNW"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"European Commission","doi-asserted-by":"publisher","award":["PNRR ECS00000017,PNRR PE00000013"],"award-info":[{"award-number":["PNRR ECS00000017,PNRR PE00000013"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"HORIZON EUROPE Framework Programme","doi-asserted-by":"publisher","award":["101093026"],"award-info":[{"award-number":["101093026"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,10]]},"DOI":"10.1145\/3626772.3657769","type":"proceedings-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:40:05Z","timestamp":1720701605000},"page":"152-162","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2469-8242","authenticated-orcid":false,"given":"Sebastian","family":"Bruch","sequence":"first","affiliation":[{"name":"Pinecone, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-334X","authenticated-orcid":false,"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0194-361X","authenticated-orcid":false,"given":"Cosimo","family":"Rulli","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9830-3936","authenticated-orcid":false,"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"SparTerm: Learning Term-based Sparse Representation for Fast Text Retrieval. arxiv","author":"Bai Yang","year":"2010","unstructured":"Yang Bai, Xiaoguang Li, Gang Wang, Chaoliang Zhang, Lifeng Shang, Jun Xu, Zhaowei Wang, Fangshan Wang, and Qun Liu. 2020. SparTerm: Learning Term-based Sparse Representation for Fast Text Retrieval. arxiv: 2010.00768 [cs.IR]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_1_3_1","volume-title":"Foundations of Vector Retrieval","author":"Bruch Sebastian","unstructured":"Sebastian Bruch. 2024. Foundations of Vector Retrieval. Springer Nature Switzerland."},{"key":"e_1_3_2_1_4_1","article-title":"An Analysis of Fusion Functions for Hybrid Retrieval","volume":"42","author":"Bruch Sebastian","year":"2023","unstructured":"Sebastian Bruch, Siyu Gai, and Amir Ingber. 2023a. An Analysis of Fusion Functions for Hybrid Retrieval. ACM Transactions on Information Systems, Vol. 42, 1, Article 20 (August 2023), 35 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781638281993"},{"key":"e_1_3_2_1_6_1","article-title":"An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors","volume":"42","author":"Bruch Sebastian","year":"2023","unstructured":"Sebastian Bruch, Franco Maria Nardini, Amir Ingber, and Edo Liberty. 2023c. An Approximate Algorithm for Maximum Inner Product Search over Streaming Sparse Vectors. ACM Transactions on Information Systems, Vol. 42, 2, Article 42 (November 2023), 43 pages.","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_1_7_1","volume-title":"Amir Ingber, and Edo Liberty.","author":"Bruch Sebastian","year":"2023","unstructured":"Sebastian Bruch, Franco Maria Nardini, Amir Ingber, and Edo Liberty. 2023d. Bridging Dense and Sparse Maximum Inner Product Search. arxiv: 2309.09013 [cs.IR]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1265530.1265545"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018726"},{"key":"e_1_3_2_1_10_1","volume-title":"arxiv","author":"Dai Zhuyun","year":"1910","unstructured":"Zhuyun Dai and Jamie Callan. 2019. Context-Aware Sentence\/Passage Term Importance Estimation For First Stage Retrieval. arxiv: 1910.10687 [cs.IR]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380258"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401204"},{"key":"e_1_3_2_1_13_1","unstructured":"Majid Daliri Juliana Freire Christopher Musco A\u00e9cio Santos and Haoxiang Zhang. 2023. Sampling Methods for Inner Product Sketching. arxiv: 2309.16157 [cs.DB]"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","volume":"1","author":"Devlin Jacob","year":"2019","unstructured":"Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 4171--4186."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433412"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_1_17_1","unstructured":"Thibault Formal Carlos Lassance Benjamin Piwowarski and St\u00e9phane Clinchant. 2021a. SPLADE v2: Sparse Lexical and Expansion Model for Information Retrieval. arxiv: 2109.10086 [cs.IR]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531857"},{"key":"e_1_3_2_1_19_1","volume-title":"Towards Effective and Efficient Sparse Neural Information Retrieval. ACM Transactions on Information Systems (December","author":"Formal Thibault","year":"2023","unstructured":"Thibault Formal, Carlos Lassance, Benjamin Piwowarski, and St\u00e9phane Clinchant. 2023. Towards Effective and Efficient Sparse Neural Information Retrieval. ACM Transactions on Information Systems (December 2023)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463098"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401075"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531833"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591941"},{"key":"e_1_3_2_1_27_1","unstructured":"Jimmy Lin and Xueguang Ma. 2021. A Few Brief Notes on DeepImpact COIL and a Conceptual Framework for Information Retrieval Techniques. arxiv: 2106.14807 [cs.IR]"},{"key":"e_1_3_2_1_28_1","volume-title":"Rodrigo Frassetto Nogueira, and Andrew Yates","author":"Lin Jimmy","year":"2021","unstructured":"Jimmy Lin, Rodrigo Frassetto Nogueira, and Andrew Yates. 2021. Pretrained Transformers for Text Ranking: BERT and Beyond. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808194.2809477"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531749"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401262"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. DESIRES. 22--34","author":"Mackenzie J.","unstructured":"J. Mackenzie, M. Petri, and L. Gallagher. 2022. IOQP: A simple Impact-Ordered Query Processor written in Rust. In Proc. DESIRES. 22--34."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. SIGIR. 1910--1914","author":"Mackenzie J.","unstructured":"J. Mackenzie, M. Petri, and A. Moffat. 2021a. Faster Index Reordering with Bipartite Graph Partitioning. In Proc. SIGIR. 1910--1914."},{"key":"e_1_3_2_1_34_1","unstructured":"Joel Mackenzie Andrew Trotman and Jimmy Lin. 2021b. Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation. arxiv: 2110.11540 [cs.IR]"},{"key":"e_1_3_2_1_35_1","article-title":"Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations","volume":"41","author":"Mackenzie Joel","year":"2023","unstructured":"Joel Mackenzie, Andrew Trotman, and Jimmy Lin. 2023. Efficient Document-at-a-Time and Score-at-a-Time Query Evaluation for Learned Sparse Representations. ACM Transactions on Information Systems, Vol. 41, 4 (2023).","journal-title":"ACM Transactions on Information Systems"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531774"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Antonio Mallia and Elia Porciani. 2019. Faster BlockMax WAND with Longer Skipping. In Advances in Information Retrieval. 771--778.","DOI":"10.1007\/978-3-030-15712-8_52"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the Open-Source IR Replicability Challenge co-located with 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, OSIRRC@SIGIR","author":"Mallia Antonio","year":"2019","unstructured":"Antonio Mallia, Michal Siedlaczek, Joel Mackenzie, and Torsten Suel. 2019. PISA: Performant Indexes and Search for Academia. In Proceedings of the Open-Source IR Replicability Challenge co-located with 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, OSIRRC@SIGIR 2019, Paris, France. 50--56."},{"key":"e_1_3_2_1_41_1","unstructured":"Stanislav Morozov and Artem Babenko. 2018. Non-metric Similarity Graphs for Maximum Inner Product Search. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Franco Maria Nardini Cosimo Rulli and Rossano Venturini. 2024. Efficient Multi-vector Dense Retrieval with Bit Vectors. In Advances in Information Retrieval. 3--17.","DOI":"10.1007\/978-3-031-56060-6_1"},{"key":"e_1_3_2_1_43_1","volume-title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. (November","author":"Nguyen Tri","year":"2016","unstructured":"Tri Nguyen, Mir Rosenberg, Xia Song, Jianfeng Gao, Saurabh Tiwary, Rangan Majumder, and Li Deng. 2016. MS MARCO: A Human Generated MAchine Reading COmprehension Dataset. (November 2016)."},{"key":"e_1_3_2_1_44_1","volume-title":"From doc2query to docTTTTTquery. Online preprint","author":"Nogueira Rodrigo","year":"2019","unstructured":"Rodrigo Nogueira, Jimmy Lin, and AI Epistemic. 2019a. From doc2query to docTTTTTquery. Online preprint, Vol. 6 (2019), 2."},{"key":"e_1_3_2_1_45_1","volume-title":"Document Expansion by Query Prediction. arxiv","author":"Nogueira Rodrigo","year":"1904","unstructured":"Rodrigo Nogueira, Wei Yang, Jimmy Lin, and Kyunghyun Cho. 2019b. Document Expansion by Query Prediction. arxiv: 1904.08375 [cs.IR]"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609615"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3415148"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"e_1_3_2_1_49_1","volume-title":"TREC (NIST Special Publication","volume":"126","author":"Robertson Stephen E.","year":"1994","unstructured":"Stephen E. Robertson, Steve Walker, Susan Jones, Micheline Hancock-Beaulieu, and Mike Gatford. 1994. Okapi at TREC-3.. In TREC (NIST Special Publication, Vol. 500--225), Donna K. Harman (Ed.). National Institute of Standards and Technology (NIST), 109--126."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.272"},{"key":"e_1_3_2_1_52_1","volume-title":"BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In 35th Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2).","author":"Thakur Nandan","year":"2021","unstructured":"Nandan Thakur, Nils Reimers, Andreas R\u00fcckl\u00e9, Abhishek Srivastava, and Iryna Gurevych. 2021. BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In 35th Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2)."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295349"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"e_1_3_2_1_57_1","unstructured":"Yonghui Wu Mike Schuster Zhifeng Chen Quoc V. Le Mohammad Norouzi Wolfgang Macherey Maxim Krikun Yuan Cao Qin Gao Klaus Macherey Jeff Klingner Apurva Shah Melvin Johnson Xiaobing Liu \u0141ukasz Kaiser Stephan Gouws Yoshikiyo Kato Taku Kudo Hideto Kazawa Keith Stevens George Kurian Nishant Patil Wei Wang Cliff Young Jason Smith Jason Riesa Alex Rudnick Oriol Vinyals Greg Corrado Macduff Hughes and Jeffrey Dean. 2016. Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation."},{"key":"e_1_3_2_1_58_1","volume-title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In International Conference on Learning Representations.","author":"Xiong Lee","year":"2021","unstructured":"Lee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang, Jialin Liu, Paul Bennett, Junaid Ahmed, and Arnold Overwijk. 2021. Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271800"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.naacl-main.47"}],"event":{"name":"SIGIR 2024: The 47th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Washington DC USA","acronym":"SIGIR 2024","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657769","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626772.3657769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:34:27Z","timestamp":1755840867000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":60,"alternative-id":["10.1145\/3626772.3657769","10.1145\/3626772"],"URL":"https:\/\/doi.org\/10.1145\/3626772.3657769","relation":{},"subject":[],"published":{"date-parts":[[2024,7,10]]},"assertion":[{"value":"2024-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}