Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks

04/20/2021
by   Ye Wang, et al.
0

Computing shortest paths is a fundamental operation in processing graph data. In many real-world applications, discovering shortest paths between two vertices empowers us to make full use of the underlying structure to understand how vertices are related in a graph, e.g. the strength of social ties between individuals in a social network. In this paper, we study the shortest-path-graph problem that aims to efficiently compute a shortest path graph containing exactly all shortest paths between any arbitrary pair of vertices on complex networks. Our goal is to design an exact solution that can scale to graphs with millions or billions of vertices and edges. To achieve high scalability, we propose a novel method, Query-by-Sketch (QbS), which efficiently leverages offline labelling (i.e., precomputed labels) to guide online searching through a fast sketching process that summarizes the important structural aspects of shortest paths in answering shortest-path-graph queries. We theoretically prove the correctness of this method and analyze its computational complexity. To empirically verify the efficiency of QbS, we conduct experiments on 12 real-world datasets, among which the largest dataset has 1.7 billion vertices and 7.8 billion edges. The experimental results show that QbS can answer shortest-path graph queries in microseconds for million-scale graphs and less than half a second for billion-scale graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2018

L_1 Shortest Path Queries in Simple Polygons

Let P be a simple polygon of n vertices. We consider two-point L_1 short...
research
11/16/2022

Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs

The shortest-path distance is a fundamental concept in graph analytics a...
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
07/12/2023

DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs

The widespread use of graph data in various applications and the highly ...
research
02/11/2020

Modular Path Queries with Arithmetic

We propose a new approach to querying graph databases. Our approach bala...
research
07/29/2023

Search for shortest paths based on the projective description of unweighted graphs

A new method of representing graph projections in computer memory is pro...
research
10/19/2021

Collective Shortest Paths for Minimizing Congestion on Temporal Load-Aware Road Networks

Shortest path queries over graphs are usually considered as isolated tas...

Please sign up or login with your details

Forgot password? Click here to reset