2021
DOI: 10.33039/ami.2021.07.001
|View full text |Cite
|
Sign up to set email alerts
|

Route planning on GTFS using Neo4j

Abstract: 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 databa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The basic structure includes nodes, relationships and properties. Nodes are connected via relationships to form a network structure [35].…”
Section: Construction Of the Knowledge Graphmentioning
confidence: 99%
“…The basic structure includes nodes, relationships and properties. Nodes are connected via relationships to form a network structure [35].…”
Section: Construction Of the Knowledge Graphmentioning
confidence: 99%
“…In summary, the query computes the nearest nodes to user-defined starting and ending points (start_node, end_node) within the graph. It uses Dijkstra's algorithm through the shortestPath function in Cypher to determine the shortest path between these nodes [44,45], which are connected by the hasNeighbor relation. The maximum distance allowed between the given starting and ending nodes is set to 15 hops.…”
Section: Computing Shortest Paths Based On Air Pollution Data With Gr...mentioning
confidence: 99%