Computing complete answers to queries in the presence of limited access patterns

Abstract.In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attributes in order to retrieve data from a relation. As a consequence, we cannot retrieve all tuples from these relations. In this article we study the problem of computing the complete answer to a query, i.e., the answer that could be computed if all the tuples could be retrieved. A query is stable if for any instance of the relations in the query, its complete answer can be computed using the access patterns permitted by the relations. We study the problem of testing stability of various classes of queries, including conjunctive queries, unions of conjunctive queries, and conjunctive queries with arithmetic comparisons. We give algorithms and complexity results for these classes of queries. We show that stability of datalog programs is undecidable, and give a sufficient condition for stability of datalog queries. Finally, we study data-dependent computability of the complete answer to a nonstable query, and propose a decision tree for guiding the process to compute the complete answer.

[1]  David S. Johnson,et al.  Optimizing Conjunctive Queries that Contain Untyped Variables , 1983, SIAM J. Comput..

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

[3]  Yuri Gurevich,et al.  The complexity of query reliability , 1998, PODS.

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

[5]  S. B. Yao,et al.  Optimization Algorithms for Distributed Queries , 1986, IEEE Transactions on Software Engineering.

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

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

[8]  Chen Li,et al.  Answering queries using views with arithmetic comparisons , 2002, PODS '02.

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

[10]  Zoubida Kedad,et al.  Discovering view expressions from a multi-source information system , 1999, Proceedings Fourth IFCIS International Conference on Cooperative Information Systems. CoopIS 99 (Cat. No.PR00384).

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

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

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

[14]  Arun N. Swami,et al.  Optimization of large join queries , 1988, SIGMOD '88.

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

[16]  Alon Y. Levy.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB 1996.

[17]  Jennifer Widom,et al.  The TSIMMIS Project: Integration of Heterogeneous Information Sources , 1994, IPSJ.

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

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

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

[21]  Alberto O. Mendelzon,et al.  Querying partially sound and complete data sources , 2001, PODS '01.

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

[23]  Jeffrey D. Ullman,et al.  The complexity of ordering subgoals , 1988, PODS.

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

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

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

[27]  Edward Y. Chang,et al.  Answering queries with useful bindings , 2001, TODS.

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

[29]  Michael Kifer,et al.  On the Semantics of Rule-Based Expert Systems with Uncertainty , 1988, ICDT.

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

[31]  Tore Risch,et al.  Integrating Heterogenous Overlapping Databases through Object-Oriented Transformations , 1999, VLDB.

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

[33]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1979, TODS.

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

[35]  Zachary G. Ives,et al.  An adaptive query execution engine for data integration , 1999 .

[36]  Paolo Merialdo,et al.  The Araneus Web-based management system , 1998, SIGMOD '98.

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

[38]  Ling Liu,et al.  Accessing heterogeneous data through homogenization and integration mediators , 1997, Proceedings of CoopIS 97: 2nd IFCIS Conference on Cooperative Information Systems.

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

[40]  Alon Y. Halevy,et al.  Using Probabilistic Information in Data Integration , 1997, VLDB.

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

[42]  John Mylopoulos,et al.  Information services for the Web: building and maintaining domain models , 1998, Proceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122).

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

[44]  Yehoshua Sagiv.  On computing restricted projections of representative instances , 1985, PODS '85.

[45]  Guy M. Lohman,et al.  Measuring the Complexity of Join Enumeration in Query Optimization , 1990, VLDB.

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

[47]  Tiziana Catarci,et al.  Web-based information access , 1999, Proceedings Fourth IFCIS International Conference on Cooperative Information Systems. CoopIS 99 (Cat. No.PR00384).

[48]  Yannis E. Ioannidis.  A time bound on the materialization of some recursively defined views , 2005, Algorithmica.

[49]  Alon Y. Halevy,et al.  An adaptive query execution system for data integration , 1999, SIGMOD '99.

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

[51]  Calton Pu,et al.  XWRAP: an XML-enabled wrapper construction system for Web information sources , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[52]  David S. Warren.  A Logic Programming View of CLP , 1993 .

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

[54]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[55]  Laura M. Haas,et al.  Optimizing Queries Across Diverse Data Sources , 1997, VLDB.

[56]  Jeffrey F. Naughton,et al.  A decidable class of bounded recursions , 1987, PODS '87.

[57]  Katherine A. Morris,et al.  An algorithm for ordering subgoals in NAIL? , 1988, PODS.

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

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

[60]  Yatin P. Saraiya.  Subtree-elimination algorithms in deductive databases , 1991 .

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