DBScholar

Back to papers

G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching

Summary: Introduces G-CARE, a unified framework to realize and benchmark all existing cardinality-estimation techniques for subgraph matching on graph and relational DBs. Evaluation on RDF and non-RDF graphs shows widespread inaccuracies in prior methods; a simple online-aggregation sampling approach consistently outperforms them. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5979
Venue
SIGMOD
Year
2020
Pagerank
7.9381573e-05
Overall Rank
2,940 | 79.84%
DOI
10.1145/3318464.3389702

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{park_sigmod20,
        title = {{G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching}},
        author = {Park, Yeonsu and Ko, Seongyun and Bhowmick, Sourav S and Kim, Kyoungmin and Hong, Kijae and Han, Wook-Shin},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3389702},
        url = {https://dl.acm.org/doi/10.1145/3318464.3389702},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 24 of 24 citing papers.

Rank Citing Paper Year Venue Pagerank
1,122 Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation 2022 VLDB 0.0001209124
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-05
2,991 FactorJoin: A New Cardinality Estimation Framework for Join Queries 2023 SIGMOD 7.8880723e-05
3,070 Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs 2022 VLDB 7.7900444e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
5,938 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 6.0343238e-05
5,942 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.0334209e-05
6,325 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9125893e-05
6,341 Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks 2024 SIGMOD 5.9068986e-05
6,704 ASM: Harmonizing Autoregressive Model, Sampling, and Multi-dimensional Statistics Merging for Cardinality Estimation 2024 SIGMOD 5.797374e-05
8,513 Galley: Modern Query Optimization for Sparse Tensor Programs 2025 SIGMOD 5.4119882e-05
9,867 SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning 2025 SIGMOD 5.2043672e-05
9,996 Path-centric Cardinality Estimation for Subgraph Matching 2025 VLDB 5.1814573e-05
10,027 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.1745962e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,488 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,763 Rule-Based Graph Cleaning with GPUs on a Single Machine 2025 SIGMOD 5.093636e-05
10,919 X-Blossom: Massive Parallelization of Graph Maximum Matching 2025 VLDB 5.093636e-05
11,072 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.093636e-05
11,165 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.093636e-05
11,205 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 27 of 27 cited papers.

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

Rank Cited Paper Year Venue Pagerank
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
232 LinkBench: a Database Benchmark Based on the Facebook Social Graph 2013 SIGMOD 0.00023830978
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
366 Scalable Semantic Web Data Management Using Vertical Partitioning 2007 VLDB 0.00020039981
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
426 The LDBC Social Network Benchmark: Interactive Workload 2015 SIGMOD 0.00018692185
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
492 Robust Query Processing through Progressive Optimization 2004 SIGMOD 0.0001756877
530 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.0001709169
593 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00016027871
737 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014490983
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
900 G-CORE: A Core for Future Graph Query Languages 2018 SIGMOD 0.00013337186
944 RDF-3X: a RISC-style Engine for RDF 2008 VLDB 0.00013067088
1,109 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00012142685
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,499 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010564536
1,536 Improved Selectivity Estimation by Combining Knowledge from Sampling and Synopses 2018 VLDB 0.00010460864
1,664 Two-Level Sampling for Join Size Estimation 2017 SIGMOD 0.00010070362
1,865 An Experimental Comparison of Partitioning Strategies in Distributed Graph Processing 2017 VLDB 9.5915721e-05
3,362 Experimental Analysis of Streaming Algorithms for Graph Partitioning 2019 SIGMOD 7.4833791e-05
3,477 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.3791229e-05
4,025 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.947875e-05
4,706 Calibrating the Query Optimizer Cost Model of IRO-DB, an Object-Oriented Federated Database System 1996 VLDB 6.5525364e-05
7,447 Experimental Analysis of Distributed Graph Systems 2018 VLDB 5.6149936e-05
8,582 RBench: Application-Specific RDF Benchmarking 2015 SIGMOD 5.4081423e-05
9,682 Graph Data Models, Query Languages and Programming Paradigms 2018 VLDB 5.2353888e-05
Previous Page 1 / 1 Next

Semantically Similar Papers