Database Paper Browser

Back to papers

Handling Redundancy in the Processing of Recursive Database Queries

Summary: Redundancy in recursive query processing: four levels. Techniques: subexpr sharing, frontier-based counting, tuple merge/filter, and level-relaxed I/O, yielding substantial redundancy reductions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2332
Venue
SIGMOD
Year
1987
Pagerank
5.9639609e-05
Overall Rank
4,732 | 67.09%
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
3,553 Compiling Separable Recursions 1988 SIGMOD 6.9779134e-05
7,156 Counting Methods for Cyclic Relations 1988 PODS 4.8145046e-05
9,112 Optimizing Recursive Queries in SQL 2005 SIGMOD 4.3942347e-05
10,404 Dynamic Pruning for Recursive Joins 2025 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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