Database Paper Browser

Back to papers

A File Structure Supporting Traversal Recursion

Summary: Introduces a simple file structure for traversal recursion on large acyclic graphs, sorting nodes topologically and storing them in a B-tree. Traversal is a single scan; supports efficient insert, delete, and modify of nodes and edges. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2446
Venue
SIGMOD
Year
1989
Pagerank
4.965987e-05
Overall Rank
6,664 | 53.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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

Overall Rank Paper Year Venue Pagerank
9,676 Schema-Based Query Optimisation for Graph Databases 2025 SIGMOD 4.3006524e-05
8,770 Compact O-Complete Trees 1988 VLDB 4.4520434e-05
11,552 Parallel Traversal of Graphs Stored in RDBMSs 2020 CIDR 4.1905499e-05
885 Efficient Transitive Closure Algorithms 1988 VLDB 0.00015565543
6,473 Efficient Search of Multidimensional B-Trees 1995 VLDB 5.0427056e-05
3,115 Processing Queries on Tree-Structured Data Efficiently 2006 PODS 7.5414053e-05
7,289 On Tree-Based Techniques for Query Evaluation 1992 PODS 4.7692311e-05
9,110 Optimizing Recursive Queries in SQL 2005 SIGMOD 4.3900304e-05
3,990 EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract) 1987 PODS 6.5536618e-05
157 Traversal Recursion: A Practical Approach to Supporting Recursive Applications 1986 SIGMOD 0.0004048407