DBScholar

Back to papers

Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach

Summary: FaSTest prunes candidate isomorphic embeddings via aggressive structural filtering and employs adaptive tree sampling for low-variance subgraph cardinality estimates. Adds a worst-case optimal stratified sampler for hard instances; shows up to 100× (sampling) and 1000× (GNN) accuracy gains on real graphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13597
Venue
VLDB
Year
2024
Pagerank
6.0334209e-05
Overall Rank
5,942 | 59.24%
DOI
10.14778/3654621.3654635

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{shin_vldb24,
        title = {{Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach}},
        author = {Shin, Wonseok and Song, Siwoo and Park, Kunsoo and Han, Wook-Shin},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {7},
        pages = {1697--1709},
        doi = {10.14778/3654621.3654635},
        url = {https://doi.org/10.14778/3654621.3654635},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

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
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
593 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00016027871
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
737 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014490983
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-05
2,940 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9381573e-05
3,028 Motivo: fast motif counting via succinct color coding and adaptive sampling 2019 VLDB 7.8349117e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
4,748 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.5251089e-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
Previous Page 1 / 1 Next

Semantically Similar Papers