Shortest Path Queries for Indoor Venues with Temporal Variations

Tiantian Liu, Zijin Feng, Huan Li, Hua Lu, Muhammad Aamir Cheema, Hong Cheng, Jianliang Xu

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Abstract

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.
OriginalsprogEngelsk
TitelThe 36th IEEE International Conference on Data Engineering (ICDE 2020)
Udgivelses stedUnited States
ForlagIEEE
StatusAccepteret/In press - 2020
Begivenhed36th IEEE International Conference on Data Engineering - Dallas, USA
Varighed: 20 apr. 202024 apr. 2020
Konferencens nummer: 36
https://www.utdallas.edu/icde/

Konference

Konference36th IEEE International Conference on Data Engineering
Nummer36
LandUSA
ByDallas
Periode20/04/202024/04/2020
Internetadresse

Citer dette

Liu, T., Feng, Z., Li, H., Lu, H., Cheema, M. A., Cheng, H., & Xu, J. (Accepteret/In press). Shortest Path Queries for Indoor Venues with Temporal Variations. I The 36th IEEE International Conference on Data Engineering (ICDE 2020) IEEE. https://www.utdallas.edu/icde/