DBScholar

Back to papers

Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation

Summary: ALLEY blends sampling and synopses for graph-pattern cardinality estimation. It introduces random-walk-with-intersection sampling, variance-reducing branching, and mined tangled-pattern synopses to deliver unbiased online estimates with worst-case optimal runtime and accuracy guarantees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h43ed53a78206ec91
Venue
SIGMOD
Year
2021
Pagerank
6.0067263e-05
Overall Rank
5,717 | 61.68%
DOI
10.1145/3448016.3457246

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kim_sigmod21,
        title = {{Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation}},
        author = {Kim, Kyoungmin and Fletcher, George and Kim, Hyeonji and Han, Wook-Shin},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3457246},
        url = {https://dl.acm.org/doi/10.1145/3448016.3457246},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 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
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026634326
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
381 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019497061
397 Worst-case Optimal Join Algorithms 2012 PODS 0.0001911958
467 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017740891
594 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015814493
689 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.00014725904
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
752 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014234789
793 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013903938
919 Estimating the Selectivity of XML Path Expressions for Internet Scale Applications 2001 VLDB 0.00013042589
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,031 GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph 2014 VLDB 0.00012379698
1,049 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012293903
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,444 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010616242
1,935 Consistently Estimating the Selectivity of Conjuncts of Predicates 2005 VLDB 9.3407959e-05
2,829 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9469964e-05
4,835 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3793473e-05
Previous Page 1 / 1 Next

Semantically Similar Papers