Database Paper Browser

Back to papers

EFFICIENT EVALUATION FOR A SUBSET OF RECURSIVE QUERIES (Extended Abstract)

Summary: Adapts graph-traversal results into a practical, efficient algorithm for evaluating regular and linear recursive queries over databases restricted to binary relations. Gives transformations that reduce a subset of regular/linear n-ary recursive queries to binary form. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
803
Venue
PODS
Year
1987
Pagerank
6.5469939e-05
Overall Rank
3,999 | 72.19%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
1,444 Finding Regular Simple Paths in Graph Databases 1989 VLDB 0.00011946075
2,474 Graph-Theoretic Methods In Database Theory 1990 PODS 8.7135761e-05
7,156 Counting Methods for Cyclic Relations 1988 PODS 4.8145046e-05
12,796 Magic Factoring of Closure Programs (Extended Abstract) 1995 PODS 4.1945683e-05
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