Argument reduction by factoring

DOI10.1016/0304-3975(94)00186-MzbMath0873.68106OpenAlexW1970195369MaRDI QIDQ673140

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

zbMATH Keywords

factoringmagic sets transformation

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (4)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Magic templates: a spellbinding approach to logic programs
• The Semantics of Predicate Logic as a Programming Language
• Equivalences among Relational Expressions

This page was built for publication: Argument reduction by factoring