Multi-level continuous skyline queries (MCSQ)

Abstract

Most of the current work on skyline queries mainly dealt with querying static query points over static data sets. With the advances in wireless communication, mobile computing, and positioning technologies, it has become possible to obtain and manage (model, index, query, etc.) the trajectories of moving objects in real life, and consequently the need for continuous skyline query processing has become more and more pressing. In this paper, we address the problem of efficiently maintaining continuous skyline queries which contain both static and dynamic attributes. We present a Multi-level Continuous Skyline Query (MCSQ) algorithm, which basically creates a pre-computed skyline data set, facilitates skyline update, and enhances query running time and performance. Our algorithm in brief proceeds as follows: First, we distinguish the data points that are permanently in the skyline and use them to derive a search bound. Second, we establish a pre-computed data set for dynamic skyline that depends on the number of skyline levels (M) which is later used to update the first (initial) skyline points. Finally, every time the skyline needs to be updated we use the pre-computed data sets of skyline to update the previous skyline set and consequently updating first skyline. Finally, we present experimental results to demonstrate the performance and efficiency of our algorithm.

Continuous skyline queries in distributed environment

“…Consequently, the skyline result will include all points existing in layer-1. In addition, the variants of the skyline queries were discussed on different research work such as top-k frequent skyline in Chan et al (2006), spatial skyline in Sharifzadeh and Shahabi (2006), probabilistic skyline for uncertain data in Lian and Chen (2010), Pei et al (2007) and continuous skyline in El-Dawy et al (2012), Zhiyong et al (2006) and El-Dawy et al (2011).…”