Ruben Verborgh’s data

Matches in Ruben’s data for { <https://dx.doi.org/10.1007/978-3-030-50578-3_21> ?p ?o }

• 978-3-030-50578-3_21 author me.
• 978-3-030-50578-3_21 author me.
• 978-3-030-50578-3_21 author pieter_jan_vandenberghe.
• 978-3-030-50578-3_21 author harm_delva.
• 978-3-030-50578-3_21 author me.
• 978-3-030-50578-3_21 creator me.
• 978-3-030-50578-3_21 creator me.
• 978-3-030-50578-3_21 creator pieter_jan_vandenberghe.
• 978-3-030-50578-3_21 creator harm_delva.
• 978-3-030-50578-3_21 creator me.
• 978-3-030-50578-3_21 about route_planning.
• 978-3-030-50578-3_21 about open_data.
• 978-3-030-50578-3_21 author me.
• 978-3-030-50578-3_21 author me.
• 978-3-030-50578-3_21 author pieter_jan_vandenberghe.
• 978-3-030-50578-3_21 author harm_delva.
• 978-3-030-50578-3_21 author me.
• 978-3-030-50578-3_21 coparticipatesWith me.
• 978-3-030-50578-3_21 coparticipatesWith me.
• 978-3-030-50578-3_21 coparticipatesWith pieter_jan_vandenberghe.
• 978-3-030-50578-3_21 coparticipatesWith harm_delva.
• 978-3-030-50578-3_21 coparticipatesWith me.
• 978-3-030-50578-3_21 type PublicationVolume.
• 978-3-030-50578-3_21 type ScholarlyArticle.
• 978-3-030-50578-3_21 type Article.
• 978-3-030-50578-3_21 type Document.
• 978-3-030-50578-3_21 type Document.
• 978-3-030-50578-3_21 type Document.
• 978-3-030-50578-3_21 type Q386724.
• 978-3-030-50578-3_21 type CreativeWork.
• 978-3-030-50578-3_21 type Work.
• 978-3-030-50578-3_21 P50 me.
• 978-3-030-50578-3_21 P50 me.
• 978-3-030-50578-3_21 P50 pieter_jan_vandenberghe.
• 978-3-030-50578-3_21 P50 harm_delva.
• 978-3-030-50578-3_21 P50 me.
• 978-3-030-50578-3_21 maker me.
• 978-3-030-50578-3_21 maker me.
• 978-3-030-50578-3_21 maker pieter_jan_vandenberghe.
• 978-3-030-50578-3_21 maker harm_delva.
• 978-3-030-50578-3_21 maker me.
• 978-3-030-50578-3_21 title "Geospatial Partitioning of Open Transit Data".
• 978-3-030-50578-3_21 isPartOf proceedings_of_the_20th_international_conference_on_web_engineering.
• 978-3-030-50578-3_21 name "Geospatial Partitioning of Open Transit Data".
• 978-3-030-50578-3_21 label "Geospatial Partitioning of Open Transit Data".
• 978-3-030-50578-3_21 name "Geospatial Partitioning of Open Transit Data".
• 978-3-030-50578-3_21 topic route_planning.
• 978-3-030-50578-3_21 topic open_data.
• 978-3-030-50578-3_21 subject route_planning.
• 978-3-030-50578-3_21 subject open_data.
• 978-3-030-50578-3_21 authorList b0_b1895.
• 978-3-030-50578-3_21 topic route_planning.
• 978-3-030-50578-3_21 topic open_data.
• 978-3-030-50578-3_21 abstract "One of the guiding principles of open data is that anyone can use the raw data for any purpose. Public transit operators often publish their open data as a single data dump, but developers with limited computational resources may not be able to process all this data. Existing work has already focused on fragmenting the data by departure time, so that data consumers can be more selective in the data they process. However, each fragment still contains data from the entire operator’s service area. We build upon this idea by fragmenting geospatially as well as by departure time. Our method is robust to changes in the original data, such as the deletion or the addition of stops, which is crucial in scenarios where data publishers do not control the data itself. In this paper we explore popular clustering methods such as k-means and METIS, alongside two simple domain-specific methods of our own. We compare the effectiveness of each for the use case of client-side route planning, focusing on the ease of use of the data and the cacheability of the data fragments. Our results show that simply clustering stops by their proximity to 8 transport hubs yields the most promising results: queries are 2.4 times faster and download 4 times less data. More than anything though, our results show that the difference between clustering methods is small, and that engineers can safely choose practical and simple solutions. We expect that this insight also holds true for publishing other geospatial data such as road networks, sensor data, or points of interest.".
• 978-3-030-50578-3_21 datePublished "2020".
• 978-3-030-50578-3_21 mainEntityOfPage delva_icwe_2020.
• 978-3-030-50578-3_21 sameAs 978-3-030-50578-3_21.
• 978-3-030-50578-3_21 isPrimaryTopicOf delva_icwe_2020.
• 978-3-030-50578-3_21 page delva_icwe_2020.
• 978-3-030-50578-3_21 number "305".
• 978-3-030-50578-3_21 number "320".
• 978-3-030-50578-3_21 number "12128".
• 978-3-030-50578-3_21 volume "12128".
• 978-3-030-50578-3_21 locator "305".
• 978-3-030-50578-3_21 locator "320".
• 978-3-030-50578-3_21 locator "12128".
• 978-3-030-50578-3_21 volume "12128".
• 978-3-030-50578-3_21 position "12128".
• 978-3-030-50578-3_21 volumeNumber "12128".
• 978-3-030-50578-3_21 endingPage "320".
• 978-3-030-50578-3_21 startingPage "305".
• 978-3-030-50578-3_21 pageEnd "320".
• 978-3-030-50578-3_21 pageStart "305".
• 978-3-030-50578-3_21 pageEnd "320".
• 978-3-030-50578-3_21 pageStart "305".