View-based query containment

Query containment is the problem of checking whether for all databases the answer to a query is a subset of the answer to a second query. In several data management tasks, such as data integration, mobile computing, etc., the data of interest are only accessible through a given set of views. In this case, containment of queries should be determined relative to the set of views, as already noted in the literature. Such a form of containment, which we call view-based query containment, is the subject of this paper. The problem comes in various forms, depending on whether each of the two queries is expressed over the base alphabet or the alphabet of the view names. We present a thorough analysis of view-based query containment, by discussing all possible combinations from a semantic point of view, and by showing their mutual relationships. In particular, for the two settings of conjunctive queries and two-way regular path queries, we provide both techniques and complexity bounds for the different variants of the problem. Finally, we study the relationship between view-based query containment and view-based query rewriting.

[1]  Diego Calvanese,et al.  Representing and Reasoning on XML Documents: A Description Logic Approach , 1999, J. Log. Comput..

[2]  Yehoshua Sagiv,et al.  Semantic query optimization in Datalog programs (extended abstract) , 1995, ILPS Workshop: Constraints and Databases.

[3]  Dan Suciu,et al.  Verifying Integrity Constraints on Web Sites , 1999, IJCAI.

[4]  Dan Suciu,et al.  Index Structures for Path Expressions , 1999, ICDT.

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

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

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

[8]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[9]  SuciuDan,et al.  A query language and optimization techniques for unstructured data , 1996 .

[10]  Amihai Motro.  Panorama: A database system that annotates its answers to queries with their properties , 2004, Journal of Intelligent Information Systems.

[11]  Y VardiMoshe,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction , 1999 .

[12]  K. Selçuk Candan,et al.  Query caching and optimization in distributed mediator systems , 1996, SIGMOD '96.

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

[14]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[15]  Alon Y. Halevy,et al.  Semantic query optimization in Datalog programs (extended abstract) , 1995, PODS '95.

[16]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

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

[18]  Serge Abiteboul,et al.  Querying Semi-Structured Data , 1997, Encyclopedia of Database Systems.

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

[20]  Edward Y. Chang,et al.  On Answering Queries in the Presence of Limited Access Patterns , 2001, ICDT.

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

[22]  Serge Abiteboul,et al.  Regular Path Queries with Constraints , 1999, J. Comput. Syst. Sci..

[23]  Harry R. Lewis,et al.  Complexity of solvable cases of the decision problem for the predicate calculus , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[24]  Peter Buneman,et al.  Semistructured data , 1997, PODS.

[25]  Jeffrey D. Ullman,et al.  Generalizing Conjunctive Query Containment for View Maintenance and Integrity Constraint Verification (Abstract) , 1992, Workshop on Deductive Databases, JICSLP.

[26]  Alon Y. Halevy,et al.  Verification of Knowledge Bases: a Unifying Logical View , 1997, EUROVAV.

[27]  Diego Calvanese,et al.  View-based query processing and constraint satisfaction , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[28]  Moshe Y. Vardi.  A Note on the Reduction of Two-Way Automata to One-Way Automata , 1989, Inf. Process. Lett..

[29]  Todd D. Millstein,et al.  Navigational Plans For Data Integration , 1999, AAAI/IAAI.

[30]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[31]  Diego Calvanese,et al.  Description Logic Framework for Information Integration , 1998, KR.

[32]  Diego Calvanese,et al.  Lossless regular views , 2002, PODS.

[33]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[34]  Alberto O. Mendelzon,et al.  Database techniques for the World-Wide Web: a survey , 1998, SGMD.

[35]  Nicolás Marín,et al.  Review of Data on the Web: from relational to semistructured data and XML by Serge Abiteboul, Peter Buneman, and Dan Suciu. Morgan Kaufmann 1999. , 2003, SGMD.

[36]  Diego Calvanese,et al.  View-Based Query Answering and Query Containment over Semistructured Data , 2001, DBPL.

[37]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

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

[39]  Diego Calvanese,et al.  Query processing using views for regular path queries with inverse , 2000, PODS 2000.