{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:18:32Z","timestamp":1775283512627,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642400469","type":"print"},{"value":"9783642400476","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_41","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T12:18:02Z","timestamp":1374322682000},"page":"394-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Efficient Parallel Block-Max WAND Algorithm"],"prefix":"10.1007","author":[{"given":"Oscar","family":"Rojas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronica","family":"Gil-Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Anh, V.N., Moffat, A.: Pruned query evaluation using pre-computed impacts. In: SIGIR, pp. 372\u2013379 (2006)","DOI":"10.1145\/1148170.1148235"},{"key":"41_CR2","unstructured":"Bast, H., Majumdar, D., Schenkel, R., Theobald, M., Weikum, G.: Io-top-k: Index-access optimized top-k query processing. In: VLDB, pp. 475\u2013486 (2006)"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Blanco, R., Barreiro, A.: Probabilistic static pruning of inverted files. ACM Trans. Inf. Syst.\u00a028(1) (2010)","DOI":"10.1145\/1658377.1658378"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.Y.: Efficient query evaluation using a two-level retrieval process. In: CIKM, pp. 426\u2013434 (2003)","DOI":"10.1145\/956863.956944"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Chakrabarti, K., Chaudhuri, S., Ganti, V.: Interval-based pruning for top-k processing over compressed lists. In: ICDE, pp. 709\u2013720 (2011)","DOI":"10.1109\/ICDE.2011.5767855"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-k document retrieval using block-max indexes. In: SIGIR, pp. 993\u20131002 (2011)","DOI":"10.1145\/2009916.2010048"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-28997-2_35","volume-title":"Advances in Information Retrieval","author":"S. Jonassen","year":"2012","unstructured":"Jonassen, S., Bratsberg, S.E.: Intra-query Concurrent Pipelined Processing for Distributed Full-Text Retrieval. In: Baeza-Yates, R., de Vries, A.P., Zaragoza, H., Cambazoglu, B.B., Murdock, V., Lempel, R., Silvestri, F. (eds.) ECIR 2012. LNCS, vol.\u00a07224, pp. 413\u2013425. Springer, Heidelberg (2012)"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Long, X., Suel, T.: Optimized query execution in large search engines with global page ordering. In: VLDB, pp. 129\u2013140 (2003)","DOI":"10.1016\/B978-012722442-8\/50020-3"},{"issue":"4","key":"41_CR9","first-page":"153","volume":"36","author":"M. Marin","year":"2010","unstructured":"Marin, M., Costa, V.G.: Sync\/async parallel search for the efficient design and construction of web search engines. PARCO\u00a036(4), 153\u2013168 (2010)","journal-title":"PARCO"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Strohman, T., Turtle, H.R., Croft, W.B.: Optimization strategies for complex queries. In: SIGIR, pp. 219\u2013225 (2005)","DOI":"10.1145\/1076034.1076074"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Cambazoglu, B., Junqueira, F.: Posting list intersection on multicore architectures. In: SIGIR (2011)","DOI":"10.1145\/2009916.2010045"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: WWW, pp. 401\u2013410 (2009)","DOI":"10.1145\/1526709.1526764"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:06:07Z","timestamp":1587344767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}