Name
Abstract | ||
|---|---|---|
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 properties of the input graph, e.g., partitioning, and evaluate them through extensive experiments. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2960414.2960418 | GRADES |
DocType | Citations | PageRank |
Conference | 1 | 0.36 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Then | 1 | 43 | 4.73 |
| Moritz Kaufmann | 2 | 23 | 2.53 |
| Alfons Kemper | 3 | 3519 | 769.50 |
| Thomas Neumann | 4 | 2523 | 156.50 |