Domination normal form: decomposing relational database schemas

  • Authors:
  • Henning Koehler

  • Affiliations:
  • Massey University, Palmerston North, New Zealand

  • Venue:
  • ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

A common approach in designing relational databases is to start with a universal relation schema, which is then decomposed into multiple subschemas. A good choice of subschemas can be determined using integrity constraints defined on the schema, such as functional, multivalued or join dependencies. In this paper we propose and analyze a new normal form based on the idea of minimizing overall storage space. This is in contrast to existing normal forms such as BCNF, 4NF or KCNF, which only characterize the absence of redundancy (and thus spaceminimality) for a single schema.