DocumentCode :
1400629
Title :
Asynchronous chain recursions
Author :
Han, Jiawei ; Lu, Wenyu
Author_Institution :
Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
Volume :
1
Issue :
2
fYear :
1989
fDate :
6/1/1989 12:00:00 AM
Firstpage :
185
Lastpage :
195
Abstract :
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
Keywords :
database management systems; database theory; information retrieval; asynchronous chain recursions; compilation; compiled formulas; complex function-free recursions; deductive databases; efficient processing; linear recursive rules; multiple-level recursions; mutually recursive rules; nonlinear recursive rules; simplification; transitive closure query-processing; Councils; Deductive databases; Ear; Information science; Query processing; Transaction databases;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/69.87959
Filename :
87959
Link To Document :
بازگشت