Access the full text.
Sign up today, get DeepDyve free for 14 days.
Chen Li, E. Chang (2001)
Answering queries with useful bindingsACM Trans. Database Syst., 26
L. Haas, Donald Kossmann, E. Wimmers, Jun Yang (1997)
Optimizing Queries Across Diverse Data Sources
K. Morris (1988)
An algorithm for ordering subgoals in NAIL?
Chen Li, E. Chang (2000)
Query planning with limited source capabilitiesProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
Yatin Saraiya (1991)
Subtree-elimination algorithms in deductive databases
Xu-bo Zhang, Z. Ozsoyoglu (1993)
On Efficient Reasoning with Implication Constraints
Ling Liu, C. Pu, Wei Han (2000)
XWRAP: an XML-enabled wrapper construction system for Web information sourcesProceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)
S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, J. Widom (1994)
The TSIMMIS Project: Integration of Heterogeneous Information Sources
T. Catarci (1999)
Web-based information accessProceedings Fourth IFCIS International Conference on Cooperative Information Systems. CoopIS 99 (Cat. No.PR00384)
Y. Sagiv (1985)
On computing restricted projections of representative instances
The Internet Movie Database Ltd. Search Engine
J. Ullman (1988)
Principles of database and knowledge-base systems, Vol. I, 14
Oliver Duschka (1997)
Query planning and optimization in information integration
Alon Levy, A. Mendelzon, Y. Sagiv, D. Srivastava (1999)
Answering Queries Using Views.
A. Halevy, A. Rajaraman, J. Ordille (1996)
Querying Heterogeneous Information Sources Using Source Descriptions
Chen Li (1999)
Query Containment in the Presence of Limited Access Patterns
Anthony Klug (1988)
On conjunctive queries containing inequalitiesJ. ACM, 35
A. Rajaraman, Y. Sagiv, J. Ullman (1995)
Answering queries using templates with binding patterns (extended abstract)
(1996)
Xiaolei Qian. Query folding. International Conference on Data Engineering (ICDE), pages 48{55
A. Halevy, A. Mendelzon, Y. Sagiv, Divesh Srivastava (1995)
Answering queries using views (extended abstract)
J. Ullman (1979)
Principles Of Database And Knowledge-Base Systems
David Johnson, Anthony Klug (1983)
Optimizing Conjunctive Queries that Contain Untyped VariablesSIAM J. Comput., 12
G. Mecca, P. Atzeni, A. Masci, G. Sindoni, P. Merialdo (1998)
The Araneus Web-based management system, 27
J. Ullman, Moshe Vardi (1988)
The complexity of ordering subgoals
E. Grädel, Y. Gurevich, C. Hirsch (1998)
The complexity of query reliability
F. Afrati, Chen Li, P. Mitra (2002)
Answering queries using views with arithmetic comparisons
Xiaolei Qian (1996)
Query foldingProceedings of the Twelfth International Conference on Data Engineering
J. Naughton, Y. Sagiv (1987)
A decidable class of bounded recursions
Lingling Yan, M. Özsu, Ling Liu (1997)
Accessing heterogeneous data through homogenization and integration mediatorsProceedings of CoopIS 97: 2nd IFCIS Conference on Cooperative Information Systems
A. Aho, Y. Sagiv, J. Ullman (1978)
Efficient optimization of a class of relational expressionsProceedings of the 1978 ACM SIGMOD international conference on management of data
M. Kifer, Ai Li (1988)
On the Semantics of Rule-Based Expert Systems with Uncertainty
A. Mendelzon, G. Mihaila (2001)
Querying partially sound and complete data sources
Ramana Yerneni, Chen Li, H. Garcia-Molina, J. Ullman (1999)
Computing capabilities of mediators
Renée Miller (1998)
Using schematically heterogeneous structures
T. Milo, Sagit Zohar (1998)
Using Schema Matching to Simplify Heterogeneous Data Translation
A. Aho, Y. Sagiv, J. Ullman (1979)
Equivalences Among Relational ExpressionsSIAM J. Comput., 8
V. Josifovski, T. Risch (1999)
Integrating Heterogenous Overlapping Databases through Object-Oriented Transformations
Kiyoshi Ono, G. Lohman (1990)
Measuring the Complexity of Join Enumeration in Query Optimization
A. Gal, Scott Kerr, J. Mylopoulos (1998)
Information services for the Web: building and maintaining domain modelsProceedings. 3rd IFCIS International Conference on Cooperative Information Systems (Cat. No.98EX122)
Oliver Duschka, A. Halevy (1997)
Recursive Plans for Information Gathering
Chen Li, E. Chang (2001)
On Answering Queries in the Presence of Limited Access Patterns
T. Millstein, A. Halevy, Marc Friedman (2000)
Query containment for data integration systemsJ. Comput. Syst. Sci., 66
A. Gupta, Y. Sagiv, J. Ullman, J. Widom (1994)
Constraint checking with partial information
A. Swami (1988)
Optimization of large join queries
Chen Li, Ramana Yerneni, V. Vassalos, H. Garcia-Molina, Y. Papakonstantinou, J. Ullman, Murty Valiveti (1998)
Capability based mediation in TSIMMIS
G. Mecca, P. Atzeni, A. Masci, P. Merialdo, G. Sindoni (1998)
The Araneus Web-Base Management System
Y. Sagiv, M. Yannakakis (1980)
Equivalences Among Relational Expressions with the Union and Difference OperatorsJournal of the ACM (JACM), 27
Ramana Yerneni, Chen Li, J. Ullman, H. Garcia-Molina (1999)
Optimizing Large Join Queries in Mediation Systems
A. Chandra, P. Merlin (1977)
Optimal implementation of conjunctive queries in relational data bases
Z. Ives, D. Florescu, Marc Friedman, Alon Levy, Daniel Weld (1999)
An adaptive query execution engine for data integration
Michael Maher (1993)
A Logic Programming View of CLP
Z. Ives, D. Florescu, Marc Friedman, A. Halevy, Daniel Weld (1999)
An adaptive query execution system for data integration
P. Apers, A. Hevner, S. Yao (1986)
Optimization Algorithms for Distributed QueriesIEEE Transactions on Software Engineering, SE-9
J. Ullman (1988)
Principles of Database and Knowledge-Base Systems, Volume II, 14
Zoubida Kedad, M. Bouzeghoub (1999)
Discovering view expressions from a multi-source information systemProceedings Fourth IFCIS International Conference on Cooperative Information Systems. CoopIS 99 (Cat. No.PR00384)
Alon Levy (1996)
Obtaining Complete Answers from Incomplete Databases
Y. Ioannidis (1985)
A time bound on the materialization of some recursively defined viewsAlgorithmica, 1
D. Florescu, D. Koller, A. Halevy (1997)
Using Probabilistic Information in Data Integration
H. Gaifman, Harry Mairson, Y. Sagiv, Moshe Vardi (1993)
Undecidable optimization problems for database logic programsJ. ACM, 40
D. Florescu, A. Halevy, I. Manolescu, Dan Suciu (1999)
Query optimization in the presence of limited access patterns
O. Shmueli (1993)
Equivalence of DATALOG Queries is UndecidableJ. Log. Program., 15
A. Rajaraman, Y. Sagiv, J. Ullman (1995)
Answering Queries using Templates with Binding Patterns
S. Cosmadakis, H. Gaifman, P. Kanellakis, Moshe Vardi (1988)
Decidable optimization problems for database logic programs
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.
The VLDB Journal – Springer Journals
Published: Oct 1, 2003
Access the full text.
Sign up today, get DeepDyve free for 14 days.