ACM Home Page
Please provide us with feedback. Feedback
Optimizing the performance of a relational algebra database interface
Full text PdfPdf (1.14 MB)
Source
Communications of the ACM archive
Volume 18 ,  Issue 10  (October 1975) table of contents
Pages: 568 - 579  
Year of Publication: 1975
ISSN:0001-0782
Authors
John Miles Smith  Univ. of Utah, Salt Lake City
Philip Yen-Tang Chang  Univ. of Utah, Salt Lake City
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 63,   Citation Count: 81
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.361025
What is a DOI?

ABSTRACT

An approach for implementing a “smart” interface to support a relational view of data is proposed. The basic idea is to employ automatic programming techniques so that the interface analyzes and efficiently refines the high level query specification supplied by the user. A relational algebra interface, called SQUIRAL, which was designed using this approach, is described in detail. SQUIRAL seeks to minimize query response time and space utilization by: (1) performing global query optimization, (2) exploiting disjoint and pipelined concurrency, (3) coordinating sort orders in temporary relations, (4) employing directory analysis, and (5) maintaining locality in page references. Algorithms for implementing the operators of E. F. Codd's relational algebra are presented, and a methodology for composing them to optimize the performance of a particular user query is 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
 
2
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. RJI200, IBM Research Laboratory, San Jose, Calif., April 1973.
3
 
4
Chang, P.Y. A design for a relational data base system. U. of Utah Tech. Rep.
5
 
6
Codd, E.F. Relational completeness of data base sublanguages. In Courant Computer Science Symposia 6: Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., May 1971, pp. 65-98.
 
7
Lorie, R.A., and Symonds, A.J. A relational access method for interactive applications. In Courant Computer Science Symposia 6: Data Base Systems, Prentice-Hall, Englewood Cliffs, N.J., May 1971, pp. 99-124.
 
8
Lorie, R.A. XRM--an extended (n-ary) relational memory. Tech. Rep. 320-2096, IBM Scientific Center, Cambridge, Mass., Jan. 1964.
9

CITED BY  81

Collaborative Colleagues:
John Miles Smith: colleagues
Philip Yen-Tang Chang: colleagues