DeepAI AI Chat
Log In Sign Up

Graph Sampling with Distributed In-Memory Dataflow Systems

by   Kevin Gomez, et al.

Given a large graph, a graph sample determines a subgraph with similar characteristics for certain metrics of the original graph. The samples are much smaller thereby accelerating and simplifying the analysis and visualization of large graphs. We focus on the implementation of distributed graph sampling for Big Data frameworks and in-memory dataflow systems such as Apache Spark or Apache Flink. We evaluate the scalability of the new implementations and analyze to what degree the sampling approaches preserve certain graph metrics compared to the original graph. The latter analysis also uses comparative graph visualizations. The presented methods will be open source and be integrated into Gradoop, a system for distributed graph analytics.


page 1

page 2

page 3

page 4


Nebula Graph: An open source distributed graph database

This paper introduces the recent work of Nebula Graph, an open-source, d...

COST of Graph Processing Using Actors

Graph processing is an increasingly important domain of computer science...

Node Centrality Metrics for Hotspots Analysis in Telecom Big Data

In this work, we are interested in the applications of big data in the t...

Empirical Characterization of Graph Sampling Algorithms

Graph sampling allows mining a small representative subgraph from a big ...

TurboGraph++: A Scalable and Fast Graph Analytics System

Existing distributed graph analytics systems are categorized into two ma...

Graffinity: Visualizing Connectivity In Large Graphs

Multivariate graphs are prolific across many fields, including transport...

Distributed graphs: in search of fast, low-latency, resource-efficient, semantics-rich Big-Data processing

Large graphs can be processed with single high-memory or distributed sys...