SQL schema design: foundations, normal forms, and normalization
作者：
Highlights：
• Possible and certain functional dependencies are introduced and shown to provide right notions for SQL schema design.
• Axiomatic and linear-time algorithmic characterizations are proven for the associated implication problem.
• A Boyce–Codd normal form for SQL is defined and semantically justified in various ways.
• An algorithm is established for normalizing a given schema design into one compliant with the Boyce–Codd normal form for SQL.
• Extended experiments demonstrate the usefulness of our notions and techniques.
摘要
•Possible and certain functional dependencies are introduced and shown to provide right notions for SQL schema design.•Axiomatic and linear-time algorithmic characterizations are proven for the associated implication problem.•A Boyce–Codd normal form for SQL is defined and semantically justified in various ways.•An algorithm is established for normalizing a given schema design into one compliant with the Boyce–Codd normal form for SQL.•Extended experiments demonstrate the usefulness of our notions and techniques.
论文关键词：Axioms,Armstrong database,Boyce–Codd normal form,Database schema design,Data redundancy,Functional dependency,Normalization,Reasoning,Update anomaly
论文评审过程：Received 4 August 2017, Revised 3 December 2017, Accepted 2 April 2018, Available online 13 April 2018, Version of Record 25 May 2018.
论文官网地址：https://doi.org/10.1016/j.is.2018.04.001
