Large-Scale Graph Processing Project Using Pregel

DOI

10.2991/assehr.k.220401.049How to use a DOI?

Keywords

graph algorithm; pregel; big data

Abstract

How to compute large-scale data is an important topic. The graph is an important type of data. Pregel is a system that is suitable for processing large-scale graphs. Pregel which sets two states of vertexes determines the program according to the states of vertexes. Because of the partitions of vertexes parted by Pregel, Pregel can sufficiently compute the large-scale graphs. In many traditional graph algorithms, Dijkstra’s algorithm is an important shortest path algorithm that can give all shortest distances between the source vertex and other vertexes. The model uses the Pregel framework to implement Dijkstra’s algorithm and uses large-scale graphs as input. The results under different conditions such as different cores and the number of vertexes are expressive and reasonable because of the features of Pregel.

Copyright

© 2022 The Authors. Published by Atlantis Press SARL.

Open Access

This is an open access article distributed under the CC BY-NC 4.0 license.

Download article (PDF)

TY  - CONF
AU  - Jingmin Yu
PY  - 2022
DA  - 2022/04/08
TI  - Large-Scale Graph Processing Project Using Pregel
BT  - Proceedings of the 2022 International Conference on Social Sciences and Humanities and Arts (SSHA 2022)
PB  - Atlantis Press
SP  - 242
EP  - 246
SN  - 2352-5398
UR  - https://doi.org/10.2991/assehr.k.220401.049
DO  - 10.2991/assehr.k.220401.049
ID  - Yu2022
ER  -