GraphBolt: Streaming Graph Approximations on Big Data

10/05/2018
by   Miguel E. Coimbra, et al.
0

Graphs are found in a plethora of domains, including online social networks, the World Wide Web and the study of epidemics, to name a few. With the advent of greater volumes of information and the need for continuously updated results under temporal constraints, it is necessary to explore novel approaches that further enable performance improvements. In the scope of stream processing over graphs, we research the trade-offs between result accuracy and the speedup of approximate computation techniques. We believe this to be a natural path towards these performance improvements. Herein we present GraphBolt, through which we conducted our research. It is an innovative model for approximate graph processing, implemented in Apache Flink. We analyze our model and evaluate it with the case study of the PageRank algorithm, perhaps the most famous measure of vertex centrality used to rank websites in search engine results. In light of our model, we discuss the challenges driven by relations between result accuracy and potential performance gains. Our experiments show that GraphBolt can reduce computational time by over 50 quality above 95 PageRank without any summarization or approximation techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/25/2019

A Foundation of Lazy Streaming Graphs

A streaming graph system continuously processes a stream of operations o...
research
11/07/2017

Quality-Efficiency Trade-offs in Machine Learning for Text Processing

Data mining, machine learning, and natural language processing are power...
research
04/11/2021

GraphGuess: Approximate Graph Processing System with Adaptive Correction

Graph-based data structures have drawn great attention in recent years. ...
research
08/27/2018

Piecewise Linear Approximation in Data Streaming: Algorithmic Implementations and Experimental Analysis

Piecewise Linear Approximation (PLA) is a well-established tool to reduc...
research
01/27/2021

A Neighborhood-preserving Graph Summarization

We introduce in this paper a new summarization method for large graphs. ...
research
01/29/2021

sGrapp: Butterfly Approximation in Streaming Graphs

We study the fundamental problem of butterfly (i.e. (2,2)-bicliques) cou...
research
01/15/2021

Visualizing and Interacting with Geospatial Networks: A Survey and Design Space

This paper surveys visualization and interaction techniques for geospati...

Please sign up or login with your details

Forgot password? Click here to reset