Towards a benchmark for graph data management and processing

Cite This

Files in this item

Checksum: MD5:4f7268c907b5d047f095acb06a29bca3

GROSSNIKLAUS, Michael, Stefania LEONE, Tilmann ZÄSCHKE, 2013. Towards a benchmark for graph data management and processing

@techreport{Grossniklaus2013Towar-24253, series={University of Konstanz : Department of Computer and Information Science :Technical Report;KN-2013-DBIS-01}, title={Towards a benchmark for graph data management and processing}, year={2013}, author={Grossniklaus, Michael and Leone, Stefania and Zäschke, Tilmann} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dc:date rdf:datatype="">2013-08-20T14:46:39Z</dc:date> <dspace:hasBitstream rdf:resource=""/> <dcterms:rights rdf:resource=""/> <dc:contributor>Grossniklaus, Michael</dc:contributor> <dc:contributor>Leone, Stefania</dc:contributor> <dcterms:hasPart rdf:resource=""/> <dc:contributor>Zäschke, Tilmann</dc:contributor> <dcterms:abstract xml:lang="eng">Graph data is used in an increasing number of analytical data processing applications, ranging from social network analysis, to monitoring of network traffic, and to ontologies in the semantic web. Both application-specific and general graph data management systems have been proposed to address this trend. Nevertheless, it would be foolish to dismiss relational and object databases as possible solutions for graph data management and processing, due to the vast amount of experience that they encompass. As a consequence, graph data analysts are faced with a broad variety of choices and approaches. However, regardless of the approach taken, users need to be able to evaluate and assess which of the many possible solutions works best in their use case. We propose a benchmark in terms of a data model, query workload, sample data sets, and usage scenarios. We also report performance figures measured based on an open-source graph database as well as commercial relational and object databases. Finally, we discuss how our benchmark can be used to characterize databases with respect to particular application scenarios.</dcterms:abstract> <dc:creator>Zäschke, Tilmann</dc:creator> <dc:language>eng</dc:language> <dcterms:issued>2013</dcterms:issued> <dspace:isPartOfCollection rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:rights>terms-of-use</dc:rights> <dc:creator>Leone, Stefania</dc:creator> <dcterms:isPartOf rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Grossniklaus, Michael</dc:creator> <dcterms:available rdf:datatype="">2013-08-20T14:46:39Z</dcterms:available> <bibo:uri rdf:resource=""/> <dcterms:title>Towards a benchmark for graph data management and processing</dcterms:title> </rdf:Description> </rdf:RDF>

Downloads since Oct 1, 2014 (Information about access statistics)

Grossniklaus_242536.pdf 1379

This item appears in the following Collection(s)

Search KOPS


My Account