Corpus ID: 232380353

HUGE: An Efficient and Scalable Subgraph Enumeration System

@article{Yang2021HUGEAE,
  title={HUGE: An Efficient and Scalable Subgraph Enumeration System},
  author={Zhengyi Yang and Longbin Lai and Xuemin Lin and Kongzhang Hao and Wenjie Zhang},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.14294}
}
  • Zhengyi Yang, Longbin Lai, +2 authors Wenjie Zhang
  • Published 2021
  • Computer Science
  • ArXiv
Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all instances of a given query graph on a large data graph. In this paper, we propose a system called HUGE to efficiently process subgraph enumeration at scale in the distributed context. HUGE features 1) an optimiser to compute an advanced execution plan without the constraints of existing works; 2) a hybrid communication layer that supports both pushing and pulling communication; 3) a novel two-stage… Expand

References

SHOWING 1-10 OF 81 REFERENCES
Scalable Distributed Subgraph Enumeration
  • 46
  • PDF
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine
  • 40
  • PDF
Scalable Subgraph Enumeration in MapReduce
  • 71
  • PDF
Parallel subgraph listing in a large-scale graph
  • 79
  • Highly Influential
  • PDF
Efficient Subgraph Matching on Billion Node Graphs
  • 319
  • PDF
Shared Memory Parallel Subgraph Enumeration
  • 8
  • PDF
BENU: Distributed Subgraph Enumeration with Backtracking-Based Framework
  • 7
  • Highly Influential
Efficient Parallel Subgraph Enumeration on a Single Machine
  • 10
PGX.ISO: Parallel and Efficient In-Memory Engine for Subgraph Isomorphism
  • 20
  • PDF
G-Miner: an efficient task-oriented graph mining system
  • 38
  • PDF
...
1
2
3
4
5
...