Normal forms and syntactic completeness proofs for functional independencies

DOI10.1016/S0304-3975(00)00195-XzbMath0989.68037OpenAlexW1999046676MaRDI QIDQ5958763

Duminda Wijesekera, Anil Nerode, Jaideep Srivastava, Mahadevan Ganesh

Publication date: 3 March 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00195-x

zbMATH Keywords

data miningcompleteness proofsfunctional dependenciesintegrity constraints

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Proof methods for modal and intuitionistic logics
• On the complexity of inferring functional dependencies
• On the Structure of Armstrong Relations for Functional Dependencies
• Algorithms for inferring functional dependencies from relations
• Tableaux for functional dependencies and independencies
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Normal forms and syntactic completeness proofs for functional independencies