Abstract
Large search engines process thousands of queries per second over billions of documents, making a huge performance gap between disjunctive and conjunctive queries. An important class of optimization techniques called top-k processing is therefore used to narrow the gap. In this paper, we propose an aggressive algorithm based on the document-at-a-time (DAAT) MaxScore, aiming at further reducing the query latency of disjunctive queries. Essentially, our approach, named Aggressive MaxScore (AMaxScore), can speed up quickly by fine-tuning the initial top-k threshold, which allows a first aggressive process and then a supplementary process if not enough results are returned. Experiments with TREC GOV2 collection show that our approach reduces disjunctive query processing time by almost 15.4% on average over the state-of-the-art MaxScore baseline, while still returns the same results as the disjunctive evaluation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dean, J.: Challenges in building large-scale information retrieval systems: invited talk. In: Proceedings of the Second ACM International Conference on Web Search and Data Mining, p. 1. ACM (2009)
Turtle, H., Flood, J.: Query evaluation: strategies and optimizations. Information Processing & Management 31(6), 831–850 (1995)
Strohman, T., Turtle, H., Croft, W.B.: Optimization strategies for complex queries. In: Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 219–225. ACM (2005)
Jonassen, S., Bratsberg, S.E.: Efficient compressed inverted index skipping for disjunctive text-queries. In: Clough, P., Foley, C., Gurrin, C., Jones, G.J.F., Kraaij, W., Lee, H., Mudoch, V. (eds.) ECIR 2011. LNCS, vol. 6611, pp. 530–542. Springer, Heidelberg (2011)
Fontoura, M., Josifovski, V., Liu, J., Venkatesan, S., Zhu, X., Zien, J.: Evaluation strategies for top-k queries over memory-resident inverted indexes. In: Proceedings of the VLDB Endowment, vol. 4(12), pp. 1213–1224 (2011)
Brown, E.W.: Fast evaluation of structured queries for information retrieval. In: Proceedings of the 18th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 30–38. ACM (1995)
Rossi, C., de Moura, E.S., Carvalho, A.L., da Silva, A.S.: Fast document-at-a-time query processing using two-tier indexes. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 183–192. ACM (2013)
Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, pp. 426–434. ACM (2003)
Terrier, http://www.terrier.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Jiang, K., Song, X., Yang, Y. (2014). Faster MaxScore Document Retrieval with Aggressive Processing. In: Li, F., Li, G., Hwang, Sw., Yao, B., Zhang, Z. (eds) Web-Age Information Management. WAIM 2014. Lecture Notes in Computer Science, vol 8485. Springer, Cham. https://doi.org/10.1007/978-3-319-08010-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-08010-9_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08009-3
Online ISBN: 978-3-319-08010-9
eBook Packages: Computer ScienceComputer Science (R0)