Skyline Queries For Moving Objects Under Distributed Environment

Spatial location is an important factor of People’s Daily life behavior.In recent years, locationtechnology and Location-Based Service begin to develop rapidly through the combine withInternet Service. Skyline query aims at finding a subset of interesting points that are not dominatedby any other points,and it is an important application of LBS. Currently, many researchers lookinto the skyline queries under distributed environment,but the existing skyline algorithm can’tsatisfy the requirement of object skyline computation in mobile environment,because they areunable to achieve the global skyline continuous update.This paper acts moving objects as the querypoint and studies distributed skyline queries for moving objects with certainty and uncertainty. Themain research contents and achievements include:This paper proposes a continuous skyline queries algorithm in order to reduce communicationcost. Firstly, the change of local skyline points in local sites are traced. Then concept of SDD(StaticDominant Degree) is introduced so that the point with maximum SDD can be selected to betransmitted to the center site. Next, the feedback rules will reduce the communication andcomputation cost.On this basis, taking into account the certain error in the collected positioninformation,moving object in the moving process act uncertainty region as the actual position ofthe moving object, thereby introduce the probability skyline. In this paper, the updating ofcontinuous probabilistic skyline queries is studied, which is under distributed environment with theuncertainty of moving objects. A continuous distributed probabilistic skyline queries algorithm inorder to reduce communication cost is proposed in this work. Firstly, the change of localprobabilistic skyline points in local sites are traced. Then the SM(Sort Method) is introduced, andthe feedback rules are proposed, which will reduce the communication and computation cost.This paper compared the algorithm under two proposed scenarios with the existing algorithms,analyzes the performance of the algorithm in all aspects, and experimental results showeffectiveness of the proposed algorithm.