Title
Lossless decompositions in complex-valued databases
Abstract
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.
Year
DOI
Venue
2008
10.1007/978-3-540-77684-0_22
FoIKS
Keywords
Field
DocType
finite domain,functional dependency,complex-valued data model,relational model state,multiset constructor,complex-valued databases,flat attribute,lossless decomposition,decomposing database schema,relational model,data model
Data mining,Relational database,Computer science,Multiset,Database schema,Theoretical computer science,Functional dependency,If and only if,Relational model,Data model,Database,Lossless compression
Conference
Volume
ISSN
ISBN
4932
0302-9743
3-540-77683-4
Citations 
PageRank 
References 
0
0.34
15
Authors
2
Name
Order
Citations
PageRank
Henning Koehler116716.06
Sebastian Link230719.17