Efficient Computation of Continuous Range Skyline Queries in Road Networks

Skyline query processing in road networks has been investigated extensively in recent years. Skyline points for road network applications may be large while the query point may only interest the ones within a certain range. In this paper, we address the issue of efficient evaluation of Continuous Range Skyline Queries (CRSQ) in road networks. Due to the computation of network distance between objects in road networks is expensive and suffers the limitation of memory resources, we propose a novel method named Dynamic Split Points Setting (DSPS) dividing a given path in road networks into several segments. For each segment, we use Network Voronoi Diagrams (NVDs) based technique to calculate the candidate skyline interest points at the starting point of the segment. After that, when the query point moves, we dynamically set the spilt points by DSPS strategy 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. Extensive experiments show that our DSPS strategy is efficient compared with previous approaches.

[1]  Seung-won Hwang,et al.  MSSQ: Manhattan Spatial Skyline Queries , 2014, Inf. Syst..

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

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

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

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

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

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

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

[9]  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).

[10]  Bernhard Seeger,et al.  Progressive skyline computation in database systems , 2005, TODS.

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

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

[13]  Jarek Gryz,et al.  Maximal Vector Computation in Large Data Sets , 2005, VLDB.

[14]  Jan Chomicki,et al.  Skyline with presorting , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

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

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