The boyce-codd-heath normal form for SQL

Authors:
Flavio Ferrarotti;Sven Hartmann;Henning Köhler;Sebastian Link;Millist Vincent
Affiliations:
School of Information Management, Victoria University of Wellington, New Zealand;Institut für Informatik, Technische Universität Clausthal, Germany;School of Information Technology & Electrical Engineering, University of Queensland, Australia;School of Information Management, Victoria University of Wellington, New Zealand;School of Computer and Information Science, University of South Australia, Australia
Venue:
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Year:
2011

Citing 20
Cited 2

Incomplete Information in Relational Databases

Journal of the ACM (JACM)
Functional dependencies and constraints on Null values in database relations

Information and Control
A guide to the SQL standard

A guide to the SQL standard
New methods and fast algorithms for database normalization

ACM Transactions on Database Systems (TODS)
Tractable reasoning via approximation

Artificial Intelligence
Dependency preserving refinements and the fundamental problem of database design

Data & Knowledge Engineering - Special issue on ER '96
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic

Journal of the ACM (JACM)
On the Equivalence of Database Models

Journal of the ACM (JACM)
A relational model of data for large shared data banks

Communications of the ACM
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Synthesizing independent database schemas

SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
A normal form for XML documents

ACM Transactions on Database Systems (TODS)
Strong functional dependencies and their application to normal forms in XML

ACM Transactions on Database Systems (TODS)
An information-theoretic approach to normal forms for relational and XML data

Journal of the ACM (JACM)
Efficient reasoning about a robust XML key fragment

ACM Transactions on Database Systems (TODS)
Unacceptable file operations in a relational data base

SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
Numerical constraints on XML data

Information and Computation
When data dependencies over SQL tables meet the logics of paradox and S-3

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics

Information Processing Letters
Finding faithful boyce-codd normal form decompositions

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

BCNF via attribute splitting

Conceptual Modelling and Its Theoretical Foundations
The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations

ACM Transactions on Database Systems (TODS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd normal form, guarantees the elimination of data redundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints and functional dependencies is more expressive than the class of functional dependencies itself. Hence, the Boyce-Codd-Heath normal form is not suitable for SQL databases. We characterize the associated implication problem of the combined class in the presence of NOT NULL constraints axiomatically, algorithmically and logically. Based on these results we are able to establish a suitable normal form for SQL.