Publikation: On the Performance of Analytical and Pattern Matching Graph Queries in Neo4j and a Relational Database
Dateien
Datum
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Graph databases with a custom non-relational backend promote themselves to outperform relational databases in answering queries on large graphs. Recent empirical studies show that this claim is not always true. However, these studies focus only on pattern matching queries and neglect analytical queries used in practice such as shortest path, diameter, degree centrality or closeness centrality. In addition, there is no distinction between different types of pattern matching queries. In this paper, we introduce a set of analytical and pattern matching queries, and evaluate them in Neo4j and a market-leading commercial relational database system. We show that the relational database system outperforms Neo4j for our analytical queries and that Neo4j is faster for queries that do not filter on specific edge types.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
HÖLSCH, Jürgen, Tobias SCHMIDT, Michael GROSSNIKLAUS, 2017. On the Performance of Analytical and Pattern Matching Graph Queries in Neo4j and a Relational Database. EDBT/ICDT 2017 Joint Conference : 6th International Workshop on Querying Graph Structured Data (GraphQ). Venice, Italy, 21. März 2017 - 24. März 2017. In: IOANNIDIS, Yannis, ed. and others. Proceedings of the Workshops of the EDBT/ICDT 2017 Joint Conference. Aachen: CEUR-WS.org, 2017. CEUR workshop proceedings. 1810. eISSN 1613-0073BibTex
@inproceedings{Holsch2017Perfo-39842, year={2017}, title={On the Performance of Analytical and Pattern Matching Graph Queries in Neo4j and a Relational Database}, url={http://ceur-ws.org/Vol-1810/GraphQ_paper_01.pdf}, number={1810}, publisher={CEUR-WS.org}, address={Aachen}, series={CEUR workshop proceedings}, booktitle={Proceedings of the Workshops of the EDBT/ICDT 2017 Joint Conference}, editor={Ioannidis, Yannis}, author={Hölsch, Jürgen and Schmidt, Tobias and Grossniklaus, Michael} }
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/39842"> <dc:creator>Grossniklaus, Michael</dc:creator> <dc:contributor>Grossniklaus, Michael</dc:contributor> <dc:creator>Schmidt, Tobias</dc:creator> <dc:creator>Hölsch, Jürgen</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-11T09:27:25Z</dcterms:available> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dcterms:title>On the Performance of Analytical and Pattern Matching Graph Queries in Neo4j and a Relational Database</dcterms:title> <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39842/1/Hoelsch_0-421199.pdf"/> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:contributor>Schmidt, Tobias</dc:contributor> <dc:contributor>Hölsch, Jürgen</dc:contributor> <dc:language>eng</dc:language> <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39842/1/Hoelsch_0-421199.pdf"/> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:rights>terms-of-use</dc:rights> <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/> <dcterms:issued>2017</dcterms:issued> <dcterms:abstract xml:lang="eng">Graph databases with a custom non-relational backend promote themselves to outperform relational databases in answering queries on large graphs. Recent empirical studies show that this claim is not always true. However, these studies focus only on pattern matching queries and neglect analytical queries used in practice such as shortest path, diameter, degree centrality or closeness centrality. In addition, there is no distinction between different types of pattern matching queries. In this paper, we introduce a set of analytical and pattern matching queries, and evaluate them in Neo4j and a market-leading commercial relational database system. We show that the relational database system outperforms Neo4j for our analytical queries and that Neo4j is faster for queries that do not filter on specific edge types.</dcterms:abstract> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39842"/> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-11T09:27:25Z</dc:date> </rdf:Description> </rdf:RDF>