Skip to content

utkucanturkan/Path-Query-Processing-under-Multiple-Criteria-and-Constraints-on-Graph-Databases

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

75 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Master Project Neo4j Implementation

Route Skyline Queries: A Multi-Preference Path Planning Approach

Kriegel, H.-P., Renz, M., & Schubert, M. (2010). Route skyline queries: A multi-preference path planning approach. 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). doi: 10.1109/icde.2010.5447845

The implementation of two route skyline queries on multi-attribute road networks. The algorithms that are called Basic Route Skyline Computation (BRSC) and Advanced Route Skyline Computation (ARSC) are defined on the paper as pseudocode. In this repository, there are implementations for Neo4j platform which is a graph database management system.

Presentation - Slides

Implementation - Slides

Effective lower bound computing method: Pareto-prep

Shekelyan, Michael & Jossé, Gregor & Schubert, Matthias. (2015). ParetoPrep: Efficient Lower Bounds for Path Skylines and Fast Path Computation. 9239. 40-58. 10.1007/978-3-319-22363-6_3.

Cache policies

About

Route Skyline Queries: A Multi-Preference Path Planning Approach

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%