{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:50:43Z","timestamp":1767973843187,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T00:00:00Z","timestamp":1489363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T00:00:00Z","timestamp":1489363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Retrieval J"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10791-017-9298-6","type":"journal-article","created":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T13:01:09Z","timestamp":1489410069000},"page":"292-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Waves: a fast multi-tier top-k query processing algorithm"],"prefix":"10.1007","volume":"20","author":[{"given":"Caio Moura","family":"Daoud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edleno Silva","family":"de Moura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Fernandes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Altigran Soares","family":"da Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristian","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Carvalho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,13]]},"reference":[{"key":"9298_CR1","unstructured":"Akbarinia, R., Pacitti, E., & Valduriez, P. (2007). Best position algorithms for top-k queries. In Proceedings of the 33rd international conference on very large data bases, VLDB \u201907 (pp. 495\u2013506). VLDB Endowment. http:\/\/dl.acm.org\/citation.cfm?id=1325851.1325909."},{"key":"9298_CR2","doi-asserted-by":"crossref","unstructured":"Anh, V., & Moffat, A. (2006). Pruned query evaluation using pre-computed impacts. In: ACM SIGIR (pp. 372\u2013379).","DOI":"10.1145\/1148170.1148235"},{"key":"9298_CR3","doi-asserted-by":"crossref","unstructured":"Anh, V. N., de\u00a0Kretser, O., & Moffat, A. (2001). Vector-space ranking with effective early termination. In ACM SIGIR (pp. 35\u201342).","DOI":"10.1145\/383952.383957"},{"key":"9298_CR4","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"2011","unstructured":"Baeza-Yates, R., & Ribeiro-Neto, B. (2011). Modern information retrieval (2nd ed.). Reading: Addison-Wesley Publishing Company.","edition":"2"},{"key":"9298_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A. Z., Carmel, D., Herscovici, M., Soffer, A., & Zien, J. (2003). Efficient query evaluation using a two-level retrieval process. In ACM CIKM (pp. 426\u2013434).","DOI":"10.1145\/956863.956944"},{"key":"9298_CR6","doi-asserted-by":"crossref","unstructured":"Carmel, D., Cohen, D., Fagin, R., Farchi, E., Herscovici, M., Maarek, Y. S., et al. (2001). Static index pruning for information retrieval systems. In ACM SIGIR (pp. 43\u201350).","DOI":"10.1145\/383952.383958"},{"issue":"92","key":"9298_CR7","first-page":"1","volume":"55","author":"A Carvalho","year":"2012","unstructured":"Carvalho, A., Rossi, C., de Moura, E. S., Fernandes, D., & da Silva, A. S. (2012). LePrEF: Learn to pre-compute evidence fusion for efficient query evaluation. JASIST, 55(92), 1\u201328.","journal-title":"JASIST"},{"key":"9298_CR8","doi-asserted-by":"publisher","unstructured":"Chakrabarti, K., Chaudhuri, S., & Ganti, V. (2011). Interval-based pruning for top-k processing over compressed lists. In Proceedings of the 2011 IEEE 27th international conference on data engineering, ICDE \u201911 (pp. 709\u2013720). IEEE Computer Society, Washington, DC, USA. doi:10.1109\/ICDE.2011.5767855.","DOI":"10.1109\/ICDE.2011.5767855"},{"issue":"5","key":"9298_CR9","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.ipm.2016.03.005","volume":"52","author":"C Daoud","year":"2016","unstructured":"Daoud, C., de Moura, E. S., Fernandes, D., da Silva, A. S., Carvalho, A. L., & Rossi, C. (2016). Fast top-k preserving query processing using two-tier indexes. Information Processing & Management, 52(5), 855\u2013872.","journal-title":"Information Processing & Management"},{"key":"9298_CR10","doi-asserted-by":"crossref","unstructured":"Dimopoulos, C., Nepomnyachiy, S., & Suel, T. (2013). A candidate filtering mechanism for fast top-k query processing on modern cpus. In ACM SIGIR (pp. 723\u2013732).","DOI":"10.1145\/2484028.2484087"},{"key":"9298_CR11","doi-asserted-by":"crossref","unstructured":"Ding, S., & Suel, T. (2011). Faster top-k document retrieval using block-max indexes. In ACM SIGIR (pp. 993\u20131002).","DOI":"10.1145\/2009916.2010048"},{"issue":"12","key":"9298_CR12","first-page":"1213","volume":"4","author":"M Fontoura","year":"2011","unstructured":"Fontoura, M., Josifovski, V., Liu, J., Venkatesan, S., Zhu, X., & Zien, J. Y. (2011). Evaluation strategies for top-k queries over memory-resident inverted indexes. PVLDB, 4(12), 1213\u20131224.","journal-title":"PVLDB"},{"issue":"2","key":"9298_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ipm.2009.09.003","volume":"46","author":"MR Herrera","year":"2010","unstructured":"Herrera, M. R., de Moura, E. S., Cristo, M., Silva, T. P., & da Silva, A. S. (2010). Exploring features for the automatic identification of user goals in web search. Information Processing & Management, 46(2), 131\u2013142.","journal-title":"Information Processing & Management"},{"issue":"4","key":"9298_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/237496.237497","volume":"14","author":"A Moffat","year":"1996","unstructured":"Moffat, A., & Zobel, J. (1996). Self-indexing inverted files for fast text retrieval. ACM TOIS, 14(4), 349\u2013379. doi:10.1145\/237496.237497.","journal-title":"ACM TOIS"},{"issue":"2","key":"9298_CR15","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1344411.1344415","volume":"26","author":"ESd Moura","year":"2008","unstructured":"Moura, E Sd, Santos, C Fd, Araujo, Bd S, Silva, A Sd, Calado, P., Nascimento, M. A., et al. (2008). Locality-based pruning methods for web search. ACM Transactions on Information Systems (TOIS), 26(2), 9.","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"9298_CR16","doi-asserted-by":"crossref","unstructured":"Ntoulas, A., & Cho, J. (2007). Pruning policies for two-tiered inverted index with correctness guarantee. In ACM SIGIR (pp. 191\u2013198).","DOI":"10.1145\/1277741.1277776"},{"key":"9298_CR17","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., & Venturini, R. (2014). Partitioned Elias\u2013Fano indexes. In Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval (pp. 273\u2013282). ACM.","DOI":"10.1145\/2600428.2609615"},{"key":"9298_CR18","doi-asserted-by":"crossref","unstructured":"Risvik, K., Aasheim, Y., & Lidal, M. (2003). Multi-tier architecture for web search engines. In First Latin American web congress (pp. 132\u2013143).","DOI":"10.1109\/LAWEB.2003.1250291"},{"key":"9298_CR19","doi-asserted-by":"crossref","unstructured":"Robertson, S. E., & Walker, S. (1994). Some simple effective approximations to the 2-poisson model for probabilistic weighted retrieval. In ACM SIGIR (pp. 232\u2013241).","DOI":"10.1007\/978-1-4471-2099-5_24"},{"key":"9298_CR20","doi-asserted-by":"crossref","unstructured":"Rossi, C., de\u00a0Moura, E. S., Carvalho, A. L., & da\u00a0Silva, A. S. (2013). Fast document-at-a-time query processing using two-tier indexes. In ACM SIGIR (pp. 183\u2013192).","DOI":"10.1145\/2484028.2484085"},{"key":"9298_CR21","unstructured":"Salton, G., Wong, A., & Yang, C. S. (1974). A vector space model for automatic indexing. Tech. Rep., Ithaca, NY."},{"key":"9298_CR22","doi-asserted-by":"crossref","unstructured":"Shan, D., Ding, S., He, J., Yan, H., & Li, X. (2012). Optimized top-k processing with global page scores on block-max indexes. In WSDM (pp. 423\u2013432).","DOI":"10.1145\/2124295.2124346"},{"key":"9298_CR23","doi-asserted-by":"crossref","unstructured":"Silvestri, F. (2007). Sorting out the document identifier assignment problem. In European conference on information retrieval (pp. 101\u2013112). Springer.","DOI":"10.1007\/978-3-540-71496-5_12"},{"key":"9298_CR24","doi-asserted-by":"crossref","unstructured":"Skobeltsyn, G., Junqueira, F., Plachouras, V., & Baeza-Yates, R. (2008). ResIn: A combination of results caching and index pruning for high-performance web search engines. In ACM SIGIR (pp. 131\u2013138).","DOI":"10.1145\/1390334.1390359"},{"key":"9298_CR25","doi-asserted-by":"crossref","unstructured":"Strohman, T., & Croft, W. B. (2007). Efficient document retrieval in main memory. In ACM SIGIR (pp. 175\u2013182).","DOI":"10.1145\/1277741.1277774"},{"key":"9298_CR26","doi-asserted-by":"crossref","unstructured":"Zukowski, M., Heman, S., Nes, N., & Boncz, P. (2006). Super-scalar ram-cpu cache compression. In Proceedings of the 22nd international conference on data engineering, ICDE\u201906 pp. 59. IEEE Computer Society, Washington, DC, USA.","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Information Retrieval Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-017-9298-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-017-9298-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-017-9298-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:32:16Z","timestamp":1704205936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-017-9298-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,13]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9298"],"URL":"https:\/\/doi.org\/10.1007\/s10791-017-9298-6","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,13]]},"assertion":[{"value":"30 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}