Database Paper Browser

Back to papers

Optimizing Recursive Queries in SQL

Summary: Optimizes linear recursive SQL queries (transitive closure) via three techniques: early selection evaluation, elimination of duplicates in intermediates, and a specialized index for joins. Evaluations on binary trees and sparse graphs show notable reductions in recursive query time for graph workloads. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3695
Venue
SIGMOD
Year
2005
Pagerank
4.3942347e-05
Overall Rank
9,112 | 36.61%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
7,863 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 4.6328993e-05
10,404 Dynamic Pruning for Recursive Joins 2025 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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