DBScholar

Back to papers

Neural Subgraph Counting with Wasserstein Estimator

Summary: NeurSC: an approximate subgraph counting algorithm with two components: an extraction module and a Wasserstein estimator WEst. It deploys a Wasserstein discriminator to align query and data graphs, enabling robust, scalable estimation on large real graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hf9f848e23ff3be4c
Venue
SIGMOD
Year
2022
Pagerank
8.1993804e-05
Overall Rank
2,634 | 82.30%
DOI
10.1145/3514221.3526163

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{wang_sigmod22,
        title = {{Neural Subgraph Counting with Wasserstein Estimator}},
        author = {Wang, Hanchen and Hu, Rong and Zhang, Ying and Qin, Lu and Wang, Wei and Zhang, Wenjie},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3526163},
        url = {https://dl.acm.org/doi/10.1145/3514221.3526163},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 19 of 19 citing papers.

Rank Citing Paper Year Venue Pagerank
3,453 Computing Graph Edit Distance via Neural Graph Matching 2023 VLDB 7.2904632e-05
5,422 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1361195e-05
5,998 Neural Attributed Community Search at Billion Scale 2023 SIGMOD 5.9198696e-05
6,469 Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks 2024 SIGMOD 5.7743636e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
7,708 Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods 2025 VLDB 5.4718627e-05
8,231 Computing Approximate Graph Edit Distance via Optimal Transport 2025 SIGMOD 5.3722895e-05
8,333 Machine Learning for Subgraph Extraction: Methods, Applications and Challenges 2023 VLDB 5.3527996e-05
8,990 Efficient Unsupervised Community Search with Pre-trained Graph Transformer 2024 VLDB 5.2421474e-05
9,073 Machine Learning for Graph Data Management and Query Processing 2025 VLDB 5.2283159e-05
9,650 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.1453267e-05
9,797 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1257999e-05
9,864 Deep Overlapping Community Search via Subspace Embedding 2025 SIGMOD 5.1176637e-05
9,962 Inductive Attributed Community Search: to Learn Communities across Graphs 2024 VLDB 5.1038322e-05
10,215 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.0584922e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,882 Efficient GPU-Accelerated Local Subgraph Counting 2026 VLDB 4.9793485e-05
11,286 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9793485e-05
11,711 Prerequisite-driven Fair Clustering on Heterogeneous Information Networks 2023 SIGMOD 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 30 of 30 cited papers.

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

Rank Cited Paper Year Venue Pagerank
15 How Good Are Query Optimizers, Really? 2016 VLDB 0.00061066921
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
386 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019444411
406 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.00019045544
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
461 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.00017829982
466 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017773029
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
512 NeuroCard: One Cardinality Estimator for All Tables 2021 VLDB 0.00017050173
596 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015785583
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
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,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,465 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010576304
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
1,580 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 0.00010180835
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-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,052 A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimation 2021 SIGMOD 7.7052471e-05
3,160 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.5807496e-05
4,123 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7927568e-05
4,688 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 6.4697463e-05
8,276 Consistent and Flexible Selectivity Estimation for High-Dimensional Data 2021 SIGMOD 5.3641556e-05
Previous Page 1 / 1 Next

Semantically Similar Papers