Handling Billions of Edges in a Graph Database
385 views · Published 8 December 2016 · 39:27 · Indexed 8 November 2026
Channel: The Linux Foundation · 2016 · Science & Technology
The amount and complexity of data rises. The need for a database capable of dealing with those requirements is rising as well. Modern graph databases are designed to handle the complexity but what about the increasing amount of data? When hitting a certain size of graphs many dedicated graph databases reach their limits in vertical and in particular horizontal scalability. In this talk I will address the glitches and more importantly the solutions on the journey to a scalable and distributed graph database. The main topics of this talk are: (1) Modern architectures in graph databases, (2) Scaling a graph: Bottlenecks in read and write performance, (3) Index free adjacency or hybrid indexes for graphs?, (4) Dealing with billions of edges. With ArangoDB there is a modern and scalable graph database readily available for Mesos, which makes deployment and actual scaling very easy.
More from this channel
-
0:37
The Linux Foundation Video Site:: Chicks dig it
-
1:01
The Origin (Japanese Subtitles)
-
5:19
The Linux Foundation Video Site:: Flock
-
0:35
The Linux Foundation Video Site:: Gnu/Linux-Desktop
-
5:51
The Linux Foundation Video Site:: Debian & Cooliris
-
6:09
The Linux Foundation Video Site:: Slackware Linux
-
1:57
The Linux Foundation Video Site:: Bdale Garbee (Hewlett-Pack
-
1:12
The Linux Foundation Video Site:: James Morris (Red Hat) at