| Property | Value |
|---|
|
?:abstract
|
-
Computing path queries such as the shortest path in public transport networks is challenging because the path costs between nodes change over time. A reachability query from a node at a given start time on such a network retrieves all points of interest (POIs) that are reachable within a given cost budget. Reachability queries are essential building blocks in many applications, for example, group recommendations, ranking spatial queries, or geomarketing. We propose an efficient solution for reachability queries in public transport networks. Currently, there are two options to solve reachability queries. (1) Execute a modified version of Dijkstra’s algorithm that supports time-dependent edge traversal costs; this solution is slow since it must expand edge by edge and does not use an index. (2) Issue a separate path query for each single POI, i.e., a single reachability query requires answering many path queries. None of these solutions scales to large networks with many POIs. We propose a novel and lightweight reachability index. The key idea is to partition the network into cells. Then, in contrast to other approaches, we expand the network cell by cell. Empirical evaluations on synthetic and real-world networks confirm the efficiency and the effectiveness of our index-based reachability query solution.
|
|
is
?:annotates
of
|
|
|
?:creator
|
|
|
?:doi
|
|
|
?:doi
|
-
10.1007/978-3-030-54832-2_5
|
|
?:externalLink
|
|
|
?:journal
|
-
Advances_in_Databases_and_Information_Systems
|
|
?:license
|
|
|
?:pdf_json_files
|
-
document_parses/pdf_json/a3796947f0fd71216b968b958ef9b58c0539f41e.json
|
|
?:pmc_json_files
|
-
document_parses/pmc_json/PMC7703798.xml.json
|
|
?:pmcid
|
|
|
?:publication_isRelatedTo_Disease
|
|
|
?:sha_id
|
|
|
?:source
|
|
|
?:title
|
-
An Efficient Index for Reachability Queries in Public Transport Networks
|
|
?:type
|
|
|
?:year
|
|
![[This page as RDF]](https://research.tib.eu/covid-19/static/rdf-icon.gif){kind=icon}