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
h7a7ce5624463d1bd
Venue
SIGMOD
Year
2021
Pagerank
6.7927568e-05
Overall Rank
4,123 | 72.29%
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 26 of 26 citing papers.

Rank Citing Paper Year Venue Pagerank
2,634 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1993804e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
4,511 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5681258e-05
5,558 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 6.0850942e-05
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
7,939 GraphINC: Graph Pattern Mining at Network Speed 2023 SIGMOD 5.4223464e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
9,659 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 5.1453267e-05
9,715 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1359137e-05
10,127 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 5.0751052e-05
10,253 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.050482e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,258 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.050482e-05
10,420 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9793485e-05
10,485 Nucleus Decomposition Revisited: An Efficient Counting-Based Approach 2026 SIGMOD 4.9793485e-05
10,571 Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine 2026 SIGMOD 4.9793485e-05
10,675 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 4.9793485e-05
10,734 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9793485e-05
10,740 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9793485e-05
10,788 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9793485e-05
11,053 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9793485e-05
11,056 Efficient Temporal Edge-Core Maintenance in Streaming Graphs 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,535 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 4.9793485e-05
11,546 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 4.9793485e-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
156 Multiprocessor Hash-Based Join Algorithms 1985 VLDB 0.00028522117
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026700508
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024884544
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.000235107
249 A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment 1989 SIGMOD 0.00023175253
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
443 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018197688
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
725 Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization 1991 SIGMOD 0.00014465736
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,046 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012319866
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
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,222 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011463714
1,249 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011340141
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010197978
2,020 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1729558e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0476814e-05
2,166 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9334874e-05
2,518 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 8.3533785e-05
2,824 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9698957e-05
3,880 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9510799e-05
4,634 Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020 VLDB 6.4933103e-05
4,858 Association Rules with Graph Patterns 2015 VLDB 6.3793644e-05
5,396 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.1494643e-05
Previous Page 1 / 1 Next

Semantically Similar Papers