{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:21:54Z","timestamp":1777890114014,"version":"3.51.4"},"reference-count":50,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T00:00:00Z","timestamp":1682294400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SW"],"published-print":{"date-parts":[[2023,4,24]]},"abstract":"<jats:p>Publishing transport data on the Web for consumption by others poses several challenges for data\u00a0publishers. In addition to planned schedules, access to live schedule updates (e.g. delays or cancellations) and historical data is fundamental to enable reliable applications and to support machine learning use cases. However publishing such dynamic data further increases the computational burden for data publishers, resulting in often unavailable historical data and live schedule updates for most public transport networks. In this paper we apply and extend the current Linked Connections approach for static data to also support cost-efficient live and historical public transport data publishing on the Web. Our contributions include (i)\u00a0a reference specification and system architecture to support cost-efficient publishing of dynamic public transport schedules and historical data; (ii)\u00a0empirical evaluations on route planning query performance based on data fragmentation size, publishing costs and a comparison with a traditional route planning engine such as OpenTripPlanner; (iii)\u00a0an analysis of potential correlations of query performance with particular public transport network characteristics such as size, average degree, density, clustering coefficient and average connection duration. Results confirm that fragmentation size influences route planning query performance and converges on an optimal fragment size per network. Size (stops), density and connection duration also show correlation with route planning query performance. Our approach proves to be more cost-efficient and in some cases outperforms OpenTripPlanner when supporting the earliest arrival time route planning use case. Moreover, the cost of publishing live and historical schedules remains in the same order of magnitude for server-side resources compared to publishing planned schedules only. Yet, further optimizations are needed for larger networks (&gt;1000 stops) to be useful in practice. Additional dataset fragmentation strategies (e.g. geospatial) may be studied for designing more scalable and performant Web apis that adapt to particular use cases, not only limited to the public transport domain.<\/jats:p>","DOI":"10.3233\/sw-223116","type":"journal-article","created":{"date-parts":[[2023,4,21]],"date-time":"2023-04-21T13:11:43Z","timestamp":1682082703000},"page":"659-693","source":"Crossref","is-referenced-by-count":2,"title":["Publishing public transport data on the Web with the Linked\u00a0Connections framework"],"prefix":"10.1177","volume":"14","author":[{"given":"Juli\u00e1n Andr\u00e9s","family":"Rojas","sequence":"first","affiliation":[{"name":"IDLab, Department of Electronics and Information Systems, Ghent University-imec, Belgium"}]},{"given":"Harm","family":"Delva","sequence":"additional","affiliation":[{"name":"IDLab, Department of Electronics and Information Systems, Ghent University-imec, Belgium"}]},{"given":"Pieter","family":"Colpaert","sequence":"additional","affiliation":[{"name":"IDLab, Department of Electronics and Information Systems, Ghent University-imec, Belgium"}]},{"given":"Ruben","family":"Verborgh","sequence":"additional","affiliation":[{"name":"IDLab, Department of Electronics and Information Systems, Ghent University-imec, Belgium"}]}],"member":"179","reference":[{"key":"10.3233\/SW-223116_ref4","doi-asserted-by":"crossref","unstructured":"H. Bast, M. Hertel and S. Storandt, Scalable transfer patterns, in: 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 2016.","DOI":"10.1137\/1.9781611974317.2"},{"issue":"1","key":"10.3233\/SW-223116_ref5","doi-asserted-by":"publisher","first-page":"158","DOI":"10.3141\/2111-18","article-title":"Beyond generating transit performance measures: Visualizations and statistical analysis with historical data","volume":"2111","author":"Berkow","year":"2009","journal-title":"Transportation Research Record"},{"key":"10.3233\/SW-223116_ref6","doi-asserted-by":"publisher","DOI":"10.13052\/jwe1540-9589.19563"},{"issue":"5","key":"10.3233\/SW-223116_ref7","first-page":"34","volume":"284","author":"Berners-Lee","year":"2001","journal-title":"The Semantic Web, Scientific American"},{"issue":"3","key":"10.3233\/SW-223116_ref8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/jswis.2009081901","article-title":"Linked data-the story so far","volume":"5","author":"Bizer","year":"2009","journal-title":"International journal on semantic web and information systems"},{"issue":"4","key":"10.3233\/SW-223116_ref9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: Structure and dynamics","volume":"424","author":"Boccaletti","year":"2006","journal-title":"Physics Reports"},{"key":"10.3233\/SW-223116_ref10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2003.12.019","article-title":"Time-dependent networks as models to achieve fast exact time-table queries","volume":"92","author":"Brodal","year":"2004","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.3233\/SW-223116_ref11","unstructured":"D. Chaves-Fraga, A. Ant\u00f3n, J. Toledo and \u00d3. Corcho, ONETT: Systematic knowledge graph generation for national access points, in: SEM4TRA-AMAR@SEMANTICS, 2019."},{"key":"10.3233\/SW-223116_ref12","unstructured":"D. Chaves-Fraga, J. Rojas, P. Vandenberghe, P. Colpaert and \u00d3. Corcho, The tripscore linked data client: Calculating specific summaries over large time series, in: DeSemWeb@ISWC, 2017."},{"key":"10.3233\/SW-223116_ref13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.retrec.2018.07.030","article-title":"Graph theoretical analysis of the Chinese high-speed rail network over time","volume":"72","author":"Chen","year":"2018","journal-title":"Research in Transportation Economics"},{"key":"10.3233\/SW-223116_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32327-1_3"},{"key":"10.3233\/SW-223116_ref15","unstructured":"P. Colpaert, A. Llaves, R. Verborgh, O. Corcho, E. Mannens and R. Van de Walle, Intermodal public transit routing using Linked Connections, in: Proceedings of the 14th International Semantic Web Conference: Posters and Demos, CEUR Workshop Proceedings, Vol. 1486, 2015, ISSN 1613-0073, http:\/\/ceur-ws.org\/Vol-1486\/paper_28.pdf."},{"key":"10.3233\/SW-223116_ref16","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2677833"},{"key":"10.3233\/SW-223116_ref17","isbn-type":"print","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/978-3-319-60131-1_26","volume-title":"Public Transit Route Planning Through Lightweight Linked Data Interfaces","author":"Colpaert","year":"2017","ISBN":"https:\/\/id.crossref.org\/isbn\/9783319601311"},{"key":"10.3233\/SW-223116_ref18","doi-asserted-by":"crossref","unstructured":"T. Davies, S.B. Walker, M. Rubenstein and F. Perini, The State of Open Data: Histories and Horizons, African Minds, 2019. ISBN 9781928331957.","DOI":"10.47622\/9781928331957"},{"key":"10.3233\/SW-223116_ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.5"},{"key":"10.3233\/SW-223116_ref20","doi-asserted-by":"crossref","unstructured":"D. Delling, T. Pajor and R.F. Werneck, Round-based public transit routing, in: Proceedings of the Meeting on Algorithm Engineering & Expermiments, ALENEX \u201912, Society for Industrial and Applied Mathematics, 2012, pp. 130\u2013140.","DOI":"10.1137\/1.9781611972924.13"},{"key":"10.3233\/SW-223116_ref21","doi-asserted-by":"crossref","unstructured":"H. Delva, J. Rojas Mel\u00e9ndez, P. Colpaert and R. Verborgh, Geospatially partitioning public transit networks for open data publishing, Journal of Web Engineering (2021).","DOI":"10.13052\/jwe1540-9589.2045"},{"issue":"1","key":"10.3233\/SW-223116_ref22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.3141\/2112-03","article-title":"Network analysis of world subway systems using updated graph theory","volume":"2112","author":"Derrible","year":"2009","journal-title":"Transportation Research Record"},{"issue":"4","key":"10.3233\/SW-223116_ref23","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1080\/01441647.2010.543709","article-title":"Applications of graph theory and network science to transit network design","volume":"31","author":"Derrible","year":"2011","journal-title":"Transport Reviews"},{"key":"10.3233\/SW-223116_ref24","doi-asserted-by":"publisher","first-page":"1.7:1","DOI":"10.1145\/3274661","article-title":"Connection scan algorithm","volume":"23","author":"Dibbelt","year":"2018","journal-title":"J. Exp. Algorithmics"},{"key":"10.3233\/SW-223116_ref25","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.3233\/SW-223116_ref26","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s11067-008-9074-7","article-title":"Graph-theoretical analysis of the Swiss road and railway networks over time","volume":"9","author":"Erath","year":"2009","journal-title":"Networks and Spatial Economics"},{"issue":"10","key":"10.3233\/SW-223116_ref27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0185333","article-title":"An efficient General Transit Feed Specification (GTFS) enabled algorithm for dynamic transit accessibility analysis","volume":"12","author":"Fayyaz S.","year":"2017","journal-title":"PLOS ONE"},{"key":"10.3233\/SW-223116_ref28","doi-asserted-by":"publisher","DOI":"10.5038\/2375-0901.19.4.2"},{"key":"10.3233\/SW-223116_ref29","doi-asserted-by":"crossref","unstructured":"A. Galati, V. Vukadinovic, M. Olivares and S. Mangold, Analyzing temporal metrics of public transportation for designing scalable delay-tolerant networks, in: PM2HW2N \u201913, 2013.","DOI":"10.1145\/2512840.2512846"},{"key":"10.3233\/SW-223116_ref30","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11067-005-6210-5","article-title":"Compared analysis of metro networks supported by graph theory","volume":"5","author":"Gattuso","year":"2005","journal-title":"Networks and Spatial Economics"},{"key":"10.3233\/SW-223116_ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30284-8_13"},{"key":"10.3233\/SW-223116_ref33","doi-asserted-by":"crossref","unstructured":"L. Heppe and T. Liebig, Real-time public transport delay prediction for situation-aware routing, in: KI 2017: Advances in Artificial Intelligence, G. Kern-Isberner, J. F\u00fcrnkranz and M. Thimm, eds, Springer International Publishing, Cham, 2017, pp. 128\u2013141. ISBN 978-3-319-67190-1.","DOI":"10.1007\/978-3-319-67190-1_10"},{"key":"10.3233\/SW-223116_ref35","doi-asserted-by":"publisher","DOI":"10.3390\/su11195404"},{"key":"10.3233\/SW-223116_ref36","doi-asserted-by":"publisher","DOI":"10.1109\/GloSIC50886.2020.9267879"},{"key":"10.3233\/SW-223116_ref37","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.trc.2018.01.023","article-title":"Ontologies for transportation research: A survey, transportation research part C: Emerging","volume":"89","author":"Katsumi","year":"2018","journal-title":"Technologies"},{"key":"10.3233\/SW-223116_ref38","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036114"},{"key":"10.3233\/SW-223116_ref39","doi-asserted-by":"publisher","first-page":"95","DOI":"10.4236\/jtts.2017.72007","article-title":"Mobility as a service (MaaS): Challenges of implementation and policy required","volume":"7","author":"Li","year":"2017","journal-title":"Journal of Transportation Technologies"},{"issue":"2","key":"10.3233\/SW-223116_ref40","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/S1007-0214(07)70029-9","article-title":"Complexity of public transport networks","volume":"12","author":"Lu","year":"2007","journal-title":"Tsinghua Science & Technology"},{"key":"10.3233\/SW-223116_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36461-7_2"},{"key":"10.3233\/SW-223116_ref43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1227161.1227166","article-title":"Efficient models for timetable information in public transportation systems","volume":"12","author":"Pyrga","year":"2008","journal-title":"ACM J. Exp. Algorithmics"},{"key":"10.3233\/SW-223116_ref44","isbn-type":"print","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/978-3-030-50578-3_22","volume-title":"Efficient Live Public Transport Data Sharing for Route Planning on the Web","author":"Rojas","year":"2020","ISBN":"https:\/\/id.crossref.org\/isbn\/9783030505783"},{"key":"10.3233\/SW-223116_ref45","unstructured":"J. Rojas Mel\u00e9ndez, D. Chaves-Fraga, P. Colpaert, R. Verborgh and E. Mannens, Providing reliable access to real-time and historic public transport data using linked connections, in: Proceedings of the 16th International Semantic Web Conference: Posters and Demos, 2017, https:\/\/iswc2017.semanticweb.org\/wp-content\/uploads\/papers\/PostersDemos\/paper637.pdf."},{"key":"10.3233\/SW-223116_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62466-8_26"},{"key":"10.3233\/SW-223116_ref47","doi-asserted-by":"crossref","unstructured":"P. Sen, S. Dasgupta, A. Chatterjee, P. Sreeram, G. Mukherjee and S. Manna, Small-world properties of the Indian railway network, Physical review. E, Statistical, nonlinear, and soft matter physics 67(3) (2003).","DOI":"10.1103\/PhysRevE.67.036106"},{"key":"10.3233\/SW-223116_ref48","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.physa.2018.02.111","article-title":"Spatial analysis of bus transport networks using network theory","volume":"502","author":"Shanmukhappa","year":"2018","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"issue":"24","key":"10.3233\/SW-223116_ref50","doi-asserted-by":"publisher","first-page":"5852","DOI":"10.1016\/j.physa.2010.08.015","article-title":"Weighted complex network analysis of travel routes on the Singapore public transportation system","volume":"389","author":"Soh","year":"2010","journal-title":"Physica A: Statistical Mechanics and its Applications"},{"key":"10.3233\/SW-223116_ref52","doi-asserted-by":"crossref","unstructured":"R. Taelman, J. Van Herwegen, M. Vander Sande and R. Verborgh, Comunica: A modular SPARQL query engine for the Web, in: Proceedings of the 17th International Semantic Web Conference, 2018, https:\/\/comunica.github.io\/Article-ISWC2018-Resource\/.","DOI":"10.1007\/978-3-030-00668-6_15"},{"key":"10.3233\/SW-223116_ref53","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.websem.2018.08.001","article-title":"Triple storage for random-access versioned querying of RDF archives","volume":"54","author":"Taelman","year":"2019","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/SW-223116_ref54","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.tranpol.2014.01.005","article-title":"Graph-theoretic evaluation support tool for fixed-route transport development in metropolitan areas","volume":"32","author":"Tsekeris","year":"2014","journal-title":"Transport Policy"},{"key":"10.3233\/SW-223116_ref55","unstructured":"R. Verborgh, M. Vander Sande, P. Colpaert, S. Coppens, E. Mannens and R. Van de Walle, Web-scale querying through linked data fragments, in: Proceedings of the 7th Workshop on Linked Data on the Web, C. Bizer, T. Heath, S. Auer and T. Berners-Lee, eds, CEUR Workshop Proceedings, Vol. 1184, 2014, ISSN 1613-0073, http:\/\/ceur-ws.org\/Vol-1184\/ldow2014_paper_04.pdf."},{"key":"10.3233\/SW-223116_ref56","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.websem.2016.03.003","article-title":"Triple pattern fragments: A low-cost knowledge graph interface for the Web","volume":"37\u201338","author":"Verborgh","year":"2016","journal-title":"Journal of Web Semantics"},{"key":"10.3233\/SW-223116_ref57","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1140\/epjb\/e2009-00090-x","article-title":"Public transport networks: Empirical analysis and modeling","volume":"68","author":"von Ferber","year":"2009","journal-title":"The European Physical Journal B"},{"key":"10.3233\/SW-223116_ref58","unstructured":"S. Witt, Trip-based public transit routing using condensed search trees, in: ATMOS, 2016, https:\/\/arxiv.org\/pdf\/1607.01299.pdf."}],"container-title":["Semantic Web"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/SW-223116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:26:41Z","timestamp":1777613201000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/SW-223116"}},"subtitle":[],"editor":[{"given":"Alex","family":"Polleres","sequence":"additional","affiliation":[{"name":"Vienna University of Economics and Business, Austria"}]},{"given":"Marco","family":"Comerio","sequence":"additional","affiliation":[]},{"given":"David","family":"Chaves-Fraga","sequence":"additional","affiliation":[]},{"given":"Joshua","family":"Shinavier","sequence":"additional","affiliation":[]},{"given":"Pieter","family":"Colpaert","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2023,4,24]]},"references-count":50,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.3233\/sw-223116","relation":{},"ISSN":["2210-4968","1570-0844"],"issn-type":[{"value":"2210-4968","type":"electronic"},{"value":"1570-0844","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4,24]]}}}