Compiling Separable Recursions
Summary: Defines separable recursions and a selective evaluation algorithm that uses constants to prune irrelevant data. Compared with GM sets and Generalized Counting, it attains O(n) on simple cases and can outperform general evaluators by a factor proportional to database size; separable recursions extend linear recursions to non-chain rules and non-binary predicates. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,036 | Proof-Tree Transformation Theorems and Their Applications | 1989 | PODS | 9.714898e-05 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |
| 4,178 | Argument Reduction by Factoring | 1989 | VLDB | 6.3812002e-05 |
| 4,329 | Commutativity And Its Role In The Processing Of Linear Recursion | 1989 | VLDB | 6.2858126e-05 |
| 7,018 | Hard problems for simple logic programs | 1990 | SIGMOD | 4.8602644e-05 |
| 7,598 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.7004867e-05 |
| 12,929 | Factoring Augmented Regular Chain Programs | 1990 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 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 |
| 365 | On the Power of Magic | 1987 | PODS | 0.00025585898 |
| 673 | One-Sided Recursions | 1987 | PODS | 0.00018348841 |
| 1,712 | Bounds on the Propagation of Selection into Logic Programs | 1987 | PODS | 0.00010804573 |
| 4,732 | Handling Redundancy in the Processing of Recursive Database Queries | 1987 | SIGMOD | 5.9639609e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,156 | Counting Methods for Cyclic Relations | 1988 | PODS | 4.8145046e-05 |
| 12,962 | Classification Of Recursive Formulas In Deductive Databases | 1988 | SIGMOD | 4.1945683e-05 |
| 7,075 | Magic-sets Transformation in Nonrecursive Systems | 1992 | PODS | 4.842703e-05 |
| 12,921 | Semigroup techniques in recursive query optimization | 1990 | PODS | 4.1945683e-05 |
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |
| 3,999 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.5469939e-05 |
| 16 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.0010066783 |
| 296 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028644922 |
| 1,529 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011496686 |
| 2,042 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.699257e-05 |