DBScholar

Back to papers

Traversal Recursion: A Practical Approach to Supporting Recursive Applications

Summary: Introduces traversal recursions for practical recursive graph applications, capturing capabilities missed by standard recursion. A taxonomy of recursion, graph, and metadata properties guides solvability, algorithm selection, and optimizer integration, with traversal outperforming general iteration. (summarized by gpt-5.6-luna on Jul 21 2026)

Paper ID
2365
Venue
SIGMOD
Year
1986
Pagerank
0.00024458594
Overall Rank
217 | 98.52%
DOI
10.1145/16894.16871

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{rosenthal_sigmod86,
        title = {{Traversal Recursion: A Practical Approach to Supporting Recursive Applications}},
        author = {Rosenthal, Arnon and Heiler, Sandra and Dayal, Umeshwar and Manola, Frank},
        series = {{SIGMOD} '86},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/16894.16871},
        url = {https://dl.acm.org/doi/10.1145/16894.16871},
        year = {1986}
}

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Rank Citing Paper Year Venue Pagerank
63 An Amateur's Introduction to Recursive Query Processing Strategies 1986 SIGMOD 0.00038782376
268 Extensible Query Processing in Starburst 1989 SIGMOD 0.00022788687
282 Efficient Management of Transitive Relationships in Large Data and Knowledge Bases 1989 SIGMOD 0.0002242162
312 A Graphical Query Language Supporting Recursion 1987 SIGMOD 0.00021733819
1,086 New Strategies for Computing the Transitive Closure of a Database Relation 1987 VLDB 0.00012252192
1,114 Direct Algorithms for Computing the Transitive Closure of Database Relations 1987 VLDB 0.00012118382
1,259 On the Computation of the Transitive Closure of Relational Operators 1986 VLDB 0.00011437537
1,330 Efficient Transitive Closure Algorithms 1988 VLDB 0.00011140171
1,359 GraphDB: Modeling and Querying Graphs in Databases 1994 VLDB 0.00011040427
1,382 Estimating the Size of Generalized Transitive Closures 1989 VLDB 0.00010965236
1,658 Finding Regular Simple Paths in Graph Databases 1989 VLDB 0.00010092304
1,921 Efficient Evaluation of Right-, Left-, and Multi-Linear Rules 1989 SIGMOD 9.4809066e-05
2,511 Aggregation and Relevance in Deductive Databases 1991 VLDB 8.4854377e-05
3,128 On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions 1989 SIGMOD 7.7292081e-05
4,189 On-the-fly Progress Detection in Iterative Stream Queries 2009 VLDB 6.8435848e-05
4,673 Handling Redundancy in the Processing of Recursive Database Queries 1987 SIGMOD 6.573022e-05
5,341 Distributed Transitive Closure Computations: The Disconnection Set Approach 1990 VLDB 6.2602701e-05
5,495 Efficient Main Memory Data Management Using the DBGraph Storage Model 1990 VLDB 6.1987657e-05
6,594 A File Structure Supporting Traversal Recursion 1989 SIGMOD 5.8296302e-05
6,840 Hybrid Transitive Closure Algorithms 1990 VLDB 5.7575344e-05
7,342 Efficient Search in Very Large Databases 1988 VLDB 5.6386997e-05
7,438 A Generalized Transitive Closure for Relational Queries 1988 PODS 5.6184826e-05
12,867 A Data Warehousing Architecture for Enabling Service Provisioning Process 2001 VLDB 5.093636e-05
13,029 Incomplete Path Expressions and their Disambiguation 1994 SIGMOD 5.093636e-05
13,197 Panel on Extensible Database Systems 1986 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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