G-Store: High-Performance Graph Store for Trillion-Edge Processing
SessionFile Systems and I/O
Session ChairJohn Bent
Event Type
Paper
Advanced
Data Analytics
File Systems
I/O
Intermediate
Storage
TimeThursday, November 17th2:30pm - 3pm
Location355-D
DescriptionHigh-performance graph processing brings great benefits to a wide range of scientific applications, e.g., biology networks, recommendation systems, and social networks, where the size of such graphs has grown to terabytes of data with billions of vertices and trillions of edges. Subsequently, storage and I/O performance plays a critical role in designing a high-performance computer system for graph analytics. In this paper, we present G-Store, a new graph store that incorporates three techniques to accelerate the I/O and computation of graph algorithms. We evaluate G-Store on a number of graphs against two state-of-the-art graph engines and show that G-Store achieves 2 to 8× saving in storage and outperforms X-Stream by up to 32× and Flash-Graph by up to 2.4×. G-Store is able to run different algorithms on trillion-edge graphs within tens of minutes, setting a new milestone in semi-external graph processing system.
