{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:55:02Z","timestamp":1775181302345,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","funder":[{"name":"Google Research Scholar Program","award":["n\/a"],"award-info":[{"award-number":["n\/a"]}]},{"name":"Australian Research Council","award":["DP200103136"],"award-info":[{"award-number":["DP200103136"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,12,7]]},"DOI":"10.1145\/3767695.3769477","type":"proceedings-article","created":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:14:58Z","timestamp":1764782098000},"page":"325-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Empirical Asymptotic Growth of Dynamic Pruning Mechanisms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3241-7615","authenticated-orcid":false,"given":"Luke","family":"Gallagher","sequence":"first","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-4633","authenticated-orcid":false,"given":"Joel","family":"Mackenzie","sequence":"additional","affiliation":[{"name":"The University of Queensland, Brisbane, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6638-0232","authenticated-orcid":false,"given":"Alistair","family":"Moffat","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,12,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582416"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383957"},{"key":"e_1_3_2_1_3_1","volume-title":"MS MARCO: A human generated machine reading comprehension dataset. arXiv:1611.09268","author":"Bajaj P.","year":"2016","unstructured":"P. Bajaj, D. Campos, N. Craswell, L. Deng, J. Gao, X. Liu, R. Majumder, A. McNamara, B. Mitra, T. Nguyen, M. Rosenberg, X. Song, A. Stoica, S. Tiwary, and T. Wang. MS MARCO: A human generated machine reading comprehension dataset. arXiv:1611.09268, 2016."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. SIGIR ReNEUIR Workshop","author":"Basnet S.","year":"2024","unstructured":"S. Basnet, J. Gou, A. Mallia, and T. Suel. DeeperImpact: Optimizing sparse learned index structures. In Proc. SIGIR ReNEUIR Workshop, 2024."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054191"},{"issue":"1","key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1064827595289108","article-title":"and conjugate gradient method for large-scale bound-constrained minimization problems","volume":"21","author":"Branch M. A.","year":"1999","unstructured":"M. A. Branch, T. F. Coleman, and Y. Li. Asubspace, interior, and conjugate gradient method for large-scale bound-constrained minimization problems. SIAM J. Sci. Comput., 21(1):1-23, 1999.","journal-title":"SIAM J. Sci. Comput."},{"key":"e_1_3_2_1_7_1","first-page":"379","volume-title":"Proc. CIKM","author":"Broccolo D.","year":"2013","unstructured":"D. Broccolo, C. Macdonald, S. Orlando, I. Ounis, R. Perego, F. Silvestri, and N. Tonellotto. Load-sensitive selective pruning for distributed search. In Proc. CIKM, pages 379-388, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000071"},{"issue":"6","key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1145\/3665324","article-title":"Bridging dense and sparse maximum inner product search","volume":"42","author":"Bruch S.","year":"2024","unstructured":"S. Bruch, F. M. Nardini, A. Ingber, and E. Liberty. Bridging dense and sparse maximum inner product search. ACM Trans. Inf. Syst., 42(6), 2024.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_11_1","first-page":"152","volume-title":"Proc. SIGIR","author":"Bruch S.","year":"2024","unstructured":"S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. Efficient inverted indexes for approximate retrieval over learned sparse representations. In Proc. SIGIR, pages 152-162, 2024."},{"key":"e_1_3_2_1_12_1","volume-title":"Overview of the TREC 2004 terabyte track. In Proc. TREC","author":"Clarke C. L. A.","year":"2004","unstructured":"C. L. A. Clarke, N. Craswell, and I. Soboroff. Overview of the TREC 2004 terabyte track. In Proc. TREC, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018726"},{"key":"e_1_3_2_1_14_1","first-page":"113","volume-title":"Proc. WSDM","author":"Dimopoulos C.","year":"2013","unstructured":"C. Dimopoulos, S. Nepomnyachiy, and T. Suel. Optimizing top-k document retrieval strategies for block-max indexes. In Proc. WSDM, pages 113-122, 2013."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_1_16_1","first-page":"983","volume-title":"Proc. SIGIR","author":"Kayaaslan E.","year":"2011","unstructured":"E. Kayaaslan, B. B. Cambazoglu, R. Blanco, F. P. Junqueira, and C. Aykanat. Energy-price-driven query processing in multi-center web search engines. In Proc. SIGIR, pages 983-992, 2011."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401076"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"issue":"5","key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","DOI":"10.1145\/3631939","article-title":"Efficient neural ranking using forward indexes and lightweight encoders","volume":"42","author":"Leonhardt J.","year":"2024","unstructured":"J. Leonhardt, H. M\u00fcller, K. Rudra, M. Khosla, A. Anand, and A. Anand. Efficient neural ranking using forward indexes and lightweight encoders. ACM Trans. Inf. Syst., 42(5), 2024.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_20_1","first-page":"241","volume-title":"Proc. WSDM","author":"Liao K.","year":"2017","unstructured":"K. Liao, A. Moffat, M. Petri, and A. Wirth. A cost model for long-term compressed data retention. In Proc. WSDM, pages 241-249, 2017."},{"key":"e_1_3_2_1_21_1","first-page":"301","volume-title":"Proc. ICTIR","author":"Lin J.","year":"2015","unstructured":"J. Lin and A. Trotman. Anytime ranking for impact-ordered indexes. In Proc. ICTIR, pages 301-304, 2015."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401404"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2037661.2037662"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348367"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412000"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159676"},{"key":"e_1_3_2_1_27_1","first-page":"544","volume-title":"Proc. ECIR","author":"Mackenzie J.","year":"2018","unstructured":"J. Mackenzie, C. Macdonald, F. Scholer, and J. S. Culpepper. On the cost of negation for dynamic pruning. In Proc. ECIR, pages 544-549, 2018."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412762"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-emnlp.205"},{"key":"e_1_3_2_1_30_1","first-page":"22","volume-title":"Proc. DESIRES","author":"Mackenzie J.","year":"2022","unstructured":"J. Mackenzie, M. Petri, and L. Gallagher. IOQP: A simple impact-ordered query processor written in rust. In Proc. DESIRES, pages 22-34, 2022."},{"issue":"1","key":"e_1_3_2_1_31_1","first-page":"13","article-title":"Anytime ranking on document-ordered indexes","volume":"40","author":"Mackenzie J.","unstructured":"J. Mackenzie, M. Petri, and A. Moffat. Anytime ranking on document-ordered indexes. ACM Trans. Inf. Syst., 40(1):13.1-13.32, 2022.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3208902"},{"issue":"4","key":"e_1_3_2_1_33_1","article-title":"Efficient document-at-a-time and score-at-a-time query evaluation for learned sparse representations","volume":"41","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 Trans. Inf. Syst., 41(4), 2023.","journal-title":"ACM Trans. Inf. Syst."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_52"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_2_1_36_1","first-page":"50","volume-title":"Proc. SIGIR OSIRRC Workshop","author":"Mallia A.","year":"2019","unstructured":"A. Mallia, M. Siedlaczek, J. Mackenzie, and T. Suel. PISA: Performant indexes and search for academia. In Proc. SIGIR OSIRRC Workshop, pages 50-56, 2019."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_23"},{"key":"e_1_3_2_1_38_1","first-page":"2411","volume-title":"Proc. SIGIR","author":"Mallia A.","year":"2024","unstructured":"A. Mallia, T. Suel, and N. Tonellotto. Faster learned sparse retrieval with Block-Max pruning. In Proc. SIGIR, pages 2411-2415, 2024."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/237496.237497"},{"key":"e_1_3_2_1_40_1","first-page":"101","volume-title":"Proc. ECIR","author":"Nguyen T.","year":"2023","unstructured":"T. Nguyen, S. MacAvaney, and A. Yates. A unified framework for learned sparse retrieval. In Proc. ECIR, pages 101-116, 2023."},{"key":"e_1_3_2_1_41_1","first-page":"58","volume-title":"Proc. ACDS","author":"Petri M.","year":"2013","unstructured":"M. Petri, J. S. Culpepper, and A. Moffat. Exploring the magic of WAND. In Proc. ACDS, pages 58-65, 2013."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331207"},{"key":"e_1_3_2_1_43_1","first-page":"53","article-title":"Techniques for inverted index compression","author":"Pibiri G. E.","year":"2020","unstructured":"G. E. Pibiri and R. Venturini. Techniques for inverted index compression. ACM Comp. Surv., 53, 2020.","journal-title":"ACM Comp. Surv."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1561\/1500000019","article-title":"The probabilistic relevance framework: BM25 and beyond","volume":"3","author":"Robertson S.","year":"2009","unstructured":"S. Robertson and H. Zaragoza. The probabilistic relevance framework: BM25 and beyond. Found. Trends Inf. Ret., 3:333-389, 2009.","journal-title":"Found. Trends Inf. Ret."},{"key":"e_1_3_2_1_45_1","first-page":"109","volume-title":"Proc. TREC","author":"Robertson S.","year":"1994","unstructured":"S. Robertson, S.Walker, S. Jones, M. M. Hancock-Beaulieu, and M. Gatford. Okapi at TREC-3. In Proc. TREC, pages 109-126, 1994."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124346"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076074"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103359"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3389795"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433407"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000057"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_3_2_1_53_1","first-page":"1619","volume-title":"Proc. CIKM","author":"Wu H.","year":"2014","unstructured":"H.Wu and H. Fang. Analytical performance modeling for top-k query processing. In Proc. CIKM, pages 1619-1628, 2014."},{"issue":"4","key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3239571","article-title":"Anserini: Reproducible ranking baselines using Lucene","volume":"10","author":"Yang P.","year":"2018","unstructured":"P. Yang, H. Fang, and J. Lin. Anserini: Reproducible ranking baselines using Lucene. J. Data and Inf. Quality, 10(4):16:1-16:20, 2018.","journal-title":"J. Data and Inf. Quality"},{"key":"e_1_3_2_1_55_1","first-page":"323","volume-title":"Proc. KDD","author":"Yin D.","year":"2016","unstructured":"D. Yin, Y. Hu, J. Tang, T. Daly, M. Zhou, H. Ouyang, J. Chen, C. Kang, H. Deng, C. Nobata, J.-M. Langlois, and Y. Chang. Ranking relevance in Yahoo search. In Proc. KDD, pages 323-332, 2016."},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/984321.984322"}],"event":{"name":"SIGIR-AP 2025:Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region","location":"Xi'an China","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 2025 Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region"],"original-title":[],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:19:04Z","timestamp":1764782344000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3767695.3769477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,6]]},"references-count":56,"alternative-id":["10.1145\/3767695.3769477","10.1145\/3767695"],"URL":"https:\/\/doi.org\/10.1145\/3767695.3769477","relation":{},"subject":[],"published":{"date-parts":[[2025,12,6]]},"assertion":[{"value":"2025-12-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}