An amateur's introduction to recursive query processing strategies

Abstract

This paper surveys and compares various strategies for processmg logic queries m relational databases The survey and comparison 1s hmlted to the case of Horn Clauses with evaluable predicates but wrthout function symbols The paper 1s organized m three parts In the first part, we introduce the mam concepts and defimtrons In the second, we describe the vanous strategies For each strategy, we give Its mam charactenstms, Its apphcatron range and a detailed descnptron We also give an example of a query evaluatron The third part of the paper compares the strategies on performance grounds We first present a set of sample rules and queries which are used for the performance compansons, and then we characterize the data Finally, we give an analytrcal solution for each query/rule system Cost curves are plotted for specific configurations of the data

Fast Graph Pattern Matching

“…Surveys on recursive query processing strategies can be found in [31]. In this paper, we show how to use graph coding and a join-index to process graph matching that avoids recursive query processing.…”

An Educational Tool for Formal Relational Database Query Languages

“…Since Datalog has the power to express relationships via recursion, as in the ancestor example, Datalog is more powerful. This increase in expressive power has led to a significant amount of research focusing on the complete and efficient evaluation of declarative recursive specifications [14]. Datalog also has the ability to express aggregation.…”

Extensions to query languages for graph traversal problems

“…Many researchers are currently investigating the implementation questions [31], [14], [16], [35], [36], [38]. A survey of optimizations for recursion is provided by Bancilhon and Ramakrishnan [3]. However, the discussion of implementation is outside the scope of this paper.…”