Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Rewriting Queries Using Views

Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1071

Definition

Given a query on a database schema and a set of views over the same schema, the problem of query rewriting is to find a way to answer the query using only the answers to the views. Rewriting algorithms aim at finding such rewritings efficiently, dealing with possible limited query-answering capabilities on the views, and producing rewritings that are efficient to execute.

Historical Background

Query rewriting is one of the oldest problems in data management. Earlier studies focused on improving performance of query evaluation [9], since using materialized views can save the execution cost of a query. In 1995, Levy et al. [10] formally studied the problem and developed complexity results. The problem became increasingly more important due to new applications such as data integration, in which views are used widely to describe the semantics of the data at different sources and queries posed on the global schema. Many algorithms have been developed, including the bucket...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Afrati FN, Li C, Mitra P. Answering Queries using views with arithmetic comparisons. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2002. p. 209–20.Google Scholar
  2. 2.
    Afrati F, Li C, Ullman JD. Generating efficient plans using views. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2001. p. 319–30.Google Scholar
  3. 3.
    Calvanese D, Giacomo GD, Lenzerini M, Vardi MY. View-based query processing: on the relationship between rewriting, answering and losslessness. In: Proceedings of the 10th International Conference on Database Theory; 2005. p. 321–36.Google Scholar
  4. 4.
    Chandra AK, Merlin PM. Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the 9th Annual ACM Symposium on Theory of Computing; 1977. p. 77–90.Google Scholar
  5. 5.
    Chaudhuri S, Krishnamurthy R, Potamianos S, Shim K. Optimizing queries with materialized views. In: Proceedings of the 11th International Conference on Data Engineering; 1995. p. 190–200.Google Scholar
  6. 6.
    Chirkova R, Li C. Materializing views with minimal size to answer queries. In: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2003. p. 38–48.Google Scholar
  7. 7.
    Duschka OM, Genesereth MR. Answering recursive queries using views. In: Proceedings of the ACM SIGACT-SIGOPS 16th Symposium on the Principles of Distributed Computing; 1997. p. 109–16.Google Scholar
  8. 8.
    Halevy AY. Answering queries using views: a survey. VLDB J. 2001;10(4):270–94.zbMATHCrossRefGoogle Scholar
  9. 9.
    Larson PÅ, Yang HZ. Computing queries from derived relations. In: Proceedings of the 11th International Conference on Very Large Data Bases; 1985. p. 259–69.Google Scholar
  10. 10.
    Levy A, Mendelzon AO, Sagiv Y, Srivastava D. Answering queries using views. In: Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1995. p. 95–104.Google Scholar
  11. 11.
    Levy A, Rajaraman A, Ordille JJ. Querying heterogeneous information sources using source descriptions. In: Proceedings of the 22th International Conference on Very Large Data Bases; 1996. p. 251–62.Google Scholar
  12. 12.
    Li C. Query processing and optimization in information-integration systems. Ph.D. Thesis, computer science department. Stanford University. 2001.Google Scholar
  13. 13.
    Mitra P. An algorithm for answering queries efficiently using views. In: Proceedings of the 12th Australasian Database Conference; 2001. p. 99–106.Google Scholar
  14. 14.
    Pottinger R, Levy A. A scalable algorithm for answering queries using views. In: Proceedings of the 26th International Conference on Very Large Data Bases; 2000.Google Scholar
  15. 15.
    Qian X. Query folding. In: Proceedings of the 12th International Conference on Data Engineering; 1996.p. 48–55.Google Scholar
  16. 16.
    Rajaraman A, Sagiv Y, Ullman JD. Answering queries using templates with binding patterns. In: Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1995. p. 105–12.Google Scholar
  17. 17.
    Theodoratos D, Sellis T. Data warehouse configuration. In: Proceedings of the 23th International Conference on Very Large Data Bases; 1997. p. 126–35.Google Scholar
  18. 18.
    Ullman JD. Information integration using logical views. In: Proceedings of the 6th International Conference on Database Theory; 1997. p. 19–40.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Chen Li
    • 1
  1. 1.University of California – Irvine, School of Information and Computer SciencesIrvineUSA