FOSDEM is the biggest free and non-commercial event organized by and for the community. Its goal is to provide Free and Open Source developers a place to meet. No registration necessary.

   
Speakers
Marcus Paradies
Schedule
Day Sunday
Room AW1.125
Capacity 76
Start time 16:00
End time 16:40
Duration 00:40
Info
Track Graph Processing Devroom

Challenges in the Design of a Graph Database Benchmark

Graph databases are one of the leading drivers in the emerging, highly heterogeneous landscape of database management systems for non-relational data management and processing. The recent interest and success of graph databases arises mainly from the growing interest in social media analysis and the exploration and mining of relationships in social media data. However, with a graph-based model as a very flexible underlying data model, a graph database can serve a large variety of scenarios from different domains such as travel planning, supply chain management and package routing.

During the past months, many vendors have designed and implemented solutions to satisfy the need to efficiently store, manage and query graph data. However, the solutions are very diverse in terms of the supported graph data model, supported query languages, and APIs. With a growing number of vendors offering graph processing and graph management functionality, there is also an increased need to compare the solutions on a functional level as well as on a performance level with the help of benchmarks. Graph database benchmarking is a challenging task. Already existing graph database benchmarks are limited in their functionality and portability to different graph-based data models and different application domains. Existing benchmarks and the supported workloads are typically based on a proprietary query language and on a specific graph-based data model derived from the mathematical notion of a graph. The variety and lack of standardization with respect to the logical representation of graph data and the retrieval of graph data make it hard to define a portable graph database benchmark. In this talk, we present a proposal and design guideline for a graph database benchmark. Typically, a database benchmark consists of a synthetically generated data set of varying size and varying characteristics and a workload driver. In order to generate graph data sets, we present parameters from graph theory, which influence the characteristics of the generated graph data set. Following, the workload driver issues a set of queries against a well-defined interface of the graph database and gathers relevant performance numbers. We propose a set of performance measures to determine the response time behavior on different workloads and also initial suggestions for typical workloads in graph data scenarios. Our main objective of this session is to open the discussion on graph database benchmarking. We believe that there is a need for a common understanding of different workloads for graph processing from different domains and the definition of a common subset of core graph functionality in order to provide a general-purpose graph database benchmark. We encourage vendors to participate and to contribute with their domain-dependent knowledge and to define a graph database benchmark proposal.

Concurrent events:

When Event Track Where
11:00-17:00 LPI Item Writing Workshop Certification UA2.114
14:00-16:30 Back to the future, (re) learn smalltalk Smalltalk AW1.126
15:00-16:45 LPI Exam Session 5 Certification Guillissen
15:25-16:10 Game On - Game Creation and Distribution with Gluon Open Source Game Development AW1.120
15:35-16:15 SIP beyond VoIP Telephony and Communications H.2213
15:45-16:15 Getting into GNOME - Impressions of a new maintainer CrossDesktop H.1308
15:50-16:10 The FusionInventory Project Perl AW1.121
16:00-16:15 Mozilla Lightning Talks Mozilla UD2.218A
16:00-16:15 Geeklog: The secure CMS. Lightning Talks Ferrer
16:00-16:25 Managing MySQL with Percona Toolkit MySQL and Friends H.1309
16:00-16:30 JDK 8 Free Java K.4.401
16:00-16:30 Automated package building BSD K.4.201
16:00-16:45 Configuration management and deployment with RPM and YADT Configuration and Systems Management K.3.601
16:00-16:50 From Dev to DevOps Development Janson
16:00-16:50 Caret and Stick Community K.1.105
16:00-16:55 Deploying Xen: troubleshooting surgery & discussion with Xen.org developers Virtualization and Cloud Chavanne
16:00-17:00 Color Management in SVG2 X.org+OpenICC K.3.401
16:00-17:00 Continuous Integration / Continuous Delivery within a Linux Distribution CrossDistribution H.1302
16:00-17:00 Panel discussion Microkernel OS K.3.201
16:00-17:00 Simple and powerful Android code with AndroidAnnotations! Embedded Lameere
16:00-17:00 Debian Secrets - what I wish I knew before joining Debian CrossDistribution H.1301
16:15-16:30 A Generation of Webmakers: Hacking with kids, journalists, and filmmakers Mozilla UD2.218A
16:15-17:00 The Future of Open Web Gaming Open Source Game Development AW1.120
16:20-16:35 Semantic MediaWiki Lightning Talks Ferrer
16:20-16:40 Using Moose objects with Memcached Perl AW1.121
16:20-16:50 Web Applications in GNOME CrossDesktop H.1308
16:20-17:00 Telephony and Communications Roundtable Telephony and Communications H.2213
16:30-16:55 Choosing Hardware for MySQL MySQL and Friends H.1309
16:30-17:00 Discussion about the future of XBL Mozilla UD2.218A
16:30-17:00 Cross-distro Collaboration Brainstorming and Closing BSD K.4.201
16:30-17:00 Discussion on the Future of Free Java Free Java K.4.401

Next (up to 3) talks in the same room (AW1.125):

When Event Track
16:45-17:00 Closing talk Graph Processing

Events that start after this one (within 30 minutes):

When Event Track Where
16:40-16:55 Unhosted Lightning Talks Ferrer
16:45-17:00 Closing talk Graph Processing AW1.125
17:00-17:50 Freedom, Out of the Box! Keynotes Janson