On the desirability of \(\gamma\)-acyclic BCNF database schemes

DOI10.1016/0304-3975(86)90012-5zbMath0658.68119OpenAlexW2111449598MaRDI QIDQ1111780

Héctor J. Hernández, Edward P. F. Chan

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90012-5

zbMATH Keywords

relational databasefunctional dependenciesquery processingupdatesgamma-acyclic Boyce-Codd normal form database schemes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items

Testing unboundedness of database schemes and functional dependencies, Succinct database schemes, On characterizing boundedness of database schemes with bounded dependencies, Independent database schemes under functional and inclusion dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent database schemas
• Candidate keys for relations
• Testing for existence of a covering Boyce-Codd normal form
• Degrees of acyclicity for hypergraphs and relational database schemes
• Database states and their tableaux
• On the foundations of the universal relation model
• Some Results on the Representative Instance in Relational Databases
• A Proof Procedure for Data Dependencies
• Testing satisfaction of functional dependencies
• A characterization of globally consistent databases and their correct access paths
• A relational model of data for large shared data banks