A Discussion on the Design of Graph Database Benchmarks

• Published in: Performance Evaluation, Measurement and Characterization of Complex Systems pp. 25 - 40
• Main Authors: Dominguez-Sal, David, Martinez-Bazan, Norbert, Muntes-Mulero, Victor, Baleta, Pere, Larriba-Pey, Josep Lluis
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Betweenness Centrality; Large Graph; Resource Description Framework; Social Network Analysis; SPARQL Query
• ISBN: 9783642182051; 3642182054
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-18206-8_3

Graph Database Management systems (GDBs) are gaining popularity. They are used to analyze huge graph datasets that are naturally appearing in many application areas to model interrelated data. The objective of this paper is to raise a new topic of discussion in the benchmarking community and allow practitioners having a set of basic guidelines for GDB benchmarking. We strongly believe that GDBs will become an important player in the market field of data analysis, and with that, their performance and capabilities will also become important. For this reason, we discuss those aspects that are important from our perspective, i.e. the characteristics of the graphs to be included in the benchmark, the characteristics of the queries that are important in graph analysis applications and the evaluation workbench.