Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Functional dependencies and constraints on Null values in database relations
Information and Control
New methods and fast algorithms for database normalization
ACM Transactions on Database Systems (TODS)
On semantic issues connected with keys in relational databases permitting null values
Journal of Information Processing and Cybernetics
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Cardinality constraints in semantic data models
Data & Knowledge Engineering
Axiomatisation of functional dependencies in incomplete relations
Theoretical Computer Science
On the Equivalence of Database Models
Journal of the ACM (JACM)
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
Fundamentals of Cardinality Constraints
ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Semantic sampling of existing databases through informative Armstrong databases
Information Systems
Keys and Armstrong databases in trees with restructuring
Acta Cybernetica
Numerical constraints on XML data
Information and Computation
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
On Codd Families of Keys over Incomplete Relations
The Computer Journal
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Hi-index | 0.00 |
Data dependencies capture meaningful information about an application domain within the target database. The theory of data dependencies is largely a theory over relations. To make data processing more efficient in practice, partial bags are permitted as database instances to accommodate partial and duplicate information. However, data dependencies interact differently over partial bags than over the idealized special case of relations. In this paper, we study the implication problem of the combined class of functional dependencies and cardinality constraints over partial bags. We establish an axiomatic and an algorithmic characterization of the implication problem. These findings have important applications in database design and data processing. Finally, we investigate structural and computational properties of Armstrong databases for the class of data dependencies under consideration. These results can be utilized to consolidate and communicate the understanding of the application domain between different stake-holders of a database.