Relational Architecture

  • E. J. Yannakoudakis


In Chapter 3, we introduced the relational model and its peculiar terminology which is based on known mathematical concepts, particularly the theory of matrices. In Chapter 4, we adopted a Relational Database Language (RDL) in order to discuss high level database software — RDL has now been proposed by the International Standards Organisation (ISO) as the industry standard for the design of relational databases. The aim of this chapter is to present the relational architecture [Codd, 1970, 1972] independent of any available software (e.g SEQUEL [Chamberlin et al, 1976], INGRESS [Stonebraker et al, 1976], and RDL [ANSI, 1986]), standards, modules, commands, etc. The emphasis here is on set-theoretic manipulation of relational tables, and also how trees and networks can be represented adequately, within the framework of the relational architecture.


Database System Relational Algebra International Standard Organisation Logical Schema Relational Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ANSI, X3H2 Technical Committee on Databases, ‘Relational Database Language’, 1986.Google Scholar
  2. Bachman, C. W., ‘Data Structure Diagrams’, Database, Vol 1, No. 2, pp. 4–10, 1969.Google Scholar
  3. Chamberlin, D. D., et al., ‘SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control’, IBM J. Research and Development, Vol. 20, No. 6, pp. 560–575, 1976.MATHGoogle Scholar
  4. Codd, E. F., ‘A Relational Model of Data for Large Shared Databases’, CACM, Vol. 13, No. 6. pp. 377–387, 1970.MATHGoogle Scholar
  5. Codd, E. F., ‘Relational Completeness of Database Sublanguages’, In: Database systems, Rustin R. (editor), Prentice-Hall, pp. 33–64, 1972.Google Scholar
  6. Hall, P. A. V., ‘Relational Algebras, Logic, and Functional Programming’, Proc. ACM SIGMOD Conf. on Management of Data, June 1984.Google Scholar
  7. Hall, P. A. V., Hitchcock, P. & Todd, S. J. P. P., ‘An Algebra of Relations for Machine Computation’, Conference Record, 2nd ACM Symposium on Principles of Programming Languages, 1975.Google Scholar
  8. Hitchcock, P., ‘Fundamental Operations on Relations’, IMB UKSC-0051, May 1974.Google Scholar
  9. Kent, W., ‘Limitations of Record-based Information Models’, ACM TODS, Vol. 4, No. 1, pp. 107–131, 1979.MathSciNetCrossRefGoogle Scholar
  10. Stonebraker, M., Wong, E., Kreps, P. & Held, G., ‘The Design and Implementation of INGRESS’, ACM TODS, Vol. 1, No. 3, pp. 189–222, 1976.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • E. J. Yannakoudakis
    • 1
  1. 1.Postgraduate School of Computer SciencesUniversity of BradfordBradford, West YorkshireUK

Personalised recommendations