PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalence of datalog queries is undecidable
Journal of Logic Programming
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Capability based mediation in TSIMMIS
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Query optimization in the presence of limited access patterns
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Computing capabilities of mediators
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Optimizing Large Join Queries in Mediation Systems
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Answering Queries Using Materialized Views with Disjunctions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Using Schema Matching to Simplify Heterogeneous Data Translation
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Query Planning with Limited Source Capabilities
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Query planning and optimization in information integration
Query planning and optimization in information integration
Description Logics for Information Integration
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Conjunctive Query Containment under Access Limitations
ER '08 Proceedings of the 27th International Conference on Conceptual Modeling
Determining relevance of accesses at runtime
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
View-based query answering in Description Logics: Semantics and complexity
Journal of Computer and System Sciences
Rewriting queries using views with access patterns under integrity constraints
ICDT'05 Proceedings of the 10th international conference on Database Theory
Hi-index | 0.00 |
Abstract. 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.