Database Paper Browser

Back to papers

A Learned Sketch for Subgraph Counting

Summary: Active Learned Sketch for Subgraph Counting (ALSS) fuses a neural regression sketch with an active-learning loop to update on new query graphs. Targets large labeled graphs, enabling accurate, scalable subgraph counting and aiding optimizers for multi-way self-joins. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6181
Venue
SIGMOD
Year
2021
Pagerank
6.7691344e-05
Overall Rank
3,781 | 73.73%
DOI
10.1145/3448016.3457289

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
2,988 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 7.7752463e-05
3,370 Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed 2022 VLDB 7.1645471e-05
3,756 Computing Graph Edit Distance via Neural Graph Matching 2023 VLDB 6.781373e-05
4,431 Lightweight and Accurate Cardinality Estimation by Neural Network Gaussian Process 2022 SIGMOD 6.1870601e-05
6,288 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 5.1226099e-05
6,715 Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks 2024 SIGMOD 4.9464666e-05
7,731 Double-Anonymous Sketch: Achieving Top-K-fairness for Finding Global Top-K Frequent Items 2023 SIGMOD 4.6612382e-05
7,936 Fast Local Subgraph Counting 2024 VLDB 4.6089395e-05
7,939 Machine Learning for Subgraph Extraction: Methods, Applications and Challenges 2023 VLDB 4.6089395e-05
8,072 Computing Approximate Graph Edit Distance via Optimal Transport 2025 SIGMOD 4.5890162e-05
9,041 TreeSensing: Linearly Compressing Sketches with Flexibility 2023 SIGMOD 4.3997447e-05
9,649 Inductive Attributed Community Search: to Learn Communities across Graphs 2024 VLDB 4.3067693e-05
9,727 SPACE: Cardinality Estimation for Path Queries Using Cardinality-Aware Sequence-based Learning 2025 SIGMOD 4.2901665e-05
9,845 Path-centric Cardinality Estimation for Subgraph Matching 2025 VLDB 4.2680295e-05
10,096 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 4.1905499e-05
10,163 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.1905499e-05
10,631 Efficient and Adaptive Estimation of Local Triadic Coefficients 2025 VLDB 4.1905499e-05
10,640 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.1905499e-05
10,951 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 28 of 28 cited papers.

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

Rank Cited Paper Year Venue Pagerank
71 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059446482
203 Learned Cardinalities: Estimating Correlated Joins with Deep Learning 2019 CIDR 0.00034868567
341 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026850764
460 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022679846
606 DeepDB: Learn from Data, not from Queries! 2020 VLDB 0.00019251186
616 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00019068362
752 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.00017138049
804 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001643674
941 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015147831
1,125 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013829006
1,194 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00013411666
1,239 Selectivity Estimation for Range Predicates using Lightweight Models 2019 VLDB 0.00013091459
1,322 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012595941
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,452 What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another? 2017 PODS 0.00011922523
1,522 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.0001152219
1,528 Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank 2020 VLDB 0.00011489661
1,715 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010776518
1,906 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010135267
1,948 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9938634e-05
2,143 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 9.4437798e-05
2,364 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 8.955077e-05
2,494 DBEst: Revisiting Approximate Query Processing Engines with Machine Learning Models 2019 SIGMOD 8.6457436e-05
2,971 Estimating Join Selectivities using Bandwidth-Optimized Kernel Density Models 2017 VLDB 7.7935535e-05
3,144 Active Learning for ML Enhanced Database Systems 2020 SIGMOD 7.4844943e-05
3,412 Motivo: fast motif counting via succinct color coding and adaptive sampling 2019 VLDB 7.1194524e-05
3,644 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 6.8842065e-05
Previous Page 1 / 1 Next

Semantically Similar Papers