One-sided recursions

DOI10.1016/0022-0000(91)90011-SMaRDI QIDQ2638765zbMATH OpenFDO

Authors Jeffrey F. Naughton

Publication date 1991

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(91)90011-S

zbMATH Keywords

evaluation algorithmsrecursive query languages

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Data independent recursion in deductive databases
• Towards an algebraic theory of recursion
• On the bottom-up evaluation of recursive queries
• A simple characterization of uniform boundedness for a class of recursions
• Characterization and processing of simple prefixed-chain recursion

Cites work

• Argument reduction by factoring
• Data independent recursion in deductive databases
• Equivalences among Relational Expressions
• Equivalences Among Relational Expressions with the Union and Difference Operators
• scientific article; zbMATH DE number 3956409 (Why is no real title available?)
• scientific article; zbMATH DE number 4049156 (Why is no real title available?)
• Minimizing function-free recursive inference rules
• On compiling queries in recursive first-order databases

Cited in

(4)

• Compilation and evaluation of linear mutual recursions
• scientific article; zbMATH DE number 3880134 (Why is no real title available?)
• On the detection of some loops in recursive computations
• scientific article; zbMATH DE number 1261165 (Why is no real title available?)

This page was built for publication: One-sided recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638765)