ACM Home Page
Please provide us with feedback. Feedback
Optimization of nested SQL queries revisited
Full text PdfPdf (1.08 MB)
Source ACM SIGMOD Record archive
Volume 16 ,  Issue 3  (December 1987) table of contents
Pages: 23 - 33  
Year of Publication: 1987
ISSN:0163-5808
Also published in ...
Authors
Richard A. Ganski  San Francisco State Univ., San Francisco, CA
Harry K. T. Wong  Univ. of California, Berkeley
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 19,   Downloads (12 Months): 109,   Citation Count: 48
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

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/38714.38723
What is a DOI?

ABSTRACT

Current methods of evaluating nested queries in the SQL language can be inefficient in a variety of query and data base contexts. Previous research in the area of nested query optimization which sought methods of reducing evaluation costs is summarized, including a classification scheme for nested queries, algorithms designed to transform each type of query to a logically equivalent form which may then be evaluated more efficiently, and a description of a major bug in one of these algorithms. Further examination reveals another bug in the same algorithm. Solutions to these bugs are proposed and incorporated into a new transformation algorithm, and extensions are proposed which will allow the transformation algorithms to handle a larger class of predicates. A recursive algorithm for processing a general nested query is presented and the action of this algorithm is demonstrated. This algorithm can be used to transform any nested query.


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.

AST 75
AST 76
COD 79
 
KIE 84
Fdesslmg, W SQL-Ltke and Quel.hke correlauon queries with aggregates revtstted. UCB/ERL Memo 84/75, Electronics Research Laboratory, Umv Cahforma, Berkeley (Sept. 1984)
KIM 82
 
ORA 86
Oracle Corporauon Private product demonstratton (Sept 1986)
 
SEL 79
Selmger, PG. Astrahan. M M. Chamberlm. D D. Lone. R A. and Price, T G Access path selecuon m a relauonal database system In Proc ACM Inter Conf Management of Data, Boston, Mass (May 1979), 23-34
STO 76

CITED BY  48
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Richard A. Ganski: colleagues
Harry K. T. Wong: colleagues

Peer to Peer - Readers of this Article have also read: