DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs

10/14/2018
by   Xun Jian, et al.
0

Subgraph listing is a fundamental problem in graph theory and has wide applications in areas like sociology, chemistry, and social networks. Modern graphs can usually be large-scale as well as highly dynamic, which challenges the efficiency of existing subgraph listing algorithms. Recent works have shown the benefits of partitioning and processing big graphs in a distributed system, however, there is only few work targets subgraph listing on dynamic graphs in a distributed environment. In this paper, we propose an efficient approach, called Distributed and Dynamic Subgraph Listing (DDSL), which can incrementally update the results instead of running from scratch. We use a Neighbor-Preserved storage for data graphs, which takes bounded extra space and supports dynamic updating. After that, we propose a comprehensive cost model to estimate the I/O cost of listing subgraphs. Then based on this cost model, we develop an algorithm to calculate the optimal join tree for a given pattern. To handle dynamic graphs, we propose an efficient left-deep join algorithm to incrementally update the join results. Extensive experiments are conducted on real-world datasets. The results show that DDSL outperforms existing methods in dealing with both static dynamic graphs in terms of the responding time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2020

Distributed Subgraph Enumeration via Backtracking-based Framework

Finding or monitoring subgraph instances that are isomorphic to a given ...
research
01/28/2018

Time Constrained Continuous Subgraph Search over Streaming Graphs

The growing popularity of dynamic applications such as social networks p...
research
06/08/2019

GSI: GPU-friendly Subgraph Isomorphism

Subgraph isomorphism is a well-known NP-hard problem that is widely used...
research
12/11/2018

DRONE: a Distributed Subgraph-Centric Framework for Processing Large Scale Power-law Graphs

Nowadays, in the big data era, social networks, graph databases, knowled...
research
07/21/2021

Fairness-aware Maximal Clique Enumeration

Cohesive subgraph mining on attributed graphs is a fundamental problem i...
research
06/01/2019

Fast Algorithm for K-Truss Discovery on Public-Private Graphs

In public-private graphs, users share one public graph and have their ow...
research
03/26/2019

On the Theory of Dynamic Graph Regression Problem

Most of real-world graphs are dynamic, i.e., they change over time. How...

Please sign up or login with your details

Forgot password? Click here to reset