ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2020, Vol. 57 ›› Issue (1): 227-239.doi: 10.7544/issn1000-1239.2020.20190026

• 软件技术 • 上一篇    

道路网环境下K-支配空间Skyline查询方法

李松1,窦雅男1,郝晓红1,张丽平1,郝忠孝1,2   

  1. 1(哈尔滨理工大学计算机科学与技术学院 哈尔滨 150080);2(哈尔滨工业大学计算机科学与技术学院 哈尔滨 150001) (lisongbeifen@163.com)
  • 出版日期: 2020-01-01
  • 基金资助: 
    国家自然科学基金项目(61872105);黑龙江省留学归国人员科学基金项目(LC2018030);黑龙江省教育厅科学技术研究项目(12531z004)

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

Li Song1, Dou Yanan1, Hao Xiaohong1, Zhang Liping1, Hao Zhongxiao1,2   

  1. 1(College of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080);2(College of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001)
  • Online: 2020-01-01
  • Supported by: 
    This work was supported by the National Natural Science Foundation of China (61872105), the Scientific Research Foundation for Returned Scholars Abroad of Heilongjiang Province of China (LC2018030), and the Science and Technology Research Project of Heilongjiang Provincial Education Department (12531z004).

摘要: 为了弥补已有的研究成果无法直接处理道路网环境下K-支配空间Skyline查询问题的不足,提出了基于网络Voronoi图的道路网环境下K-支配空间Skyline查询方法.该方法将K-支配应用到道路网Skyline查询中以处理多属性数据对象,在实际应用中可以用来解决道路网环境下多目标查询和决策问题.方法主要包括道路网中约减数据集过程和K-支配检查过程.首先基于空间数据点构建网络Voronoi图,并对查询点建立查询凸包,通过网络Voronoi图的性质与查询区域的位置关系对数据集约减,从而优化数据集并且有效地减少查询点重复搜索的现象;然后对候选集的非空间属性进行K-支配检查得到道路网精炼集合;最后对精炼集合进行支配检查得到最终的空间Skyline集合.理论研究和实验表明所提出的方法具有较高的效率,可较好地处理道路网环境下K-支配空间Skyline查询问题.

关键词: 空间Skyline查询, 多目标决策, Voronoi图, 道路网, 空间属性

Abstract: 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.

Key words: spatial Skyline query, multi-objective decision-making, Voronoi diagram, road network, spatial attribute

中图分类号: