Route planning on GTFS using Neo4j

Vágner, Anikó (2021) Route planning on GTFS using Neo4j Annales Mathematicae et Informaticae (54.). pp. 163-179. ISSN 1787-6117 (Online)

[img] pdf

Download (680kB)
Hivatalos webcím (URL):

Absztrakt (kivonat)

GTFS (General Transit Feed Specification) is a standard of Google for public transportation schedules. The specification describes stops, routes, dates, trips, etc. of one or more public transportation company for a city or a country. Examining a GTFS feed it can be considered as a graph. In addition in the last decades new database management systems was born in order to support the big data era and/or help to write program codes. Their collective name is the NoSQL databases, which covers many types of database systems. One type of them is the graph databases, from which the Neo4j is the most widespread. In this paper I try to find the answer for the question how the Neo4j can support the usage of the GTFS. The most obvious usage of the GTFS is the route planning for which the Neo4j offers some algorithms. I built some storage structures on which the tools provided by Neo4j can be effectively used to plan routes on GTFS data.

Mű típusa: Folyóiratcikk
Szerző neveMTMT azonosítóORCID azonosítóKözreműködés
Megjegyzés: Published online: July 23, 2021 ----- The work is supported by the EFOP-3.6.1-16-2016-00022 project. The project is co-nanced by the European Union and the European Social Fund.
Kapcsolódó URL-ek:
Kulcsszavak: Graph database, GTFS, route planning
Nyelv: angol
DOI azonosító: 10.33039/ami.2021.07.001
ISSN: 1787-6117 (Online)
Felhasználó: Tibor Gál
Dátum: 23 Júl 2021 06:48
Utolsó módosítás: 23 Dec 2021 08:17
Műveletek (bejelentkezés szükséges)
Tétel nézet Tétel nézet