Encyclopedia of Database Systems

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

Answering Queries Using Views

  • Vasilis Vassalos
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_849

Synonyms

Rewriting Queries Using Views

Definition

Answering queries using views refers to a data management problem and the set of related techniques, algorithms and other results to address it. The basic formulation of the problem is the following: Given a query Q over a database schema Σ, expressed in a query language LQ and a set of views V1, V2,…,Vn over the same schema, expressed in a query language LV, is it possible to answer the query Q using (only) the views V1, V2,…,Vn?

The problem has a number of related formulations: What is the maximal set of tuples in the answer of Q that can be obtained from the views? If it is possible to access both the views and the database relations, what is the cheapest query execution plan for answering Q?

From the above, it is clear that this is more generally a family of problems. Problems of different complexity, often admitting different (or no) solutions and solution techniques, result from making choices about various “parameters” of the...

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

Recommended Reading

  1. 1.
    Abiteboul S, Duschka O. Complexity of answering queries using materialized views. In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1998. p. 254–63.Google Scholar
  2. 2.
    Cohen S, Nutt W, Sagiv Y. Containment of aggregate queries. In: Proceedings of the 9th International Conference on Database Theory; 2003. p. 111–25.Google Scholar
  3. 3.
    Deutsch A, Popa L, Tannen V. Query reformulation with constraints. ACM SIGMOD Rec. 2006;35(4)CrossRefGoogle Scholar
  4. 4.
    Duschka O, Geneserth M. Answering recursive queries using views. In: Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1997. p. 109–16.Google Scholar
  5. 5.
    Halevy A. Answering queries using views: a survey. VLDB J. 2001;10(4):270–94.zbMATHCrossRefGoogle Scholar
  6. 6.
    Lenzerini M. Data integration: a theoretical perspective. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 2002. p. 233–46.Google Scholar
  7. 7.
    Levy AY, 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
  8. 8.
    Lin V, Vassalos V, Malakasiotis P. MiniCount: efficient rewriting of COUNT-Queries using views. In: Proceedings of the 22nd International Conference on Data Engineering; 2006. p. 1.Google Scholar
  9. 9.
    Papakonstantinou Y, Vassalos V. Query Rewriting using semistructured views. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 1999. p. 455–66.Google Scholar
  10. 10.
    Pottinger R, Halevy A. Minicon: A scalable algorithm for answering queries using views. VLDB J. 2001;10(2–3):182–98.zbMATHGoogle Scholar
  11. 11.
    Xu A, Meral OZ. Rewriting XPath queries using materialized views. In: Proceedings of the 31st International Conference on Very Large Data Bases; 2005. p. 121–32.Google Scholar

Copyright information

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

Authors and Affiliations

  1. 1.Athens University of Economics and BusinessAthensGreece

Section editors and affiliations

  • Yannis Kotidis
    • 1
  1. 1.Computer Science Dept.Athens Univ. of Economics and BusinessAthensGreece