The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1991 vol.17)
pp: 1241-1252
ABSTRACT
<p>The authors study the efficient evaluation of side-coherent multiple linear recursions, which can be further classified into three types: multiple one-sided, multiple balanced k-sided, and multiple mixed k-sided. New techniques are developed by integrating the existing single-linear recursive query evaluation methods with the idea of side-relation unioned processing, which leads to a set of efficient query evaluation algorithms such as a side-relation unioned transitive closure algorithm for the processing of Type I ML recursions and a generalized side-relation unioned magic sets method for the processing of Types II and III ML recursions. The authors describe the processing of single-probe queries on side-coherent ML recursions. They outline the processing of complex queries on ML recursions.</p>
INDEX TERMS
multiple one sided linear recursions; deductive database; multiple balanced K-sided recursions; multiple mixed K-sided recursion; side-coherent multiple linear recursions; single-linear recursive query evaluation; side-relation unioned processing; side-relation unioned transitive closure algorithm; side-relation unioned magic sets method; single-probe queries; database theory; deductive databases; information retrieval; recursive functions
CITATION
J. Han, L. Liu, "Efficient Evaluation of Multiple Linear Recursions", IEEE Transactions on Software Engineering, vol.17, no. 12, pp. 1241-1252, December 1991, doi:10.1109/32.106985
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool