Decomposition and Composition of a Relational Database.
Yuzuru Tanaka, Takao Tsuda:
Decomposition and Composition of a Relational Database.
VLDB 1977: 454-462@inproceedings{DBLP:conf/vldb/TanakaT77,
author = {Yuzuru Tanaka and
Takao Tsuda},
title = {Decomposition and Composition of a Relational Database},
booktitle = {Proceedings of the Third International Conference on Very Large
Data Bases, October 6-8, 1977, Tokyo, Japan},
publisher = {IEEE Computer Society},
year = {1977},
pages = {454-462},
ee = {db/conf/vldb/TanakaT77.html},
crossref = {DBLP:conf/vldb/77},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
New algorithms for the decomposition and the composition of a relational data base are proposed in this
paper. Given a data base specified by a set of attributes and a set of functional dependencies, the
decomposition algorithm removes redundancy and abnormalities to generate a nondecomposable schema and a
D-tree. After the data base is constructed following this schema, the D-tree is used by the composition
algorithm to construct the simplest relational expression that specifies a desired subrelation over an
arbitrary set of attributes given as a query by a user.
Copyright © 1977 by The Institute of
Electrical and Electronic Engineers, Inc. (IEEE).
Abstract used with permission.
CDROM Version: Load the CDROM "Volume 1 Issue 4, VLDB '75-'88" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
Proceedings of the Third International Conference on Very Large Data Bases, October 6-8, 1977, Tokyo, Japan.
IEEE Computer Society 1977
Contents
References
- [1]
- E. F. Codd:
A Relational Model of Data for Large Shared Data Banks.
Commun. ACM 13(6): 377-387(1970)
- [2]
- E. F. Codd:
Further Normalization of the Data Base Relational Model.
IBM Research Report, San Jose, California RJ909: (1971)
- [3]
- ...
- [4]
- Philip A. Bernstein:
Synthesizing Third Normal Form Relations from Functional Dependencies.
ACM Trans. Database Syst. 1(4): 277-298(1976)
Copyright © Tue Mar 16 02:21:55 2010
by Michael Ley (ley@uni-trier.de)