Shortest path queries for indoor venues with temporal variations

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

doi:10.1109/ICDE48307.2020.00227

Shortest path queries for indoor venues with temporal variations

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

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

19 Citations (Scopus)

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	https://doi.org/10.1109/ICDE48307.2020.00227
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	https://ieeexplore.ieee.org/xpl/conhome/9093725/proceeding (Link to conference proceedings)

Access to Document

10.1109/ICDE48307.2020.00227

Cite this

Liu, T., Feng, Z., Li, H., Lu, H., Cheema, M. A., Cheng, H., & Xu, J. (2020). Shortest path queries for indoor venues with temporal variations. In Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020 (pp. 2014-2017). (Proceedings - International Conference on Data Engineering; Vol. 2020-April). IEEE Computer Society. https://doi.org/10.1109/ICDE48307.2020.00227

@inproceedings{da4a35fab22c488e8ff0081f5cc20ccb,

title = "Shortest path queries for indoor venues with temporal variations",

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.",

author = "Tiantian Liu and Zijin Feng and Huan Li and Hua Lu and Cheema, {Muhammad Aamir} and Hong Cheng and Jianliang Xu",

note = "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).; 36th IEEE International Conference on Data Engineering, ICDE 2020 ; Conference date: 20-04-2020 Through 24-04-2020",

year = "2020",

month = apr,

doi = "10.1109/ICDE48307.2020.00227",

language = "English",

series = "Proceedings - International Conference on Data Engineering",

publisher = "IEEE Computer Society",

pages = "2014--2017",

booktitle = "Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020",

address = "United States",

url = "https://ieeexplore.ieee.org/xpl/conhome/9093725/proceeding",

}

Liu, T, Feng, Z, Li, H, Lu, H, Cheema, MA, Cheng, H & Xu, J 2020, Shortest path queries for indoor venues with temporal variations. in Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020. Proceedings - International Conference on Data Engineering, vol. 2020-April, IEEE Computer Society, pp. 2014-2017, 36th IEEE International Conference on Data Engineering, ICDE 2020, Dallas, United States, 20/04/20. https://doi.org/10.1109/ICDE48307.2020.00227

Shortest path queries for indoor venues with temporal variations. / Liu, Tiantian; Feng, Zijin; Li, Huan et al.
Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020. IEEE Computer Society, 2020. p. 2014-2017 (Proceedings - International Conference on Data Engineering; Vol. 2020-April).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

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 -

Shortest path queries for indoor venues with temporal variations

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this