{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:18:46Z","timestamp":1775283526191,"version":"3.50.1"},"publisher-location":"New York, New York, USA","reference-count":27,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1145\/3041021.3054191","type":"proceedings-article","created":{"date-parts":[[2018,1,11]],"date-time":"2018-01-11T18:39:25Z","timestamp":1515695965000},"page":"653-661","source":"Crossref","is-referenced-by-count":10,"title":["Top-k Query Processing with Conditional Skips"],"prefix":"10.1145","author":[{"given":"Edward","family":"Bortnikov","sequence":"first","affiliation":[{"name":"Yahoo Research, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Carmel","sequence":"additional","affiliation":[{"name":"Yahoo Research, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Golan-Gueta","sequence":"additional","affiliation":[{"name":"VMWare Research, Hertzelia, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3041021.3054191-1","doi-asserted-by":"crossref","unstructured":"V. N. Anh and A. Moffat. Pruned query evaluation using pre-computed impacts. In Proceedings of SIGIR, pages 372--379. ACM, 2006.","DOI":"10.1145\/1148170.1148235"},{"key":"key-10.1145\/3041021.3054191-2","doi-asserted-by":"crossref","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 CIKM, pages 426--434. ACM, 2003.","DOI":"10.1145\/956863.956944"},{"key":"key-10.1145\/3041021.3054191-3","doi-asserted-by":"crossref","unstructured":"C. Buckley and A. F. Lewit. Optimization of inverted vector searches. In Proceedings of SIGIR, pages 97--110. ACM, 1985.","DOI":"10.1145\/253495.253515"},{"key":"key-10.1145\/3041021.3054191-4","doi-asserted-by":"crossref","unstructured":"K. Chakrabarti, S. Chaudhuri, and V. Ganti. Interval-based pruning for top-k processing over compressed lists. In Proceedings of ICDE, pages 709--720, 2011.","DOI":"10.1109\/ICDE.2011.5767855"},{"key":"key-10.1145\/3041021.3054191-5","doi-asserted-by":"crossref","unstructured":"J. S. Culpepper, M. Petri, and F. Scholer. Efficient in-memory top-k document retrieval. In Proceedings of SIGIR, pages 225--234. ACM, 2012.","DOI":"10.1145\/2348283.2348317"},{"key":"key-10.1145\/3041021.3054191-6","doi-asserted-by":"crossref","unstructured":"C. M. Daoud, E. S. de Moura, A. Carvalho, A. S. da Silva, D. Fernandes, and C. Rossi. Fast top-k preserving query processing using two-tier indexes. Information Processing &#38; Management, 2016.","DOI":"10.1016\/j.ipm.2016.03.005"},{"key":"key-10.1145\/3041021.3054191-7","doi-asserted-by":"crossref","unstructured":"C. Dimopoulos, S. Nepomnyachiy, and T. Suel. Optimizing top-k document retrieval strategies for block-max indexes. In Proceedings of WSDM, pages 113--122. ACM, 2013.","DOI":"10.1145\/2433396.2433412"},{"key":"key-10.1145\/3041021.3054191-8","doi-asserted-by":"crossref","unstructured":"S. Ding and T. Suel. Faster top-k document retrieval using block-max indexes. In Proceedings of SIGIR, pages 993--1002. ACM, 2011.","DOI":"10.1145\/2009916.2010048"},{"key":"key-10.1145\/3041021.3054191-9","doi-asserted-by":"crossref","unstructured":"M. Fontoura, V. Josifovski, J. Liu, S. Venkatesan, X. Zhu, and J. Zien. Evaluation strategies for top-k queries over memory-resident inverted indexes. Proceedings of the VLDB Endowment, 4(12):1213--1224, 2011.","DOI":"10.14778\/3402755.3402756"},{"key":"key-10.1145\/3041021.3054191-10","doi-asserted-by":"crossref","unstructured":"I. Guy. Searching by talking: Analysis of voice queries on mobile web search. In Proceedings of SIGIR, pages 35--44. ACM, 2016.","DOI":"10.1145\/2911451.2911525"},{"key":"key-10.1145\/3041021.3054191-11","doi-asserted-by":"crossref","unstructured":"R. Konow and G. Navarro. Dual-sorted inverted lists in practice. In Proceedings of SPIRE, pages 295--306. Springer-Verlag, 2012.","DOI":"10.1007\/978-3-642-34109-0_31"},{"key":"key-10.1145\/3041021.3054191-12","doi-asserted-by":"crossref","unstructured":"R. Konow, G. Navarro, C. L. Clarke, and A. L&#243;pez-Ort&#237;z. Faster and smaller inverted indices with treaps. In Proceedings of SIGIR, pages 193--202. ACM, 2013.","DOI":"10.1145\/2484028.2484088"},{"key":"key-10.1145\/3041021.3054191-13","doi-asserted-by":"crossref","unstructured":"C. Macdonald, I. Ounis, and N. Tonellotto. Upper-bound approximations for dynamic pruning. ACM Trans. Inf. Syst., 29(4):17:1--17:28, Dec. 2011.","DOI":"10.1145\/2037661.2037662"},{"key":"key-10.1145\/3041021.3054191-14","doi-asserted-by":"crossref","unstructured":"A. Moffat and J. Zobel. Self-indexing inverted files for fast text retrieval. ACM Trans. Inf. Syst., 14(4):349--379, Oct. 1996.","DOI":"10.1145\/237496.237497"},{"key":"key-10.1145\/3041021.3054191-15","doi-asserted-by":"crossref","unstructured":"G. Navarro. Wavelet trees for all. Journal of Discrete Algorithms, 25:2--20, 2014.","DOI":"10.1016\/j.jda.2013.07.004"},{"key":"key-10.1145\/3041021.3054191-16","doi-asserted-by":"crossref","unstructured":"G. Ottaviano and R. Venturini. Partitioned elias-fano indexes. In Proceedings of SIGIR, pages 273--282. ACM, 2014.","DOI":"10.1145\/2600428.2609615"},{"key":"key-10.1145\/3041021.3054191-17","doi-asserted-by":"crossref","unstructured":"M. Persin. Document filtering for fast ranking. In Proceedings SIGIR, pages 339--348. ACM, 1994.","DOI":"10.1007\/978-1-4471-2099-5_35"},{"key":"key-10.1145\/3041021.3054191-18","doi-asserted-by":"crossref","unstructured":"M. Persin, J. Zobel, and R. Sacks-Davis. Filtered document retrieval with frequency-sorted indexes. Journal of the American Society for Information Science, 47(10):749--764, 1996.","DOI":"10.1002\/(SICI)1097-4571(199610)47:10<749::AID-ASI3>3.0.CO;2-2"},{"key":"key-10.1145\/3041021.3054191-19","doi-asserted-by":"crossref","unstructured":"M. Petri, J. S. Culpepper, and A. Moffat. Exploring the magic of WAND. In Proceedings of ADCS, pages 58--65. ACM, 2013.","DOI":"10.1145\/2537734.2537744"},{"key":"key-10.1145\/3041021.3054191-20","doi-asserted-by":"crossref","unstructured":"C. Rossi, E. S. de Moura, A. L. Carvalho, and A. S. da Silva. Fast document-at-a-time query processing using two-tier indexes. In Proceedings of SIGIR, pages 183--192. ACM, 2013.","DOI":"10.1145\/2484028.2484085"},{"key":"key-10.1145\/3041021.3054191-21","doi-asserted-by":"crossref","unstructured":"R. Seidel and C. R. Aragon. Randomized search trees. Algorithmica, 16(4--5):464--497, 1996.","DOI":"10.1007\/BF01940876"},{"key":"key-10.1145\/3041021.3054191-22","doi-asserted-by":"crossref","unstructured":"D. Shan, S. Ding, J. He, H. Yan, and X. Li. Optimized top-k processing with global page scores on block-max indexes. In Proceedings of WSDM, pages 423--432. ACM, 2012.","DOI":"10.1145\/2124295.2124346"},{"key":"key-10.1145\/3041021.3054191-23","doi-asserted-by":"crossref","unstructured":"T. Strohman, H. Turtle, and W. B. Croft. Optimization strategies for complex queries. In Proceedings of SIGIR, pages 219--225. ACM, 2005.","DOI":"10.1145\/1076034.1076074"},{"key":"key-10.1145\/3041021.3054191-24","doi-asserted-by":"crossref","unstructured":"J. Teevan, D. Ramage, and M. R. Morris.#twittersearch: A comparison of microblog search and web search. In Proceedings of WSDM, pages 35--44. ACM, 2011.","DOI":"10.1145\/1935826.1935842"},{"key":"key-10.1145\/3041021.3054191-25","doi-asserted-by":"crossref","unstructured":"H. Turtle and J. Flood. Query evaluation: Strategies and optimizations. Inf. Process. Manage., 31(6):831--850, Nov. 1995.","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"key-10.1145\/3041021.3054191-26","doi-asserted-by":"crossref","unstructured":"L. Wang, J. Lin, and D. Metzler. A cascade ranking model for efficient ranked retrieval. In Proceedings of SIGIR, pages 105--114. ACM, 2011.","DOI":"10.1145\/2009916.2009934"},{"key":"key-10.1145\/3041021.3054191-27","doi-asserted-by":"crossref","unstructured":"J. Zobel and A. Moffat. Inverted files for text search engines. ACM Comput. Surv., 38(2), July 2006.","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"the 26th International Conference","location":"Perth, Australia","acronym":"WWW '17 Companion","number":"26","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2017,4,3]]},"end":{"date-parts":[[2017,4,7]]}},"container-title":["Proceedings of the 26th International Conference on World Wide Web Companion - WWW '17 Companion"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3041021.3054191","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3054191&ftid=1865228&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:19Z","timestamp":1750215799000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3041021.3054191"}},"subtitle":[],"proceedings-subject":"World Wide Web Companion","short-title":[],"issued":{"date-parts":[[2017]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1145\/3041021.3054191","relation":{},"subject":[],"published":{"date-parts":[[2017]]}}}