Reasearch On Reverse Skyline Query And Its Variants

The skyline operator is a hot topic in database community. It is executed from the customers’perspective and returns the objects not dominated by other objects. The reverse skyline query is performed from the companies’perspective, which retrieves the objects in dataset whose dynamic skyline contains the query point. It has received considerable attention in the past few years, due to its importance in applications such as business planning, environmental monitoring, and profile-based investment. Currently, the state-of-the-art algorithm for the reverse skyline query is RSSA. But it needs for multiple accesses of the same nodes, incurring redundant I/O and CPU costs. In addition, the traditional reverse skyline query can not fully meet the demands of the user. All these bring the new challenges for the research on reverse skyline query.Motivated by the above facts, in this paper, we focus on the the reverse skyline query and its variants, which include the following four aspects:1. By employing the reuse technique and new pruning heuristic, we propose several efficient reverse skyline query algorithm.2. Explore firstly the problem of reverse k-skyband query. Specifically, this dissertation formalizes the reverse k-skyband query and analyzes the problem characteristics of this query as well as proposes a series of algorithms.3. Discuss firstly the problem of the constrained reverse skyline query. We formally define the constrained reverse skyline query and propose three efficient algorithms to address the query.4. Analyse the correctness and the time complexicty of all the algorithms proposed in this paper and conduct extensive experiments using both real and synthetic datasets to demonstrate the performance of our proposed algorithms.The work of this paper enriches the theory system of spatio-temporal database.