Deciding implication for functional dependencies in complex-value databases

DOI10.1016/j.tcs.2006.08.005zbMath1110.68034OpenAlexW2044738440MaRDI QIDQ860838

Sebastian Link, Sven Hartmann

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.005

zbMATH Keywords

complexitycorrectnessfunctional dependencydatabasesimplication problemdata typesBrouwerian algebra

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (4)

ON THE IMPLICATION OF MULTIVALUED DEPENDENCIES IN PARTIAL DATABASE RELATIONS ⋮ Ideal non-deterministic operators as a formal framework to reduce the key finding problem ⋮ Characterising nested database dependencies by fragments of propositional logic ⋮ Lossless Decompositions in Complex-Valued Databases

Cites Work

• Fundamental properties of infinite trees
• The relational model with relation-valued attributes
• The chemical abstract machine
• Semantics in databases
• Integrity constraints for XML
• Advances in databases and information systems. 7th East European conference, ADBIS 2003, Dresden, Germany, September 3--6, 2003. Proceedings
• The nested universal relation database model
• Insertion anomalies and the justification for 4NF in relational databases
• On the implication problem for cardinality constraints and functional dependencies
• Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
• Functional and multivalued dependencies in nested databases generated by record and list constructor
• The algebra of topology
• On closed elements in closure algebras
• Decomposing relationship types by pivoting and schema equivalence
• On XML integrity constraints in the presence of DTDs
• On the menbership problem for functional and multivalued dependencies in relational databases
• A normal form for relational databases that is based on domains and keys
• Minimum Covers in Relational Database Model
• Equivalence of Relational Database Schemes
• REDUNDANCY AND THE JUSTIFICATION FOR FOURTH NORMAL FORM IN RELATIONAL DATABASES
• On Functional Dependencies in Advanced Data Models
• Foundations of Information and Knowledge Systems
• Foundations of Information and Knowledge Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Deciding implication for functional dependencies in complex-value databases