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.00030241337 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.0001629507 |
| 1,611 | One-Sided Recursions | 1987 | PODS | 0.00011146101 |
| 2,473 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 8.7048914e-05 |
| 4,855 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB | 5.8698466e-05 |
| 6,499 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.0307246e-05 |
| 6,650 | Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases | 2014 | VLDB | 4.9715438e-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 |
| 11,919 | Slider: an Efficient Incremental Reasoner | 2015 | SIGMOD | 4.1905499e-05 |
| 12,931 | Semigroup techniques in recursive query optimization | 1990 | PODS | 4.1905499e-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.00099936325 |
| 79 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00056010993 |
| 612 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.0001915957 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.0001629507 |
| 1,078 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014223265 |
| 1,200 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00013342243 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 364 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD | 0.00025657601 |
| 1,552 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011393892 |
| 1,078 | On The Computation Of The Transitive Closure Of Relational Operators | 1986 | VLDB | 0.00014223265 |
| 9,110 | Optimizing Recursive Queries in SQL | 2005 | SIGMOD | 4.3900304e-05 |
| 815 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.0001629507 |
| 9,285 | A Theory of Regular Queries | 2016 | PODS | 4.3594818e-05 |
| 885 | Efficient Transitive Closure Algorithms | 1988 | VLDB | 0.00015565543 |
| 12,972 | Classification Of Recursive Formulas In Deductive Databases | 1988 | SIGMOD | 4.1905499e-05 |
| 897 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB | 0.00015484372 |
| 7,182 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 4.802834e-05 |