Query Rewriting Using Views in the Presence of Functional and Inclusion Dependencies

Abstract Query rewriting using views is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries, or queries answerable by other databases. The power of query rewriting can be considerably enhanced by taking into account integrity constraints that are known to hold on base relations. This paper describes an extension of query rewriting that utilizes inclusion dependencies to find rewritings of queries that would otherwise be overlooked. We describe a complete strategy for finding rewritings in the presence of inclusion dependencies and present a basic algorithm that implements that strategy. We also describe extensions to this algorithm when both inclusion and functional dependencies are considered.

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

[2]  Kyuseok Shim,et al.  Optimizing queries with materialized views , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[3]  David S. Johnson,et al.  Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies , 1984, J. Comput. Syst. Sci..

[4]  Joann J. Ordille,et al.  Query-Answering Algorithms for Information Agents , 1996, AAAI/IAAI, Vol. 1.

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

[6]  Alon Y. Halevy,et al.  Recursive Plans for Information Gathering , 1997, IJCAI.

[7]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

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

[9]  Ronald Fagin,et al.  Inclusion Dependencies and Their Interaction with Functional Dependencies , 1984, J. Comput. Syst. Sci..

[10]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

[11]  David Maier,et al.  The Theory of Relational Databases , 1983 .

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

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

[14]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[15]  Stavros S. Cosmadakis,et al.  Functional and inclusion dependencies a graph theoretic approach , 1984, PODS '84.

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

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

[18]  Moshe Y. Vardi,et al.  The Implication Problem for Functional and Inclusion Dependencies is Undecidable , 1985, SIAM J. Comput..

[19]  Moshe Y. Vardi,et al.  Unary inclusion dependencies have polynomial time inference problems , 1983, STOC '83.

[20]  Xiaolei Qian,et al.  Query folding , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

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