{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T18:48:53Z","timestamp":1774291733014,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T00:00:00Z","timestamp":1595635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NPRP","award":["#7-1330-2-483"],"award-info":[{"award-number":["#7-1330-2-483"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,25]]},"DOI":"10.1145\/3397271.3401076","type":"proceedings-article","created":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T07:50:08Z","timestamp":1595663408000},"page":"1031-1040","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Finding the Best of Both Worlds"],"prefix":"10.1145","author":[{"given":"Omar","family":"Khattab","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Hammoud","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University in Qatar, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tamer","family":"Elsayed","sequence":"additional","affiliation":[{"name":"Qatar University, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11735106_3"},{"key":"e_1_3_2_1_2_1","volume-title":"Probabilistic models of information retrieval based on measuring the divergence from randomness. TOIS","author":"Amati Gianni","year":"2002","unstructured":"Gianni Amati and Cornelis Joost Van Rijsbergen . 2002. Probabilistic models of information retrieval based on measuring the divergence from randomness. TOIS ( 2002 ). Gianni Amati and Cornelis Joost Van Rijsbergen. 2002. Probabilistic models of information retrieval based on measuring the divergence from randomness. TOIS (2002)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/245882.245908"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054191"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Andrei Z Broder David Carmel Michael Herscovici Aya Soffer and Jason Zien. 2003. Efficient query evaluation using a two-level retrieval process. In CIKM.  Andrei Z Broder David Carmel Michael Herscovici Aya Soffer and Jason Zien. 2003. Efficient query evaluation using a two-level retrieval process. In CIKM.","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Kaushik Chakrabarti Surajit Chaudhuri and Venkatesh Ganti. 2011. Interval-based pruning for top-k processing over compressed lists. In ICDE.  Kaushik Chakrabarti Surajit Chaudhuri and Venkatesh Ganti. 2011. Interval-based pruning for top-k processing over compressed lists. In ICDE.","DOI":"10.1109\/ICDE.2011.5767855"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Clinchant and Eric Gaussier. 2010. Information-based models for ad hoc IR. In SIGIR.  St\u00e9phane Clinchant and Eric Gaussier. 2010. Information-based models for ad hoc IR. In SIGIR.","DOI":"10.1145\/1835449.1835490"},{"key":"e_1_3_2_1_8_1","volume-title":"TREC 2013 Web Track Overview. In TREC.","author":"Collins-Thompson Kevyn","unstructured":"Kevyn Collins-Thompson , Paul N. Bennett , Fernando Diaz , Charlie Clarke , and Ellen M. Voorhees . 2014 . TREC 2013 Web Track Overview. In TREC. Kevyn Collins-Thompson, Paul N. Bennett, Fernando Diaz, Charlie Clarke, and Ellen M. Voorhees. 2014. TREC 2013 Web Track Overview. In TREC."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Matt Crane J Shane Culpepper Jimmy Lin Joel Mackenzie and Andrew Trotman. 2017. A comparison of Document-at-a-Time and Score-at-a-Time query evaluation. In WSDM.  Matt Crane J Shane Culpepper Jimmy Lin Joel Mackenzie and Andrew Trotman. 2017. A comparison of Document-at-a-Time and Score-at-a-Time query evaluation. In WSDM.","DOI":"10.1145\/3018661.3018726"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.03.005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-017-9298-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Jeffrey Dean. 2009. Challenges in building large-scale information retrieval systems: invited talk. In WSDM. 1--1.  Jeffrey Dean. 2009. Challenges in building large-scale information retrieval systems: invited talk. In WSDM. 1--1.","DOI":"10.1145\/1498759.1498761"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484087"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Constantinos Dimopoulos Sergey Nepomnyachiy and Torsten Suel. 2013b. Optimizing top-k document retrieval strategies for block-max indexes. In WSDM.  Constantinos Dimopoulos Sergey Nepomnyachiy and Torsten Suel. 2013b. Optimizing top-k document retrieval strategies for block-max indexes. In WSDM.","DOI":"10.1145\/2433396.2433412"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Shuai Ding and Torsten Suel. 2011. Faster top-k document retrieval using block-max indexes. In SIGIR.  Shuai Ding and Torsten Suel. 2011. Faster top-k document retrieval using block-max indexes. In SIGIR.","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076116"},{"key":"e_1_3_2_1_17_1","volume-title":"Evaluation strategies for top-k queries over memory-resident inverted indexes. VLDB","author":"Fontoura Marcus","year":"2011","unstructured":"Marcus Fontoura , Vanja Josifovski , Jinhui Liu , Srihari Venkatesan , Xiangfei Zhu , and Jason Zien . 2011. Evaluation strategies for top-k queries over memory-resident inverted indexes. VLDB ( 2011 ). Marcus Fontoura, Vanja Josifovski, Jinhui Liu, Srihari Venkatesan, Xiangfei Zhu, and Jason Zien. 2011. Evaluation strategies for top-k queries over memory-resident inverted indexes. VLDB (2011)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983769"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609572"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808194.2809477"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-016-9291-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210048"},{"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\/3121050.3121094"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080827"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Antonio Mallia Giuseppe Ottaviano Elia Porciani Nicola Tonellotto and Rossano Venturini. 2017. Faster blockmax wand with variable-sized blocks. In SIGIR.  Antonio Mallia Giuseppe Ottaviano Elia Porciani Nicola Tonellotto and Rossano Venturini. 2017. Faster blockmax wand with variable-sized blocks. In SIGIR.","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_2_1_27_1","volume-title":"2019 b","author":"Mallia Antonio","year":"2019","unstructured":"Antonio Mallia , Micha\u0142 Siedlaczek , Joel Mackenzie , and Torsten Suel . 2019 b . PISA : Performant Indexes and Search for Academia . ( 2019 ). Antonio Mallia, Micha\u0142 Siedlaczek, Joel Mackenzie, and Torsten Suel. 2019 b. PISA: Performant Indexes and Search for Academia. (2019)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_23"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872518.2889361"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2537734.2537744"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331207"},{"key":"e_1_3_2_1_32_1","volume-title":"et almbox","author":"Robertson Stephen E","year":"1995","unstructured":"Stephen E Robertson , Steve Walker , Susan Jones , Micheline M Hancock-Beaulieu , Mike Gatford , et almbox . 1995 . Okapi at TREC-3. NIST Special Publication ( 1995). Stephen E Robertson, Steve Walker, Susan Jones, Micheline M Hancock-Beaulieu, Mike Gatford, et almbox. 1995. Okapi at TREC-3. NIST Special Publication (1995)."},{"key":"e_1_3_2_1_33_1","volume-title":"Distributing efficiently the Block-Max WAND algorithm. Procedia Computer Science","author":"Rojas Oscar","year":"2013","unstructured":"Oscar Rojas , Veronica Gil-Costa , and Mauricio Marin . 2013a. Distributing efficiently the Block-Max WAND algorithm. Procedia Computer Science ( 2013 ). Oscar Rojas, Veronica Gil-Costa, and Mauricio Marin. 2013a. Distributing efficiently the Block-Max WAND algorithm. Procedia Computer Science (2013)."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40047-6_41"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124346"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063627"},{"key":"e_1_3_2_1_37_1","volume-title":"et almbox","author":"Tonellotto Nicola","year":"2018","unstructured":"Nicola Tonellotto , Craig Macdonald , Iadh Ounis , et almbox . 2018 . Efficient Query Processing for Scalable Web Search. Foundations and Trends\u00ae in Information Retrieval ( 2018). Nicola Tonellotto, Craig Macdonald, Iadh Ounis, et almbox. 2018. Efficient Query Processing for Scalable Web Search. Foundations and Trends\u00ae in Information Retrieval (2018)."},{"key":"e_1_3_2_1_38_1","volume-title":"Query evaluation: strategies and optimizations. IP & M","author":"Turtle Howard","year":"1995","unstructured":"Howard Turtle and James Flood . 1995. Query evaluation: strategies and optimizations. IP & M ( 1995 ). Howard Turtle and James Flood. 1995. Query evaluation: strategies and optimizations. IP & M (1995)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Sebastiano Vigna. 2013. Quasi-succinct Indices. In WSDM.  Sebastiano Vigna. 2013. Quasi-succinct Indices. In WSDM.","DOI":"10.1145\/2433396.2433409"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Lidan Wang Jimmy Lin and Donald Metzler. 2011. A cascade ranking model for efficient ranked retrieval. In SIGIR.  Lidan Wang Jimmy Lin and Donald Metzler. 2011. A cascade ranking model for efficient ranked retrieval. In SIGIR.","DOI":"10.1145\/2009916.2009934"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3239571"},{"key":"e_1_3_2_1_42_1","volume-title":"et almbox","author":"Yin Dawei","year":"2016","unstructured":"Dawei Yin , Yuening Hu , Jiliang Tang , Tim Daly , Mianwei Zhou , Hua Ouyang , Jianhui Chen , Changsung Kang , Hongbo Deng , Chikashi Nobata , et almbox . 2016 . Ranking relevance in yahoo search. In SIGKDD. Dawei Yin, Yuening Hu, Jiliang Tang, Tim Daly, Mianwei Zhou, Hua Ouyang, Jianhui Chen, Changsung Kang, Hongbo Deng, Chikashi Nobata, et almbox. 2016. Ranking relevance in yahoo search. In SIGKDD."},{"key":"e_1_3_2_1_43_1","volume-title":"A study of smoothing methods for language models applied to information retrieval. TOIS","author":"Zhai Chengxiang","year":"2004","unstructured":"Chengxiang Zhai and John Lafferty . 2004. A study of smoothing methods for language models applied to information retrieval. TOIS ( 2004 ). Chengxiang Zhai and John Lafferty. 2004. A study of smoothing methods for language models applied to information retrieval. TOIS (2004)."}],"event":{"name":"SIGIR '20: The 43rd International ACM SIGIR conference on research and development in Information Retrieval","location":"Virtual Event China","acronym":"SIGIR '20","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401076","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397271.3401076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:38Z","timestamp":1750195898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397271.3401076"}},"subtitle":["Faster and More Robust Top-k Document Retrieval"],"short-title":[],"issued":{"date-parts":[[2020,7,25]]},"references-count":43,"alternative-id":["10.1145\/3397271.3401076","10.1145\/3397271"],"URL":"https:\/\/doi.org\/10.1145\/3397271.3401076","relation":{},"subject":[],"published":{"date-parts":[[2020,7,25]]},"assertion":[{"value":"2020-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}