A Study of Transitive Closure As a Recursion Mechanism
Summary: Linearly recursive queries collapse to transitive closure, possibly wrapped by relational-algebra operations. Even with repeated variables and constants, the equivalence holds, guiding TC-centric language design and enabling efficient deductive-database implementations. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. H V Jagadish
- 2. Rakesh Agrawal
- 3. Linda Ness
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 256 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00030259041 |
| 673 | One-Sided Recursions | 1987 | PODS | 0.00018348841 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 2,474 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7135761e-05 |
| 4,852 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB | 5.8764777e-05 |
| 6,504 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0357556e-05 |
| 6,650 | Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases | 2014 | VLDB | 4.9763184e-05 |
| 7,181 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.8074621e-05 |
| 7,293 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7740089e-05 |
| 11,911 | Slider: an Efficient Incremental Reasoner | 2015 | SIGMOD | 4.1945683e-05 |
| 12,921 | Semigroup techniques in recursive query optimization | 1990 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 77 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00057043861 |
| 617 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.00019090876 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 1,055 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014422575 |
| 1,185 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013445831 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 363 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025715157 |
| 1,529 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011496686 |
| 9,112 | Optimizing Recursive Queries in SQL | 2005 | SIGMOD | 4.3942347e-05 |
| 1,055 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014422575 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00016369666 |
| 9,280 | A Theory of Regular Queries | 2016 | PODS | 4.3636639e-05 |
| 880 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015667998 |
| 12,962 | Classification Of Recursive Formulas In Deductive Databases | 1988 | SIGMOD | 4.1945683e-05 |
| 688 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00018134733 |
| 7,181 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.8074621e-05 |