ACM Home Page
Please provide us with feedback. Feedback
Implementation of a structured English query language
Full text PdfPdf (897 KB)
Source
Communications of the ACM archive
Volume 18 ,  Issue 10  (October 1975) table of contents
Pages: 580 - 588  
Year of Publication: 1975
ISSN:0001-0782
Authors
M. M. Astrahan  IBM Research Division, San Jose, CA
D. D. Chamberlin  IBM Research Division, San Jose, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 43,   Citation Count: 56
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361020.361215
What is a DOI?

ABSTRACT

The relational model of data, the XRM Relational Memory System, and the SEQUEL language have been covered in previous papers and are reviewed. SEQUEL is a relational data sublanguage intended for ad hoc interactive problem solving by non-computer specialists. A version of SEQUEL that has been implemented in a prototype interpreter is described. The interpreter is designed to minimize the data accessing operations required to respond to an arbitrary query. The optimization algorithms designed for this purpose are described.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bjorner, D., Codd, E.F., Deckert, K.L., and Traiger, I.L. The Gamma-0 N-ary relational data base interface: specifications of objects and operations. Res. Rep. RJ 1200, IBM Research Laboratory, San Jose, Calif., April 1973.
2
 
3
Boyce, R.F. and Chamberlin, D.D. Using a structured English query language as a data definition facility. Res. Rep. RJ 1318, IBM Research Laboratory, San Jose, Calif., Dec. 1973.
 
4
Bracchi, G., Fedeli, A., and Paolini, P. A language for a relational data base management system. Proc. Sixth Annual Princeton Conference on Information Science and Systems, March 1972, pp. 84-92.
5
 
6
Codasyl Data Base Task Group Report. ACM, April 1971.
7
 
8
Codd, E.F. Relational completeness of data base sublanguages. Courant Computer Science Symposia, Vol. 6: Data Base Systems. Prentice-Hall, Engelwood Cliffs, N.J. 1971.
 
9
Codd, E. F. A data base sublanguage founded on the relational calculus. Proc. 1971 ACM SIGFIDET Workshop, San Diego, Calif, Nov. 1971, pp. 35-68.
 
10
Goldstein, R.C., and Strnad, A.L. The MACAIMS data management system. Proc. 1970 ACM SIGFIDET Workshop, Houston, Texas, pp. 201-229.
 
11
Lalonde, W.R., Lee, E.S., and Homing, J.J. An LALR(k) parser generator. Proc. IFIPS Congress, 1971. Ljubljana, Yugoslavia. North-Holland Publishing Co., Amsterdam, 1972, 513-518.
 
12
Lorie, R.A. XRM--An extended (N-ary) relational memory. Tech. Rep. 320-2096, IBM Scientific Center, Cambridge, Mass., Jan. 1974.
 
13
Lode, R.W., and Symonds, A.J. A relational access method for interactive applications. In {8}.
 
14
Peteul, B., and Lorie, R.A. Multisegment relational memory users guide, IBM internal rep., Oct. 1973.

CITED BY  56

Collaborative Colleagues:
M. M. Astrahan: colleagues
D. D. Chamberlin: colleagues