A discussion on the design of graph database benchmarks

View/Open
Cita com:
hdl:2117/24027
Document typeArticle
Defense date2011
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
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.
CitationDominguez, D. [et al.]. A discussion on the design of graph database benchmarks. "Lecture notes in computer science", 2011, vol. 6417/2011, p. 25-40.
ISSN0302-9743
Publisher versionhttp://www.springerlink.com/content/ul41g67g76300677/
Files | Description | Size | Format | View |
---|---|---|---|---|
2010_tpctc.pdf | Article | 160,5Kb | View/Open |