Issue No. 05 - October (1994 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.317703
<p>We study a general class of single linear recursions and the properties of their expansions by analyzing the structures of the recursions. We show that the expansions of a linear recursion of this class are very regular in that the variable connections are heavily shared and change periodically with respect to the expansions. The variable connections can be precisely characterized as static bindings and chain connections. We conclude that a single linear recursion under our assumptions either is bounded or can be expressed as chain recursions. This study contributes to query processing, because it provides the basis for rule compilation as a general and powerful technique for query processing. Combined with query information, the expansion properties of the recursion provide optimized query-processing plans.</p>
query processing; database theory; optimisation; deductive databases; linear recursion; expansions; variable connections; static bindings; chain connections; chain recursions; query processing; rule compilation; query information; optimized query-processing plans; deductive database; logic database; rule classification
W. Lu, D. Lee and J. Han, "A Study on the Structure of Linear Recursion," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 723-737, 1994.