Skip to content
naulon
Not checkedNot checked for notices yet.

Graph Database Schema for Multimodal Transportation in Semarang

Panji Wisnu Wirawan, Djalal Er Riyanto, Dinar Mutiara Kusumo Nugraheni and 1 more

Journal of Information Systems Engineering and Business Intelligence · 2019

doi:10.20473/jisebi.5.2.163-170 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Background: Semarang has broad area that cannot be covered entirely by single transportation mode. To reach a specific location, people often use more than one public transportation mode. Apart from Bus Rapid Transit, another exist namely angkot or city transportation. Multimodal traveler information is then required to help passenger searching for a route. Several studies of multimodal traveler information system has been conducted, however the data model for multimodal transportation did not conceived in detail.Objective: Proposes a database of multimodal transportation design using graph data model by taking Semarang as a case study.Method: We create our model in oriented entity-relationship diagram (O-ERD) and map this O-ERD to the graph database schema.Result: We develop our data model in graph database schema and we implement the model using Neo4J graph database for validation purpose. Our model consist of three graph node label namely Shelter, Angkot Stopper, and Closer Place. To validate our model, we execute a search query using the Cypher query to look for location with closer place to it.Conclusion: Our data model was successfully developed and implemented. Searching transportation route in the implementation of our model has been conducted using cypher query. It can successfully display all possible paths and routes. Our query can distinguish between one mode of transportation with another.Keywords: Graph database, Multimodal transportation, Neo4j, Cypher

Abstract licence: CC BY

References21

    21 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.