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.

Citations

995	Principles of Database and Knowledge-Base Systems, vol - Ullman - 1989
638	Querying heterogeneous information sources using source descriptions - Levy, Rajaraman, et al. - 1996
390	Answering queries using views - Levy, Mendelzon, et al. - 1995
382	Optimal Implementation of Conjunctive Queries in Relational Databases - Chandra, Merlin
241	Optimizing Queries across Diverse Data Sources - Haas, Kossmann, et al. - 1997
220	On the Power of Magic - Beeri, Ramakrishnan - 1991
180	Answering queries using templates with binding patterns - Rajaraman, Sagiv, et al. - 1995
126	On conjunctive queries containing inequalities - Klug - 1988
82	Recursive plans for information gathering - Duschka, Levy - 1997
78	Measuring the complexity of join enumeration in query optimization - Ono, Lohman - 1990
77	Query optimization in the presence of limited access patterns - Florescu, Manolescu, et al. - 1999
73	Equivalences among relational expressions - AHO, SAGIV, et al. - 1979
69	Undecidable optimization problems for database logic programs - Gaifman, Mairson, et al. - 1993
65	Widom J.: Constraint Checking with Partial Information - Gupta, Sagiv, et al. - 1994
62	Equivalence of datalog queries is undecidable - Shmueli - 1993
61	Query Planning and Optimization in Information Integration - Duschka - 1997
55	Optimization Algorithms for Distributed Queries - Apers, Hevner, et al. - 1983
54	Ullman: Efficient optimization of a class of relational expressions - Aho, Sagiv, et al. - 1979
45	Computing capabilities of mediators - Yerneni, Li, et al. - 1999
37	Optimizing large join queries in mediation systems - Yerneni, Li, et al. - 1999
29	Query planning with limited source capabilities - Li, Chang - 2000
22	and A.Klug. Optimizing Conjunctive Queries that Contain Untyped Variables - Johnson - 1983
21	A decidable class of bounded recursions - Naughton, Sagiv - 1987
19	Subtree elimination algorithms in deductive databases - Saraiya - 1991
18	An algorithm for ordering subgoals in nail - Morris - 1988
11	A time bound on the materialization of some recursively defined views - Ioannidis - 1985
11	The complexity of ordering subgoals - Ullman, Vardi - 1988
6	On computing restricted projections of representative instances - Sagiv - 1985
6	Swami and Anoop Gupta. Optimization of large join queries - Arun - 1988
3	The Internet Movie Database Ltd. Search Engine, http://www.imdb.com/search - IMDB