Processing queries aganist database procedures: a performance analysis

  • Authors:
  • Eric N. Hanson

  • Affiliations:
  • Air Force Wright Aeronautical Laboratories, Wright-Patterson AFB, OH

  • Venue:
  • SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

A database procedure is a collection of queries stored in the database. Several methods are possible for processing queries that retrieve the value returned by a database procedure. The conventional algorithm is to execute the queries in a procedure whenever it is accessed. A second strategy requires caching the previous value returned by the database procedure. If the cached value is valid at the time of a query, the value is returned immediately. If the cached value has been invalidated by an update, the value is recomputed, stored back into the cache, and then returned. A third strategy uses a differential view maintenance algorithm to maintain an up-to-date copy of the value returned by the procedure. This paper compares the performance of these three alternatives. The results show that which algorithm is preferred depends heavily on the database environment, particularly, the frequency of updates and the size of objects retrieved by database procedures.