Public transit route planning through lightweight linked data interfaces
- Author
- Pieter Colpaert (UGent) , Ruben Verborgh (UGent) and Erik Mannens (UGent)
- Organization
- Abstract
- While some public transit data publishers only provide a data dump – which only few reusers can afford to integrate within their applications – others provide a use case limiting origin-destination route planning api. The Linked Connections framework instead introduces a hypermedia api, over which the extendable base route planning algorithm “Connections Scan Algorithm” can be implemented. We compare the cpu usage and query execution time of a traditional server-side route planner with the cpu time and query execution time of a Linked Connections interface by evaluating query mixes with increasing load. We found that, at the expense of a higher bandwidth consumption, more queries can be answered using the same hardware with the Linked Connections server interface than with an origin-destination api, thanks to an average cache hit rate of 78%. The findings from this research show a cost-efficient way of publishing transport data that can bring federated public transit route planning at the fingertips of anyone.
- Keywords
- Linked data, Public transport, Route planning, Open data
Downloads
-
(...).pdf
- full text (Published version)
- |
- UGent only
- |
- |
- 330.64 KB
Citation
Please use this url to cite or link to this publication: http://hdl.handle.net/1854/LU-8660637
- MLA
- Colpaert, Pieter, et al. “Public Transit Route Planning through Lightweight Linked Data Interfaces.” Web Engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings, edited by J Cabot et al., vol. 10360, 2017, pp. 403–11, doi:10.1007/978-3-319-60131-1_26.
- APA
- Colpaert, P., Verborgh, R., & Mannens, E. (2017). Public transit route planning through lightweight linked data interfaces. In J. Cabot, R. De Virgilio, & R. Torlone (Eds.), Web engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings (Vol. 10360, pp. 403–411). https://doi.org/10.1007/978-3-319-60131-1_26
- Chicago author-date
- Colpaert, Pieter, Ruben Verborgh, and Erik Mannens. 2017. “Public Transit Route Planning through Lightweight Linked Data Interfaces.” In Web Engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings, edited by J Cabot, R De Virgilio, and R Torlone, 10360:403–11. Cham. https://doi.org/10.1007/978-3-319-60131-1_26.
- Chicago author-date (all authors)
- Colpaert, Pieter, Ruben Verborgh, and Erik Mannens. 2017. “Public Transit Route Planning through Lightweight Linked Data Interfaces.” In Web Engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings, ed by. J Cabot, R De Virgilio, and R Torlone, 10360:403–411. Cham. doi:10.1007/978-3-319-60131-1_26.
- Vancouver
- 1.Colpaert P, Verborgh R, Mannens E. Public transit route planning through lightweight linked data interfaces. In: Cabot J, De Virgilio R, Torlone R, editors. Web engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings. Cham; 2017. p. 403–11.
- IEEE
- [1]P. Colpaert, R. Verborgh, and E. Mannens, “Public transit route planning through lightweight linked data interfaces,” in Web engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings, Rome, Italy, 2017, vol. 10360, pp. 403–411.
@inproceedings{8660637,
abstract = {{While some public transit data publishers only provide a data dump – which only few reusers can afford to integrate within their applications – others provide a use case limiting origin-destination route planning api. The Linked Connections framework instead introduces a hypermedia api, over which the extendable base route planning algorithm “Connections Scan Algorithm” can be implemented. We compare the cpu usage and query execution time of a traditional server-side route planner with the cpu time and query execution time of a Linked Connections interface by evaluating query mixes with increasing load. We found that, at the expense of a higher bandwidth consumption, more queries can be answered using the same hardware with the Linked Connections server interface than with an origin-destination api, thanks to an average cache hit rate of 78%. The findings from this research show a cost-efficient way of publishing transport data that can bring federated public transit route planning at the fingertips of anyone.}},
author = {{Colpaert, Pieter and Verborgh, Ruben and Mannens, Erik}},
booktitle = {{Web engineering, 17th International Conference, ICWE 2017, Rome, Italy, June 5-8, 2017, Proceedings}},
editor = {{Cabot, J and De Virgilio, R and Torlone, R}},
isbn = {{9783319601304}},
issn = {{0302-9743}},
keywords = {{Linked data,Public transport,Route planning,Open data}},
language = {{eng}},
location = {{Rome, Italy}},
pages = {{403--411}},
title = {{Public transit route planning through lightweight linked data interfaces}},
url = {{http://doi.org/10.1007/978-3-319-60131-1_26}},
volume = {{10360}},
year = {{2017}},
}
- Altmetric
- View in Altmetric