BIT Numerical Mathematics

, Volume 20, Issue 3, pp 265–278 | Cite as

A simple query language based on set algebra

  • Stefan Arnborg
Part I Computer Science
  • 22 Downloads

Abstract

A design process for a query language based on set algebra is described. Key principles used in the design are: make explicit assumptions about the end users background, delimit the scope of the language, and make it simple by omitting all features that have not been found necessary. The language closely mirrors concepts well known from algebra and set theory: it contains no join or relational division, and it has a high expressive power.

Keywords

Design Process Computational Mathematic Query Language Expressive Power Explicit Assumption 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Arnborg, E. Elvers and P. Svensson,Design specifications for Datalab — system for data analysis based on the relational model of data, FOA report C 20326, October 1979.Google Scholar
  2. 2.
    M. Lacroix and A. Pirotte,Example queries in relational languages, Technical note N 107, M.B.L.E., Brussels, January 1976, revised April 1978.Google Scholar
  3. 3.
    P. Medema,PICULA, a database query language, Philips ISA report IDR/AP/PM/780622, June 1978.Google Scholar
  4. 4.
    Thomas,Psychological issues in data base management, Proceedings of 4th International VLDB Conference, Berlin 1978.Google Scholar
  5. 5.
    N. Wirth,The programming language Pascal, Acta Informatica 1(1) (1971), 35–63.CrossRefGoogle Scholar
  6. 6.
    J. Welsh, W. J. Sneeringer and C. A. R. Hoare,Ambiguities and insecurities in Pascal, Software — Practice and Experience 7 (1977), 685–696.Google Scholar

Copyright information

© BIT Foundations 1980

Authors and Affiliations

  • Stefan Arnborg
    • 1
  1. 1.Department of Numerical Analysis and Computing ScienceRoyal Institute of TechnologyStockholm 70Sweden

Personalised recommendations