Optimization of nested SQL queries revisited

  • Authors:
  • Richard A. Ganski;Harry K. T. Wong

  • Affiliations:
  • San Francisco State Univ., San Francisco, CA;Univ. of California, Berkeley

  • Venue:
  • SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

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.