Dynamic Skyline Maintaining Strategies for Moving Query Points in Road Networks

Skyline query processing in Location-based Services has been investigated extensively in recent years. In this paper, we address the issue of efficient evaluation of Continuous Range Skyline Queries (CRSQ) in road networks where the query points are moving and the interest points are within a certain range. We develop efficient skyline maintaining strategies to answer continuous range skyline queries. First, we propose a novel method named Dynamic Split Points Setting (DSPS) dividing a given path in road networks into several segments. Second, for each segment, we adopt the Progressive Incremental Network Expansion (PINE) technique based on Network Voronoi Diagrams (NVD) to calculate candidates of skyline interest points. After that, when the query point moves, the spilt points are dynamically set by DSPS strategies to ensure that when the query point moves within a segment, skyline points remain unchanged and only need to be updated while moving across the split points. Finally, extensive experiments show that our DSPS strategies are efficient compared with previous approaches.

[1]  Christian S. Jensen,et al.  In-Route Skyline Querying for Location-Based Services , 2004, W2GIS.

[2]  Yuan-Ko Huang,et al.  Continuous distance-based skyline queries in road networks , 2012, Inf. Syst..

[3]  Maytham Safar,et al.  K nearest neighbor search in navigation systems , 2005, Mob. Inf. Syst..

[4]  Yunjun Gao,et al.  Direction-based surrounder queries for mobile recommendations , 2011, The VLDB Journal.

[5]  Seung-won Hwang,et al.  MSSQ: Manhattan Spatial Skyline Queries , 2011, SSTD.

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

[7]  Seung-won Hwang,et al.  Continuous Skylining on Volatile Moving Data , 2009, 2009 IEEE 25th International Conference on Data Engineering.

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

[9]  Donald Kossmann,et al.  The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.

[10]  Jialiang Chen,et al.  K-th Order Skyline Queries in Bicriteria Networks , 2016, APWeb.

[11]  Yuan Tian,et al.  Finding skyline paths in road networks , 2009, GIS.

[12]  Hans-Peter Kriegel,et al.  Route skyline queries: A multi-preference path planning approach , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[13]  Jianliang Xu,et al.  Range-Based Skyline Queries in Mobile Environments , 2013, IEEE Transactions on Knowledge and Data Engineering.

[14]  Zhen He,et al.  Skyline Trips of Multiple POIs Categories , 2015, DASFAA.

[15]  Cyrus Shahabi,et al.  The spatial skyline queries , 2006, VLDB.

[16]  He Li,et al.  An Efficient Architecture for Parallel Skyline Computation over Large Distributed Datasets , 2014 .

[17]  Jae Soo Yoo,et al.  Processing Continuous Skyline Queries in Road Networks , 2008, International Symposium on Computer Science and its Applications.

[18]  Jialiang Chen,et al.  Efficient Geometric Pruning Strategies for Continuous Skyline Queries , 2017, ISPRS Int. J. Geo Inf..

[19]  David Taniar,et al.  Voronoi-based reverse nearest neighbor query processing on spatial networks , 2009, Multimedia Systems.

[20]  Hans-Peter Kriegel,et al.  Linear Path Skyline Computation in Bicriteria Networks , 2014, DASFAA.

[21]  Anthony K. H. Tung,et al.  Continuous Skyline Queries for Moving Objects , 2006, IEEE Transactions on Knowledge and Data Engineering.

[22]  Maytham Safar,et al.  Optimized skyline queries on road networks using nearest neighbors , 2011, Personal and Ubiquitous Computing.

[23]  Cyrus Shahabi,et al.  Alternative Solutions for Continuous K Nearest Neighbor Queries in Spatial Network Databases , 2005, STDBM.

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