Experiences with Implementing Landmark Embedding in Neo4j-Reference-Cited by-同舟云学术

Experiences with Implementing Landmark Embedding in Neo4j

Published:2019 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2nd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA) - GRADES-NDA'19
language:
Short-container-title:

Author:

Hotz Manuel¹,Chondrogiannis Theodoros¹,Wörteler Leonard¹,Grossniklaus Michael¹

Affiliation:

1. University of Konstanz, Konstanz, Germany

Funder

Deutsche Forschungsgemeinschaft

Publisher

ACM Press

Reference30 articles.

1. Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Antti Ukkonen. 2014. Distance oracles in edge-labeled graphs. In Proc. EDBT.

2. Angela Bonifati, George Fletcher, Hannes Voigt, and Nikolay Yakovets. 2018. Querying graphs. Morgan & Claypool Publishers.

3. Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper, and Ulf Leser. 2017. Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. In Proc. EDBT. 414--425.

4. Theodoros Chondrogiannis and Johann Gamper. 2014. Exploring Graph Partitioning for Shortest Path Queries on Road Networks. In Proc. GI-Workshop Grundlagen von Datenbanken. 71--76.

5. Theodoros Chondrogiannis and Johann Gamper. 2016. ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks. In Proc. MDM. IEEE, 242--251.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A novel framework for the efficient evaluation of hybrid tree-pattern queries on large data graphs;Information Systems;2023-07

2. Online Landmark-Based Batch Processing of Shortest Path Queries;33rd International Conference on Scientific and Statistical Database Management;2021-07-06