Top-k Spatial Preference Queries in Directed Road Networks

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.

[1]  Man Lung Yiu,et al.  Efficient top-k aggregation of ranked inputs , 2007, TODS.

[2]  Yilong Yin,et al.  k-Multi-preference query over road networks , 2016, Personal and Ubiquitous Computing.

[3]  Tae-Sun Chung,et al.  ALPS: an efficient algorithm for top-k spatial preference search in road networks , 2013, Knowledge and Information Systems.

[4]  Tae-Sun Chung,et al.  A new approach to process top-k spatial preference queries in a directed road network , 2014, MobiGIS '14.

[5]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[6]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[7]  Yang Du,et al.  On Computing Top-t Most Influential Spatial Sites , 2005, VLDB.

[8]  Man Lung Yiu,et al.  Top-k Spatial Preference Queries , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[9]  Houbing Song,et al.  Discovering time-dependent shortest path on traffic graph for drivers towards green driving , 2017, J. Netw. Comput. Appl..

[10]  Weiwei Sun,et al.  Combining Top-k Query in Road Networks , 2011, WAIM Workshops.

[11]  Muhammad Aamir Cheema,et al.  Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks , 2011, The VLDB Journal.

[12]  Hua Lu,et al.  Ranking Spatial Data by Quality Preferences , 2011, IEEE Transactions on Knowledge and Data Engineering.

[13]  Xuemin Lin,et al.  Efficient general spatial skyline computation , 2012, World Wide Web.

[14]  Chi-Yin Chow,et al.  Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks , 2010, 2010 Eleventh International Conference on Mobile Data Management.

[15]  Ihab F. Ilyas,et al.  A survey of top-k query processing techniques in relational database systems , 2008, CSUR.

[16]  Bin Jiang,et al.  Recommendations for two-way selections using skyline view queries , 2012, Knowledge and Information Systems.

[17]  Yufei Tao,et al.  Progressive computation of the min-dist optimal-location query , 2006, VLDB.

[18]  Muhammad Aamir Cheema,et al.  A safe zone based approach for monitoring moving skyline queries , 2013, EDBT '13.

[19]  Wei Liu,et al.  An Energy-Efficient Skyline Query for Massively Multidimensional Sensing Data , 2016, Sensors.

[20]  Tae-Sun Chung,et al.  An efficient algorithm for computing safe exit points of moving range queries in directed road networks , 2014, Inf. Syst..

[21]  Kyriakos Mouratidis,et al.  Preference queries in large multi-cost transportation networks , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[22]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[23]  Yang Du,et al.  The Optimal-Location Query , 2005, SSTD.

[24]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[25]  Heng Tao Shen,et al.  Multi-source Skyline Query Processing in Road Networks , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[26]  Christos Doulkeridis,et al.  Efficient Processing of Top-k Spatial Preference Queries , 2010, Proc. VLDB Endow..

[27]  Chi-Yin Chow,et al.  Efficient Index-Based Approaches for Skyline Queries in Location-Based Applications , 2013, IEEE Transactions on Knowledge and Data Engineering.

[28]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[29]  Nick Roussopoulos,et al.  K-Nearest Neighbor Search for Moving Query Point , 2001, SSTD.

[30]  Tae-Sun Chung,et al.  A safe exit approach for continuous monitoring of reverse k-nearest neighbors in road networks , 2015, Int. Arab J. Inf. Technol..

[31]  Roger Zimmermann,et al.  Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks , 2011, IEEE Transactions on Knowledge and Data Engineering.