{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:17:04Z","timestamp":1784179024583,"version":"3.55.0"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T00:00:00Z","timestamp":1631059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Australian Research Council Discovery Project","award":["DP200103136"],"award-info":[{"award-number":["DP200103136"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2022,1,31]]},"abstract":"<jats:p>\n            Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections. While there are a number of possible organizations, document-ordered indexes are the most common, since they are amenable to various query types, support index updates, and allow for efficient dynamic pruning operations. One disadvantage with document-ordered indexes is that high-scoring documents can be distributed across the document identifier space, meaning that index traversal algorithms that terminate early might put search effectiveness at risk. The alternative is impact-ordered indexes, which primarily support top-\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            disjunctions but also allow for\n            <jats:italic>anytime<\/jats:italic>\n            query processing, where the search can be terminated at any time, with search quality improving as processing latency increases. Anytime query processing can be used to effectively reduce high-percentile tail latency that is essential for operational scenarios in which a service level agreement (SLA) imposes response time requirements. In this work, we show how document-ordered indexes can be organized such that they can be queried in an anytime fashion, enabling strict latency control with effective early termination. Our experiments show that processing document-ordered topical segments selected by a simple score estimator outperforms existing anytime algorithms, and allows query runtimes to be accurately limited to comply with SLA requirements.\n          <\/jats:p>","DOI":"10.1145\/3467890","type":"journal-article","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T15:31:23Z","timestamp":1631115083000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Anytime Ranking on Document-Ordered Indexes"],"prefix":"10.1145","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7992-4633","authenticated-orcid":false,"given":"Joel","family":"Mackenzie","sequence":"first","affiliation":[{"name":"The University of Melbourne, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0054-9429","authenticated-orcid":false,"given":"Matthias","family":"Petri","sequence":"additional","affiliation":[{"name":"Amazon Alexa, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"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":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,9,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201907)","author":"Allan J.","unstructured":"J. Allan , B. Carterette , J. A. Aslam , V. Pavlu , B. Dachev , and E. Kanoulas . 2007. Million query track 2007 overview . In Proceedings of the Text Retrieval Conference (TREC\u201907) . J. Allan, B. Carterette, J. A. Aslam, V. Pavlu, B. Dachev, and E. Kanoulas. 2007. Million query track 2007 overview. In Proceedings of the Text Retrieval Conference (TREC\u201907)."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201908)","author":"Allan J.","unstructured":"J. Allan , J. A. Aslam , B. Carterette , V. Pavlu , and E. Kanoulas . 2008. Million query track 2008 overview . In Proceedings of the Text Retrieval Conference (TREC\u201908) . J. Allan, J. A. Aslam, B. Carterette, V. Pavlu, and E. Kanoulas. 2008. Million query track 2008 overview. In Proceedings of the Text Retrieval Conference (TREC\u201908)."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201908)","author":"Altingovde I. S.","unstructured":"I. S. Altingovde , E. Demir , F. Can , and O. Ulusoy . 2008. Site-based dynamic pruning for query processing in search engines . In Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201908) , 861\u2013862. I. S. Altingovde, E. Demir, F. Can, and O. Ulusoy. 2008. Site-based dynamic pruning for query processing in search engines. In Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201908), 861\u2013862."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1361684.1361688"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201913)","author":"Aly R.","year":"2013","unstructured":"R. Aly , D. Hiemstra , and T. Demeester . 2013. Taily: Shard selection using the tail of score distributions . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201913) , 673\u2013682, 2013 . R. Aly, D. Hiemstra, and T. Demeester. 2013. Taily: Shard selection using the tail of score distributions. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201913), 673\u2013682, 2013."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582416"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201906)","author":"Anh V. N.","unstructured":"V. N. Anh and A. Moffat . 2006. Pruned query evaluation using pre-computed impacts . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201906) , 372\u2013379. V. N. Anh and A. Moffat. 2006. Pruned query evaluation using pre-computed impacts. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201906), 372\u2013379."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201901)","author":"Anh V. N.","year":"2001","unstructured":"V. N. Anh , O. de Kretser , and A. Moffat . 2001. Vector-space ranking with effective early termination . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201901) , 35\u201342, 2001 . V. N. Anh, O. de Kretser, and A. Moffat. 2001. Vector-space ranking with effective early termination. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201901), 35\u201342, 2001."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)","author":"Broccolo D.","unstructured":"D. Broccolo , C. Macdonald , S. Orlando , I. Ounis , R. Perego , F. Silvestri , and N. Tonellotto . 2013. Load-sensitive selective pruning for distributed search . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913) , 379\u2013388. D. Broccolo, C. Macdonald, S. Orlando, I. Ounis, R. Perego, F. Silvestri, and N. Tonellotto. 2013. Load-sensitive selective pruning for distributed search. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913), 379\u2013388."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903)","author":"Broder A. Z.","unstructured":"A. Z. Broder , D. Carmel , M. Herscovici , A. Soffer , and J. Zien . Efficient query evaluation using a two-level retrieval process . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903) , 426\u2013434. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien. Efficient query evaluation using a two-level retrieval process. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201903), 426\u2013434."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(03)00062-0"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the Text Retrieval Conference (TREC\u201909)","author":"Carterette B.","unstructured":"B. Carterette , V. Pavlu , H. Fang , and E. Kanoulas . Million query track 2009 overview . In Proceedings of the Text Retrieval Conference (TREC\u201909) . B. Carterette, V. Pavlu, H. Fang, and E. Kanoulas. Million query track 2009 overview. In Proceedings of the Text Retrieval Conference (TREC\u201909)."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917)","author":"Chen R.-C.","unstructured":"R.-C. Chen , L. Gallagher , R. Blanco , and J. S. Culpepper . 2017. Efficient cost-aware cascade ranking in multi-stage retrieval . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917) , 445\u2013454. R.-C. Chen, L. Gallagher, R. Blanco, and J. S. Culpepper. 2017. Efficient cost-aware cascade ranking in multi-stage retrieval. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917), 445\u2013454."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-016-9279-1"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913)","author":"Crane M.","unstructured":"M. Crane , A. Trotman , and R. O\u2019Keefe . 2013. Maintaining discriminatory power in quantized indexes . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913) , 1221\u20131224. M. Crane, A. Trotman, and R. O\u2019Keefe. 2013. Maintaining discriminatory power in quantized indexes. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201913), 1221\u20131224."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201917)","author":"Crane M.","unstructured":"M. Crane , J. S. Culpepper , J. Lin , J. Mackenzie , and A. Trotman . 2017.A. comparison of document-at-a-time and score-at-a-time query evaluation . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201917) , 201\u2013210. M. Crane, J. S. Culpepper, J. Lin, J. Mackenzie, and A. Trotman. 2017.A. comparison of document-at-a-time and score-at-a-time query evaluation. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201917), 201\u2013210."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201916)","author":"Dai Z.","unstructured":"Z. Dai , C. Xiong , and J. Callan . 2016. Query-biased partitioning for selective search . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201916) , 1119\u20131128. Z. Dai, C. Xiong, and J. Callan. 2016. Query-biased partitioning for selective search. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201916), 1119\u20131128."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917)","author":"Dai Z.","unstructured":"Z. Dai , Y. Kim , and J. Callan . 2017. Learning to rank resources . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917) , 837\u2013840. Z. Dai, Y. Kim, and J. Callan. 2017. Learning to rank resources. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201917), 837\u2013840."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-017-9298-6"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD\u201916)","author":"Dhulipala L.","unstructured":"L. Dhulipala , I. Kabiljo , B. Karrer , G. Ottaviano , S. Pupyrev , and A. Shalita . 2016. Compressing graphs and indexes with recursive graph bisection . In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD\u201916) , 1535\u20131544. L. Dhulipala, I. Kabiljo, B. Karrer, G. Ottaviano, S. Pupyrev, and A. Shalita. 2016. Compressing graphs and indexes with recursive graph bisection. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD\u201916), 1535\u20131544."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911)","author":"Ding S.","unstructured":"S. Ding and T. Suel . 2011. Faster top- document retrieval using block-max indexes . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911) , 993\u20131002. S. Ding and T. Suel. 2011. Faster top- document retrieval using block-max indexes. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911), 993\u20131002."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201919)","author":"Gallagher L.","unstructured":"L. Gallagher , R.-C. Chen , R. Blanco , and J. S. Culpepper . 2019. Joint optimization of cascade ranking models . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201919) , 15\u201323. L. Gallagher, R.-C. Chen, R. Blanco, and J. S. Culpepper. 2019. Joint optimization of cascade ranking models. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201919), 15\u201323."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201917)","author":"Hafizoglu F.","unstructured":"F. Hafizoglu , E. C. Kucukoglu , and I. S. Altingovde . 2017. On the efficiency of selective search . In Proceedings of the European Conference on Information Retrieval (ECIR\u201917) , 705\u2013712. F. Hafizoglu, E. C. Kucukoglu, and I. S. Altingovde. 2017. On the efficiency of selective search. In Proceedings of the European Conference on Information Retrieval (ECIR\u201917), 705\u2013712."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2943784"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914)","author":"Jeon M.","unstructured":"M. Jeon , S. Kim , S.-W. Hwang , Y. He , S. Elnikety , A. L. Cox , and S. Rixner . 2014. Predictive parallelization: Taming tail latencies in web search . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914) , 253\u2013262. M. Jeon, S. Kim, S.-W. Hwang, Y. He, S. Elnikety, A. L. Cox, and S. Rixner. 2014. Predictive parallelization: Taming tail latencies in web search. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914), 253\u2013262."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the Australasian Document Computing Symposium (ADCS\u201910)","author":"Jia X.-F.","unstructured":"X.-F. Jia , A. Trotman , and R. O\u2019Keefe . 2010. Efficient accumulator initialization . In Proceedings of the Australasian Document Computing Symposium (ADCS\u201910) , 44\u201351. X.-F. Jia, A. Trotman, and R. O\u2019Keefe. 2010. Efficient accumulator initialization. In Proceedings of the Australasian Document Computing Symposium (ADCS\u201910), 44\u201351."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201920)","author":"Kamphuis C.","unstructured":"C. Kamphuis , A. P. de Vries , L. Boytsov , and J. Lin . 2020. Which BM25 do you mean? A large-scale reproducibility study of scoring variants . In Proceedings of the European Conference on Information Retrieval (ECIR\u201920) , 28\u201334. C. Kamphuis, A. P. de Vries, L. Boytsov, and J. Lin. 2020. Which BM25 do you mean? A large-scale reproducibility study of scoring variants. In Proceedings of the European Conference on Information Retrieval (ECIR\u201920), 28\u201334."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918)","author":"Kane A.","unstructured":"A. Kane and F. W. Tompa . 2018. Split-lists and initial thresholds for WAND-based search . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918) , 877\u2013880. A. Kane and F. W. Tompa. 2018. Split-lists and initial thresholds for WAND-based search. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918), 877\u2013880."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201920)","author":"Khattab O.","unstructured":"O. Khattab and M. Zaharia . 2020. ColBERT: Efficient and effective passage search via contextualized late interaction over BERT . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201920) , 39\u201348. O. Khattab and M. Zaharia. 2020. ColBERT: Efficient and effective passage search via contextualized late interaction over BERT. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201920), 39\u201348."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201915)","author":"Kim S.","unstructured":"S. Kim , Y. He , S.-W. Hwang , S. Elnikety , and S. Choi . 2015. Delayed-Dynamic-Selective (DDS) prediction for reducing extreme tail latency in web search . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201915) , 7\u201316. S. Kim, Y. He, S.-W. Hwang, S. Elnikety, and S. Choi. 2015. Delayed-Dynamic-Selective (DDS) prediction for reducing extreme tail latency in web search. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201915), 7\u201316."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201916)","author":"Kim Y.","unstructured":"Y. Kim , J. Callan , J. S. Culpepper , and A. Moffat . 2016. Does selective search benefit from WAND optimization? In Proceedings of the European Conference on Information Retrieval (ECIR\u201916) , 145\u2013158. Y. Kim, J. Callan, J. S. Culpepper, and A. Moffat. 2016. Does selective search benefit from WAND optimization? In Proceedings of the European Conference on Information Retrieval (ECIR\u201916), 145\u2013158."},{"key":"e_1_2_1_33_1","first-page":"1","article-title":"Efficient distributed selective search","volume":"20","author":"Kim Y.","year":"2016","unstructured":"Y. Kim , J. Callan , J. S. Culpepper , and A. Moffat . 2016 . Efficient distributed selective search . Inf. Retriev. 20 , 3 (2016), 1 \u2013 32 . Y. Kim, J. Callan, J. S. Culpepper, and A. Moffat. 2016. Efficient distributed selective search. Inf. Retriev. 20, 3 (2016),1\u201332.","journal-title":"Inf. Retriev."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23826-5_32"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2738035"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201912)","author":"Kulkarni A.","unstructured":"A. Kulkarni , A. S. Tigelaar , D. Hiemstra , and J. Callan . 2012. Shard ranking and cutoff estimation for topically partitioned collections . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201912) , 555\u2013564. A. Kulkarni, A. S. Tigelaar, D. Hiemstra, and J. Callan. 2012. Shard ranking and cutoff estimation for topically partitioned collections. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201912), 555\u2013564."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the ACM International Conference on Theory of Information Retrieval (ICTIR\u201915)","author":"Lin J.","unstructured":"J. Lin and A. Trotman . 2015. Anytime ranking for impact-ordered indexes . In Proceedings of the ACM International Conference on Theory of Information Retrieval (ICTIR\u201915) , 301\u2013304. J. Lin and A. Trotman. 2015. Anytime ranking for impact-ordered indexes. In Proceedings of the ACM International Conference on Theory of Information Retrieval (ICTIR\u201915), 301\u2013304."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401404"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201920)","author":"MacAvaney S.","unstructured":"S. MacAvaney , F. M. Nardini , R. Perego , N. Tonellotto , N. Goharian , and O. Frieder . 2020. Efficient document re-ranking for transformers by precomputing term representations . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201920) , 49\u201358. S. MacAvaney, F. M. Nardini, R. Perego, N. Tonellotto, N. Goharian, and O. Frieder. 2020. Efficient document re-ranking for transformers by precomputing term representations. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201920), 49\u201358."},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912)","author":"Macdonald C.","unstructured":"C. Macdonald , N. Tonellotto , and I. Ounis . 2012. Learning to predict response times for online query scheduling . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912) , 621\u2013630. C. Macdonald, N. Tonellotto, and I. Ounis. 2012. Learning to predict response times for online query scheduling. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912), 621\u2013630."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912)","author":"Macdonald C.","unstructured":"C. Macdonald , N. Tonellotto , and I. Ounis . 2012. Effect of dynamic pruning safety on learning to rank effectiveness . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912) , 1051\u20131052. C. Macdonald, N. Tonellotto, and I. Ounis. 2012. Effect of dynamic pruning safety on learning to rank effectiveness. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201912), 1051\u20131052."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the Australasian Document Computing Symposium (ADCS\u201917)","author":"Mackenzie J.","unstructured":"J. Mackenzie , F. Scholer , and J. S. Culpepper . 2017.Early termination heuristics for score-at-a-time index traversal . In Proceedings of the Australasian Document Computing Symposium (ADCS\u201917) , 8.1\u20138.8. J. Mackenzie, F. Scholer, and J. S. Culpepper. 2017.Early termination heuristics for score-at-a-time index traversal. In Proceedings of the Australasian Document Computing Symposium (ADCS\u201917), 8.1\u20138.8."},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201918)","author":"Mackenzie J.","unstructured":"J. Mackenzie , J. S. Culpepper , R. Blanco , M. Crane , C. L. A. Clarke , and J. Lin . 2018. Query driven algorithm selection in early stage retrieval . In Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201918) , 396\u2013404. J. Mackenzie, J. S. Culpepper, R. Blanco, M. Crane, C. L. A. Clarke, and J. Lin. 2018. Query driven algorithm selection in early stage retrieval. In Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201918), 396\u2013404."},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201918)","author":"Mackenzie J.","unstructured":"J. Mackenzie , C. Macdonald , F. Scholer , and J. S. Culpepper . 2018. On the cost of negation for dynamic pruning . In Proceedings of the European Conference on Information Retrieval (ECIR\u201918) , 544\u2013549. J. Mackenzie, C. Macdonald, F. Scholer, and J. S. Culpepper. 2018. On the cost of negation for dynamic pruning. In Proceedings of the European Conference on Information Retrieval (ECIR\u201918), 544\u2013549."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201919)","author":"Mackenzie J.","unstructured":"J. Mackenzie , A. Mallia , M. Petri , J. S. Culpepper , and T. Suel . 2019. Compressing inverted indexes with recursive graph bisection: A reproducibility study . In Proceedings of the European Conference on Information Retrieval (ECIR\u201919) , 339\u2013352. J. Mackenzie, A. Mallia, M. Petri, J. S. Culpepper, and T. Suel. 2019. Compressing inverted indexes with recursive graph bisection: A reproducibility study. In Proceedings of the European Conference on Information Retrieval (ECIR\u201919), 339\u2013352."},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201921), 1910","author":"Mackenzie J.","year":"1914","unstructured":"J. Mackenzie , M. Petri , and A. Moffat . 2021. Faster index reordering with bipartite graph partitioning . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201921), 1910 \u2013 1914 . J. Mackenzie, M. Petri, and A. Moffat. 2021. Faster index reordering with bipartite graph partitioning. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201921), 1910\u20131914."},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201917)","author":"Mallia A.","unstructured":"A. Mallia , G. Ottaviano , E. Porciani , N. Tonellotto , and R. Venturini . 2017.Faster blockmax WAND with variable-sized blocks . In Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201917) , 625\u2013634. A. Mallia, G. Ottaviano, E. Porciani, N. Tonellotto, and R. Venturini. 2017.Faster blockmax WAND with variable-sized blocks. In Proceedings of the ACM International Conference On Research and Development in Information Retrieval (SIGIR\u201917), 625\u2013634."},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the Open-Source IR Replicability Challenge Workshop (OSIRRC@SIGIR\u201919)","author":"Mallia A.","unstructured":"A. Mallia , M. Siedlaczek , J. Mackenzie , and T. Suel . 2019. PISA: Performant indexes and search for academia . In Proceedings of the Open-Source IR Replicability Challenge Workshop (OSIRRC@SIGIR\u201919) , 50\u201356. A. Mallia, M. Siedlaczek, J. Mackenzie, and T. Suel. 2019. PISA: Performant indexes and search for academia. In Proceedings of the Open-Source IR Replicability Challenge Workshop (OSIRRC@SIGIR\u201919), 50\u201356."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201919)","author":"Mallia A.","unstructured":"A. Mallia , M. Siedlaczek , and T. Suel . 2019. An experimental study of index compression and DAAT query processing methods . In Proceedings of the European Conference on Information Retrieval (ECIR\u201919) , 353\u2013368. A. Mallia, M. Siedlaczek, and T. Suel. 2019. An experimental study of index compression and DAAT query processing methods. In Proceedings of the European Conference on Information Retrieval (ECIR\u201919), 353\u2013368."},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the ACM International Conference On Information and Knowledge Management (CIKM\u201920)","author":"Mallia A.","unstructured":"A. Mallia , M. Siedlaczek , M. Sun , and T. Suel . 2020.A comparison of top-k threshold estimation techniques for disjunctive query processing . In Proceedings of the ACM International Conference On Information and Knowledge Management (CIKM\u201920) , 2141\u20132144. A. Mallia, M. Siedlaczek, M. Sun, and T. Suel. 2020.A comparison of top-k threshold estimation techniques for disjunctive query processing. In Proceedings of the ACM International Conference On Information and Knowledge Management (CIKM\u201920), 2141\u20132144."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013002601898"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/237496.237497"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the International Conference on Web Information Systems Engineering (WISE\u201904)","author":"Moffat A.","unstructured":"A. Moffat and J. Zobel . 2004. What does it mean to \u201cmeasure performance\u201d? In Proceedings of the International Conference on Web Information Systems Engineering (WISE\u201904) , 1\u201312. A. Moffat and J. Zobel. 2004. What does it mean to \u201cmeasure performance\u201d? In Proceedings of the International Conference on Web Information Systems Engineering (WISE\u201904), 1\u201312."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1416950.1416952"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918)","author":"Mohammad H. R.","unstructured":"H. R. Mohammad , K. Xu , J. Callan , and J. S. Culpepper . 2018. Dynamic shard cutoff prediction for selective search . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918) , 85\u201394. H. R. Mohammad, K. Xu, J. Callan, and J. S. Culpepper. 2018. Dynamic shard cutoff prediction for selective search. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201918), 85\u201394."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914)","author":"Ottaviano G.","unstructured":"G. Ottaviano and R. Venturini . Partitioned Elias-Fano indexes. 2014 . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914) , 273\u2013282. G. Ottaviano and R. Venturini. Partitioned Elias-Fano indexes. 2014. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201914), 273\u2013282."},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the Australasian Document Computing Symposium (ADCS\u201913)","author":"Petri M.","unstructured":"M. Petri , J. S. Culpepper , and A. Moffat . 2013. Exploring the magic of WAND . In Proceedings of the Australasian Document Computing Symposium (ADCS\u201913) , 58\u201365. M. Petri, J. S. Culpepper, and A. Moffat. 2013. Exploring the magic of WAND. In Proceedings of the Australasian Document Computing Symposium (ADCS\u201913), 58\u201365."},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201919)","author":"Petri M.","unstructured":"M. Petri , A. Moffat , J. Mackenzie , J. S. Culpepper , and D. Beck . 2019. Accelerated query processing via similarity score prediction . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201919) , 485\u2013494. M. Petri, A. Moffat, J. Mackenzie, J. S. Culpepper, and D. Beck. 2019. Accelerated query processing via similarity score prediction. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201919), 485\u2013494."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201998)","author":"Ponte J.","unstructured":"J. Ponte and W. B. Croft . 1998.A. Language modeling approach to information retrieval . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201998) , 275\u2013281. J. Ponte and W. B. Croft. 1998.A. Language modeling approach to information retrieval. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201998), 275\u2013281."},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913)","author":"Risvik K. M.","unstructured":"K. M. Risvik , T. Chilimbi , H. Tan , K. Kalyanaraman , and C. Anderson . 2013. Maguro, a system for indexing and searching over very large text collections . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913) , 727\u2013736. K. M. Risvik, T. Chilimbi, H. Tan, K. Kalyanaraman, and C. Anderson. 2013. Maguro, a system for indexing and searching over very large text collections. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913), 727\u2013736."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000019"},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the European Conference on Information Retrieval (ECIR\u201919)","author":"Siedlaczek M.","unstructured":"M. Siedlaczek , J. Rodriguez , and T. Suel . 2019. Exploiting global impact ordering for higher throughput selective search . In Proceedings of the European Conference on Information Retrieval (ECIR\u201919) , 12\u201319. M. Siedlaczek, J. Rodriguez, and T. Suel. 2019. Exploiting global impact ordering for higher throughput selective search. In Proceedings of the European Conference on Information Retrieval (ECIR\u201919), 12\u201319."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71496-5_12"},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"N. Tonellotto and C. Macdonald. 2020. Using an inverted index synopsis for query latency and performance prediction. ACM Trans. Inf. Syst. 38.3 (2020) 29.1\u201329.33.  N. Tonellotto and C. Macdonald. 2020. Using an inverted index synopsis for query latency and performance prediction. ACM Trans. Inf. Syst. 38.3 (2020) 29.1\u201329.33.","DOI":"10.1145\/3389795"},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913)","author":"Tonellotto N.","unstructured":"N. Tonellotto , C. Macdonald , and I. Ounis . 2013. Efficient and effective retrieval using selective pruning . In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913) , 63\u201372. N. Tonellotto, C. Macdonald, and I. Ounis. 2013. Efficient and effective retrieval using selective pruning. In Proceedings of the ACM International Conference on Web Search and Data Mining (WSDM\u201913), 63\u201372."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2683"},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of the Australasian Document Computing Symposium (ADCS\u201918)","author":"Trotman A.","unstructured":"A. Trotman and K. Lilly . 2018.Elias revisited: Group Elias SIMD coding . In Proceedings of the Australasian Document Computing Symposium (ADCS\u201918) , 4.1-4.8. A. Trotman and K. Lilly. 2018.Elias revisited: Group Elias SIMD coding. In Proceedings of the Australasian Document Computing Symposium (ADCS\u201918), 4.1-4.8."},{"key":"e_1_2_1_69_1","volume-title":"Proceedings of the SIGIR Workshop on Open Source Information Retrieval (OSIR@SIGIR\u201912)","author":"Trotman A.","unstructured":"A. Trotman , X.-F. Jia , and M. Crane . 2012. Towards an efficient and effective search engine . In Proceedings of the SIGIR Workshop on Open Source Information Retrieval (OSIR@SIGIR\u201912) , 40\u201347. A. Trotman, X.-F. Jia, and M. Crane. 2012. Towards an efficient and effective search engine. In Proceedings of the SIGIR Workshop on Open Source Information Retrieval (OSIR@SIGIR\u201912), 40\u201347."},{"key":"e_1_2_1_70_1","volume-title":"Proceedings of the Australasian Document Computing Symposium (ADCS\u201914)","author":"Trotman A.","unstructured":"A. Trotman , A. Puurula , and B. Burgess . 2014. Improvements to BM25 and language models examined . In Proceedings of the Australasian Document Computing Symposium (ADCS\u201914) , 58\u201365. A. Trotman, A. Puurula, and B. Burgess. 2014. Improvements to BM25 and language models examined. In Proceedings of the Australasian Document Computing Symposium (ADCS\u201914), 58\u201365."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_2_1_72_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911)","author":"Wang L.","unstructured":"L. Wang , J. Lin , and D. Metzler . 2011.A cascade ranking model for efficient ranked retrieval . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911) , 105\u2013114. L. Wang, J. Lin, and D. Metzler. 2011.A cascade ranking model for efficient ranked retrieval. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201911), 105\u2013114."},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201916)","author":"Wang Q.","unstructured":"Q. Wang , C. Dimpoloulos , and T. Suel . 2016. Fast first-phase candidate generation for cascading rankers . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201916) , 295\u2013304. Q. Wang, C. Dimpoloulos, and T. Suel. 2016. Fast first-phase candidate generation for cascading rankers. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201916), 295\u2013304."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/1852102.1852106"},{"key":"e_1_2_1_75_1","volume-title":"Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201919)","author":"Yafay E.","unstructured":"E. Yafay and I. S. Altingovde . 2019. Caching scores for faster query processing with dynamic pruning in search engines . In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201919) , 2457\u20132460. E. Yafay and I. S. Altingovde. 2019. Caching scores for faster query processing with dynamic pruning in search engines. In Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM\u201919), 2457\u20132460."},{"key":"e_1_2_1_76_1","article-title":"Anserini: Reproducible ranking baselines using Lucene","volume":"10","author":"Yang P.","year":"2018","unstructured":"P. Yang , H. Fang , and J. Lin . 2018 . Anserini: Reproducible ranking baselines using Lucene . ACM J. Data Inf. Qual. 10 , 40 (1\u201320). P. Yang, H. Fang, and J. Lin. 2018. Anserini: Reproducible ranking baselines using Lucene. ACM J. Data Inf. Qual. 10, 40 (1\u201320).","journal-title":"ACM J. Data Inf. Qual."},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201915)","author":"Yun J.-M.","unstructured":"J.-M. Yun , Y. He , S. Elnikety , and S. Ren . 2015. Optimal aggregation policy for reducing tail latency of web search . In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201915) , 63\u201372. J.-M. Yun, Y. He, S. Elnikety, and S. Ren. 2015. Optimal aggregation policy for reducing tail latency of web search. In Proceedings of the ACM International Conference on Research and Development in Information Retrieval (SIGIR\u201915), 63\u201372."}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3467890","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3467890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:25:07Z","timestamp":1750195507000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3467890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,8]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,31]]}},"alternative-id":["10.1145\/3467890"],"URL":"https:\/\/doi.org\/10.1145\/3467890","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,8]]},"assertion":[{"value":"2020-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}