Abstract
With the increasingly available indoor positioning technologies, indoor location-based services (LBS) are becoming popular. Among indoor LBS applications, indoor routing is particularly in demand. In the literature, there are several existing studies on indoor keyword-Aware routing queries, each considering different criteria when finding an optimal route. However, none of these studies explicitly constraint the time budget for the route. In this paper, we propose a new problem formulation TIKRQ that considers the time needed for a user to complete the route, in addition to other criteria such as static cost and textual relevance. A set-based search algorithm and effective pruning strategies are proposed for TIKRQ. We conduct extensive experiments to verify the efficiency of our proposals.
Original language | English |
---|---|
Title of host publication | Proceedings of 17th International Symposium on Spatial and Temporal Databases, SSTD 2021 |
Number of pages | 11 |
Publisher | Association for Computing Machinery |
Publication date | 23 Aug 2021 |
Pages | 74-84 |
ISBN (Electronic) | 9781450384254 |
DOIs | |
Publication status | Published - 23 Aug 2021 |
Event | 17th International Symposium on Spatial and Temporal Databases, SSTD 2021 - Virtual, Online, United States Duration: 23 Aug 2021 → 25 Aug 2021 |
Conference
Conference | 17th International Symposium on Spatial and Temporal Databases, SSTD 2021 |
---|---|
Country/Territory | United States |
City | Virtual, Online |
Period | 23/08/2021 → 25/08/2021 |
Bibliographical note
Funding Information:This work was supported by Independent Research Fund Denmark (No. 8022-00366B).
Publisher Copyright:
© 2021 ACM.
Keywords
- indoor query processing
- indoor space
- keyword-Aware
- routing
Fingerprint
Dive into the research topics of 'Time-Constrained Indoor Keyword-Aware Routing'. Together they form a unique fingerprint.Prizes
-
SSTD 2021 Best Paper Candidate
Chan, Harry Kai Ho (Recipient), Liu, Tiantian (Recipient), Li, Huan (Recipient) & Lu, Hua (Recipient), 2021
Prize: Conference prizes