Commutativity and its role in the processing of linear recursion

DOI10.1016/0743-1066(92)90012-RMaRDI QIDQ4015958zbMATH OpenFDO

Authors Yannis E. Ioannidis

Publication date 10 November 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(92)90012-R

zbMATH Keywords

linear recursive rulesquery processingrecursively redundant predicatesseparable recursion

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Towards an algebraic theory of recursion
• On the Complexity of Commutativity Analysis
• Characterization and processing of simple prefixed-chain recursion
• Magic sets revisited
• Algebraic Optimization Of Recursive Database Queries

Cited in

(6)

• Synthesizing precise and useful commutativity conditions
• Towards an algebraic theory of recursion
• On the Complexity of Commutativity Analysis
• Grammars and automata to optimize chain logic queries
• On the complexity of commutativity analysis
• Logical query optimization by proof-tree transformation

This page was built for publication: Commutativity and its role in the processing of linear recursion

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