BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale

04/23/2022
by   Muhammad Farhan, et al.
0

Many real-world applications operate on dynamic graphs that undergo rapid changes in their topological structure over time. However, it is challenging to design dynamic algorithms that are capable of supporting such graph changes efficiently. To circumvent the challenge, we propose a batch-dynamic framework for answering distance queries, which combines offline labelling and online searching to leverage the advantages from both sides - accelerating query processing through a partial distance labelling that is of limited size but provides a good approximation to bound online searches. We devise batch-dynamic algorithms to dynamize a distance labelling efficiently in order to reflect batch updates on the underlying graph. In addition to providing theoretical analysis for the correctness, labelling minimality, and computational complexity, we have conducted experiments on 14 real-world networks to empirically verify the efficiency and scalability of the proposed algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/17/2021

Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs

Finding the shortest path distance between an arbitrary pair of vertices...
research
12/06/2018

A Highly Scalable Labelling Approach for Exact Distance Queries in Complex Networks

Answering exact shortest path distance queries is a fundamental task in ...
research
02/12/2020

Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees

Dynamic algorithms capable of supporting batches of updates are increasi...
research
03/21/2019

Parallel Batch-Dynamic Graph Connectivity

With the rapid growth of graph datasets over the past decade, a new kind...
research
05/15/2020

Input-dynamic distributed graph algorithms for congested networks

Consider a distributed system, where the topology of the communication n...
research
12/04/2018

On incompressible high order networks

This work presents a theoretical investigation of incompressible high or...
research
02/11/2019

Accelerating Partial Evaluation in Distributed SPARQL Query Evaluation

Partial evaluation has recently been used for processing SPARQL queries ...

Please sign up or login with your details

Forgot password? Click here to reset