Name
Abstract | ||
|---|---|---|
In the last years researchers and industry have become interested in the analysis of graphs to gain insights into social networks, road networks, and other data that is naturally organized as a set of connected entities. Many of these graphs are very large, some containing hundreds of billions of edges. Usually, graphs are stored in static or immutable representations. We propose ASGraph. ASGraph is a graph container that supports updates and multi-versioning while still providing high analytical performance in the order of magnitude of the predominant CSR. ASGraph stores temporal graphs with arbitrarily fine granularity. Additionally, it can optimize its internal layout for analytical queries at specific snapshots. We show that it has moderate runtime overhead between 7% -- 98% for PageRank compared to CSR. Meanwhile it outperforms CSR both in runtime and memory consumption in scenarios where a graph is repeatedly updated between analysis. We designed ASGraph to support an update stream that can be applied concurrently to all analytical operations without blocking. In contrast to existing solutions for storing versioned graphs, its performance is independent of the number of stored snapshots.
|
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2960414.2960422 | GRADES '16: Graph Data Management Experiences and Systems
Redwood Shores
California
June, 2016 |
DocType | ISBN | Citations |
Conference | 978-1-4503-4780-8 | 1 |
PageRank | References | Authors |
0.35 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Haubenschild | 1 | 1 | 0.35 |
| Manuel Then | 2 | 9 | 1.51 |
| Sungpack Hong | 3 | 864 | 33.20 |
| Hassan Chafi | 4 | 1118 | 61.11 |