Trip Planning Queries in Indoor Venues. (24th November 2017)

• Record Type: Journal Article
• Authors: Shao, Zhou; Cheema, Muhammad Aamir; Taniar, David
• Is Part Of: Computer journal. Volume 61:Number 3(2018)
• Page Start: 409
• Page End: 426
• Publication Date: 2017-11-24
• Subjects: trip planning query -- indoor query processing -- indoor space, spatial databases; Computers -- Periodicals; 005.1
• DOI: 10.1093/computer_journal/bxx107
• Languages: English
• ISSNs: 0010-4620

Abstract

Abstract: In this paper, we study a new type of indoor queries, called the indoor trip planning query ( i TPQ). We have observed that the existing methods for outdoor spaces cannot be applied directly to indoor spaces, due to the difference in the underlying networks. Outdoor spaces, which are normally represented as spatial road networks, are commonly modelled as a graph. In contrast, indoor spaces have distinct features (e.g. rooms, doors, hallways) that do not exist in road networks. So far, no specific solutions have been proposed for i TPQ. Even if outdoor techniques are revised for i TPQ, they fail to process i TPQ efficiently. In this paper, we propose an indoor-specific technique, based on the indoor VIP-Tree, called the VIP-Tree neighbor expansion ( VNE ) method, that also includes new pruning techniques in both pre-processing and query processing phases. Our experimental results show that our proposed method VNE outperforms other indoor and outdoor algorithms by several orders of magnitude in terms of processing time with low indexing cost.