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.
|Titel||Proceedings of 17th International Symposium on Spatial and Temporal Databases, SSTD 2021|
|Forlag||Association for Computing Machinery|
|Publikationsdato||23 aug. 2021|
|Status||Udgivet - 23 aug. 2021|
|Begivenhed||17th International Symposium on Spatial and Temporal Databases, SSTD 2021 - Virtual, Online, USA|
Varighed: 23 aug. 2021 → 25 aug. 2021
|Konference||17th International Symposium on Spatial and Temporal Databases, SSTD 2021|
|Periode||23/08/2021 → 25/08/2021|
|Navn||ACM International Conference Proceeding Series|
Bibliografisk noteFunding Information:
This work was supported by Independent Research Fund Denmark (No. 8022-00366B).
- indoor query processing
- indoor space