Non-finite specifiability of projections of functional dependency families

DOI10.1016/0304-3975(85)90141-0zbMath0602.68096OpenAlexW2015923170MaRDI QIDQ1082095

Richard Hull

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90141-0

zbMATH Keywords

relational databasefunctional dependencyimplicational dependency

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (1)

Propagating XML constraints to relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Order dependency in the relational model
• Characterizations for functional dependency and Boyce-Codd normal form families
• On the Structure of Armstrong Relations for Functional Dependencies
• Finitely Specifiable Implicational Dependency Families
• A Proof Procedure for Data Dependencies
• Testing satisfaction of functional dependencies
• Properties of functional-dependency families
• Horn clauses and database dependencies
• Equivalences among Relational Expressions
• A relational model of data for large shared data banks

This page was built for publication: Non-finite specifiability of projections of functional dependency families