<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
        <title>Handling Billions Of Edges in a Graph Database</title>
        <link>https://peertube.watch/videos/watch/8e3ee3c0-9eff-4a1e-aac9-87e06530a8f2</link>
        <description>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, Speaker: Michael Hackstein, Track: Graph Processing, Room: H.2214, When: Saturday 3 February 2018, 15:00–15:35 (Brussels time), Schedule: FOSDEM 2018 event page, Licence: Creative Commons Attribution 2.0 Belgium (CC BY 2.0 BE) (as stated in the FOSDEM video archive). Attribution: “Handling Billions Of Edges in a Graph Database” by Michael Hackstein, FOSDEM 2018. Original recording: 2018/H.2214/handling_billion_edges__in_graphdb.webm from the FOSDEM video archive. This channel is an unofficial mirror; FOSDEM is a free and non-commercial event organised by the community for the community.</description>
        <lastBuildDate>Tue, 13 Oct 2026 04:11:18 GMT</lastBuildDate>
        <docs>https://validator.w3.org/feed/docs/rss2.html</docs>
        <generator>PeerTube - https://peertube.watch</generator>
        <image>
            <title>Handling Billions Of Edges in a Graph Database</title>
            <url>https://peertube.watch/lazy-static/avatars/3b284627-b75f-409e-ac2e-10f4c2946f43.png</url>
            <link>https://peertube.watch/videos/watch/8e3ee3c0-9eff-4a1e-aac9-87e06530a8f2</link>
        </image>
        <copyright>All rights reserved, unless otherwise specified in the terms specified at https://peertube.watch/about and potential licenses granted by each content's rightholder.</copyright>
        <atom:link href="https://peertube.watch/feeds/video-comments.xml?videoId=8e3ee3c0-9eff-4a1e-aac9-87e06530a8f2" rel="self" type="application/rss+xml"/>
    </channel>
</rss>