Abstract
In Search Computing, queries act over internet resources, and combine access to standard web services with exact results and to ranked search services. Such resources often provide limited statistical information that can be used to inform static query optimization, and correlations between the values and ranks associated with different resources may only become clear at query runtime. As a result, search computing seems likely to benefit from adaptive query processing, where information obtained during query evaluation is used to change the way in which a query is executing. This chapter provides a perspective on how run-time adaptivity can be achieved in the context of Search Computing.
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.
References
Avnur, R., Hellerstein, J.M.: Eddies: Continuously Adaptive Query Processing. In: SIGMOD Conference, pp. 261–272 (2000)
Shah, M.A., Hellerstein, J.M., Chandrasekaran, S., Franklin, M.J.: Flux: An Adaptive Partitioning Operator for Continuous Query Systems. In: ICDE, pp. 25–36 (2003)
Raman, V., Han, W., Narang, I.: Parallel querying with non-dedicated computers. In: Proc. VLDB, pp. 61–72 (2005)
Urhan, T., Franklin, M.J., Amsaleg, L.: Cost Based Query Scrambling for Initial Delays. In: SIGMOD Conference, pp. 130–141 (1998)
Gounaris, A., Paton, N., Fernandes, A., Sakellariou, R.: Self-monitoring query execution for adaptive query processing. Data Knowl. Eng. 51(3), 325–348 (2004)
Sutherland, T.M., Zhu, Y., Ding, L., Rundensteiner, E.A.: An adaptive multi-objective scheduling selection framework for continuous query processing. In: IDEAS, pp. 445–454 (2005)
Raman, V., Deshpande, A., Hellerstein, J.M.: Using State Modules for Adaptive Query Processing. In: Proc. ICDE, pp. 353–364 (2003)
Babu, S., Bizarro, P., DeWitt, D.: Proactive Re-Optimization. In: Proc. ACM SIGMOD, pp. 107–118 (2005)
Bizarro, P., Babu, S., DeWitt, D.J., Widom, J.: Content-based routing: Different plans for different data. In: VLDB, pp. 757–768 (2005)
Kabra, N., DeWitt, D.J.: Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans. In: SIGMOD Conference, pp. 106–117 (1998)
Markl, V., Raman, V., Simmen, D.E., Lohman, G.M., Pirahesh, H.: Robust Query Processing through Progressive Optimization. In: SIGMOD Conference, pp. 659–670 (2004)
Li, Q., Shao, M., Markl, V., Beyer, K., Colby, L., Lohman, G.: Adaptively Reordering Joins during Query Execution. In: Proc. ICDE, pp. 26–35 (2007)
Eurviriyanukul, K., Paton, N.W., Fernandes, A.A.A., Lynden, S.J.: Adaptive Join Processing in Pipelined Plans. In: Proc. EDBT, pp. 183–194 (2010)
Ives, Z., Halevy, A., Weld, D.: Adapting to Source Properties in Data Integration Queries. In: Proc. SIGMOD, pp. 395–406 (2004)
Bozzon, A., Brambilla, M., Ceri, S., Fraternali, P.: Exploring the Web with Search Computing. In: Ceri, S., Brambilla, M. (eds.) Search Computing II. LNCS, vol. 6585, pp. 10–25. Springer, Heidelberg (2011)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDB J. 13(3), 207–221 (2004)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K., Elmongui, H.G., Shah, R., Vitter, J.S.: Adaptive Rank-Aware Query Optimization in Relational Databases. ACM Trans. Database Syst. 31(4), 1257–1304 (2006)
Braga, D., Corcoglioniti, F., Grossniklaus, M., Vadacca, S.: Efficient Computation of Search Computing Queries. In: Ceri, S., Brambilla, M. (eds.) Search Computing II. LNCS, vol. 6585, pp. 141–155. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Braga, D., Grossniklaus, M., Paton, N.W. (2011). Run-Time Adaptivity for Search Computing. In: Ceri, S., Brambilla, M. (eds) Search Computing. Lecture Notes in Computer Science, vol 6585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19668-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-19668-3_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19667-6
Online ISBN: 978-3-642-19668-3
eBook Packages: Computer ScienceComputer Science (R0)