The design of relational databases
The design of relational databases
Semantics for null extended nested relations
ACM Transactions on Database Systems (TODS)
Unique complements and decompositions of database schemata
Journal of Computer and System Sciences
A new normal form for the design of relational database schemata
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
An information-theoretic approach to normal forms for relational and XML data
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theory of Relational Databases
Theory of Relational Databases
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Theoretical Computer Science - Logic, language, information and computation
Deciding implication for functional dependencies in complex-value databases
Theoretical Computer Science - Logic, language, information and computation
Dependency-preserving normalization of relational and XML data
Journal of Computer and System Sciences
Finding faithful boyce-codd normal form decompositions
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
The nested list normal form for functional and multivalued dependencies
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model states that a functional dependency preserving decomposition is lossless if and only if it contains a key. We will show that this result does not always hold when domains are allowed to be finite, but provide conditions under which it can be preserved. We then extend our work to a complex-valued data model based on record, list, set and multiset constructor, where finite domains occur naturally for subattributes, even if the domains of flat attributes are infinite.