A new normal form for the design of relational database schemata

DOI10.1145/319732.319749zbMath0488.68061OpenAlexW2117671567MaRDI QIDQ3949993

Carlo Zaniolo

Publication date: 1982

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319732.319749

zbMATH Keywords

functional dependenciesthird normal formrelational data modeldatabase schema designBoyce- Codd normal form

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (8)

An algorithm for handling many relational calculus queries efficiently. ⋮ Insertion anomalies and the justification for 4NF in relational databases ⋮ Autonomous sets for the hypergraph of all canonical covers ⋮ Closure via functional dependence simplification ⋮ Unnamed Item ⋮ Autonomous Sets – A Method for Hypergraph Decomposition with Applications in Database Theory ⋮ Lossless Decompositions in Complex-Valued Databases ⋮ Equivalence of keyed relational schemas by conjunctive queries

This page was built for publication: A new normal form for the design of relational database schemata