Optimizing Distance Computation in Distributed Graph Systems

Optimizing Distance Computation in Distributed Graph Systems

Given a large graph, such as a social network or a knowledge graph, a fundamental query is how to find the distance from a source vertex to another vertex in the graph. As real graphs become very large and many distributed graph systems, such as Pregel, Pregel+, Giraph, and GraphX, are proposed, how...

Full description

Bibliographic Details
Main Authors: Qing Wang, Shengyi Ji, Peng Peng, Mingdao Li, Ping Huang, Zheng Qin
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Distributed information systems
graph theory
distributed computing
distance computation
distributed graph systems
landmark
Online Access:https://ieeexplore.ieee.org/document/9234445/

Internet

https://ieeexplore.ieee.org/document/9234445/

Similar Items