A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Database abstractions: aggregation
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Design of relational views over network schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Inclusion dependencies and their interaction with functional dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Entity-Relationship Views over Uninterpreted Enterprise Schemas
Proceedings of the 1st International Conference on the Entity-Relationship Approach to Systems Analysis and Design
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Containment of conjunctive queries: beyond relations as sets
ACM Transactions on Database Systems (TODS)
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
The implication problem for inclusion dependencies: a graph approach
ACM SIGMOD Record
Towards Intelligent Semantic Caching for Web Sources
Journal of Intelligent Information Systems
Functional dependencies on cyclic database schemes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Functional and inclusion dependencies a graph theoretic approach
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and the universal instance
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inference rules for functional and inclusion dependencies
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Inclusion dependencies and their interaction with functional dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An optimizing prolog front-end to a relational query system
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
ACM SIGMOD Record
IEEE Transactions on Knowledge and Data Engineering
LAURA: A Formal Data Model and her Logical Design Methodology
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Join minimization in XML-to-SQL translation: an algebraic approach
ACM SIGMOD Record
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient XML-to-SQL query translation: where to add the intelligence?
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Mining frequent conjunctive queries in star schemas
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
On chase termination beyond stratification
Proceedings of the VLDB Endowment
Semantic query optimization in the presence of types
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the termination of the chase algorithm
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Computing universal models under guarded TGDs
Proceedings of the 15th International Conference on Database Theory
Extending decidable existential rules by joining acyclicity and guardedness
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
| Hi-index | 0.00 |
We consider the problem of optimizing conjunctive queries in the presence of inclusion and functional dependencies. We show that the problem of containment (and hence those of equivalence and non-minimality) is in NP when either (a) there are no functional dependencies or (b) the set of dependencies is what we call key-based. These results assume that infinite databases are allowed. If only finite databases are allowed, new containments may arise, as we illustrate by an example. We also prove a "compactness" theorem that shows that no such examples can exist for case (b).