Database Paper Browser

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
6128
Venue
SIGMOD
Year
2021
Pagerank
5.761237e-05
Overall Rank
5,009 | 65.16%
DOI
10.1145/3448016.3457237

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 23 of 23 citing papers.

Rank Citing Paper Year Venue Pagerank
3,001 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 7.7404487e-05
5,728 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 5.3507988e-05
5,773 I/O-Efficient Butterfly Counting at Scale 2023 SIGMOD 5.3319911e-05
6,281 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 5.128862e-05
7,934 Fast Local Subgraph Counting 2024 VLDB 4.613363e-05
8,031 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 4.6018906e-05
8,273 GraphINC: Graph Pattern Mining at Network Speed 2023 SIGMOD 4.5450209e-05
9,330 Parallel Query Processing: To Separate Communication from Computation 2022 SIGMOD 4.3556432e-05
9,518 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 4.3328897e-05
9,788 A Modular Graph-Native Query Optimization Framework 2025 SIGMOD 4.2818172e-05
10,014 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 4.1945683e-05
10,082 Gem: Scalable Monotonic Graph Processing Beyond Billion-Scale on a Single Machine 2026 SIGMOD 4.1945683e-05
10,131 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 4.1945683e-05
10,199 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 4.1945683e-05
10,264 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.1945683e-05
10,270 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.1945683e-05
10,308 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.1945683e-05
10,311 Efficient Temporal Edge-Core Maintenance in Streaming Graphs 2026 VLDB 4.1945683e-05
10,632 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.1945683e-05
10,708 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 4.1945683e-05
10,733 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 4.1945683e-05
10,979 Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching 2024 SIGMOD 4.1945683e-05
10,994 Towards a Converged Relational-Graph Optimization Framework 2024 SIGMOD 4.1945683e-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
78 Multiprocessor Hash-Based Join Algorithms 1985 VLDB 0.00056413752
203 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00034889335
232 A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment 1989 SIGMOD 0.00032122485
331 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00027214222
342 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026795977
461 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022499343
506 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021475362
612 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.0001920234
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
764 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017018712
813 Left-Deep Vs. Bushy Trees: An Analysis Of Strategy Spaces And Its Implications For Query Optimization 1991 SIGMOD 0.0001639584
1,180 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013456907
1,333 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012523806
1,484 Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks 2019 VLDB 0.00011714263
1,500 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00011674394
1,561 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00011358946
1,635 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001105793
1,756 Graphflow: An Active Graph Database 2017 SIGMOD 0.00010664542
1,775 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010602927
1,924 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010077055
1,953 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9665955e-05
2,162 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 9.3964337e-05
2,801 Scalable Distributed Subgraph Enumeration 2017 VLDB 8.0992955e-05
2,910 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 7.9266529e-05
2,997 Subgraph Matching: on Compression and Computation 2018 VLDB 7.7559339e-05
3,215 Fractal: A General-Purpose Graph Pattern Mining System 2019 SIGMOD 7.3645742e-05
3,646 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 6.8853079e-05
4,205 Association Rules with Graph Patterns 2015 VLDB 6.3597474e-05
4,534 Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice 2020 VLDB 6.1049756e-05
4,556 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.0883757e-05
5,811 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 5.317401e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
7,675 Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale 2022 VLDB 4.6817479e-05
1,500 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00011674394
4,830 Systems for Big-Graphs 2014 VLDB 5.8924342e-05
651 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018648572
1,922 Selecting Subexpressions to Materialize at Datacenter Scale 2018 VLDB 0.00010082599
1,953 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9665955e-05
3,641 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 6.8884895e-05
2,910 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 7.9266529e-05
9,089 Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs 2024 SIGMOD 4.39898e-05
5,811 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 5.317401e-05