A Relational Model of Data for Large Shared Data Banks



  • Jörg von Ärbach University of Tübingen
  • Lars Thørväld The Thørväld Group
  • Donald Fauntleroy Duck Scientific Writing Academy


data bases, derivability, data banks, AI, Artificial Intelligence, Machine Intelligence, computer, data integrity


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.


Download data is not yet available.

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.



How to Cite

von Ärbach, Jörg, Lars Thørväld, and Donald Fauntleroy Duck. 2020. “A Relational Model of Data for Large Shared Data Banks”. Demo Journal AI 1 (2):1-3. https://doi.org/10.1237/djai.v1i2.23.