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)
Incoming Non-self Citations Over Time
Authors
- 1. Zhengyi Yang
- 2. Longbin Lai
- 3. Xuemin Lin
- 4. Kongzhang Hao
- 5. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 23 of 23 citing papers.
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,674 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 4.677258e-05 |
| 1,487 | Parallel Subgraph Listing in a Large-Scale Graph | 2014 | SIGMOD | 0.00011691164 |
| 4,834 | Systems for Big-Graphs | 2014 | VLDB | 5.8867916e-05 |
| 648 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018688754 |
| 1,921 | Selecting Subexpressions to Materialize at Datacenter Scale | 2018 | VLDB | 0.00010085899 |
| 1,948 | Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows | 2018 | VLDB | 9.9938634e-05 |
| 3,488 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 7.0460627e-05 |
| 2,799 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD | 8.109137e-05 |
| 9,086 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 4.3947639e-05 |
| 5,809 | Fast and Robust Distributed Subgraph Enumeration | 2019 | VLDB | 5.3175972e-05 |