The Method of the K-Dominant Space Skyline Query in Road Network

In order to make up for the shortcomings of the existing research results in dealing with the K-dominat space Skyline query problem in the road network environment, the method of the K-dominant space Skyline query in road network based on the network Voronoi diagram is proposed. This method applies K-dominant to the Skyline query of road network to deal with the multi-attribute data objects and can be used to solve the multi-objective decision problems in practical applications in the road network. The method mainly includes reduction data set process and K-dominant checking process in road network. Firstly, the Voronoi diagram is constructed based on spatial data points, and the query convex hull is built for query points. The Voronoi diagram of the data and the positional relationship of the query area are used to cut the data set. Thus the data set is optimized and the phenomenon of repeated search of query points is effectively reduced. Then, the refined set is obtained by K-dominant checking on the non-spatial attributes of the candidate set. Finally, the final spatial Skyline set is obtained by dominating the refined set.Theoretical research and experiments show that the proposed method has higher efficiency and can handle the K-dominant space Skyline query problem in the road network better.