Answering queries with useful bindings

In information-integration systems, sources may have diverse and limited query capabilities. To obtain maximum information from these restrictive sources to answer a query, one can access sources that are not specified in the query (i.e., off-query sources). In this article, we propose a query-planning framework to answer queries in the presence of limited access patterns. In the framework, a query and source descriptions are translated to a recursive datalog program. We then solve optimization problems in this framework, including how to decide whether accessing off-query sources is necessary, how to choose useful sources for a query, and how to test query containment. We develop algorithms to solve these problems, and thus construct an efficient program to answer a query.

[1]  Jennifer Widom,et al.  Object exchange across heterogeneous information sources , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

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

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

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

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

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

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

[8]  Sophie Cluet,et al.  Your mediators need data conversion! , 1998, SIGMOD '98.

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

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

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

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

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

[14]  Vipul Kashyap,et al.  InfoSleuth: agent-based semantic integration of information in open and dynamic environments , 1997, SIGMOD '97.

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

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

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

[18]  Surajit Chaudhuri,et al.  On the Equivalence of Recursive and Nonrecursive Datalog Programs , 1997, J. Comput. Syst. Sci..

[19]  Gio Wiederhold,et al.  Abstraction of Representation for Interoperation , 1997, ISMIS.

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

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

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

[23]  Michael R. Genesereth,et al.  Infomaster: an information integration system , 1997, SIGMOD '97.

[24]  Vipul Kashyap,et al.  InfoSleuth: Semantic Integration of Information in Open and Dynamic Environments (Experience Paper) , 1997, SIGMOD Conference.

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

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

[27]  Hector Garcia-Molina,et al.  Template-based wrappers in the TSIMMIS system , 1997, SIGMOD '97.

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

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

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

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

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

[33]  Laura M. Haas,et al.  Towards heterogeneous multimedia information systems: the Garlic approach , 1995, Proceedings RIDE-DOM'95. Fifth International Workshop on Research Issues in Data Engineering-Distributed Object Management.

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

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

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

[37]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

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

[39]  Todd D. Millstein,et al.  Query containment for data integration systems , 2003, J. Comput. Syst. Sci..

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

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

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

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

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

[45]  Patrick Valduriez,et al.  Scaling Access to Heterogeneous Data Sources with DISCO , 1998, IEEE Trans. Knowl. Data Eng..