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
hf45d08d8f905c6d7
Venue
VLDB
Year
2024
Pagerank
6.1361195e-05
Overall Rank
5,422 | 63.55%
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 8 of 8 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
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.000235107
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
386 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019444411
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
596 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015785583
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
750 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014265196
795 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013938779
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,634 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1993804e-05
2,824 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9698957e-05
2,985 Motivo: fast motif counting via succinct color coding and adaptive sampling 2019 VLDB 7.7808773e-05
3,160 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.5807496e-05
4,817 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3985024e-05
5,901 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9539374e-05
Previous Page 1 / 1 Next

Semantically Similar Papers