RealGraph: A graph engine leveraging the power-law distribution of real-world graphs

Citations

WEB OF SCIENCE

17
Citations

SCOPUS

22

초록

As the size of real-world graphs has drastically increased in recent years, a wide variety of graph engines have been developed to deal with such big graphs efficiently. However, the majority of graph engines have been designed without considering the power-law degree distribution of real-world graphs seriously. Two problems have been observed when existing graph engines process real-world graphs: inefficient scanning of the sparse indicator and the delay in iteration progress due to uneven workload distribution. In this paper, we propose RealGraph, a single-machine based graph engine equipped with the hierarchical indicator and the block-based workload allocation. Experimental results on real-world datasets show that RealGraph significantly outperforms existing graph engines in terms of both speed and scalability.

키워드

Graph engine; Power-law degree distribution; Real-world graph; Single machine; Graphic methods; Scheduling algorithms; World Wide Web; Block based; Power law degree distribution; Power law distribution; Real-world datasets; Real-world graphs; Single- machines; Work-load distribution; Workload allocation; Engines
제목
RealGraph: A graph engine leveraging the power-law distribution of real-world graphs
저자
Jo, Yong-Yeon; Kim, Sang-Wook; Jang, Myung-Hwan; Park, Sunju
DOI
10.1145/3308558.3313434
발행일
2019-05
유형
Conference Paper
저널명
The Web Conference 2019 - Proceedings of the World Wide Web Conference, WWW 2019
페이지
807 ~ 817