DBScholar

Back to papers

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)

Paper ID
2417
Venue
SIGMOD
Year
1987
Pagerank
9.212586e-05
Overall Rank
2,076 | 85.76%
DOI
10.1145/38713.38750

Incoming Non-self Citations Over Time

Authors

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.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers