Generating Flexible Workloads for Graph Databases
Type de document :
Article dans une revue scientifique: Article original
Titre :
Generating Flexible Workloads for Graph Databases
Auteur(s) :
Bagan, Guillaume [Auteur]
Graphes, AlgOrithmes et AppLications [GOAL]
Bonifati, Angela [Auteur correspondant]
Base de Données [BD]
Ciucanu, Radu [Auteur correspondant]
Department of Computer Science [Oxford]
Fletcher, George [Auteur correspondant]
Eindhoven University of Technology [Eindhoven] [TU/e]
Lemay, Aurélien [Auteur]
Linking Dynamic Data [LINKS]
Advokaat, Nicky [Auteur]
Eindhoven University of Technology [Eindhoven] [TU/e]
Graphes, AlgOrithmes et AppLications [GOAL]
Bonifati, Angela [Auteur correspondant]
Base de Données [BD]
Ciucanu, Radu [Auteur correspondant]
Department of Computer Science [Oxford]
Fletcher, George [Auteur correspondant]
Eindhoven University of Technology [Eindhoven] [TU/e]
Lemay, Aurélien [Auteur]
Linking Dynamic Data [LINKS]
Advokaat, Nicky [Auteur]
Eindhoven University of Technology [Eindhoven] [TU/e]
Titre de la revue :
Proceedings of the VLDB Endowment (PVLDB)
Pagination :
1457-1460
Éditeur :
VLDB Endowment
Date de publication :
2016-06-10
ISSN :
2150-8097
Discipline(s) HAL :
Informatique [cs]/Base de données [cs.DB]
Résumé en anglais : [en]
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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :