Argument reduction by factoring

DOI10.1016/0304-3975(94)00186-MMaRDI QIDQ673140zbMATH OpenOpenAlexFDO

Authors Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)00186-m

zbMATH Keywords

factoringmagic sets transformation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• An analysis of magic sets and related optimization strategies for logic queries
• Magic sets revisited
• On the expected size of recursive datalog queries
• Magic templates: a spellbinding approach to logic programs

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4049156 (Why is no real title available?)
• scientific article; zbMATH DE number 194907 (Why is no real title available?)
• Equivalences among Relational Expressions
• Magic templates: a spellbinding approach to logic programs
• The Semantics of Predicate Logic as a Programming Language

Cited in

(4)

• Bottom-up evaluation and query optimization of well-founded models
• Generalization of ZYT-linearizability for bilinear datalog programs
• One-sided recursions
• A counting algorithm for a cyclic binary query

This page was built for publication: Argument reduction by factoring

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