A Label-based Edge Partitioning for Multi-Layer Graphs - Cnam - Conservatoire national des arts et métiers Access content directly
Conference Papers Year : 2019

A Label-based Edge Partitioning for Multi-Layer Graphs

Camelia Constantin
Yifan Li
  • Function : Author


Social network systems rely on very large underlying graphs. Consequently, to achieve scalability, most data analytics and data mining algorithms are distributed and graphs are partitioned over a set of servers. In most real-world graphs, the edges and/or vertices have different semantics and queries largely consider this semantics. But while several works focus on efficient graph computations on these "multi-semantic" graphs, few ones are dedicated to their partitioning. In this work, we propose a novel approach to achieve edge partitioning for multi-layer graphs, which considers both structural and edge-types (labels) localities. Our experiments on real life datasets with benchmark graph applications confirm that the execution time and the inter-partition communication can be significantly reduced with our approach.


Fichier principal
Vignette du fichier
hicss2019.pdf (463.13 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02465807 , version 1 (04-02-2020)



Camelia Constantin, Cédric Du Mouza, Yifan Li. A Label-based Edge Partitioning for Multi-Layer Graphs. 52nd Hawaii International Conference on System Sciences (HICSS 2019), Jan 2019, Maui, Hawaii, United States. pp.2216-2225, ⟨10.24251/HICSS.2019.269⟩. ⟨hal-02465807⟩
105 View
144 Download



Gmail Mastodon Facebook X LinkedIn More