Publication Type

Journal Article

Version

acceptedVersion

Publication Date

9-2019

Abstract

Reachability computation is a fundamental graph functionality with a wide range of applications. In spite of this, little work has as yet been done on efficient reachability queries over temporal graphs, which are used extensively to model time-varying networks, such as communication networks, social networks, and transportation schedule networks. Moreover, we are faced with increasingly large real-world temporal networks that may be distributed across multiple data centers. This state of affairs motivates the paper's study of efficient reachability queries on distributed temporal graphs. We propose an efficient index, called Temporal Vertex Labeling (TVL), which is a labeling scheme for distributed temporal graphs. We also present algorithms that exploit TVL to achieve efficient support for distributed reachability querying over temporal graphs in Pregel-like systems. The algorithms exploit several optimizations that hinge upon non-trivial lemmas. Extensive experiments using massive real and synthetic temporal graphs are conducted to provide detailed insight into the efficiency and scalability of the proposed methods, covering both index construction and query processing. Compared with the state-of-the-art methods, the TVL based query algorithms are capable of up to an order of magnitude speedup with lower index construction overhead.

Keywords

Graph, Reachability, Distributed processing, Query processing, Algorithm

Discipline

Computer Engineering | Theory and Algorithms

Research Areas

Data Science and Engineering

Publication

VLDB Journal

Volume

28

Issue

6

First Page

871

Last Page

896

ISSN

1066-8888

Identifier

10.1007/s00778-019-00572-x

Publisher

Springer Verlag (Germany)

Additional URL

https://doi.org/10.1007/s00778-019-00572-x

Download

Share

COinS