Abstract
Query rewriting using views is a technique for answering a query that exploits a set of views instead of accessing the database relations directly. There are two categories of rewritings, i.e., equivalent rewritings using materialized views applied in query optimization, and maximally contained rewritings used mainly in data integration. Although maximally contained rewritings are acceptable in data integration, there are cases where an equivalent rewriting is desired. More importantly, the maximally contained rewriting is a union of contained queries, many of which are redundant. This paper gives an efficient algorithm to find a complete and equivalent rewriting that is a single conjunctive query. We prove that the algorithm is guaranteed to find all the complete and equivalent rewritings, and that the resulting rewriting is guaranteed to be an equivalent one without additional containment checking. We also show that our algorithm is much faster than others through complexity analysis and experimentation.
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
Chaudhuri, S., Krishnamurthy, R., Potamianos, S., Shim, K.: Optimizing queries with materialized views. In: ICDE 1995, pp. 190–200 (1995)
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the ninth annual ACM symposium on Theory of computing (STOC), pp. 77–90 (1977)
Chirkova, R., Li, C.: Materializing views with minimal size to answer queries. In: PODS 2003, pp. 38–48 (2003)
Florescu, D., Levy, A.Y., Suciu, D., Yagoub, K.: Optimization of run-time management of data intensive web-sites. In: VLDB, pp. 627–638 (1999)
Gou, G., Kormilitsin, M., Chirkova, R.: Query evaluation using overlapping views: completeness and efficiency. In: SIGMOD 2006, pp. 37–48 (2006)
Halvey, A.Y.: Answering queries using views: A survey. The VLDB Journal 10(4), 270–294 (2001)
Lau, T., Lu, J., Mylopoulos, J., Kontogiannis, K.: Migrating E-commerce Database Applications to an Enterprise Java Environment. In: Information Systems Frontiers, vol. 5(2). Kluwer Academic Publishers, Dordrecht (2003)
Levy, A.Y., Rajaraman, A., Ordille, J.J.: Querying heterogeneous information sources using source descriptions. In: VLDB 1996, pp. 251–262 (1996)
Lu, J.: Reengineering of database applications to EJB based architecture. In: Pidduck, A.B., Mylopoulos, J., Woo, C.C., Ozsu, M.T. (eds.) CAiSE 2002. LNCS, vol. 2348, p. 361. Springer, Heidelberg (2002)
Pottinger, R., Halevy, A.: Minicon: A scalable algorithm for answering queries using views. The VLDB Journal 10(2-3), 182–198 (2001)
Zaharioudakis, M., Cochrane, R., Lapis, G., Pirahesh, H., Urata, M.: Answering complex sql queries using automatic summary tables. In: SIGMOD 2000, pp. 105–116 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, J., Li, M., Mylopoulos, J., Cheung, K. (2009). Complete and Equivalent Query Rewriting Using Views. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, QM. (eds) Advances in Data and Web Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00672-2_64
Download citation
DOI: https://doi.org/10.1007/978-3-642-00672-2_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00671-5
Online ISBN: 978-3-642-00672-2
eBook Packages: Computer ScienceComputer Science (R0)