Synthesizing least fixed point queries into non-recursive iterative programs

Authors:
Shamim A. Naqvi;Lawrence J. Henschen
Affiliations:
Bell Laboratories, Murray Hill, NJ;Northwestern University, Evanston, IL
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Year:
1983

Citing 3
Cited 1

On compiling queries in recursive first-order databases

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Universality of data retrieval languages

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.