This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Evaluation of Multiple Linear Recursions
December 1991 (vol. 17 no. 12)
pp. 1241-1252

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.

[1] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACM-SIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 16-52.
[2] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic sets and other strange ways to implement logic programs," inProc. 5th ACM Symp. Principles of Database Syst.(Cambridge, MA), Mar. 1986, pp. 1-15.
[3] C. Beeri and R. Ramakrishnan, "On the power of magic," inProc. 6th ACM Symp. Principles of Database Syst.(San Diego, CA), Mar. 1987, pp. 269-283.
[4] R. W. Haddad and J. F. Naughton, "Counting methods for cyclic relations," inProc. 7th ACM Symp. Principles of Database Syst.(Austin, TX), Mar. 1988, pp. 333-346.
[5] J. Han and L. J. Henschen, "Handling redundancy in the processing of recursive database queries," inProc. 1987 ACM-SIGMOD Conf. Management of Data(San Francisco, CA), May 1987, pp. 73-81.
[6] J. Han, "Selection of processing strategies for different recursive queries," inProc. 3rd Int. Conf. Data and Knowledge Bases(Jerusalem), June 1988, pp. 59-68.
[7] J. Han and W. Lu, "Asynchronous chain recursions,"IEEE Trans. Knowledge and Data Eng., vol. 1, pp. 185-195, 1989.
[8] J. Han, "Compiling general linear recursions by variable connection graph analysis,"Comput. Intell., vol. 5, no. 1, pp. 12-31, 1989.
[9] L. J. Henschen and S. Naqvi, "On compiling queries in recursive first-order databases,"J. ACM, vol. 1, no. 1, pp. 47-85, 1984.
[10] A. Marchetti-Spaccamela, A. Pelaggi, and D. Sacca, "Worst-case complexity analysis of methods for logic query implementation," inProc. 6th ACM Symp. Principles of Database Syst.(San Diego, CA), Mar. 1987, pp. 294-301.
[11] J. F. Naughton and Y. Sagiv, "A decidable class of bounded recursions," inProc. 6th ACM Symp. Principles of Database Syst.(San Diego, CA), Mar. 1987, pp. 214-226.
[12] J. F. Naughton, "Compiling separable recursions," inProc. 1988 ACM-SIGMOD Conf. Management of Data(Chicago, IL), June 1988, pp. 312-319.
[13] J. F. Naughton, "Minimizing function-free recursive inference rules,"J. ACM, vol. 36, no. 1, pp. 69-91, 1989.
[14] J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman, "Efficient evaluation of right-, left-, and multi-linear rules," inProc. 1989 ACM-SIGMOD Conf. Management of Data(Portland, OR), June 1989, pp. 235-242.
[15] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.

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, Dec. 1991, doi:10.1109/32.106985
Usage of this product signifies your acceptance of the Terms of Use.