Skip to main content

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ANSI, X3H2 Technical Committee on Databases, ‘Relational Database Language’, 1986.

    Google Scholar 

  • Bachman, C. W., ‘Data Structure Diagrams’, Database, Vol 1, No. 2, pp. 4–10, 1969.

    Google Scholar 

  • 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.

    MATH  Google Scholar 

  • Codd, E. F., ‘A Relational Model of Data for Large Shared Databases’, CACM, Vol. 13, No. 6. pp. 377–387, 1970.

    MATH  Google Scholar 

  • Codd, E. F., ‘Relational Completeness of Database Sublanguages’, In: Database systems, Rustin R. (editor), Prentice-Hall, pp. 33–64, 1972.

    Google Scholar 

  • Hall, P. A. V., ‘Relational Algebras, Logic, and Functional Programming’, Proc. ACM SIGMOD Conf. on Management of Data, June 1984.

    Google Scholar 

  • 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 

  • Hitchcock, P., ‘Fundamental Operations on Relations’, IMB UKSC-0051, May 1974.

    Google Scholar 

  • Kent, W., ‘Limitations of Record-based Information Models’, ACM TODS, Vol. 4, No. 1, pp. 107–131, 1979.

    Article  MathSciNet  Google Scholar 

  • Stonebraker, M., Wong, E., Kreps, P. & Held, G., ‘The Design and Implementation of INGRESS’, ACM TODS, Vol. 1, No. 3, pp. 189–222, 1976.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Yannakoudakis, E.J. (1988). Relational Architecture. In: The Architectural Logic of Database Systems. Springer, London. https://doi.org/10.1007/978-1-4471-1616-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1616-5_8

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19513-9

  • Online ISBN: 978-1-4471-1616-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics