Time and Memory Efficient Parallel Algorithm for Structural Graph Summaries and two Extensions to Incremental Summarization and k-Bisimulation for Long k-Chaining

11/24/2021
โˆ™
by   Till Blume, et al.
โˆ™
0
โˆ™

We developed a flexible parallel algorithm for graph summarization based on vertex-centric programming and parameterized message passing. The base algorithm supports infinitely many structural graph summary models defined in a formal language. An extension of the parallel base algorithm allows incremental graph summarization. In this paper, we prove that the incremental algorithm is correct and show that updates are performed in time ๐’ช(ฮ”ยท d^k), where ฮ” is the number of additions, deletions, and modifications to the input graph, d the maximum degree, and k is the maximum distance in the subgraphs considered. Although the iterative algorithm supports values of k>1, it requires nested data structures for the message passing that are memory-inefficient. Thus, we extended the base summarization algorithm by a hash-based messaging mechanism to support a scalable iterative computation of graph summarizations based on k-bisimulation for arbitrary k. We empirically evaluate the performance of our algorithms using benchmark and real-world datasets. The incremental algorithm almost always outperforms the batch computation. We observe in our experiments that the incremental algorithm is faster even in cases when 50% of the graph database changes from one version to the next. The incremental computation requires a three-layered hash index, which has a low memory overhead of only 8% (ยฑ 1%). Finally, the incremental summarization algorithm outperforms the batch algorithm even with fewer cores. The iterative parallel k-bisimulation algorithm computes summaries on graphs with over 10M edges within seconds. We show that the algorithm processes graphs of 100+M edges within a few minutes while having a moderate memory consumption of <150 GB. For the largest BSBM1B dataset with 1 billion edges, it computes k=10 bisimulation in under an hour.

READ FULL TEXT
research
โˆ™ 06/17/2020

Incremental Lossless Graph Summarization

Given a fully dynamic graph, represented as a stream of edge insertions ...
research
โˆ™ 04/15/2023

Layph: Making Change Propagation Constraint in Incremental Graph Processing by Layering Graph

Real-world graphs are constantly evolving, which demands updates of the ...
research
โˆ™ 08/28/2019

Streaming and Batch Algorithms for Truss Decomposition

Truss decomposition is a method used to analyze large sparse graphs in o...
research
โˆ™ 06/11/2018

Scalable Approximation Algorithm for Graph Summarization

Massive sizes of real-world graphs, such as social networks and web grap...
research
โˆ™ 03/06/2020

Bundle Adjustment on a Graph Processor

Graph processors such as Graphcore's Intelligence Processing Unit (IPU) ...
research
โˆ™ 01/17/2021

Data stream fusion for accurate quantile tracking and analysis

UDDSKETCH is a recent algorithm for accurate tracking of quantiles in da...
research
โˆ™ 06/04/2018

Deep Graphs

We propose an algorithm for deep learning on networks and graphs. It rel...

Please sign up or login with your details

Forgot password? Click here to reset