Efficient Computation of Continuous Range Skyline Queries in Road Networks

Abstract

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.