ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Design and implementation of a relational database on a minicomputer
Full text PdfPdf (565 KB)
Source ACM Annual Conference/Annual Meeting archive
Proceedings of the 1977 annual conference table of contents
Pages: 16 - 22  
Year of Publication: 1977
Author
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800179.810175
What is a DOI?

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
3
4
 
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
 
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