The implication problem for functional and inclusion dependencies
Information and Control
A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Two applications of equational theories to database theory
Proc. of the first international conference on Rewriting techniques and applications
Partition semantics for relations
Journal of Computer and System Sciences
Equational theories and database constraints
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A normal form for relational databases that is based on domains and keys
ACM Transactions on Database Systems (TODS)
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Extending the database relational model to capture more meaning
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
Journal of the ACM (JACM)
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
Journal of the ACM (JACM)
A Complete Axiomatization of Full Join Dependencies
Journal of the ACM (JACM)
Horn clauses and database dependencies
Journal of the ACM (JACM)
Database abstractions: aggregation
Communications of the ACM
A complete axiomatization for functional and multivalued dependencies in database relations
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Functional dependencies on cyclic database schemes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Towards a sound view integration methodology
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
The inference problem for template dependencies
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Unary inclusion dependencies have polynomial time inference problems
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A unified constraint model for XML
Proceedings of the 10th international conference on World Wide Web
On XML integrity constraints in the presence of DTDs
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On verifying consistency of XML specifications
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On XML integrity constraints in the presence of DTDs
Journal of the ACM (JACM)
Justification for Inclusion Dependency Normal Form
IEEE Transactions on Knowledge and Data Engineering
Decidability of First-Order Logic Queries over Views
ICDT '99 Proceedings of the 7th International Conference on Database Theory
An Equational Chase for Path-Conjunctive Queries, Constraints, and Views
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Reasoning in expressive description logics
Handbook of automated reasoning
Journal of Computer and System Sciences - Special issue on PODS 2000
The description logic handbook
Reasoning about Uniqueness Constraints in Object Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Algorithms for analysing related constraint business rules
Data & Knowledge Engineering
Improving quality in conceptual modeling
OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
The complexity of embedded axiomatization for a class of closed database views
Annals of Mathematics and Artificial Intelligence
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Description Logics, Data Modelling and Relational Dependencies
Proceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII
Discovering functional dependencies for multidimensional design
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
Logical queries over views: Decidability and expressiveness
ACM Transactions on Computational Logic (TOCL)
The complexity of finite model reasoning in description logics
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Finite model reasoning in DL-lite
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Journal of Computer and System Sciences
OCL-Lite: Finite reasoning on UML/OCL conceptual schemas
Data & Knowledge Engineering
Consistency of XML specifications
Inconsistency Tolerance
Information-based distance measures and the canonical reflection of view updates
Annals of Mathematics and Artificial Intelligence
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Extending inclusion dependencies with conditions
Theoretical Computer Science
Hi-index | 0.01 |
Unary inclusion dependencies are database constraints expressing subset relationships. The decidability of implication for these dependencies together with embedded implicational dependencies, such as functional dependencies, are investigated. As shown by Casanova et al., the unrestricted and finite implication problems are different for the class of functional and unary inclusion dependencies; also, for this class and for any fixed k, finite implication has no k-ary complete axiomatization. For both of these problems, complete axiomatizations and polynomial-time decision procedures are provided: linear time for unrestricted implication and cubic time for finite implication. It follows that functional and unary inclusion dependencies form a semantically natural class of first-order sentences with equality, which although not finitely controllable, is efficiently solvable and docile. Generalizing from these results, it is shown that the interaction between functionaland inclusion dependencies characterizes: (1) unrestricted implication of unary inclusion and all embedded implicational dependencies; (2) finite implication of unary inclusion and all full implicational dependencies; (3) finite implication of unary inclusion and all embedded tuple-generating dependencies. As a direct consequence of this analysis, most of the applications of dependency implication are extended, within polynomial-time, to database design problems involving unary inclusion dependencies. Such examples are tests for lossless joins and tests for complementarity of projective views. Finally, if one additionally requires that