Characterization and processing of simple prefixed-chain recursion

DOI10.1016/0020-0255(93)90108-XMaRDI QIDQ1208145zbMATH OpenOpenAlexFDO

Authors Wenyu Lu, Dik Lun Lee

Publication date 16 May 1993

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(93)90108-x

zbMATH Keywords

linear recursionlogic databasesrecursive query processing

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Magic sets revisited
• Towards an algebraic theory of recursion
• On the bottom-up evaluation of recursive queries
• Grammars and automata to optimize chain logic queries
• Efficient evaluation for a subset of recursive queries

Cites work

• scientific article; zbMATH DE number 4049156 (Why is no real title available?)
• scientific article; zbMATH DE number 193197 (Why is no real title available?)
• Minimizing function-free recursive inference rules
• Multi-way counting method
• On compiling queries in recursive first-order databases

Cited in

(3)

• One-sided recursions
• Commutativity and its role in the processing of linear recursion
• Towards an algebraic theory of recursion

This page was built for publication: Characterization and processing of simple prefixed-chain recursion

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