An Algebra and Equivalences to Transform Graph Patterns in Neo4j

Cite This

Files in this item

Checksum: MD5:d1b8abf4571d962161e28c96066e16c3

HÖLSCH, Jürgen, Michael GROSSNIKLAUS, 2016. An Algebra and Equivalences to Transform Graph Patterns in Neo4j. EDBT/ICDT 2016 Workshops : EDBT Workshop on Querying Graph Structured Data (GraphQ). Bordeaux, France, Mar 15, 2016. In: PALPANAS, Themis, ed., Kostas STEFANIDIS, ed.. Proceedings of the Workshops of the EDBT/ICDT 2016 Joint Conference (EDBT/ICDT 2016). ISSN 1613-0073

@inproceedings{Holsch2016Algeb-33584, title={An Algebra and Equivalences to Transform Graph Patterns in Neo4j}, url={}, year={2016}, number={1558}, issn={1613-0073}, series={CEUR Workshop Proceedings}, booktitle={Proceedings of the Workshops of the EDBT/ICDT 2016 Joint Conference (EDBT/ICDT 2016)}, editor={Palpanas, Themis and Stefanidis, Kostas}, author={Hölsch, Jürgen and Grossniklaus, Michael} }

<rdf:RDF xmlns:dcterms="" xmlns:dc="" xmlns:rdf="" xmlns:bibo="" xmlns:dspace="" xmlns:foaf="" xmlns:void="" xmlns:xsd="" > <rdf:Description rdf:about=""> <dcterms:isPartOf rdf:resource=""/> <dc:rights>terms-of-use</dc:rights> <dc:language>eng</dc:language> <dcterms:available rdf:datatype="">2016-04-15T12:31:44Z</dcterms:available> <dcterms:title>An Algebra and Equivalences to Transform Graph Patterns in Neo4j</dcterms:title> <dcterms:rights rdf:resource=""/> <dcterms:abstract xml:lang="eng">Modern query optimizers of relational database systems embody more than three decades of research and practice in the area of data management and processing. Key advances in- clude algebraic query transformation, intelligent search space pruning, and modular optimizer architectures. Surprisingly, many of these contributions seem to have been overlooked in the emerging field of graph databases so far. In particular, we believe that query optimization based on a general graph algebra and its equivalences can greatly improve on the current state of the art. Although some graph algebras have already been proposed, they have often been developed in a context, in which a relational database system is used as a backend to process graph data. As a consequence, these algebras are typically tightly coupled to the relational algebra, making them unsuitable for native graph databases. While we support the approach of extending the relational algebra, we argue that graph-specific operations should be defined at a higher level, independent of the database backend. In this paper, we introduce such a general graph algebra and corresponding equivalences. We demonstrate how it can be used to optimize Cypher queries in the setting of the Neo4j native graph database.</dcterms:abstract> <dspace:isPartOfCollection rdf:resource=""/> <dcterms:hasPart rdf:resource=""/> <bibo:uri rdf:resource=""/> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:creator>Hölsch, Jürgen</dc:creator> <dspace:hasBitstream rdf:resource=""/> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> <dc:date rdf:datatype="">2016-04-15T12:31:44Z</dc:date> <dc:contributor>Hölsch, Jürgen</dc:contributor> <dcterms:issued>2016</dcterms:issued> <dc:creator>Grossniklaus, Michael</dc:creator> <dc:contributor>Grossniklaus, Michael</dc:contributor> </rdf:Description> </rdf:RDF>

Downloads since Apr 15, 2016 (Information about access statistics)

Hoelsch_0-326779.pdf 669

This item appears in the following Collection(s)

Search KOPS


My Account