The recent years have witnessed the growing popularity of indoor location-based services (LBS) in practice and research. Among others, indoor shortest path query (ISPQ) is of fundamental importance for indoor LBS. However, existing works on ISPQ ignore indoor temporal variations, e.g., the open and close times associated with entities like doors and rooms. In this paper, we define a new type of query called Indoor Temporal-variation aware Shortest Path Query (ITSPQ). It returns the valid shortest path based on the up-to-date indoor topology at the query time. A set of techniques is designed to answer ITSPQ efficiently. We design a graph structure (IT-Graph) that captures indoor temporal variations. To process ITSPQ using IT-Graph, we design two algorithms that check a door's accessibility synchronously and asynchronously. We evaluate the proposed techniques using extensive experiments on synthetic and real data. The results show that our methods are efficient.
|Titel||The 36th IEEE International Conference on Data Engineering (ICDE 2020)|
|Status||Udgivet - 2020|
|Begivenhed||36th IEEE International Conference on Data Engineering - Online, Dallas, USA|
Varighed: 20 apr. 2020 → 24 apr. 2020
Konferencens nummer: 36
|Konference||36th IEEE International Conference on Data Engineering|
|Periode||20/04/2020 → 24/04/2020|