Abstract
Recently, various algorithms were proposed to speed up top-k query answering by using multiple materialized query results. Nevertheless, for most of the proposed algorithms, a potentially costly view selection operation is required. In fact, the processing cost has been shown to be linear with respect to the number of views and can be exorbitant given the large number of views to be considered. In this paper, we address the problem of identifying the top-N promising views to use for top-k query answering in the presence of a collection of views. We propose a novel algorithm, called Top-N rewritings algorithm, for handling this problem, which aims to achieve significant reduction in query execution time. Indeed, it considers minimal amount of rewritings that are likely necessary to return the top-k tuples for a top-k query. We consider, also, the problem of how, efficiently, exploit the output of the Top-N rewritings algorithm to retrieve the top-k tuples through two possible solutions. The results of a thorough experimental study indicate that the proposed algorithm offers a robust solution to the problem of efficient top-k query answering using views since it discards non-promising query rewritings from the view selection process.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pottinger, R., Levy, A.Y.: A scalable algorithm for answering queries using views. In: VLDB, pp. 484–495, San Francisco, CA, USA (2000)
Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)
Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB Journal 13(1), 49–70 (2004)
Das, G., Gunopulos, D., Koudas, N., Tsirogiannis, D.: Answering top-k queries using views. In: VLDB, pp. 451–462 (2006)
Baikousi, E., Vassiliadis, P.: View usability and safety for the answering of top-k queries via materialized views. In: DOLAP, pp. 97–104 (2009)
Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: a system for the efficient execution of multi-parametric ranked queries. In: SIGMOD, pp. 259–270 (2001)
Xie, M., Lakshmanan, L.V.S., Wood, P.T.: Efficient top-k query answering using cached views. In: EDBT/ICDT, pp. 18–22 (2013)
Ryeng, N.H., Vlachou, A., Doulkeridis, C., Nørvåg, K.: Efficient distributed top-kquery processing with caching. In: DASFAA, pp. 280–295 (2011)
Baikousi, E., Vassiliadis, P.: View usability and safety for the answering of top-k queries via materialized views. In: DOLAP, pp. 97–104 (2009)
Bosc, P., Prade, H.: An Introduction to the Treatment of Flexible Queries and Uncertain or Imprecise Databases. In: Motro, A., Smets, P. (eds.) Uncertainty Management in Information Systems, pp. 285–324. Kluwer Academic Publishers, Dordrecht (1997)
Bosc, P., Hadjali, A., Jaudoin, H., Pivert, O.: Flexible querying of multiple data sources through fuzzy summaries. In: DEXA Workshop, pp.350–354 (2007)
HadjAli, A., Pivert, O.: Towards fuzzy query answering using fuzzy views – a graded-subsumption-based approach. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds.) Foundations of Intelligent Systems. LNCS (LNAI), vol. 4994, pp. 268–277. Springer, Heidelberg (2008)
Jaudoin, H., Pivert, O.: Rewriting fuzzy queries using imprecise views. In: Eder, J., Bielikova, M., Tjoa, A.M. (eds.) ADBIS 2011. LNCS, vol. 6909, pp. 257–270. Springer, Heidelberg (2011)
Jaudoin, H., Colomb, P., Pivert, O.: Ranking approximate query rewritings based on views. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds.) FQAS 2009. LNCS, vol. 5822, pp. 13–24. Springer, Heidelberg (2009)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS (2001)
Zhao, K., Tao, Y., Zhou, S.: Efficient top-k processing in large-scaled distributed environments. Data and Knowledge Engineering 63(2), 315–335 (2007)
Halevy, A.Y.: Answering queries using views: A survey. VLDB Journal 10(4), 270–294 (2001)
Guntzer, U.: Optimizing Multifeature Queries in Image Databases. VLDB Journal (2003)
Ramakrishna, M.V., Nepal, S.: Query processing issues in image (multimedia) databases. In: ICDE (1996)
Das, G., Gunopulos, D., Koudas, N., Sarkas, N.: Ad-hoc top-k query answering for data streams. In: VLDB, pp. 183–194 (2007)
Yu, A., Agarwal, P.K., Yang, J.: Processing a large number of continuous preference top-k queries. In: SIGMOD, pp. 397–408 (2012)
Baseball statistics. http://www.databaseBaseball.com
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Labbadi, W., Akaichi, J. (2016). A Scalable Algorithm for Answering Top-K Queries Using Cached Views. In: Andreasen, T., et al. Flexible Query Answering Systems 2015. Advances in Intelligent Systems and Computing, vol 400. Springer, Cham. https://doi.org/10.1007/978-3-319-26154-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-26154-6_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26153-9
Online ISBN: 978-3-319-26154-6
eBook Packages: Computer ScienceComputer Science (R0)