Graph Database Schema for Multimodal Transportation in Semarang

P. W. Wirawan, D. E. Riyanto, D. Nugraheni, Yasmin Yasmin
{"title":"Graph Database Schema for Multimodal Transportation in Semarang","authors":"P. W. Wirawan, D. E. Riyanto, D. Nugraheni, Yasmin Yasmin","doi":"10.20473/jisebi.5.2.163-170","DOIUrl":null,"url":null,"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","PeriodicalId":16185,"journal":{"name":"Journal of Information Systems Engineering and Business Intelligence","volume":"209 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Information Systems Engineering and Business Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20473/jisebi.5.2.163-170","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

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
三宝垄多式联运的图形数据库模式
背景:三宝垄地域广阔,单一的运输方式无法完全覆盖。为了到达一个特定的地点,人们经常使用多种公共交通工具。除了快速公交,还有另一种交通方式,即吴哥或城市交通。然后需要多式联运旅行者信息来帮助乘客搜索路线。对多式联运旅客信息系统进行了一些研究,但对多式联运的数据模型并没有详细的设想。目的:以三宝垄为例,提出基于图形数据模型的多式联运设计数据库。方法:在面向实体关系图(O-ERD)中创建模型,并将其映射到图形数据库模式。结果:我们在图形数据库模式中开发数据模型,并使用Neo4J图形数据库实现模型以进行验证。我们的模型由三个图节点标签组成,分别是Shelter、Angkot Stopper和Closer Place。为了验证我们的模型,我们使用Cypher查询执行一个搜索查询,以查找离它最近的位置。结论:我们的数据模型开发和实施成功。在我们的模型实现中,运输路线的搜索是使用密码查询进行的。它可以成功地显示所有可能的路径和路由。我们的查询可以区分不同的运输方式。关键词:图数据库,多式联运,Neo4j, Cypher
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.30
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信