Generating Flexible Workloads for Graph Databases - Archive ouverte HAL Access content directly
Journal Articles Proceedings of the VLDB Endowment (PVLDB) Year : 2016

Generating Flexible Workloads for Graph Databases

(1) , (2) , (3) , (4) , (5) , (4)
1
2
3
4
5

Abstract

Graph data management tools are nowadays evolving at a great pace. Key drivers of progress in the design and study of data intensive systems are solutions for synthetic generation of data and workloads, for use in empirical studies. Current graph generators, however, provide limited or no support for workload generation or are limited to fixed use-cases. Towards addressing these limitations, we demonstrate gMark, the first domain- and query language-independent framework for synthetic graph and query workload generation. Its novel features are: (i) fine-grained control of graph instance and query workload generation via expressive user-defined schemas; (ii) the support of expressive graph query languages, including recursion among other features; and, (iii) selectivity estimation of the generated queries. During the demonstration, we will showcase the highly tunable generation of graphs and queries through various user-defined schemas and targeted selectivities, and the variety of supported practical graph query languages. We will also show a performance comparison of four state-of-the-art graph database engines, which helps us understand their current strengths and desirable future extensions.
Not file

Dates and versions

hal-01330111 , version 1 (10-06-2016)

Identifiers

  • HAL Id : hal-01330111 , version 1

Cite

Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George Fletcher, Aurélien Lemay, et al.. Generating Flexible Workloads for Graph Databases. Proceedings of the VLDB Endowment (PVLDB), 2016, 9 (13), pp.1457-1460. ⟨hal-01330111⟩
271 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More