Interactions between dependencies and nested relational structures
Journal of Computer and System Sciences
Design of relational database schemes by deleting attributes in the canonical decomposition
Journal of Computer and System Sciences
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
Object normal forms and dependency constraints for object-oriented schemata
ACM Transactions on Database Systems (TODS)
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
Reasoning about nested functional dependencies
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Temporal FDs on complex objects
ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
Normalization and hierarchical dependencies in the relational data model
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases
ACM Transactions on Database Systems (TODS)
On Axiomatizing Multivalued Dependencies in Relational Databases
Journal of the ACM (JACM)
On the Equivalence of Database Models
Journal of the ACM (JACM)
A relational model of data for large shared data banks
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
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Analysis and design of relational schemata for database systems.
Analysis and design of relational schemata for database systems.
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Multi-valued dependencies in the presence of lists
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
On a problem of Fagin concerning multivalued dependencies in relational databases
Theoretical Computer Science
On the logical implication of multivalued dependencies with null values
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Multivalued dependencies in XML
BNCOD'03 Proceedings of the 20th British national conference on Databases
On multivalued dependencies in fixed and undetermined universes
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
On Inferences ofWeak Multivalued Dependencies
Fundamenta Informaticae
Spoilt for Choice: Full First-Order Hierarchical Decompositions
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Appropriate reasoning about data dependencies in fixed and undetermined universes
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Appropriate inferences of data dependencies in relational databases
Annals of Mathematics and Artificial Intelligence
On Inferences of Full First-Order Hierarchical Decompositions
Fundamenta Informaticae - Logic, Language, Information and Computation
On Inferences ofWeak Multivalued Dependencies
Fundamenta Informaticae
Hi-index | 0.00 |
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it is the natural join over at least two of its projections that all share the same join attributes. Therefore, FHDs generalise multivalued dependencies (MVDs) in which case the number of these projections is precisely two. The implication of FHDs has originally been defined in the context of some fixed finite universe. This paper identifies a sound and complete set of inference rules for the implication of FHDs. This axiomatisation is very reminiscent of that for MVDs. Then, an alternative notion of FHD implication is introduced in which the underlying set of attributes is left undetermined. The first main result establishes a finite axiomatisation for FHD implication in undetermined universes. It is then formally clarified that the complementation rule is only a mere means for database normalisation. In fact, the second main result establishes a finite axiomatisation for FHD implication in fixed universes which allows to infer FHDs either without using the complementation rule at all or only in the very last step of the inference. This also characterises the expressiveness of an incomplete set of inference rules in fixed universes. The results extend previous work on MVDs by Biskup.