On Answering Queries in the Presence of Limited Access Patterns

In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relation in order to retrieve its tuples. In this paper we consider the following fundamental problem: can we compute the complete answer to a query by accessing the relations with legal patterns? The complete answer to a query is the answer that we could compute if we could retrieve all the tuples from the relations. We give algorithms for solving the problem for various classes of queries, including conjunctive queries, unions of conjunctive queries, and conjunctive queries with arithmetic comparisons. We prove the problem is undecidable for datalog queries. If the complete answer to a query cannot be computed, we often need to compute its maximal answer. The second problem we study is, given two conjunctive queries on relations with limited access patterns, how to test whether the maximal answer to the first query is contained in the maximal answer to the second one? We show this problem is decidable using the results of monadic programs.

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

[2]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[3]  Chen Li,et al.  Query Containment in the Presence of Limited Access Patterns , 1999 .

[4]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[5]  Jeffrey D. Ullman,et al.  Capability based mediation in TSIMMIS , 1998, SIGMOD '98.

[6]  Z. Meral Özsoyoglu,et al.  On Efficient Reasoning with Implication Constraints , 1993, DOOD.

[7]  Anthony C. Klug.  On conjunctive queries containing inequalities , 1988, JACM.

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

[9]  Surajit Chaudhuri,et al.  On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..

[10]  Alon Y. Halevy,et al.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB.

[11]  Ioana Manolescu,et al.  Query optimization in the presence of limited access patterns , 1999, SIGMOD '99.

[12]  Gio Wiederhold,et al.  Mediators in the architecture of future information systems , 1992, Computer.

[13]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

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

[15]  Jeffrey D. Ullman,et al.  Optimizing Large Join Queries in Mediation Systems , 1999, ICDT.

[16]  Diego Calvanese,et al.  Query Answering Using Views for Data Integration over the Web , 1999, WebDB.

[17]  Jeffrey D. Ullman,et al.  Computing capabilities of mediators , 1999, SIGMOD '99.

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

[19]  Edward Y. Chang,et al.  Query planning with limited source capabilities , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[20]  Chen Li,et al.  Computing complete answers to queries in the presence of limited access patterns , 2003, The VLDB Journal.

[21]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

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

[23]  Tova Milo,et al.  Using Schema Matching to Simplify Heterogeneous Data Translation , 1998, VLDB.

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

[25]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

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

[27]  Jennifer Widom,et al.  Constraint checking with partial information , 1994, PODS.

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

[29]  Michael R. Genesereth,et al.  Query planning in infomaster , 1997, SAC '97.

[30]  Oded Shmueli,et al.  Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..

[31]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

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