Lossless Decompositions in Complex-Valued Databases

DOI10.1007/978-3-540-77684-0_22zbMath1138.68394OpenAlexW1552979616WikidataQ62043135 ScholiaQ62043135MaRDI QIDQ5445309

Sebastian Link, Henning Koehler

Publication date: 4 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77684-0_22

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding implication for functional dependencies in complex-value databases
• Dependency-preserving normalization of relational and XML data
• Adequacy of decompositions of relational databases
• Testing for existence of a covering Boyce-Codd normal form
• Unique complements and decompositions of database schemata
• Characterization of desirable properties of general database decompositions.
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• An information-theoretic approach to normal forms for relational and XML data
• A new normal form for the design of relational database schemata
• Finding Faithful Boyce-Codd Normal Form Decompositions
• Foundations of Information and Knowledge Systems

This page was built for publication: Lossless Decompositions in Complex-Valued Databases