• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Generating Flexible Workloads for Graph Databases
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Article dans une revue scientifique
Title :
Generating Flexible Workloads for Graph Databases
Author(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]
Journal title :
Proceedings of the VLDB Endowment (PVLDB)
Pages :
1457-1460
Publisher :
VLDB Endowment
Publication date :
2016-06-10
ISSN :
2150-8097
HAL domain(s) :
Informatique [cs]/Base de données [cs.DB]
English abstract : [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 ...
Show more >
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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Université de Lille

Mentions légales
Université de Lille © 2017