{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T13:55:25Z","timestamp":1774360525280,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032212993","type":"print"},{"value":"9783032213006","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-21300-6_35","type":"book-chapter","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T13:00:49Z","timestamp":1774357249000},"page":"444-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Forward Index Compression for\u00a0Learned Sparse Retrieval"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2469-8242","authenticated-orcid":false,"given":"Sebastian","family":"Bruch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martino","family":"Fontana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3183-334X","authenticated-orcid":false,"given":"Franco Maria","family":"Nardini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0194-361X","authenticated-orcid":false,"given":"Cosimo","family":"Rulli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9830-3936","authenticated-orcid":false,"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,25]]},"reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1080\/15427951.2005.10129113","volume":"2","author":"P Boldi","year":"2005","unstructured":"Boldi, P., Vigna, S.: Codes for the world wide web. Internet Math. 2(4), 407\u2013429 (2005)","journal-title":"Internet Math."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Bruch, S.: Foundations of Vector Retrieval. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-55182-6"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Bruch, S., Nardini, F.M., Rulli, C., Venturini, R.: Efficient inverted indexes for approximate retrieval over learned sparse representations. In: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 152\u2013162 (2024)","DOI":"10.1145\/3626772.3657769"},{"key":"35_CR4","doi-asserted-by":"publisher","unstructured":"Bruch, S., Nardini, F.M., Rulli, C., Venturini, R.: 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, pp. 3642\u20133646 (2024). https:\/\/doi.org\/10.1145\/3627673.3679977","DOI":"10.1145\/3627673.3679977"},{"key":"35_CR5","unstructured":"Bruch, S., Nardini, F.M., Rulli, C., Venturini, R.: Efficient sketching and nearest neighbor search algorithms for sparse vector sets (2025). https:\/\/arxiv.org\/abs\/2509.24815"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Bruch, S., Nardini, F.M., Rulli, C., Venturini, R., Venuta, L.: Investigating the scalability of approximate sparse retrieval algorithms to massive datasets. In: Proceedings of the 47th European Conference on Information Retrieval, ECIR, pp. 437\u2013445 (2025)","DOI":"10.1007\/978-3-031-88714-7_43"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Carlson, P., Xie, W., He, S., Yang, T.: Dynamic superblock pruning for fast learned sparse retrieval. In: Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 3004\u20133009 (2025)","DOI":"10.1145\/3726302.3730183"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Dean, J.: Challenges in building large-scale information retrieval systems: invited talk. In: Proceedings of the Second International Conference on Web Search and Web Data Mining, p.\u00a01 (2009)","DOI":"10.1145\/1498759.1498761"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Delfino, L., Erriquez, D., Martinico, S., Nardini, F.M., Rulli, C., Venturini, R.: KANNolo: sweet and smooth approximate k-nearest neighbors search. In: Proceedings of the 47th European Conference on Information Retrieval, pp. 400\u2013406 (2025)","DOI":"10.1007\/978-3-031-88717-8_29"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Kabiljo, I., Karrer, B., Ottaviano, G., Pupyrev, S., Shalita, A.: Compressing graphs and indexes with recursive graph bisection. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1535\u20131544 (2016)","DOI":"10.1145\/2939672.2939862"},{"issue":"2","key":"35_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194\u2013203 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"35_CR12","doi-asserted-by":"publisher","unstructured":"Formal, T., Lassance, C., Piwowarski, B., Clinchant, S.: From distillation to hard negative sampling: making sparse neural ir models more effective. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2353\u20132359 (2022). https:\/\/doi.org\/10.1145\/3477495.3531857","DOI":"10.1145\/3477495.3531857"},{"key":"35_CR13","doi-asserted-by":"publisher","unstructured":"Geng, Z., Ru, D., Yang, Y.: Towards competitive search relevance for inference-free learned sparse retrievers. CoRR abs\/2411.04403 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2411.04403","DOI":"10.48550\/ARXIV.2411.04403"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ipl.2017.09.011","volume":"130","author":"D Lemire","year":"2018","unstructured":"Lemire, D., Kurz, N., Rupp, C.: Stream VByte: faster byte-oriented integer compression. Inf. Process. Lett. 130, 1\u20136 (2018)","journal-title":"Inf. Process. Lett."},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Mackenzie, J., Petri, M., Moffat, A.: Faster index reordering with bipartite graph partitioning. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 1910\u20131914 (2021)","DOI":"10.1145\/3404835.3462991"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2020)","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Mallia, A., Suel, T., Tonellotto, N.: Faster learned sparse retrieval with block-max pruning. In: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2411\u20132415 (2024)","DOI":"10.1145\/3626772.3657906"},{"key":"35_CR18","unstructured":"Morozov, S., Babenko, A.: Non-metric similarity graphs for maximum inner product search. In: Advances in Neural Information Processing Systems (2018)"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Nardini, F.M., Nguyen, T., Rulli, C., Venturini, R., Yates, A.: Effective inference-free retrieval for learned sparse representations. In: Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2936\u20132940 (2025)","DOI":"10.1145\/3726302.3730185"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Pibiri, G.E., Venturini, R.: Techniques for inverted index compression. ACM Comput. Surv. 53(6), 125:1\u2013125:36 (2021)","DOI":"10.1145\/3415148"},{"key":"35_CR21","doi-asserted-by":"publisher","unstructured":"Shen, X., Geng, Z., Yang, Y.: Exploring $$\\cal{L}_0$$ sparsification for inference-free sparse retrievers. In: Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 2572\u20132576 (2025). https:\/\/doi.org\/10.1145\/3726302.3730192","DOI":"10.1145\/3726302.3730192"},{"key":"35_CR22","doi-asserted-by":"publisher","unstructured":"Stepanov, A.A., Gangolli, A.R., Rose, D.E., Ernst, R.J., Oberoi, P.S.: SIMD-based decoding of posting lists. In: Proceedings of the 20th ACM Conference on Information and Knowledge Management CIKM, pp. 317\u2013326 (2011). https:\/\/doi.org\/10.1145\/2063576.2063627","DOI":"10.1145\/2063576.2063627"},{"issue":"1","key":"35_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0271(72)90024-1","volume":"8","author":"LH Thiel","year":"1972","unstructured":"Thiel, L.H., Heaps, H.: Program design for retrospective searches on large data bases. Inf. Storage Retrieval 8(1), 1\u201320 (1972)","journal-title":"Inf. Storage Retrieval"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-21300-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T13:00:59Z","timestamp":1774357259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-21300-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032212993","9783032213006"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-21300-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"25 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ECIR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecir2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ecir2026.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}