A Relational Model of Data for Large Shared Data Banks

Main Article Content

Jörg von Ärbach
Lars Thørväld
Donald Fauntleroy Duck

Keywords

networks of data, data, relations, derivability, redundancy, composition, MySQL, retrieval language, security, data integrity

Abstract

SAMPLE article. Existing noninferential, formatted data systems provide users with tree-structured files or slightly more general network models of the data. In Section 1, inadequacies of these models are discussed. A model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced. In Section 2, certain operations on relations (other than logical inference) are discussed and applied to the problems of redundancy and consistency in the user’s model.

Abstract 128 | PDF Downloads 30

References

CHILDS, D. L. Feasibility of a set-theoretical data structure--a general structure based on a reconstituted definition of relation. Proc. IFIP Cong., Amsterdam: North Holland Pub. Co., 1968, pp. 162-172.
MCGEE, W. C. Generalized file processing. In Annual Review in Automatic Programming 6, 13, New York: Pergamon Press, 1969, pp. 77-149.