Graph modeling and analysis of linear recursive queries

Abstract

The authors study a class of complex linear recursive rules or blocks via the V-graph model. A block a linear recursive rule represented by a nontrivial 2-connected component (i.e. containing at least a cycle). It is first shown that a simple form of block, namely, the cycle, has a simple, periodic, variable connection in the expansions. Then it is shown that blocks also have a periodic variable connection in the expansions, and the period and connection can be algorithmically determined. This allows a query to be evaluated efficiently with an iterative algorithm. The effects of the static variable bindings in blocks on query evaluation are then discussed.<>