{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:16:47Z","timestamp":1784179007699,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,7]],"date-time":"2017-08-07T00:00:00Z","timestamp":1502064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EU H2020 Program","award":["654024"],"award-info":[{"award-number":["654024"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,7]]},"DOI":"10.1145\/3077136.3080780","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T19:35:01Z","timestamp":1501270501000},"page":"625-634","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Faster BlockMax WAND with Variable-sized Blocks"],"prefix":"10.1145","author":[{"given":"Antonio","family":"Mallia","sequence":"first","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Ottaviano","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elia","family":"Porciani","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicola","family":"Tonellotto","sequence":"additional","affiliation":[{"name":"ISTI-CNR, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rossano","family":"Venturini","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574380"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Vo Ngoc Anh Owen de Kretser and Alistair Moffat. 2001. Vector-space ranking with effective early termination SIGIR. 35--42. Vo Ngoc Anh Owen de Kretser and Alistair Moffat. 2001. Vector-space ranking with effective early termination SIGIR. 35--42.","DOI":"10.1145\/383952.383957"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Nima Asadi and Jimmy Lin 2013. Effectiveness\/Efficiency Tradeoffs for Candidate Generation in Multi-stage Retrieval Architectures. In SIGIR. 997--1000. Nima Asadi and Jimmy Lin 2013. Effectiveness\/Efficiency Tradeoffs for Candidate Generation in Multi-stage Retrieval Architectures. In SIGIR. 997--1000.","DOI":"10.1145\/2484028.2484132"},{"key":"e_1_3_2_1_4_1","volume-title":"Zien","author":"Broder Andrei Z.","year":"2003"},{"key":"e_1_3_2_1_5_1","volume-title":"Cormack","author":"B\u00fcttcher Stefan","year":"2010"},{"key":"e_1_3_2_1_6_1","volume-title":"Clarke","author":"B\u00fcttcher Stefan","year":"2007"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Kaushik Chakrabarti Surajit Chaudhuri and Venkatesh Ganti 2011. Interval-based Pruning for Top-k Processing over Compressed Lists ICDE. 709--720. Kaushik Chakrabarti Surajit Chaudhuri and Venkatesh Ganti 2011. Interval-based Pruning for Top-k Processing over Compressed Lists ICDE. 709--720.","DOI":"10.1109\/ICDE.2011.5767855"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Jeffrey Dean. 2009. Challenges in building large-scale information retrieval systems: invited talk WSDM. Jeffrey Dean. 2009. Challenges in building large-scale information retrieval systems: invited talk WSDM.","DOI":"10.1145\/1498759.1498761"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Constantinos Dimopoulos Sergey Nepomnyachiy and Torsten Suel. 2013. Optimizing Top-k Document Retrieval Strategies for Block-max Indexes WSDM. 113--122. Constantinos Dimopoulos Sergey Nepomnyachiy and Torsten Suel. 2013. Optimizing Top-k Document Retrieval Strategies for Block-max Indexes WSDM. 113--122.","DOI":"10.1145\/2433396.2433412"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Shuai Ding and Torsten Suel 2011. Faster top-k document retrieval using block-max indexes SIGIR. 993--1002. Shuai Ding and Torsten Suel 2011. Faster top-k document retrieval using block-max indexes SIGIR. 993--1002.","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321820"},{"key":"e_1_3_2_1_12_1","volume-title":"On the number of bits required to implement an associative memory. Memorandum 61","author":"Fano Robert M.","year":"1971"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.115"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9437-6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132873"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646101"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2203"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2037661.2037662"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45253-2_30"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-006-9014-4"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685297"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609615"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.4630270302"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-959-0"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124346"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71496-5_12"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Fabrizio Silvestri and Rossano Venturini 2010. VSEncoding: Efficient Coding and Fast Decoding of Integer Lists via Dynamic Programming CIKM. 35--42. Fabrizio Silvestri and Rossano Venturini 2010. VSEncoding: Efficient Coding and Fast Decoding of Integer Lists via Dynamic Programming CIKM. 35--42.","DOI":"10.1145\/1871437.1871592"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Nicola Tonellotto Craig Macdonald and Iadh Ounis. 2013. Efficient and Effective Retrieval Using Selective Pruning WSDM. 63--72. Nicola Tonellotto Craig Macdonald and Iadh Ounis. 2013. Efficient and Effective Retrieval Using Selective Pruning WSDM. 63--72.","DOI":"10.1145\/2433396.2433407"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(95)00020-H"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433409"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"SIGIR '17: The 40th International ACM SIGIR conference on research and development in Information Retrieval","location":"Shinjuku Tokyo Japan","acronym":"SIGIR '17","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080780","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3077136.3080780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T18:42:10Z","timestamp":1750790530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3077136.3080780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,7]]},"references-count":32,"alternative-id":["10.1145\/3077136.3080780","10.1145\/3077136"],"URL":"https:\/\/doi.org\/10.1145\/3077136.3080780","relation":{},"subject":[],"published":{"date-parts":[[2017,8,7]]},"assertion":[{"value":"2017-08-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}