One-Directional Recursive Formulas

ABSTRACT We show a general and uniform planning mechanism for one-directional recursive formulas, which can map an arbitrary query of that class to a compiled formula. We also give the syntactic and the semantic definitions of one-directional recursive formulas. The syntactic definition is given from the graph model, and the semantic definition is from the query evaluation point of view. It is shown that two definitions are equivalent.