Raymond F. Boyce
Abstract
This paper presents a data sublanguage called SQUARE, intended for use in ad hoc, interactive problem solving by non-computer specialists. SQUARE is based on the relational model of data, and is shown to be relationally complete; however, it avoids the quantifiers and bound variables required by languages based on the relational calculus. Facilities for query, insertion, deletion, and update on tabular data bases are described. A syntax is given, and suggestions are made for alternative syntaxes, including a syntax based on English key words for users with limited mathematical background.
- 1 Boyce, R.F., Chamberlin, D.D., King, W.F., and Hammer, M.M. Specifying queries as relational expressions. Proc. ACM SIGPLAN/SIGIR Interface Meeting, Gaithersburg, Md., Nov. 1973. Google Scholar
Digital Library
- 2 Boyce, R.F., and Chamberlin, D.D. Using a structured English query language as a data definition facility. Res. Report RJ 1318, IBM Res. Lab., San Jose, Calif., Dec. 1973.Google Scholar
- 3 Bracchi, G., Fedeli, A., and Paolini, P. A language for a relational data base management system. Proc. Sixth Annual Princeton Conf. Inf. Science and Systems, March 1972, pp. 84-92.Google Scholar
- 4 Chamberlin, D.D., and Boyce, R.F. SEQUEL: A structured English query language. Proc. 1974 ACM SIGFIDET Workshop, Ann Arbor, Michigan. Google ScholarDigital Library
- 5 Childs, D.L. Description of a set-theoretic data structure. Proc. 1968 AFIPS Fall Joint Comp. Conf., pp. 557-564.Google Scholar
- 6 Codasyl Development Committee. An information algebra. Comm. ACM 5, 4 (Apr. 1962), 190-204. Google ScholarDigital Library
- 7 Codd, E.F. A relational model of data for large shared data banks. Comm. ACM 13, 6 (June 1970), 377-387. Google ScholarDigital Library
- 8 Codd, E.F. Relational completeness of data base sublanguages. Courant Computer Science Symposia, Vol. 6: Data Base Systems. Prentice-Hall, New York, 1971.Google Scholar
- 9 Codd, E.F. A data base sublanguage founded on the relational calculus. Proc. 1971 ACM SIGF1DET Workshop, San Diego, Calif., pp 35-68.Google Scholar
- 10 Codd, E.F. Normalized data base structure: a brief tutorial. Proc. 1971 ACM SIGFIDET Workshop, San Diego, Calif., pp. 1-18.Google Scholar
- 11 Fehder, P.L. The representation-independent language. Res. Rep. RJ 1121, IBM Research Laboratory, San Jose, Calif., Nov. 1972.Google Scholar
- 12 Goldstein, R.C., and Strnad, A.L. The MACA1MS data management system. Proc. 1970 ACM SIGFIDET Workshop, Houston, Texas, pp. 201-230.Google Scholar
- 13 Kuhns, J.L. Logical aspects of question-answering by computer. In Software Engineering: COINS 2, J. Tou (Ed.), Academic Press, New York, 1971, pp. 89-104.Google Scholar
- 14 Kuhns, J.L. Quantification in query systems. Proc. Syrup. Inf. Storage and Retrieval, ACM, New York, 1971, pp. 81-94. Google ScholarDigital Library
- 15 Levien, R.E., and Maron, M.E. A computer system for inference execution and data retrieval. Comm. ACM 10, 11 (Nov. 1967), 715-721. Google ScholarDigital Library
- 16 Notley, M.G. The Peterlee IS/1 System. Tech. Rep. UKSC-0018, IBM Scientific Centre, Peterlee, U.K., March 1972.Google Scholar
- 17 Whitehead, A.N., and Russell, B. Principia Mathematica. Cambridge University Press, 1950.Google Scholar
- 18 Whitney, V.K. A relational data management system. In information Systems: COINS IV J. Tou (Ed.), Plenum Press, New York, 1974, pp. 55-66.Google Scholar
- 19 Held, G.D., Stonebraker, M.R., and Wong, E. INGRES--a relational data base system. Proc. 1975 AFIPS Nat. Computer Conf., pp. 409-416.Google Scholar
- 20 Astrahan, M.M., and Chamberlin, D.D. 1 mplementation of a structured English query language. Comm. ACM 18, 10 (Oct. 1975), 580-588. Google ScholarDigital Library
Index Terms
- Specifying queries as relational expressions: the SQUARE data sublanguage
Recommendations
Compilation of Nonprocedural Specifications into Computer Programs
The paper describes the compilation of a program specification, written in the very high level nonprocedural MODEL language, into an object, PL/1 or Cobol, procedural language program. Nonprocedural programming languages are descriptive and devoid of ...
Access to Indexed Hierarchical Databases Using a Relational Query Language
An efficient means of accessing indexed hierarchical databases using a relational query language is presented. The purpose is to achieve an effective sharing of heterogeneous distributed databases. Translation of hierarchical data to an equivalent ...
Incremental Recomputation of Active Relational Expressions
Database updates are small and incremental compared to database contents. It is therefore desirable that recomputations of active relational expressions-such as views, derived data, integrity constraints, active queries, and monitors-can also be ...
Comments