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.
Similar content being viewed by others
References
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.
M. Lacroix and A. Pirotte,Example queries in relational languages, Technical note N 107, M.B.L.E., Brussels, January 1976, revised April 1978.
P. Medema,PICULA, a database query language, Philips ISA report IDR/AP/PM/780622, June 1978.
Thomas,Psychological issues in data base management, Proceedings of 4th International VLDB Conference, Berlin 1978.
N. Wirth,The programming language Pascal, Acta Informatica 1(1) (1971), 35–63.
J. Welsh, W. J. Sneeringer and C. A. R. Hoare,Ambiguities and insecurities in Pascal, Software — Practice and Experience 7 (1977), 685–696.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arnborg, S. A simple query language based on set algebra. BIT 20, 265–278 (1980). https://doi.org/10.1007/BF01932769
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01932769