@article{pop00245,
	author = {A Mallia and T Suel and N Tonellotto},
	title = {Faster learned sparse retrieval with block-max pruning},
	journal = {… of the 47th International ACM SIGIR …},
	publisher = {dl.acm.org},
	doi = {10.1145/3626772.3657906},
	url = {https://dl.acm.org/doi/abs/10.1145/3626772.3657906},
	fulltext = {https://www.antoniomallia.it/uploads/SIGIR24.pdf},
	related = {https://scholar.google.com/scholar?q=related:BQNR0MhWHTQJ:scholar.google.com/\&scioq=%22icsc%22%7Ccn00000013+hpc%7C%22high+performance+computing%22+%22big+data%22+quantum\&hl=en\&as_sdt=0,5},
	year = {2024},
	abstract = {Learned sparse retrieval systems aim to combine the effectiveness of contextualized language models with the scalability of conventional data structures such as inverted indexes. …},
	note = {17 cites: https://scholar.google.com/scholar?cites=3755253084785279749\&as_sdt=2005\&sciodt=0,5\&hl=en},
	note = {Query date: 2025-10-13 00:07:46},
}

{"_id":"aX8iFQ4D2ciXPmtqw","bibbaseid":"mallia-suel-tonellotto-fasterlearnedsparseretrievalwithblockmaxpruning-2024","author_short":["Mallia, A","Suel, T","Tonellotto, N"],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["A"],"propositions":[],"lastnames":["Mallia"],"suffixes":[]},{"firstnames":["T"],"propositions":[],"lastnames":["Suel"],"suffixes":[]},{"firstnames":["N"],"propositions":[],"lastnames":["Tonellotto"],"suffixes":[]}],"title":"Faster learned sparse retrieval with block-max pruning","journal":"… of the 47th International ACM SIGIR …","publisher":"dl.acm.org","doi":"10.1145/3626772.3657906","url":"https://dl.acm.org/doi/abs/10.1145/3626772.3657906","fulltext":"https://www.antoniomallia.it/uploads/SIGIR24.pdf","related":"https://scholar.google.com/scholar?q=related:BQNR0MhWHTQJ:scholar.google.com/&scioq=%22icsc%22%7Ccn00000013+hpc%7C%22high+performance+computing%22+%22big+data%22+quantum&hl=en&as_sdt=0,5","year":"2024","abstract":"Learned sparse retrieval systems aim to combine the effectiveness of contextualized language models with the scalability of conventional data structures such as inverted indexes. …","note":"Query date: 2025-10-13 00:07:46","bibtex":"@article{pop00245,\n\tauthor = {A Mallia and T Suel and N Tonellotto},\n\ttitle = {Faster learned sparse retrieval with block-max pruning},\n\tjournal = {… of the 47th International ACM SIGIR …},\n\tpublisher = {dl.acm.org},\n\tdoi = {10.1145/3626772.3657906},\n\turl = {https://dl.acm.org/doi/abs/10.1145/3626772.3657906},\n\tfulltext = {https://www.antoniomallia.it/uploads/SIGIR24.pdf},\n\trelated = {https://scholar.google.com/scholar?q=related:BQNR0MhWHTQJ:scholar.google.com/\\&scioq=%22icsc%22%7Ccn00000013+hpc%7C%22high+performance+computing%22+%22big+data%22+quantum\\&hl=en\\&as_sdt=0,5},\n\tyear = {2024},\n\tabstract = {Learned sparse retrieval systems aim to combine the effectiveness of contextualized language models with the scalability of conventional data structures such as inverted indexes. …},\n\tnote = {17 cites: https://scholar.google.com/scholar?cites=3755253084785279749\\&as_sdt=2005\\&sciodt=0,5\\&hl=en},\n\tnote = {Query date: 2025-10-13 00:07:46},\n}\n","author_short":["Mallia, A","Suel, T","Tonellotto, N"],"bibbaseid":"mallia-suel-tonellotto-fasterlearnedsparseretrievalwithblockmaxpruning-2024","role":"author","urls":{"Paper":"https://dl.acm.org/doi/abs/10.1145/3626772.3657906"},"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/f/5MAcCcTaAtgWLSKEX/PoPCites2.bib","dataSources":["qF4nyXCzmTpDDJmeh"],"keywords":[],"search_terms":["faster","learned","sparse","retrieval","block","max","pruning","mallia","suel","tonellotto"],"title":"Faster learned sparse retrieval with block-max pruning","year":2024}