skip to main content
article
Free Access

PEIRCE: A relational DBMS for small systems

Published:01 October 1981Publication History
Skip Abstract Section

Abstract

PEIRCE is an interactive relational database management system intended for mini and microcomputers, with an extensible command facility, QUERY, based on Codd's relational algebra and supporting a clerk oriented interface.

PEIRCE contains three major independent on-line modules: DBA, QUERY, and CSU.

DBA provides the data definition and data dictionary facilities and is discussed in Section 2.

QUERY provides both a relational algebra data manipulation language and a clerk oriented interface. QUERY is also discussed in Section 2.

Command sequences are discussed in Section 3.

We discuss the virtual file facilities of PEIRCE (which include the updating of virtual files) in Section 4.

The underlying storage structure, namely entry order sequence with secondary indexes, was chosen primarily with simplicity of recovery in mind and is discussed in section 5.

In Section 6 we discuss the control commands IF and FOR, which help to conveniently avoid having a host language facility.

We conclude in Section 7 by describing further work planned on PEIRCE.

References

  1. 1 Aho, A.V. and J.D. Ullman {1979}, "Universality of data retrieval languages", Proc. Sixth ACM Symposium on Principles of Programming Languages, pp. 110-120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Astrahan, M.M., et al. {1976}, "System R a relational approach to data management", ACM Trans. on Database Systems 1:2, pp. 97-137. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Date, C.J. {1977}, An Introduction to Database Systems, Addison-Wesley, Reading, Mass. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Furtado, A., et al. {1979}, "Permitting updates through views of databases", Information Systems Vol. 41, pp. 269-283.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 Solomon, M.K. {1980}, PEIRCE User's Manual, Graduate School of Management, Rutgers University.Google ScholarGoogle Scholar
  6. 6 Stonebraker, M.E., et al. {1976}, "The design and implementation of Ingres", ACM Trans. on Database Systems 1:3, pp. 189-222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Tarski, A. {1941}, "On the calculus of relations", Journal of Symbolic Logic 6:3, pp. 73-89.Google ScholarGoogle ScholarCross RefCross Ref
  8. 8 Ullman, J.D. {1980}, Principles of Data Base Systems, Computer Science Press, Potomac, Md. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Klug, A. {1980}, "Calculating constraints on relational expressions", ACM Trans. on Database Systems 5:3, pp. 260-290. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Severance, D.G. and G.M. Lohman {1976}, "Differential files: their application to the maintenance of large databases", ACM Trans. on Database Systems 1:3, pp. 256-267. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. PEIRCE: A relational DBMS for small systems

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGSMALL Newsletter
              ACM SIGSMALL Newsletter  Volume 7, Issue 2
              October 1981
              180 pages
              ISSN:0272-720X
              DOI:10.1145/1067672
              Issue’s Table of Contents
              • cover image ACM Conferences
                SIGSMALL '81: Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems
                October 1981
                180 pages
                ISBN:0897910591
                DOI:10.1145/800074

              Copyright © 1981 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 October 1981

              Check for updates

              Qualifiers

              • article
            • Article Metrics

              • Downloads (Last 12 months)12
              • Downloads (Last 6 weeks)1

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader