A simple query language based on set algebra |
| |
| Authors: | Stefan Arnborg |
| |
| Affiliation: | (1) Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-10044 Stockholm 70, Sweden |
| |
| 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: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
