Top-k Spatial Preference Queries in Directed Road Networks
AbstractTop-k spatial preference queries rank objects based on the score of feature objects in their spatial neighborhood. Top-k preference queries are crucial for a wide range of location based services such as hotel browsing and apartment searching. In recent years, a lot of research has been conducted on processing of top-k spatial preference queries in Euclidean space. While few algorithms study top-k preference queries in road networks, they all focus on undirected road networks. In this paper, we investigate the problem of processing the top-k spatial preference queries in directed road networks where each road segment has a particular orientation. Computation of data object scores requires examining the scores of each feature object in its spatial neighborhood. This may cause the computational delay, thus resulting in a high query processing time. In this paper, we address this problem by proposing a pruning and grouping of feature objects to reduce the number of feature objects. Furthermore, we present an efficient algorithm called TOPS that can process top-k spatial preference queries in directed road networks. Experimental results indicate that our algorithm significantly reduces the query processing time compared to period solution for a wide range of problem settings. View Full-Text
Share & Cite This Article
Attique, M.; Cho, H.-J.; Jin, R.; Chung, T.-S. Top-k Spatial Preference Queries in Directed Road Networks. ISPRS Int. J. Geo-Inf. 2016, 5, 170.
Attique M, Cho H-J, Jin R, Chung T-S. Top-k Spatial Preference Queries in Directed Road Networks. ISPRS International Journal of Geo-Information. 2016; 5(10):170.Chicago/Turabian Style
Attique, Muhammad; Cho, Hyung-Ju; Jin, Rize; Chung, Tae-Sun. 2016. "Top-k Spatial Preference Queries in Directed Road Networks." ISPRS Int. J. Geo-Inf. 5, no. 10: 170.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.