%0 Journal Article
%T TRANSFORMATION FOR GENERALIZED LEFT-LINEAR RECURSIONS: ALGORITHM AND ITS CORRECTNESS<br>拓广的左线性递仅变换算法及其正确性
%A Fan Ming
%A <br>范明
%J 软件学报
%D 1994
%I 
%X This paper presents an algorithm which transform a generalized left-linear recursion into more efficient rules,and shows the correctness of the given algorithm. A generalized left-linear recursion contains one or more IDB predicates and its definition is essentially generalized from that of left-linear recursions. As the algorithm for the evaluation of left - linear recursions, the algorithm we present here follows the magic-sets paradigm of a rewriting phase followed by semi -naive bottom-up evaluation. The efficinecy of the transformed rules is also discussed in this paper.
%K Deductive database
%K query processing
%K linear recursion
%K left - linear recursion<br>演绎数据库
%K 查询处理
%K 线性递归
%K 左线性递归
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=7316CCB7329CFFDD7FA9DF2CC44ECF1F&yid=3EBE383EEA0A6494&vid=94C357A881DFC066&iid=CA4FD0336C81A37A&sid=014B591DF029732F&eid=1D0FA33DA02ABACD&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=8