Issue No. 02 - June (1989 vol. 1)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.87959
<p>The authors study the compilation and efficient processing of asynchronous chain recursions and show that many complex function-free recursions, which may contain single or multiple linear recursive rules, nonlinear recursive rules, mutually recursive rules, and multiple-level recursions, can be compiled to asynchronous chain recursions. The study on the compilation methods, the simplification of compiled formulas, and the query-processing techniques shows that asynchronous chain recursions can be compiled to relatively simple compiled formulas and processed efficiently using transitive closure query-processing methods.</p>
deductive databases; compilation; efficient processing; asynchronous chain recursions; complex function-free recursions; linear recursive rules; nonlinear recursive rules; mutually recursive rules; multiple-level recursions; simplification; compiled formulas; transitive closure query-processing; database management systems; database theory; information retrieval
W. Lu and J. Han, "Asynchronous Chain Recursions," in IEEE Transactions on Knowledge & Data Engineering, vol. 1, no. , pp. 185-195, 1989.