Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020 |
Publisher | IEEE Computer Society |
Pages | 2014-2017 |
Number of pages | 4 |
ISBN (Electronic) | 9781728129037 |
DOIs | |
Publication status | Published - Apr 2020 |
Event | 36th IEEE International Conference on Data Engineering, ICDE 2020 - Dallas, United States Duration: 20 Apr 2020 → 24 Apr 2020 https://ieeexplore.ieee.org/xpl/conhome/9093725/proceeding (Link to conference proceedings) |
Publication series
Name | Proceedings - International Conference on Data Engineering |
---|---|
Volume | 2020-April |
ISSN (Print) | 1084-4627 |
Conference
Conference | 36th IEEE International Conference on Data Engineering, ICDE 2020 |
---|---|
Country/Territory | United States |
City | Dallas |
Period | 20/04/20 → 24/04/20 |
Internet address |
|
Scopus Subject Areas
- Software
- Signal Processing
- Information Systems