Characterizations for functional dependency and Boyce-Codd normal form families

DOI10.1016/0304-3975(83)90019-1zbMath0584.68096MaRDI QIDQ1069712

Seymour Ginsburg, Richard Hull

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90019-1

zbMATH Keywords

relational database; relational algebra

Mathematics Subject Classification ID

68P05: Data structures

68P20: Information storage and retrieval of data

03E20: Other classical set theory (including functions, relations, and set algebra)

03D60: Computability and recursion theory on ordinals, admissible sets, etc.

Related Items

On completing tables to satisfy functional dependencies, Order dependency in the relational model, Non-finite specifiability of projections of functional dependency families, Database survivability under dynamic constraints, On the expressive power of data dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adequacy of decompositions of relational databases
• Calculating constraints on relational expression
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Equivalence of Relational Database Schemes
• Properties of functional-dependency families
• Horn clauses and database dependencies
• Functional Dependencies in a Relational Database and Propositional Logic
• Equivalences among Relational Expressions
• A relational model of data for large shared data banks