Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins

Summary: Cost-based optimizer for subgraph queries with worst-case optimal plans, enabling hybrid plans that mix binary joins and multiway intersections. Introduces intersection-cost, expands plan space beyond tree decompositions, and adds adaptive reordering during execution in Graphflow DBMS. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h35a4dd0f128c0179
Venue: VLDB
Year: 2019
Pagerank: 0.00014622696
Overall Rank: 706 | 95.27%
DOI: 10.14778/3342263.3342643
PDF: Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

1. Amine Mhedhbi (University of Waterloo)
2. Semih Salihoglu (University of Waterloo)

BibTeX Citation

@article{mhedhbi_vldb19,
        title = {{Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins}},
        author = {Mhedhbi, Amine and Salihoglu, Semih},
        journal = {PVLDB},
        series = {{VLDB} '19},
        volume = {12},
        number = {11},
        pages = {1692--1704},
        doi = {10.14778/3342263.3342643},
        url = {https://doi.org/10.14778/3342263.3342643},
        year = {2019}
}

Incoming Citations (Sorted by Pagerank)

Showing 17 of 67 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,689	An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis]	2026	SIGMOD	4.9605343e-05
10,747	R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization	2026	SIGMOD	4.9605343e-05
10,781	TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics	2026	VLDB	4.9605343e-05
10,805	CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination	2026	VLDB	4.9605343e-05
10,839	One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans	2026	VLDB	4.9605343e-05
10,859	Subgraph Enumeration: Beyond Tree Decomposition	2026	VLDB	4.9605343e-05
10,873	BaCon: Efficient Batch Processing of Counting Queries	2026	VLDB	4.9605343e-05
10,888	A Unified Query Planning Framework for Conjunctive Regular Path Queries	2026	VLDB	4.9605343e-05
10,924	Worst-Case Optimal BGPs on Temporal Graphs	2026	VLDB	4.9605343e-05
10,952	Efficient GPU-Accelerated Local Subgraph Counting	2026	VLDB	4.9605343e-05
11,059	Aquila: A High-Concurrency System for Incremental Graph Query	2026	VLDB	4.9605343e-05
11,270	cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns	2025	SIGMOD	4.9605343e-05
11,590	Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching	2024	SIGMOD	4.9605343e-05
11,601	Towards a Converged Relational-Graph Optimization Framework	2024	SIGMOD	4.9605343e-05
11,659	KGFabric: A Scalable Knowledge Graph Warehouse for Enterprise Data Interconnection	2024	VLDB	4.9605343e-05
12,034	Vertex-centric Parallel Computation of SQL Queries	2021	SIGMOD	4.9605343e-05
12,145	IDAR: Fast Supergraph Search Using DAG Integration	2020	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
15	How Good Are Query Optimizers, Really?	2016	VLDB	0.00061463175
176	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00026634326
208	EmptyHeaded: A Relational Engine for Graph Processing	2016	SIGMOD	0.00024929198
397	Worst-case Optimal Join Algorithms	2012	PODS	0.0001911958
439	Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism	2008	VLDB	0.00018247958
467	Design and Implementation of the LogicBlox System	2015	SIGMOD	0.00017740891
658	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00015032442
734	Graph Indexing: Tree + Delta >= Graph	2007	VLDB	0.00014334121
919	Estimating the Selectivity of XML Path Expressions for Internet Scale Applications	2001	VLDB	0.00013042589
1,046	Parallel Subgraph Listing in a Large-Scale Graph	2014	SIGMOD	0.00012315969
1,049	Graphflow: An Active Graph Database	2017	SIGMOD	0.00012293903
1,185	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD	0.00011586181
1,253	Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows	2018	VLDB	0.00011316982
1,296	From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System	2015	SIGMOD	0.00011119184
1,417	A Distributed Graph Engine for Web Scale RDF Data	2013	VLDB	0.00010706533
1,879	Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs	2014	VLDB	9.4293777e-05
2,023	Scalable Distributed Subgraph Enumeration	2017	VLDB	9.1568397e-05
4,357	Algorithmic Aspects of Parallel Query Processing	2018	SIGMOD	6.6290396e-05
7,184	SPARTex: A Vertex-Centric Framework for RDF Data Analytics	2015	VLDB	5.5753492e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,188	Efficient Query Re-optimization with Judicious Subquery Selections	2023	SIGMOD
2	2,739	Weighted Hypertree Decompositions and Optimal Query Plans	2004	PODS
3	8,677	Hybrid Mixed Integer Linear Programming for Large-Scale Join Order Optimisation	2026	VLDB
4	144	Optimization of Nonrecursive Queries	1986	VLDB
5	2,151	Optimization of Multi-Way Join Queries for Parallel Execution	1991	VLDB
6	1,185	Adaptive Optimization of Very Large Join Queries	2018	SIGMOD
7	318	Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems	2018	PODS
8	3,807	Query Simplification: Graceful Degradation for Join-Order Optimization	2009	SIGMOD
9	10,585	Succinct Structure Representations for Efficient Query Optimization	2026	SIGMOD
10	1,603	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB