Arnon Rosenthal
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.
- AHO76 Aho A J Hopcroft and J UIIman Design and Analysis of Computer AigonMms Add=son Wesley Reading MA 1976 Google Scholar
Digital Library
- AHO79 Aho A and J UIIman "On the Unwersahty of Data Retrieval Languages " ACM Symp on Pnnclples of Programming Languages 1979 Google ScholarDigital Library
- BANC86 Bancdhon F "Nawe Evaluation of Recurswely Defined Relat=ons" =n M L Brod=e and J Mylopoulos (eds) On Know#edge Base Management Integrating Artificial Intelhgence and Database Technologies Springer Verlag 1986 Google ScholarDigital Library
- BAYE85 Bayer R "Query Evaluation and Recurslon m Deductive Database Systems " 1985Google Scholar
- CARR79 Carre B Graphs and Networks Oxford Umverslty Press New York NY 1979 ch 3Google Scholar
- CHAK82 Chakravarthy U S J Minker and D Tran "interfacing Predicate Logic Languages and Relational Databases" Proc of the 1st Intl Logic Programming Conf France Sept 1982Google Scholar
- CHAN82 Chandra A and D Harel "Horn Clause Quenes and Generalization" ACM SIGACT-SIGMOD Symp on Principles of Database Systems Conf 1982Google Scholar
- CLEM81 Clemons E "Design of an External Schema Facility to Define and Process Recurslve Structures" ACM Trans on Database Systems Vol 6 No 2 June 1981 pp 81-92 Google ScholarDigital Library
- CLOC81 Clocksm W F and C S Melhsh Programming m PROLOG Spnnger-Verlag New York NY 1981Google Scholar
- DAYA85 Dayal U et al "Probe -A Knowledge-Oriented Database Sys tern Prehmmary Analysis" Technical Report CCA 85-03 Corn puter Corporation of America July 1985Google Scholar
- DAYA86 Dayal U and J M Smith "PROBE A Knowledge Oriented Database Management System" ,n M L Brodle and J Mylopoulos (eds) On Knowledge Base Management Integrating Artificial Intelhgence and Database Technologies Spnnger-Verlag 1986 Google ScholarDigital Library
- HEIL85 Heder S I and A Rosenthat "G Whiz A Visual Interface for the Functional Model with Recursion " Proc of the 11th Conf on VLDB 1985Google Scholar
- HENS84 Henschen L J and S A NaqvJ "On Compdmg Queries an Recurswe F#rst Order Databases" Journal of the ACM Vol 31 No 1 Oct 1984 pp 47 85 Google ScholarDigital Library
- IOAN85 Ioanntdes Y "A Time Bound on the Matenahzatlon of some Recursively Defined Views" Proc of the 11th Conf on VLDB 1985Google Scholar
- JAME82 James G and W Stoeller "Operattons on Tree Structured Tables " X3H2-26-15 Standards Committee Working Paper 1982 pp 81 92Google Scholar
- JARK84 Jarke M J Clifford and Y Vass,hou "An Optimizing PROLOG Front-end to a Relational Query" Proc of the ACM SIGMOD Int I Conf on Management of Data 1984 Google ScholarDigital Library
- JARK85 Jarke M Lmnemann V and Schmldt J "Data Constructors On the Integrahon of Rules and Relations" Proc of the Hth Conf on VLDB 1985Google Scholar
- MERR84 Merrett T Relational Information Systems Reston PubhshJng Reston VA 1984 ch 5 2 Google ScholarDigital Library
- OREN86 Orensteln J "Spabal Query Processing an an Object Oriented Database system" Proc ACM SIGMOD Intl Conf on Manage ment of Data 1986 Google ScholarDigital Library
- ROSE84 Rosenthal A S I Heder and F Manola An Example of Knowledge Based Query Processing m a CAD/CAM DBMS" Proc oft he Tenth Intl Conf on VLDB 1984 pp 363-370 Google ScholarDigital Library
- ROSE85 Rosenthal A "Traversal Recurslons " Probe Project Working Paper Computer Corporation of America 1985Google Scholar
- SHIP81 Shipman D "The Functional Data Model and the Data Language DAPLEX " ACM Transaction on Database Systems 6 1 March 1981 pp 140-173 Google ScholarDigital Library
- ULLM85 UIIman J "Implementation of Logical Query Languages for Data bases " ACM Trans on Database Systems 1985 Google ScholarDigital Library
- YOKO84 Yokota H et al "An Enhanced Inference Mechanism for Generating Relational Algebra Queries" ACM SIGACT-SIGMOD Syrup on Pnnclples of Database Systems 1984 Google ScholarDigital Library
- ZLOO75 Zloof M "Query By Example Proc of the NCC44 May 1975Google Scholar
Index Terms
- Traversal recursion: a practical approach to supporting recursive applications
Recommendations
Traversal recursion: a practical approach to supporting recursive applications
SIGMOD '86: Proceedings of the 1986 ACM SIGMOD international conference on Management of dataMany 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 file structure supporting traversal recursion
SIGMOD '89: Proceedings of the 1989 ACM SIGMOD international conference on Management of dataTraversal recursion is a class of recursive queries where the evaluation of the query involves traversal of a graph or a tree. This limited type of recursion arises in many applications. In this report we investigate a simple file structure that ...
A file structure supporting traversal recursion
Traversal recursion is a class of recursive queries where the evaluation of the query involves traversal of a graph or a tree. This limited type of recursion arises in many applications. In this report we investigate a simple file structure that ...
Comments