Public Transit Route Planning through Lightweight Linked Data Interfaces
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.
full text BibTeX other citation formats
Published in 2017 in Proceedings of the 17th International Conference on Web Engineering.
- Linked Data
- public transport
- route planning
- Web API
- open data
- Linked Connections
- reuse
- hypermedia
- research
Read this article online
- Read the full text online.
- Request a digital copy of this article.
- Comment on this article.
Cite this article in your work
Cite this article easily using its BibTeX entry:
@inproceedings{colpaert_icwe_2017,
author = {Colpaert, Pieter and Verborgh, Ruben and Mannens, Erik},
title = {Public Transit Route Planning through Lightweight {Linked Data} Interfaces},
booktitle = {Proceedings of the 17th International Conference on Web Engineering},
year = 2017,
month = jun,
editor = {Cabot, Jordi and de Virgilio, Roberto and Torlone, Riccardo},
volume = 10360,
pages = {403--411},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
url = {https://pietercolpaert.be/papers/icwe2017-lc/paper.pdf},
doi = {10.1007/978-3-319-60131-1_26},
}
Alternatively, pick a reference of your choice below:
- ACM
- Pieter Colpaert, Ruben Verborgh, and Erik Mannens. 2017. Public Transit Route Planning through Lightweight Linked Data Interfaces. In Proceedings of the 17th International Conference on Web Engineering (Lecture Notes in Computer Science), Springer, 403–411.
- 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.), Proceedings of the 17th International Conference on Web Engineering (Vol. 10360, pp. 403–411). Springer.
- IEEE
- P. Colpaert, R. Verborgh, and E. Mannens, “Public Transit Route Planning through Lightweight Linked Data Interfaces,” in Proceedings of the 17th International Conference on Web Engineering, 2017, vol. 10360, pp. 403–411.
- LNCS
- Colpaert, P., Verborgh, R., Mannens, E.: Public Transit Route Planning through Lightweight Linked Data Interfaces. In: Cabot, J., Virgilio, R. de, and Torlone, R. (eds.) Proceedings of the 17th International Conference on Web Engineering. pp. 403–411. Springer (2017).
- MLA
- Colpaert, Pieter, et al. “Public Transit Route Planning through Lightweight Linked Data Interfaces.” Proceedings of the 17th International Conference on Web Engineering, edited by Jordi Cabot et al., vol. 10360, Springer, 2017, pp. 403–11.
Discuss this article
- Discover all publications by Ruben Verborgh.
- Find related articles on Google Scholar.
- Post your questions or comments below.