Generating flexible workloads for graph databases

G.H.L. Fletcher, G. Bagan, A. Bonifati, R. Ciucanu, A. Lemay, N. Advokaat

Research output: Contribution to journalArticleAcademicpeer-review

17 Citations (Scopus)
4 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)1457-1460
JournalProceedings of the VLDB Endowment
Issue number13
Publication statusPublished - 2016


Dive into the research topics of 'Generating flexible workloads for graph databases'. Together they form a unique fingerprint.

Cite this