Database Paper Browser

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
6138
Venue
SIGMOD
Year
2021
Pagerank
4.9507418e-05
Overall Rank
6,705 | 53.41%
DOI
10.1145/3448016.3457246

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 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
202 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00034881375
341 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026850764
503 Worst-case Optimal Join Algorithms 2012 PODS 0.00021517145
610 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00019204048
627 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00018959896
941 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015147831
1,045 Estimating the Selectivity of XML Path Expressions for Internet Scale Applications 2001 VLDB 0.00014451072
1,095 GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph 2014 VLDB 0.00014103799
1,104 Cardinality Estimation Done Right: Index-Based Join Sampling 2017 CIDR 0.0001398479
1,194 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00013411666
1,334 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012543633
1,372 Random Sampling over Joins Revisited 2018 SIGMOD 0.0001233325
1,522 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.0001152219
1,746 Graphflow: An Active Graph Database 2017 SIGMOD 0.0001069135
1,906 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010135267
2,143 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 9.4437798e-05
2,359 Consistently Estimating the Selectivity of Conjuncts of Predicates 2005 VLDB 8.967267e-05
3,644 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 6.8842065e-05
5,871 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 5.2912806e-05
Previous Page 1 / 1 Next

Semantically Similar Papers