Characterizations for functional dependency and Boyce-Codd normal form families
DOI10.1016/0304-3975(83)90019-1zbMATH Open0584.68096OpenAlexW2159869517MaRDI QIDQ1069712FDOQ1069712
Authors: 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
Recommendations
Information storage and retrieval of data (68P20) Data structures (68P05) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other classical set theory (including functions, relations, and set algebra) (03E20)
Cites Work
- Title not available (Why is that?)
- A relational model of data for large shared data banks
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Horn clauses and database dependencies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equivalences among Relational Expressions
- Functional Dependencies in a Relational Database and Propositional Logic
- Title not available (Why is that?)
- Equivalence of Relational Database Schemes
- Adequacy of decompositions of relational databases
- Properties of functional-dependency families
- Title not available (Why is that?)
- Calculating constraints on relational expression
Cited In (8)
- Database survivability under dynamic constraints
- On completing tables to satisfy functional dependencies
- On the expressive power of data dependencies
- Title not available (Why is that?)
- Order dependency in the relational model
- Non-finite specifiability of projections of functional dependency families
- Title not available (Why is that?)
- Family of functional dependencies and its equivalent descriptions
This page was built for publication: Characterizations for functional dependency and Boyce-Codd normal form families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069712)
