Continuous Skyline Queries for Moving Objects in Road Networks

  title={Continuous Skyline Queries for Moving Objects in Road Networks},
  author={Changyue Shi and Xiaolin Qin and Li Wang},
  journal={J. Softw.},
Skyline queries in road networks have received much attention because of their wide applications in LBS. [] Key Method We propose an event-based incremental processing algorithm on the strength of tracking dominant relationships between objects with the distances changing and finding the result changing points. Extensive experiments are conducted to evaluate the performance of our proposed algorithm.

Figures and Tables from this paper

Continuous Skyline Queries for Moving Objects in Road Network based on MSO
A model of moving state of object (MSO) considering the relations between the object's moving state and query is constructed and an efficient algorithm handling the continuous skyline query of moving objects in road networks is proposed.
On Efficiently Answering Why-Not Range-Based Skyline Queries in Road Networks
This paper systematically carries out the study of why-not questions on the r-skyline query in the road network environment, and proposes three efficient algorithms to tackle the why- not RSQ problem, where several newly presented effective concepts/techniques are leveraged.
The Range Skyline Query
This paper considers the query as a hyper-rectangle iso-oriented towards the axes of the multi-dimensional space and proposes main-memory algorithmic strategies, which are simple to implement and secondary-memory pruning mechanisms for processing range skyline queries efficiently.


Continuous distance-based skyline queries in road networks
Continuous Skyline Queries for Moving Objects
This paper examines the spatiotemporal coherence of the problem, proposes a kinetic-based data structure and an efficient skyline query processing algorithm, and concisely analyzes the space and time costs.
Range-Based Skyline Queries in Mobile Environments
Two novel algorithms are proposed: one is index-based (I- SKY) and the other is not based on any index (N-SKY), which develop efficient solutions for probabilistic and continuous range-based skyline queries.
Continuous monitoring of skyline query over highly dynamic moving objects
This work proposes a continuous skyline query processing strategy for static query point, and the main idea is a grid-based algorithm that achieves low running time by handling movements only from objects that fall in the influence region, while data changes in the free region are omitted with correctness guarantee.
Dynamic skyline queries in metric spaces
This paper illustrates an efficient and effective pruning mechanism to answer metric skyline queries through a metric index, whose dynamic attributes are defined in the metric space (i.e. not limited to the Euclidean space).
PRISMO: predictive skyline query processing over moving objects
This paper proposes a framework, namely PRISMO, for processing predictive skyline queries over moving objects that not only contain spatio-temporal information, but also include non-spatial dimensions, such as other dynamic and static attributes.
Multi-source Skyline Query Processing in Road Networks
The Lower Bound Constraint algorithm (LBC) is proven to be an instance optimal algorithm and extensive experiments demonstrate that LBC is four times more efficient than a straightforward algorithm.
Skyline Query for Selecting Spatial Objects by Utilizing Surrounding Objects
This paper presents a method for selecting spatial objects, such as houses, based on the objects of the surrounding facilities such as restaurants, supermarkets, and stations by utilizing the idea of skyline queries.
Probabilistic Skyline Queries over Uncertain Moving Objects
A novel probabilistic skyline model where an uncertain object may take a probability to be in the skyline at a certain time point, therefore a p-t-skyline contains those moving objects whose skyline probabilities are at least p at time point t is proposed.
A safe zone based approach for monitoring moving skyline queries
The main focus of this paper is to present the techniques for Euclidean distance metric, and the proposed techniques are applicable to any metric distance (e.g., Manhattan distance, road network distance).