One-Sided Recursions
Summary: Introduce 'one-sided recursions', a subset of recursive definitions that allows simple, selection-aware evaluation using minimal state. Present detection and two complementary algorithms (one applies per selection), prove many-sided impossibility and undecidability of equivalence, and give a practical conversion procedure complete for a useful class. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 256 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00030241337 |
| 276 | Regular Path Queries with Constraints | 1997 | PODS | 0.00029365217 |
| 885 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015565543 |
| 897 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00015484372 |
| 2,048 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.689916e-05 |
| 2,473 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7048914e-05 |
| 3,556 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9712392e-05 |
| 4,179 | Argument Reduction by Factoring | 1989 | VLDB | 6.3751001e-05 |
| 4,367 | Distributed Processing Of Logic Programs | 1988 | SIGMOD | 6.2423944e-05 |
| 7,182 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.802834e-05 |
| 7,289 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7692311e-05 |
| 9,128 | Counting Methods for Cyclic Relations | 1988 | PODS | 4.3866751e-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.00099936325 |
| 79 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00056010993 |
| 209 | OPTIMIZING DATALOG PROGRAMS (Extended Abstract) | 1987 | PODS | 0.00034147258 |
| 1,200 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013342243 |
| 1,905 | A Study of Transitive Closure As a Recursion Mechanism | 1987 | SIGMOD | 0.00010142772 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,200 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013342243 |
| 359 | On the Power of Magic | 1987 | PODS | 0.00025830228 |
| 5,267 | On the Optimization of Recursive Relational Queries: Application to Graph Queries | 2020 | SIGMOD | 5.5930569e-05 |
| 12,972 | Classification Of Recursive Formulas In Deductive Databases | 1988 | SIGMOD | 4.1905499e-05 |
| 3,556 | Compiling Separable Recursions | 1988 | SIGMOD | 6.9712392e-05 |
| 3,990 | EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) | 1987 | PODS | 6.5536618e-05 |
| 2,048 | Efficient Evaluation of Right-, Left-, and Multi-Linear Rules | 1989 | SIGMOD | 9.689916e-05 |
| 7,066 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS | 4.8389293e-05 |
| 1,552 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011393892 |
| 2,212 | A Decidable Class of Bounded Recursions | 1987 | PODS | 9.2818302e-05 |