DBScholar

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
3757
Venue
SIGMOD
Year
2005
Pagerank
5.3090815e-05
Overall Rank
9,173 | 37.07%
DOI
10.1145/1066157.1066260

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ordonez_sigmod05,
        title = {{Optimizing Recursive Queries in SQL}},
        author = {Ordonez, Carlos},
        series = {{SIGMOD} '05},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1066157.1066260},
        url = {https://dl.acm.org/doi/10.1145/1066157.1066260},
        year = {2005}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
7,891 Adaptive Optimizations of Recursive Queries in Teradata 2012 SIGMOD 5.5211516e-05
10,690 Dynamic Pruning for Recursive Joins 2025 SIGMOD 5.093636e-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