Experiences with Implementing Landmark Embedding in Neo4j

Loading...
Thumbnail Image
Date
2019
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Contribution to a conference collection
Publication status
Published
Published in
Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) - GRADES-NDA'19. - New York : ACM Press, 2019. - 7. - ISBN 978-1-4503-6789-9
Abstract
Reachability, distance, and shortest path queries are fundamental operations in the field of graph data management with various applications in research and industry. However, while various preprocessing-based methods have been proposed to optimize the computation of such queries, the integration of existing methods into graph database management systems and processing frameworks has been limited. In this paper, we present an implementation of a static graph index that employs landmark embedding for Neo4j, to enable the index-based computation of reachability, distance, and shortest path queries on the database. We explore different strategies for selecting landmarks and different schemes for storing the precomputed landmark distances. To evaluate the efficiency of each landmark selection strategy and each storage scheme, we conduct an experimental evaluation using four real-world network datasets. We measure the preprocessing cost, the query processing time, and the accuracy of the distance estimation of different configurations of our index structure.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
The 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), Jun 30, 2019 - Jul 5, 2019, Amsterdam, Netherlands
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690HOTZ, Manuel, Theodoros CHONDROGIANNIS, Leonard WÖRTELER, Michael GROSSNIKLAUS, 2019. Experiences with Implementing Landmark Embedding in Neo4j. The 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA). Amsterdam, Netherlands, Jun 30, 2019 - Jul 5, 2019. In: Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) - GRADES-NDA'19. New York:ACM Press, 7. ISBN 978-1-4503-6789-9. Available under: doi: 10.1145/3327964.3328496
BibTex
@inproceedings{Hotz2019Exper-46242,
  year={2019},
  doi={10.1145/3327964.3328496},
  title={Experiences with Implementing Landmark Embedding in Neo4j},
  isbn={978-1-4503-6789-9},
  publisher={ACM Press},
  address={New York},
  booktitle={Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)  - GRADES-NDA'19},
  author={Hotz, Manuel and Chondrogiannis, Theodoros and Wörteler, Leonard and Grossniklaus, Michael},
  note={Article Number: 7}
}
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/46242">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/46242/1/Hotz_2-1dsppp9sa57ng0.pdf"/>
    <dcterms:abstract xml:lang="eng">Reachability, distance, and shortest path queries are fundamental operations in the field of graph data management with various applications in research and industry. However, while various preprocessing-based methods have been proposed to optimize the computation of such queries, the integration of existing methods into graph database management systems and processing frameworks has been limited. In this paper, we present an implementation of a static graph index that employs landmark embedding for Neo4j, to enable the index-based computation of reachability, distance, and shortest path queries on the database. We explore different strategies for selecting landmarks and different schemes for storing the precomputed landmark distances. To evaluate the efficiency of each landmark selection strategy and each storage scheme, we conduct an experimental evaluation using four real-world network datasets. We measure the preprocessing cost, the query processing time, and the accuracy of the distance estimation of different configurations of our index structure.</dcterms:abstract>
    <dcterms:issued>2019</dcterms:issued>
    <dc:creator>Hotz, Manuel</dc:creator>
    <dc:contributor>Chondrogiannis, Theodoros</dc:contributor>
    <dc:contributor>Hotz, Manuel</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/46242/1/Hotz_2-1dsppp9sa57ng0.pdf"/>
    <dc:creator>Chondrogiannis, Theodoros</dc:creator>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Grossniklaus, Michael</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Grossniklaus, Michael</dc:creator>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/46242"/>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-07-08T12:52:31Z</dc:date>
    <dc:contributor>Wörteler, Leonard</dc:contributor>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2019-07-08T12:52:31Z</dcterms:available>
    <dc:creator>Wörteler, Leonard</dc:creator>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:title>Experiences with Implementing Landmark Embedding in Neo4j</dcterms:title>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
Yes
Refereed