Next Article in Journal
A Sensor Web and Web Service-Based Approach for Active Hydrological Disaster Monitoring
Next Article in Special Issue
Hidden Naive Bayes Indoor Fingerprinting Localization Based on Best-Discriminating AP Selection
Previous Article in Journal
A Two-Step Clustering Approach to Extract Locations from Individual GPS Trajectory Data
Previous Article in Special Issue
Method for Determining Appropriate Clustering Criteria of Location-Sensing Data
Article

Top-k Spatial Preference Queries in Directed Road Networks

1
Department of Software, Ajou University, Worldcup-ro 206, Yeongtong-gu, Suwon 16499, Korea
2
Department of Software, Kyungpook National University, Gyeongsang-daero 2559, Sangju-si 37224, Korea
*
Author to whom correspondence should be addressed.
Academic Editors: Georg Gartner, Haosheng Huang and Wolfgang Kainz
ISPRS Int. J. Geo-Inf. 2016, 5(10), 170; https://0-doi-org.brum.beds.ac.uk/10.3390/ijgi5100170
Received: 27 June 2016 / Revised: 7 September 2016 / Accepted: 18 September 2016 / Published: 23 September 2016
(This article belongs to the Special Issue Location-Based Services)
Top-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
Keywords: top-k spatial preference query; directed road networks; spatial databases; location based services; ranking of data objects top-k spatial preference query; directed road networks; spatial databases; location based services; ranking of data objects
Show Figures

Figure 1

MDPI and ACS Style

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. https://0-doi-org.brum.beds.ac.uk/10.3390/ijgi5100170

AMA Style

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. https://0-doi-org.brum.beds.ac.uk/10.3390/ijgi5100170

Chicago/Turabian Style

Attique, Muhammad, Hyung-Ju Cho, Rize Jin, and Tae-Sun Chung. 2016. "Top-k Spatial Preference Queries in Directed Road Networks" ISPRS International Journal of Geo-Information 5, no. 10: 170. https://0-doi-org.brum.beds.ac.uk/10.3390/ijgi5100170

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop