This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Asynchronous Chain Recursions
June 1989 (vol. 1 no. 2)
pp. 185-195

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.

[1] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[2] 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.
[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] C. Beeri, P. Kanellakis, F. Bancilhon, and R. Ramakrishnan, "Bounds on the propagation of selection into logic programs," inProc. 6th ACM Symp. Principles of Database Syst., San Diego, CA, Mar. 1987, pp. 214-226.
[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 and W. S. Luk, "What kinds of recursions can be processed by transitive closure strategies?," in Z. W. Ras and L. Saitta, Eds.,Methodologies for Intelligent Systems, vol. 3. Amsterdam: North-Holland, 1988, pp. 170-179.
[7] J. Han, "Selection of processing strategies for different recursive queries," inProc. 3rd Int Conf. Data and Knowledge Bases, Jerusalem, Israel, June 1988, pp. 59-68.
[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] Y. E. Ioannides, "A time bound on the materialization of some recursively defined views," inProc. 11th Int. Conf. Very Large Data Bases, Stockholm, Sweden, Aug. 1985, pp. 219-226.
[11] Y. E. Ioannidis and E. Wong, "Transforming nonlinear recursion to linear recursion," inProc. 2nd Int. Conf. Expert Database Syst., Fairfax, VA, Apr. 1988, pp. 401-422.
[12] J. Minker and J. M. Nicolas, "On recursive axioms in relational databases,"Inform Syst., vol. 8, no. 1, pp. 1-13, 1983.
[13] J. F. Naughton, "One-sided recursions," inProc. 6th ACM Symp. Principles of Database Syst., San Diego, CA, Mar. 1987, pp. 340- 348.
[14] J. F. Naughton, "Compiling separable recursions," inProc. 1988 ACM-SIGMOD Conf. Management of Data(Chicago, IL), June 1988, pp. 312-319.
[15] J. D. Ullman,Database and Knowledge-base Systems. Rockville, MD: Computer Science Press, 1988.
[16] W. Zhang and C. T. Yu, "A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule," inProc. 1987 ACM-SIGMOD Conf. Management of Data, San Francisco, CA, May 1987, pp. 345-356.

Index Terms:
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
Citation:
J. Han, W. Lu, "Asynchronous Chain Recursions," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 2, pp. 185-195, June 1989, doi:10.1109/69.87959
Usage of this product signifies your acceptance of the Terms of Use.