Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Relational database systems
Functional dependencies and constraints on Null values in database relations
Information and Control
Reasoning about functional dependencies generalized for semantic data models
ACM Transactions on Database Systems (TODS)
The practical need for fourth normal form
SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
Tractable reasoning via approximation
Artificial Intelligence
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
Database design for incomplete relations
ACM Transactions on Database Systems (TODS)
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)
Extending the database relational model to capture more meaning
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 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
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Closed World Databases Opened Through Null Values
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
A normal form for XML documents
ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML
ACM Transactions on Database Systems (TODS)
A consideration on normal form of not-necessarily-normalized relation in the relational data model
VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
On Keys and Functional Dependencies as First-Class Citizens in Description Logics
Journal of Automated Reasoning
Semantics in Data and Knowledge Bases
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
Numerical constraints on XML data
Information and Computation
Consistency enforcement in databases
Proceedings of the 2nd international conference on Semantics in databases
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
When data dependencies over SQL tables meet the logics of paradox and S-3
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database 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
Reasoning about functional and full hierarchical dependencies over partial relations
Information Sciences: an International Journal
Hi-index | 0.00 |
Recently, an axiomatization for functional dependencies (FDs) and multivalued dependencies (MVDs) has been established where arbitrary attributes can be specified as NOT NULL. That is, the information stored over such attributes must not be incomplete. The axiomatization subsumes previous axiomatizations of FDs and MVDs where every attribute is declared to be NOT NULL, and where no attribute is declared to be NOT NULL. We establish axiomatizations which underpin formally the intuition that the complementation rule is a mere means of database normalization. The results unburden the existing theory of the strong assumption that all attributes are known at the time when the dependencies are specified. The findings extend and unify previous results for the special cases above.