A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Evaluation of parallel graph loading techniques
2016
Proceedings of the Fourth International Workshop on Graph Data Management Experiences and Systems - GRADES '16
For many exploratory graph workloads, the initial loading and construction of the graph data structures makes up a significant part of the total runtime. Still, this topic is hardly analyzed in literature and often neglected in systems and their evaluations. In this paper we analyze the whole graph loading process, including parsing, dense vertex identifier relabeling, and writing the final in-memory data structures. We present various loading strategies that take into consideration the
doi:10.1145/2960414.2960418
dblp:conf/grades/ThenKK016
fatcat:zrshwdodf5h5nkkzwwvsbygq3y