Architecture-intact oracle for fastest path and time queries on dynamic spatial networks

Architecture-intact oracle for fastest path and time queries on dynamic spatial networks

Given two vertices of interest (POIs) s and t on a spatial network, a distance (path) query returns the shortest network distance (shortest path) from s to t. This query has a variety of applications in practice and is a fundamental operation for many database and data mining algorithms. In this pap...

Full description

Bibliographic Details
Main Authors: Wei, Victor Junqiu, Wong, Raymond Chi-Wing, Long, Cheng
Other Authors: School of Computer Science and Engineering
Format: Conference Paper
Language:English
Published: 2021
Subjects:
Engineering::Computer science and engineering::Information systems::Database management
Shortest Path Query
Data Mining
Online Access:https://hdl.handle.net/10356/148161

Internet

https://hdl.handle.net/10356/148161

Similar Items