Ruben Verborgh’s data

Matches in Ruben’s data for { ?s ?p ?o }

• 978-3-319-60131-1_26 title "Public Transit Route Planning through Lightweight Linked Data Interfaces".
• 978-3-319-60131-1_26 isPartOf proceedings_of_the_17th_international_conference_on_web_engineering.
• 978-3-319-60131-1_26 name "Public Transit Route Planning through Lightweight Linked Data Interfaces".
• 978-3-319-60131-1_26 label "Public Transit Route Planning through Lightweight Linked Data Interfaces".
• 978-3-319-60131-1_26 name "Public Transit Route Planning through Lightweight Linked Data Interfaces".
• 978-3-319-60131-1_26 topic public_transport.
• 978-3-319-60131-1_26 topic Linked_Connections.
• 978-3-319-60131-1_26 topic route_planning.
• 978-3-319-60131-1_26 topic Hypermedia.
• 978-3-319-60131-1_26 topic reuse.
• 978-3-319-60131-1_26 topic Web_API.
• 978-3-319-60131-1_26 topic open_data.
• 978-3-319-60131-1_26 topic Research.
• 978-3-319-60131-1_26 topic Linked_Data.
• 978-3-319-60131-1_26 subject public_transport.
• 978-3-319-60131-1_26 subject Linked_Connections.
• 978-3-319-60131-1_26 subject route_planning.
• 978-3-319-60131-1_26 subject Hypermedia.
• 978-3-319-60131-1_26 subject reuse.
• 978-3-319-60131-1_26 subject Web_API.
• 978-3-319-60131-1_26 subject open_data.
• 978-3-319-60131-1_26 subject Research.
• 978-3-319-60131-1_26 subject Linked_Data.
• 978-3-319-60131-1_26 authorList b0_b2417.
• 978-3-319-60131-1_26 topic public_transport.
• 978-3-319-60131-1_26 topic Linked_Connections.
• 978-3-319-60131-1_26 topic route_planning.
• 978-3-319-60131-1_26 topic Hypermedia.
• 978-3-319-60131-1_26 topic reuse.
• 978-3-319-60131-1_26 topic Web_API.
• 978-3-319-60131-1_26 topic open_data.
• 978-3-319-60131-1_26 topic Research.
• 978-3-319-60131-1_26 topic Linked_Data.
• 978-3-319-60131-1_26 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.".
• 978-3-319-60131-1_26 datePublished "2017".
• 978-3-319-60131-1_26 mainEntityOfPage colpaert_icwe_2017.
• 978-3-319-60131-1_26 sameAs 978-3-319-60131-1_26.
• 978-3-319-60131-1_26 isPrimaryTopicOf colpaert_icwe_2017.
• 978-3-319-60131-1_26 page colpaert_icwe_2017.
• 978-3-319-60131-1_26 number "403".
• 978-3-319-60131-1_26 number "411".
• 978-3-319-60131-1_26 number "10360".
• 978-3-319-60131-1_26 volume "10360".
• 978-3-319-60131-1_26 locator "403".
• 978-3-319-60131-1_26 locator "411".
• 978-3-319-60131-1_26 locator "10360".
• 978-3-319-60131-1_26 volume "10360".
• 978-3-319-60131-1_26 position "10360".
• 978-3-319-60131-1_26 volumeNumber "10360".
• 978-3-319-60131-1_26 endingPage "411".
• 978-3-319-60131-1_26 startingPage "403".
• 978-3-319-60131-1_26 pageEnd "411".
• 978-3-319-60131-1_26 pageStart "403".
• 978-3-319-60131-1_26 pageEnd "411".
• 978-3-319-60131-1_26 pageStart "403".
• 978-3-319-61252-2_3 author me.
• 978-3-319-61252-2_3 author erik_mannens.
• 978-3-319-61252-2_3 author dorthe_arndt.
• 978-3-319-61252-2_3 author me.
• 978-3-319-61252-2_3 author me.
• 978-3-319-61252-2_3 creator me.
• 978-3-319-61252-2_3 creator erik_mannens.
• 978-3-319-61252-2_3 creator dorthe_arndt.
• 978-3-319-61252-2_3 creator me.
• 978-3-319-61252-2_3 creator me.
• 978-3-319-61252-2_3 about validation.
• 978-3-319-61252-2_3 about constraints.
• 978-3-319-61252-2_3 about rules.
• 978-3-319-61252-2_3 about Notation_.
• 978-3-319-61252-2_3 about reasoning.
• 978-3-319-61252-2_3 about SPARQL.
• 978-3-319-61252-2_3 about Research.
• 978-3-319-61252-2_3 about Linked_Data.
• 978-3-319-61252-2_3 about Semantic_Web.
• 978-3-319-61252-2_3 about RDF.
• 978-3-319-61252-2_3 about World_Wide_Web.
• 978-3-319-61252-2_3 author me.
• 978-3-319-61252-2_3 author erik_mannens.
• 978-3-319-61252-2_3 author dorthe_arndt.
• 978-3-319-61252-2_3 author me.
• 978-3-319-61252-2_3 author me.
• 978-3-319-61252-2_3 coparticipatesWith me.
• 978-3-319-61252-2_3 coparticipatesWith erik_mannens.
• 978-3-319-61252-2_3 coparticipatesWith dorthe_arndt.
• 978-3-319-61252-2_3 coparticipatesWith me.
• 978-3-319-61252-2_3 coparticipatesWith me.
• 978-3-319-61252-2_3 type PublicationVolume.
• 978-3-319-61252-2_3 type ScholarlyArticle.
• 978-3-319-61252-2_3 type Article.
• 978-3-319-61252-2_3 type Document.
• 978-3-319-61252-2_3 type Q386724.
• 978-3-319-61252-2_3 type CreativeWork.
• 978-3-319-61252-2_3 type Document.
• 978-3-319-61252-2_3 type Work.
• 978-3-319-61252-2_3 type Document.
• 978-3-319-61252-2_3 P50 me.
• 978-3-319-61252-2_3 P50 erik_mannens.
• 978-3-319-61252-2_3 P50 dorthe_arndt.
• 978-3-319-61252-2_3 P50 me.
• 978-3-319-61252-2_3 P50 me.

• first
• previous
• next