Corpus ID: 232168856

Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments

  title={Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments},
  author={Fatih Tasyaran and Berkay Demireller and Kamer Kaya and Bora Uçar},
Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently used to model such data. For many of today’s datacentric applications, this data is streaming; new items arrive continuously, and the data grows with time. With paradigms such as Internet of Things and Edge Computing, such applications become more natural and more practical. In this work, we assume a streaming model… Expand

Figures and Tables from this paper


Streaming Min-max Hypergraph Partitioning
This paper shows that a greedy assignment strategy is able to recover a hidden co-clustering of items under a natural set of recovery conditions, and demonstrates that this greedy strategy yields superior performance when compared with alternative approaches. Expand
PaToH (Partitioning Tool for Hypergraphs)
Buffered Streaming Graph Partitioning
This work extends the streaming model to a more reasonable approach in practice – the buffered streaming model and develops a multilevel algorithm that optimizes an objective function that has previously shown to be effective for the streaming setting. Expand
Fast shared-memory streaming multilevel graph partitioning
This work assesses the feasibility of using streaming graph partitioning algorithms within the multilevel framework and relies on a simple but fast and flexible streaming algorithm that serves multiple purposes in the partitioning process: a clustering algorithms in the coarsening, an effective algorithm for the initial partitioning, and a fast refinement algorithm in the uncoarsening. Expand
Unimodular Hypergraph for DNA Sequencing: A Polynomial Time Algorithm
The paper discusses a hypergraph-based polynomial time algorithm for constructing a DNA sequence corresponding to a given spectrum with no errors. The presence of n-ary relations in the expression ofExpand
Experimental Analysis of Streaming Algorithms for Graph Partitioning
The results show that the no partitioning algorithms performs best in all cases, and the choice of graph partitioning algorithm depends on: type and degree distribution of the graph, characteristics of the workloads, and specific application requirements. Expand
Semantic Hypergraphs
This work proposes a hypergraphic knowledge representation model that can be used to provide effective overviews of a large corpus of text in natural language, and presents a pipeline of transformations from the output of conventional NLP algorithms to such hypergraphs, which are denoted as semantic hyper graphs. Expand
AKIN: A Streaming Graph Partitioning Algorithm for Distributed Graph Storage Systems
  • Wei Zhang, Yong Chen, Dong Dai
  • Computer Science
  • 2018 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)
  • 2018
This research aims to provide a better solution that fits the need of streaming graph partitioning in a distributed system, which further reduces the edge-cut ratio while maintaining rough balance among all partitions. Expand
HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion
HYPE is proposed, a hypergraph partitionier that exploits the neighborhood relations between vertices in the hypergraph using an efficient implementation of neighborhood expansion and improves partitioning quality and reduces runtime compared to streaming partitioning. Expand
Master's thesis, Institute of Parallel and Distributed Systems
  • 2018