TY - GEN
T1 - Shortest path queries for indoor venues with temporal variations
AU - Liu, Tiantian
AU - Feng, Zijin
AU - Li, Huan
AU - Lu, Hua
AU - Cheema, Muhammad Aamir
AU - Cheng, Hong
AU - XU, Jianliang
N1 - Funding Information:
This work was supported by IRFD (No. 8022-00366B), HK-RGC (No. 12200819 and 12201018) and ARC (No. FT180100140 and DP180103411).
Funding Information:
Acknowledgement. This work was supported by IRFD (No. 8022-00366B), HK-RGC (No. 12200819 and 12201018) and ARC (No. FT180100140 and DP180103411).
PY - 2020/4
Y1 - 2020/4
N2 - Indoor shortest path query (ISPQ) is of fundamental importance for indoor location-based services (LBS). However, existing ISPQs 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, respectively. We experimentally evaluate the proposed techniques using synthetic data. The results show that our methods are efficient.
AB - Indoor shortest path query (ISPQ) is of fundamental importance for indoor location-based services (LBS). However, existing ISPQs 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, respectively. We experimentally evaluate the proposed techniques using synthetic data. The results show that our methods are efficient.
UR - http://www.scopus.com/inward/record.url?scp=85085863697&partnerID=8YFLogxK
U2 - 10.1109/ICDE48307.2020.00227
DO - 10.1109/ICDE48307.2020.00227
M3 - Conference proceeding
AN - SCOPUS:85085863697
T3 - Proceedings - International Conference on Data Engineering
SP - 2014
EP - 2017
BT - Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020
PB - IEEE Computer Society
T2 - 36th IEEE International Conference on Data Engineering, ICDE 2020
Y2 - 20 April 2020 through 24 April 2020
ER -