View in EDS

In-Path Oracles for Road Networks

Saved in:
Bibliographic Details
Title: In-Path Oracles for Road Networks
Authors: Debajyoti Ghosh, Jagan Sankaranarayanan, Kiran Khatter, Hanan Samet
Source: ISPRS International Journal of Geo-Information, Vol 12, Iss 277, p 277 (2023)
Publisher Information: MDPI AG
Publication Year: 2023
Collection: Directory of Open Access Journals: DOAJ Articles
Subject Terms: spatial databases, spatial coherence, spatial indexes, spatial data structures, geographic information systems, database query processing, Geography (General), G1-922
Description: Many spatial applications benefit from the fast answering to a seemingly simple spatial query: “Is a point of interest (POI) ‘in-path’ to the shortest path between a source and a destination?” In this context, an in-path POI is one that is either on the shortest path or can be reached within a bounded yet small detour from the shortest path. The fast answering of the in-path queries is contingent on being able to determine without having to actually compute the shortest paths during runtime. Thus, this requires a precomputation solution. The key contribution of the paper is the development of an in-path oracle that is based on precomputation of which pairs of sources and destinations are in-path with respect to the given POI. For a given road network with n nodes and m POIs, an O ( m × n ) -sized oracle is envisioned based on the reduction of the well-separated pairs (WSP) decomposition of the road network. Furthermore, an oracle can be indexed in a database using a B-tree that can answer queries at very high throughput. Experimental results on the real road network POI dataset illustrate the superiority of this technique compared to a baseline algorithm. The proposed approach can answer ≈ 1.5 million in-path queries per second compared to a few hundred per second using a suitable baseline approach.
Document Type: article in journal/newspaper
Language: English
Relation: https://www.mdpi.com/2220-9964/12/7/277; https://doaj.org/toc/2220-9964; https://doaj.org/article/5290432e75b2405a957571ac379d0038
DOI: 10.3390/ijgi12070277
Availability: https://doi.org/10.3390/ijgi12070277
https://doaj.org/article/5290432e75b2405a957571ac379d0038
Accession Number: edsbas.7C42C083
Database: BASE
Description
Abstract:Many spatial applications benefit from the fast answering to a seemingly simple spatial query: “Is a point of interest (POI) ‘in-path’ to the shortest path between a source and a destination?” In this context, an in-path POI is one that is either on the shortest path or can be reached within a bounded yet small detour from the shortest path. The fast answering of the in-path queries is contingent on being able to determine without having to actually compute the shortest paths during runtime. Thus, this requires a precomputation solution. The key contribution of the paper is the development of an in-path oracle that is based on precomputation of which pairs of sources and destinations are in-path with respect to the given POI. For a given road network with n nodes and m POIs, an <semantics> O ( m × n ) </semantics> -sized oracle is envisioned based on the reduction of the well-separated pairs (WSP) decomposition of the road network. Furthermore, an oracle can be indexed in a database using a B-tree that can answer queries at very high throughput. Experimental results on the real road network POI dataset illustrate the superiority of this technique compared to a baseline algorithm. The proposed approach can answer ≈ 1.5 million in-path queries per second compared to a few hundred per second using a suitable baseline approach.
DOI:10.3390/ijgi12070277