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 (AT&T)
- 2. Rakesh Agrawal (AT&T)
- 3. Linda Ness (University of Texas)
BibTeX Citation
@inproceedings{jagadish_sigmod87,
title = {{A Study of Transitive Closure As a Recursion Mechanism}},
author = {Jagadish, H V and Agrawal, Rakesh and Ness, Linda},
series = {{SIGMOD} '87},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/38713.38750},
url = {https://dl.acm.org/doi/10.1145/38713.38750},
year = {1987}
}
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 300 | GraphLog: a Visual Formalism for Real Life Recursion | 1990 | PODS | 0.00022046803 |
| 1,114 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00012118382 |
| 2,033 | One-Sided Recursions | 1987 | PODS | 9.2819369e-05 |
| 2,957 | Graph-Theoretic Methods In Database Theory | 1990 | PODS | 7.9200375e-05 |
| 5,341 | Distributed Transitive Closure Computations: The Disconnection Set Approach | 1990 | VLDB | 6.2602701e-05 |
| 6,840 | Hybrid Transitive Closure Algorithms | 1990 | VLDB | 5.7575344e-05 |
| 7,118 | Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases | 2014 | VLDB | 5.6973262e-05 |
| 7,438 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS | 5.6184826e-05 |
| 8,035 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 5.5028526e-05 |
| 12,110 | Slider: an Efficient Incremental Reasoner | 2015 | SIGMOD | 5.093636e-05 |
| 13,116 | Semigroup techniques in recursive query optimization | 1990 | PODS | 5.093636e-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.00060089598 |
| 63 | An Amateur's Introduction to Recursive Query Processing Strategies | 1986 | SIGMOD | 0.00038782376 |
| 916 | A Time Bound on the Materialization of Some Recursively Defined Views | 1985 | VLDB | 0.00013224702 |
| 1,114 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB | 0.00012118382 |
| 1,173 | Data Independent Recursion in Deductive Databases | 1986 | PODS | 0.00011822695 |
| 1,259 | On the Computation of the Transitive Closure of Relational Operators | 1986 | VLDB | 0.00011437537 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 312 | A Graphical Query Language Supporting Recursion | 1987 | SIGMOD |
| 2 | 2,054 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD |
| 3 | 9,173 | Optimizing Recursive Queries in SQL | 2005 | SIGMOD |
| 4 | 1,259 | On the Computation of the Transitive Closure of Relational Operators | 1986 | VLDB |
| 5 | 1,114 | Direct Algorithms for Computing the Transitive Closure of Database Relations | 1987 | VLDB |
| 6 | 9,430 | A Theory of Regular Queries | 2016 | PODS |
| 7 | 1,330 | Efficient Transitive Closure Algorithms | 1988 | VLDB |
| 8 | 13,158 | Classification Of Recursive Formulas In Deductive Databases | 1988 | SIGMOD |
| 9 | 1,382 | Estimating the Size of Generalized Transitive Closures | 1989 | VLDB |
| 10 | 7,438 | A Generalized Transitive Closure for Relational Queries | 1988 | PODS |