Theory of answering queries using views

The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a wide variety of data management problems, such as query optimization, the maintenance of physical data independence, data integration and data warehousing. This article surveys the theoretical issues concerning the problem of answering queries using views.

[1]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[2]  Yannis Papakonstantinou,et al.  Describing and Using Query Capabilities of Heterogeneous Sources , 1997, VLDB.

[3]  Anand Rajaraman,et al.  Conjunctive query containment revisited , 1997, Theor. Comput. Sci..

[4]  Hamid Pirahesh,et al.  Answering complex SQL queries using automatic summary tables , 2000, SIGMOD '00.

[5]  Werner Nutt,et al.  Rewriting aggregate queries using views , 1999, PODS.

[6]  Dan Suciu,et al.  Optimization of Run-time Management of Data Intensive Web-sites , 1999, VLDB.

[7]  Daniel S. Weld,et al.  Planning to gather inforrnation , 1996, AAAI 1996.

[8]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[9]  Maurizio Rafanelli,et al.  Querying aggregate data , 1999, PODS '99.

[10]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.

[11]  Joann J. Ordille,et al.  Querying Heterogeneous Information Sources Using Source Descriptions , 1996, VLDB.

[12]  Stéphane Grumbach,et al.  On the content of materialized aggregate views , 2000, PODS '00.

[13]  Jarek Gryz,et al.  Query folding with inclusion dependencies , 1998, Proceedings 14th International Conference on Data Engineering.

[14]  Manolis Gergatsoulis,et al.  Answering Queries Using Materialized Views with Disjunctions , 1999, ICDT.

[15]  Renée J. Miller.  Using schematically heterogeneous structures , 1998, SIGMOD '98.

[16]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[17]  Diego Calvanese,et al.  Answering regular path queries using views , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[18]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[19]  Alin Deutsch,et al.  Physical Data Independence, Constraints, and Optimization with Universal Plans , 1999, VLDB.

[20]  Mohamed Ziauddin,et al.  Materialized Views in Oracle , 1998, VLDB.

[21]  Michael R. Genesereth,et al.  Query planning and optimization in information integration , 1997 .

[22]  Yannis Papakonstantinou,et al.  Query rewriting for semistructured data , 1999, SIGMOD '99.

[23]  Alon Y. Halevy,et al.  Recursive Query Plans for Data Integration , 2000, J. Log. Program..

[24]  Alberto O. Mendelzon,et al.  Tableau Techniques for Querying Information Sources through Global Schemas , 1999, ICDT.

[25]  Jeffrey D. Ullman,et al.  Answering queries using limited external query processors (extended abstract) , 1996, PODS.

[26]  Diego Calvanese,et al.  Rewriting of regular expressions and regular path queries , 1999, PODS '99.

[27]  Diego Calvanese,et al.  Answering Queries Using Views in Description Logics , 1999, KRDB.

[28]  J W Ballard,et al.  Data on the web? , 1995, Science.

[29]  Per-Åke Larson,et al.  Query Transformation for PSJ-Queries , 1987, VLDB.

[30]  Michael R. Genesereth,et al.  Answering recursive queries using views , 1997, PODS '97.

[31]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[32]  Marvin H. Solomon,et al.  The GMAP: a versatile tool for physical data independence , 1996, The VLDB Journal.

[33]  Marc Friedman,et al.  Efficiently Executing Information-Gathering Plans , 1997, IJCAI.

[34]  Surajit Chaudhuri,et al.  Automated Selection of Materialized Views and Indexes in SQL Databases , 2000, VLDB.

[35]  Rada Chirkova,et al.  Linearly Bounded Reformulations of Conjunctive Databases , 2000, Computational Logic.

[36]  Alexander Borgida,et al.  Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..

[37]  Alon Y. Halevy,et al.  MiniCon: A scalable algorithm for answering queries using views , 2000, The VLDB Journal.

[38]  Jeffrey D. Ullman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.

[39]  Gao Jun,et al.  QUERY REWRITING FOR SEMI-STRUCTURED DATA , 2002 .

[40]  Daniel S. Weld,et al.  Planning to Gather Information , 1996, AAAI/IAAI, Vol. 1.

[41]  Diego Calvanese,et al.  View-based query processing for regular path queries with inverse , 2000, PODS '00.

[42]  Todd D. Millstein,et al.  Query containment for data integration systems , 2000, PODS '00.

[43]  Divesh Srivastava,et al.  Semantic Data Caching and Replacement , 1996, VLDB.

[44]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[45]  Anand Rajaraman,et al.  Answering Queries Using Limited External Processors. , 1996, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[46]  Subbarao Kambhampati,et al.  Optimizing Recursive Information-Gathering Plans , 1999, IJCAI.

[47]  Catriel Beeri,et al.  Rewriting queries using views in description logics , 1997, PODS '97.