Ανάπτυξη τελεστών ερώτησης NoDA για δεδομένα οδικών δικτύων με χρήση της Neo4J
View/
Keywords
NoDA ; Neo4j ; Δίκτυα δρόμων ; Shortest path ; Graph database ; OpenStreetMapAbstract
The present thesis focuses on developing operators for the NoDA system, with an
emphasis on solving complex queries related to road networks. NoDA is an abstraction layer used for accessing NoSQL storage engines in a unified manner. Its primary focus is on scalable management of mobility data, particularly
spatio-temporal operators. NoDA is ideal for developers and data analysts who want
to execute queries on NoSQL databases without needing to use the respective drivers.
Through a flexible interface, users can perform both simple and complex queries,
depending on their needs. So far, NoDA can operate with MongoDB, HBase, Redis, and
Neo4j. The main objective this thesis is initially the design of storing the road network and
the objects located on the road network in a Graph Database (Neo4j), followed by the
creation of NoDA operators for executing queries on this road network. These queries
will involve calculating the shortest path between two points on the road network and
finding objects on this network based on a specific distance and within a certain time
frame.
Postgraduate Studies Programme
Πληροφοριακά Συστήματα και ΥπηρεσίεςDepartment
Σχολή Τεχνολογιών Πληροφορικής και Επικοινωνιών. Τμήμα Ψηφιακών ΣυστημάτωνNumber of pages
50Language
GreekCollections
Except where otherwise noted, this item's license is described as
Αναφορά Δημιουργού-Μη Εμπορική Χρήση 3.0 Ελλάδα
Αναφορά Δημιουργού-Μη Εμπορική Χρήση 3.0 Ελλάδα