Skip to Main content Skip to Navigation
Conference papers

SGVCut: A Vertex-Cut Partitioning Tool for RandomWalks-based Computations over Social Network graphs

Yifan Li 1 Camelia Constantin 1 Cédric Du Mouza 2
1 BD - Bases de Données
LIP6 - Laboratoire d'Informatique de Paris 6
2 CEDRIC - ISID - CEDRIC. Ingénierie des Systèmes d'Information et de Décision
CEDRIC - Centre d'études et de recherche en informatique et communications
Abstract : Several distributed frameworks have recently emerged to perform computations on large-scale graphs. However somerecent studies have highlighted that vertex-partitioning approaches, e.g. Giraph, failed to achieve workload-balancedpartitioning for skewed graphs, typically having a heavy-tail degree distribution. While edge-partitioning approachessuch as PowerGraph and GraphX provide better balancing and performances for graph computation, they supply ageneric framework, independent from the computation. Thisdemonstration presents SGVCut to display our edge partitions designed for random walks-based computation, whichis the foundation of many graph algorithms, on skewed graphs.The demonstration scenario introduces SGVCut interface andillustrates the benefits of our approach compare to other partitioning strategies for different settings and algorithms.
Document type :
Conference papers
Complete list of metadata

https://hal.sorbonne-universite.fr/hal-01515676
Contributor : Camelia Constantin Connect in order to contact the contributor
Submitted on : Thursday, April 27, 2017 - 10:16:02 PM
Last modification on : Wednesday, July 21, 2021 - 11:58:00 AM

Identifiers

Citation

Yifan Li, Camelia Constantin, Cédric Du Mouza. SGVCut: A Vertex-Cut Partitioning Tool for RandomWalks-based Computations over Social Network graphs. International Conference on Scientific and Statistical Database Management, SSDBM, Jun 2017, Chicago, United States. pp.39:1--39:4, ⟨10.1145/3085504.3091114⟩. ⟨hal-01515676⟩

Share

Metrics

Record views

606