DBScholar

Back to papers

HUGE: An Efficient and Scalable Subgraph Enumeration System

Summary: HUGE is a scalable distributed subgraph-enumeration system. Key ideas: optimiser, hybrid push/pull communication, 2-stage lock-free cache, BFS/DFS-adaptive scheduling, and two-layer load balancing—plug-in with existing subgraph algorithms for bounded-memory speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6190
Venue
SIGMOD
Year
2021
Pagerank
6.8628196e-05
Overall Rank
4,158 | 71.48%
DOI
10.1145/3448016.3457237

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{yang_sigmod21,
        title = {{HUGE: An Efficient and Scalable Subgraph Enumeration System}},
        author = {Yang, Zhengyi and Lai, Longbin and Lin, Xuemin and Hao, Kongzhang and Zhang, Wenjie},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3457237},
        url = {https://dl.acm.org/doi/10.1145/3448016.3457237},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Rank Citing Paper Year Venue Pagerank
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-05
4,563 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6291459e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
5,427 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.2230767e-05
7,150 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.687428e-05
8,179 GraphINC: Graph Pattern Mining at Network Speed 2023 SIGMOD 5.472762e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
9,478 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.2634238e-05
9,532 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.2537948e-05
9,693 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2351259e-05
9,942 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.1915905e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,273 Nucleus Decomposition Revisited: An Efficient Counting-Based Approach 2026 SIGMOD 5.093636e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,373 Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,488 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,606 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 5.093636e-05
10,609 Efficient Temporal Edge-Core Maintenance in Streaming Graphs 2026 VLDB 5.093636e-05
10,885 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
11,192 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 5.093636e-05
11,205 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 31 of 31 cited papers.

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

Rank Cited Paper Year Venue Pagerank
152 Multiprocessor Hash-Based Join Algorithms 1985 VLDB 0.00029038365
177 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00027100548
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
242 A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment 1989 SIGMOD 0.00023604323
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
708 Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization 1991 SIGMOD 0.00014727576
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,036 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012499878
1,058 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012378784
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,211 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011648789
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,246 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011504088
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,119 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.141144e-05
2,187 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9966682e-05
2,522 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.4713567e-05
2,940 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9381573e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
4,551 Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020 VLDB 6.6355948e-05
4,832 Association Rules with Graph Patterns 2015 VLDB 6.4877e-05
5,296 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.2782852e-05
Previous Page 1 / 1 Next

Semantically Similar Papers