Brussels / 3 & 4 February 2018

schedule

Handling Billions Of Edges in a Graph Database


The complexity and amount of data rises. Modern graph databases are designed to handle the complexity but still not for the amount of data. When hitting a certain size of a graph, many dedicated graph databases reach their limits in vertical or, most common, horizontal scalability. In this talk I'll provide a brief overview about current approaches and their limits towards scalability. Dealing with complex data in a complex system doesn't make things easier... but more fun finding a solution. Join me on my journey to handle billions of edges in a graph database.

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 a graph many dedicated graph databases reach their limits in vertical or most common horizontal scalability.

In this talk Michael will address the glitches and most important the solutions on the journey to a scalable and distributed graph database. The main topics of this talk are:

  • Modern architectures in graph databases
  • Scaling a graph: Bottlenecks in read and write performance
  • Index free adjacency or hybrid indexes for graphs?
  • Dealing with billions of edges: A graphy journey to London with ArangoDB

Speakers

Photo of Michael Hackstein Michael Hackstein

Attachments

Links