Characterizations for functional dependency and Boyce-Codd normal form families

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

Richard Hull, Seymour Ginsburg

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 databaserelational algebra

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Other classical set theory (including functions, relations, and set algebra) (03E20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

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

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