Argument Reduction by Factoring
Summary: Factoring is predicate-relative; factorability is undecidable in general. For broad classes, Magic Sets yields a factorable program; factoring enables a rewrite with lower arity and is never slower than the MS program, often dramatically faster. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. J. F. Naughton
- 2. R. Ramakrishnan
- 3. Y. Sagiv
- 4. J. D. Ullman
Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,585 | Right-, left- and multi-linear rule transformations that maintain context information | 1990 | VLDB | 6.9454028e-05 |
| 6,876 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8977465e-05 |
| 12,746 | Binding Propagation in Disjunctive Databases | 1998 | VLDB | 4.1945683e-05 |
| 12,796 | Magic Factoring of Closure Programs (Extended Abstract) | 1995 | PODS | 4.1945683e-05 |
| 12,929 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.0010066783 |
| 200 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00035012858 |
| 365 | On the Power of Magic | 1987 | PODS | 0.00025585898 |
| 673 | One-Sided Recursions | 1987 | PODS | 0.00018348841 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 3,553 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9779134e-05 |
| 6,417 | Optimizing Existential Datalog Queries | 1988 | PODS | 5.0717071e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,834 | Magic Functions : A Technique To Optimize Extended Datalog Recursive Programs | 1987 | VLDB | 4.2751057e-05 |
| 4,329 | Commutativity And Its Role In The Processing Of Linear Recursion | 1989 | VLDB | 6.2858126e-05 |
| 7,266 | Termination Detection in Logic Programs using Argument Sizes* (Extended Abstract) | 1991 | PODS | 4.782728e-05 |
| 4,555 | Magic Counting Methods | 1987 | SIGMOD | 6.0891017e-05 |
| 12,929 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1945683e-05 |
| 6,876 | Modular Acyclicity and Tail Recursion in Logic Programs | 1991 | PODS | 4.8977465e-05 |
| 12,904 | Structural Query Optimization — A Uniform Framework For Semantic Query Optimization In Deductive Databases | 1991 | PODS | 4.1945683e-05 |
| 6,365 | On the Expected Size of Recursive Datalog Queries | 1991 | PODS | 5.0945408e-05 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 12,796 | Magic Factoring of Closure Programs (Extended Abstract) | 1995 | PODS | 4.1945683e-05 |