.png){kind=icon}
Return
Distributed framework for high-quality graph partitioning
.png){kind=icon}
PRE
AI
DOI：10.1007/s11227-025-07907-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The graph partitioning problem is increasing with the emergence of Big Data. Handling tremendous volumes of graph data requires an efficient graph processing system and especially a high-quality graph partitioning approach(s) to cope with graph application needs. However, all graph partitioning algorithms do not consider graph data volumes during graph partitioning. As a result, graph processing systems experience an imbalance in their workload and a decrease in system performance. For this purpose, we designed our distributed framework for high-quality graph partitioning including the volume metric. Also, it is created for scalable, high-availability, and fault tolerance. Using real-world datasets, we show that VF-Hammer performs a good graph partitioning quality and achieves better performance results against state-of-the-art graph partitioning.
Keywords:
Graph databases
Property graph
Graph partitioning
Balance volume
Balance size
Journal
T
IF:
0
Papers:
647
Citations:
0
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveHipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks.png)
NUCLEIC ACIDS RESEARCH
OAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAIShareSaveShareSave
View more