A pegging method for decomposing relations in databases

Authors:
C. Alec Chang;Michael S. Leonard;H. Brian Hwarng;Tzong-Huie Shiau
Affiliations:
113 Electrical Engineering Building, University of Missouri-Columbia, Columbia, MO;113 Electrical Engineering Building, University of Missouri-Columbia, Columbia, MO;113 Electrical Engineering Building, University of Missouri-Columbia, Columbia, MO;113 Electrical Engineering Building, University of Missouri-Columbia, Columbia, MO
Venue:
CSC '87 Proceedings of the 15th annual conference on Computer Science
Year:
1987

Citing 9
Cited 0

An introduction to database systems: vol. I (4th ed.)

An introduction to database systems: vol. I (4th ed.)
On the design of relational database schemata

ACM Transactions on Database Systems (TODS)
Hierarchical schemata for relational databases

ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies

ACM Transactions on Database Systems (TODS)
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
Principles of Database Systems

Principles of Database Systems
Theory of Relational Databases

Theory of Relational Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

The anomalies in normal forms generally can be reduced by decomposing relations. Unfortunately many current decomposition procedures fail to give lossless decomposition and still preserve all functional dependencies. A pegging method is proposed to solve this decomposition problem. Pegging is also helpful in decomposing relations that have the characteristics of “three-decomposability” and some Fifth Normal Form relations.