Paper Info
Title
Synthesizing least fixed point queries into non-recursive iterative programs
Abstract
An algorithm is presented which takes a least fixed point query expressed by a basis and inductive step and transforms it into a non-recursive iterative program. By augmenting a relational system with this algorithm, least fixed point queries can be handled automatically, and there is no need to proceduralizc relational algebra for such queries.
Year
Venue
Keywords
1983
IJCAI
relational system,fixed point query,non-recursive iterative program,relational algebra,inductive step,relation algebra,fixed point
Field
DocType
Citations 
Discrete mathematics,Conjunctive query,Computer science,Theoretical computer science,Least fixed point,Relational algebra,Recursion
Conference
7
PageRank 
References 
Authors
11.47
11
2
Name
Order
Citations
PageRank
Shamim A. Naqvi1522329.22
Lawrence J. Henschen2478280.94