Parallel Order-Based Core Maintenance in Dynamic Graphs

10/25/2022
by   Bin Guo, et al.
0

The core numbers of vertices in a graph are one of the most well-studied cohesive subgraph models because of the linear running time. In practice, many data graphs are dynamic graphs that are continuously changing by inserting or removing edges. The core numbers are updated in dynamic graphs with edge insertions and deletions, which is called core maintenance. When a burst of a large number of inserted or removed edges come in, we have to handle these edges on time to keep up with the data stream. There are two main sequential algorithms for core maintenance, Traversal and Order. It is proved that the Order algorithm significantly outperforms the Traversal algorithm over all tested graphs with up to 2,083 times speedups. To the best of our knowledge, all existing parallel approaches are based on the Traversal algorithm; also, their parallelism exists only for affected vertices with different core numbers, which will reduce to sequential when all vertices have the same core numbers. In this paper, we propose a new parallel core maintenance algorithm based on the Order algorithm. Importantly, our new approach always has parallelism, even for the graphs where all vertices have the same core numbers. Extensive experiments are conducted over real-world, temporal, and synthetic graphs on a 64-core machine. The results show that for inserting and removing 100,000 edges using 16-worker, our method achieves up to 289x and 10x times speedups compared with the most efficient existing method, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/27/2021

Efficient Parallel Graph Trimming by Arc-Consistency

Given a large data graph, trimming techniques can reduce the search spac...
research
01/18/2022

Simplified Algorithms for Order-Based Core Maintenance

Graph analytics attract much attention from both research and industry c...
research
08/16/2022

New Parallel Order Maintenance Data Structure

The Order-Maintenance (OM) data structure maintains a total order list o...
research
04/29/2022

DePa: Simple, Provably Efficient, and Practical Order Maintenance for Task Parallelism

A number of problems in parallel computing require reasoning about the d...
research
06/03/2019

Betti numbers of unordered configuration spaces of small graphs

The purpose of this document is to provide data about known Betti number...
research
06/07/2021

Parallel Batch-Dynamic k-Core Decomposition

Maintaining a k-core decomposition quickly in a dynamic graph is an impo...
research
07/01/2019

Trimming Graphs Using Clausal Proof Optimization

We present a method to gradually compute a smaller and smaller unsatisfi...

Please sign up or login with your details

Forgot password? Click here to reset