Design and implementation of a relational database on a minicomputer

ABSTRACT

DB85, a relational database management system on a minicomputer Interdata 85, is described. It is a single user system to run on a computer with 64K bytes of memory and disk storage. The system supports a high level, relation-algebraic query language which provides facilities for users to define, create, manipulate, and interrogate the relations in the database. Emphasis in the presentation is on the query language design, physical structures of relations, and minicomputer related issues. The approach used in the implementation reflects a clear separation of the logical view and the physical representation of the database. The goal of the project is to investigate minicomputer oriented database technology and to develop a training tool for teaching database concepts.

REFERENCES

• 1: G. Bracchi, A. Fedili, and P. Paolini, A Language for a Relational Data Base Management System, Proceedings of the Sixth Annual Princeton Conference on Information Sciences and Systems, March 1972, 84-92.
• 2: R. F. Boyce , D. D. Chamberlin , M. M. Hammer , W. F. King, Specifying queries as relational expressions, Proceedings of the 1973 meeting on Programming languages and information retrieval, p.31-47, November 04-06, 1973, Gaithersburg, Maryland
• 3: Donald D. Chamberlin , Raymond F. Boyce, SEQUEL: A structured English query language, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.249-264, May 01-03, 1974, Ann Arbor, Michigan [doi>10.1145/800296.811515]
• 4: E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM, v.13 n.6, p.377-387, June 1970 [doi>10.1145/362384.362685]
• 5: E. F. Codd, Relational Completeness of Data Base Sublanguages, Courant Computer Sciences Symposia, Vol. 6, Data Base Systems Prentice-Hall, New York, May 1971, 65-98.
• 6: E. F. Codd, A Data Base Sublanguage Founded on the Relational Calculus, Proceedings of the 1971 ACM SIGFIDET Workshop on Data Description, Access and Control, San Diego, November 1971, 1-18.
• 7: Franklin L. DeRemer, Simple LR(k) grammars, Communications of the ACM, v.14 n.7, p.453-460, July 1971 [doi>10.1145/362619.362625]
• 8: J. D. Driscoll and Y. E. Lien, A Data Selection Algorithm for Binary Trees. Submitted for publication.
• 9: R. C. Goldstein and A. J. Strnad, The MacAIMs Data Management System, Proceedings of the 1970 ACM SIGFIDET Workshop on Data Description and Access, Houston, Texas, 201-209.
• 10: Y. E. Lien, C. E. Taylor, and J. R. Driscoll, A Design and Implementation of a Relational Data Base, Technical Report TR-75-2, Department of Computer Science, University of Kansas, June 1975.
• 11: N. McDonald, M. Stonebraker, and E. Wong, Preliminary Design of INGRES: Part I - Query Language, Data Storage and Access, Memorandum No. ERL-M435, University of California, Berkeley, April 1974.
• 12: M. Owen, A Relation-Algebraic Query Language—User Manual, in preparation.
• 13: P. Reisner, R. F. Boyce and D. D. Chamberlin, Human Factors Evaluation of Two Data Base Query Languages—SQUARE and SEQUEL, Proceedings of the National Computer Conference, 1975, 447-452.
• 14: M. L. Reynolds, An Implementation of a Relational Data Base Management System, M. S. report, Computer Science, University of Kansas, 1976.
• 15: Michael Stonebraker , Gerald Held , Eugene Wong , Peter Kreps, The design and implementation of INGRES, ACM Transactions on Database Systems (TODS), v.1 n.3, p.189-222, Sept. 1976 [doi>10.1145/320473.320476]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems
          Subjects: Relational databases

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT

General Terms:
Design, Management