Database Paper Browser

Back to papers

Towards a Converged Relational-Graph Optimization Framework

Summary: RelGo: a converged relational-graph optimizer for SPJM queries (SQL/PGQ) that adds a graph-pattern matcher to SPJ. Shows graph-agnostic plans miss graph-specific gains; on DuckDB, RelGo yields ~21.9x speedups on standard benchmarks. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6999
Venue
SIGMOD
Year
2024
Pagerank
4.1905499e-05
Overall Rank
10,997 | 23.58%
DOI
10.1145/3698828

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
9,791 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 4.2777144e-05
9,845 Path-centric Cardinality Estimation for Subgraph Matching 2025 VLDB 4.2680295e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 26 of 26 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059446482
144 Optimization of Nonrecursive Queries 1986 VLDB 0.00041430126
341 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026850764
454 An Overview of Query Optimization in Relational Systems 1998 PODS 0.00022796106
616 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00019068362
728 Optimizing Queries Using Materialized Views: A Practical, Scalable Solution 2001 SIGMOD 0.00017459654
729 Umbra: A Disk-Based System with In-Memory Performance 2020 CIDR 0.00017448059
749 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017193776
941 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015147831
1,125 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013829006
1,334 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012543633
1,948 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9938634e-05
2,172 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.37776e-05
2,281 Adopting Worst-Case Optimal Joins in Relational Database Systems 2020 VLDB 9.122455e-05
2,962 Kuzu* Graph Database Management System 2023 CIDR 7.8069285e-05
3,644 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 6.8842065e-05
4,189 On the Complexity of Approximate Query Optimization 2002 PODS 6.3681294e-05
4,554 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0839934e-05
5,002 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 5.7610359e-05
5,334 Fast In-Memory SQL Analytics on Typed Graphs 2017 VLDB 5.5625443e-05
6,294 Free Join: Unifying Worst-Case Optimal and Traditional Joins 2023 SIGMOD 5.1202075e-05
7,021 DuckPGQ: Bringing SQL/PGQ to DuckDB 2023 VLDB 4.8546368e-05
7,340 Weighted Distinct Sampling: Cardinality Estimation for SPJ Queries 2021 SIGMOD 4.7526052e-05
8,149 Efficiently Computing Join Orders with Heuristic Search 2023 SIGMOD 4.5715614e-05
8,257 DuckPGQ: Efficient Property Graph Queries in an analytical RDBMS 2023 CIDR 4.5437589e-05
8,487 Making RDBMSs Efficient on Graph Workloads Through Predefined Joins 2022 VLDB 4.4953604e-05
Previous Page 1 / 1 Next

Semantically Similar Papers