HyperX: A Scalable Hypergraph Framework

doi:10.1109/TKDE.2018.2848257

HyperX: A Scalable Hypergraph Framework

2019-05-01

20

PRE

AI

DOI：10.1109/TKDE.2018.2848257

Original

Original request for help

Save

Abstract

En 中文

Hypergraphs are generalizations of graphs where the (hyper) edges can connect any number of vertices. They are powerful tools for representing complex and non-pairwise relationships. However, existing graph computation frameworks cannot accommodate hypergraphs without converting them into graphs, because they do not offer APIs that support (hyper) edges directly. This graph conversion may create excessive replicas and result in very large graphs, causing difficulties in workload balancing. A few tools have been developed for hypergraph partitioning, but they are not general-purpose frameworks for hypergraph processing. In this paper, we propose HyperX, a general-purpose distributed hypergraph processing framework built on top of Spark. HyperX is based on the computation paradigm Pregel, which is user-friendly and has been widely adopted by popular graph computation frameworks. To help create balanced workloads for distributed hypergraph processing, we further investigate the hypergraph partitioning problem and propose a novel label propagation partitioning (LPP) algorithm. We conduct extensive experiments using both real and synthetic data. The result shows that HyperX achieves an order of magnitude improvement for running hypergraph learning algorithms compared with graph conversion based approaches in terms of running time, network communication costs, and memory consumption. For hypergraph partitioning, LPP outperforms the baseline algorithms significantly in these measures as well.

Keywords:

Hypergraph

HyperX

graph framework

graph partitioning

label propagation partitioning

HyperX: A Scalable Hypergraph Framework

Abstract

AI Summary

Journal

Organization