Traversal recursion: a practical approach to supporting recursive applications

  • Authors:

  • Arnon Rosenthal;Sandra Heiler;Umeshwar Dayal;Frank Manola

  • Affiliations:

  • Computer Corporation of America, Four Cambridge Center, Cambridge Massachusetts;Computer Corporation of America, Four Cambridge Center, Cambridge Massachusetts;Computer Corporation of America, Four Cambridge Center, Cambridge Massachusetts;Computer Corporation of America, Four Cambridge Center, Cambridge Massachusetts

  • Venue:
  • SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
  • Year:
  • 1986

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many capabilities that are needed for recursive applications in engineering and project management are not well supported by the usual formulations of recursion. We identify a class of recursions called “traversal recursions” (which model traversals of a directed graph) that have two important properties they can supply the necessary capabilities and efficient processing algorithms have been defined for them. First we present a taxonomy of traversal recursions based on properties of the recursion on graph structure and on unusual types of metadata. This taxonomy is exploited to identify solvable recursions and to select an execution algorithm. We show how graph traversal can sometimes outperform the more general iteration algorithm. Finally we show how a conventional query optimizer architecture can be extended to handle recursive queries and views.