Towards a benchmark for graph data management and processing

Lade...
Vorschaubild
Dateien
Grossniklaus_242536.pdf
Grossniklaus_242536.pdfGröße: 675.69 KBDownloads: 807
Datum
2013
Autor:innen
Leone, Stefania
Zäschke, Tilmann
Herausgeber:innen
Kontakt
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
University of Konstanz : Department of Computer and Information Science :Technical Report;KN-2013-DBIS-01
Auflagebezeichnung
DOI (zitierfähiger Link)
ArXiv-ID
Internationale Patentnummer
EU-Projektnummer
DFG-Projektnummer
Projekt
Open Access-Veröffentlichung
Gesperrt bis
Titel in einer weiteren Sprache
Forschungsvorhaben
Organisationseinheiten
Zeitschriftenheft
Publikationstyp
Working Paper/Technical Report
Publikationsstatus
unikn.publication.listelement.citation.prefix.version.undefined
Zusammenfassung

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.

Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690GROSSNIKLAUS, Michael, Stefania LEONE, Tilmann ZÄSCHKE, 2013. Towards a benchmark for graph data management and processing
BibTex
@techreport{Grossniklaus2013Towar-24253,
  year={2013},
  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},
  author={Grossniklaus, Michael and Leone, Stefania and Zäschke, Tilmann}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/24253">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <dc:creator>Zäschke, Tilmann</dc:creator>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dc:contributor>Leone, Stefania</dc:contributor>
    <dc:contributor>Zäschke, Tilmann</dc:contributor>
    <dcterms:title>Towards a benchmark for graph data management and processing</dcterms:title>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24253/2/Grossniklaus_242536.pdf"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-20T14:46:39Z</dc:date>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/24253/2/Grossniklaus_242536.pdf"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-20T14:46:39Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:issued>2013</dcterms:issued>
    <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>Grossniklaus, Michael</dc:creator>
    <dc:creator>Leone, Stefania</dc:creator>
    <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24253"/>
  </rdf:Description>
</rdf:RDF>
Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Kontakt
URL der Originalveröffentl.
Prüfdatum der URL
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet