Argument reduction by factoring

DOI10.1016/0304-3975(94)00186-MzbMATH Open0873.68106OpenAlexW1970195369MaRDI QIDQ673140FDOQ673140

Yehoshua Sagiv, Raghu Ramakrishnan, Jeffrey F. Naughton, 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

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

zbMATH Keywords

factoringmagic sets transformation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• Equivalences among Relational Expressions
• Title not available (Why is that?)
• Magic templates: a spellbinding approach to logic programs
• Title not available (Why is that?)

Cited In (4)

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

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)