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
6535
Venue
SIGMOD
Year
2022
Pagerank
8.1959181e-05
Overall Rank
2,731 | 81.27%
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 18 of 18 citing papers.

Rank Citing Paper Year Venue Pagerank
3,423 Computing Graph Edit Distance via Neural Graph Matching 2023 VLDB 7.4260662e-05
5,877 Neural Attributed Community Search at Billion Scale 2023 SIGMOD 6.0551011e-05
5,942 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.0334209e-05
6,341 Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks 2024 SIGMOD 5.9068986e-05
7,601 Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods 2025 VLDB 5.5866563e-05
8,126 Computing Approximate Graph Edit Distance via Optimal Transport 2025 SIGMOD 5.4827332e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
8,256 Machine Learning for Subgraph Extraction: Methods, Applications and Challenges 2023 VLDB 5.4574671e-05
8,821 Efficient Unsupervised Community Search with Pre-trained Graph Transformer 2024 VLDB 5.3624668e-05
9,617 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.2434488e-05
9,688 Deep Overlapping Community Search via Subspace Embedding 2025 SIGMOD 5.2351259e-05
9,782 Inductive Attributed Community Search: to Learn Communities across Graphs 2024 VLDB 5.2209769e-05
10,027 Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation 2025 VLDB 5.1745962e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,885 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 5.093636e-05
11,067 Machine Learning for Graph Data Management and Query Processing 2025 VLDB 5.093636e-05
11,165 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.093636e-05
11,396 Prerequisite-driven Fair Clustering on Heterogeneous Information Networks 2023 SIGMOD 5.093636e-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
18 How Good Are Query Optimizers, Really? 2016 VLDB 0.00059284255
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
401 Deep Unsupervised Cardinality Estimation 2020 VLDB 0.00019092557
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
465 An End-to-End Learning-based Cost Estimator 2020 VLDB 0.0001803934
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
490 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.000175757
513 NeuroCard: One Cardinality Estimator for All Tables 2021 VLDB 0.00017190574
593 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00016027871
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
737 Join Size Estimation Subject to Filter Conditions 2015 VLDB 0.00014490983
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,499 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010564536
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
1,573 Deep Learning Models for Selectivity Estimation of Multi-Attribute Queries 2020 SIGMOD 0.00010328171
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,940 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9381573e-05
3,028 Motivo: fast motif counting via succinct color coding and adaptive sampling 2019 VLDB 7.8349117e-05
3,086 A Unified Deep Model of Learning from both Data and Queries for Cardinality Estimation 2021 SIGMOD 7.7708642e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,617 Learned Cardinality Estimation for Similarity Queries 2021 SIGMOD 6.604437e-05
8,124 Consistent and Flexible Selectivity Estimation for High-Dimensional Data 2021 SIGMOD 5.4829513e-05
Previous Page 1 / 1 Next

Semantically Similar Papers