In-Path Oracles for Road Networks

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 bound...

Full description

Saved in:
Bibliographic Details
Published in:ISPRS international journal of geo-information Vol. 12; no. 7; p. 277
Main Authors: Ghosh, Debajyoti, Sankaranarayanan, Jagan, Khatter, Kiran, Samet, Hanan
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.07.2023
Subjects:
Algorithms
B trees
data collection
database query processing
Decomposition
Discount coupons
geographic information systems
Graphs
Queries
roads
Roads & highways
Shortest-path problems
spatial coherence
spatial data structures
spatial databases
spatial indexes
Germany
ISSN:2220-9964, 2220-9964
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2220-9964
2220-9964
DOI:10.3390/ijgi12070277