摘要
为了有效解决不确定对象的组最近邻查询问题,对不确定Voronoi图进行分析,提出单核不确定Voronoi区域和多核不确定Voronoi区域的概念,研究查询组对象的分布特点,利用不确定Voronoi图的性质,给出判断概率组最近邻的理论方法,并提出基于不确定Voronoi图的概率组最近邻查询算法,实验结果表明,算法的查询时间明显减少,具有较好的查询性能。
In order to solve the problem of group nearest neighbor queries for uncertain objects,the uncertain-voronoi diagram was analyzed and the concepts of single-core and multi-core uncertain voronoi areas wereproposed.The distribution characteristics of the query object group was studied,and the characteristics of uncertain-voronoi diagram were exploited.The theories that evaluate the probabilistic group nearest neighbors were put forward,and the algorithm was presented which deals with the probabilistic group nearest neighbor queries based on uncertain-voronoi diagram.The algorithm presented had a good query performance and its query time is shortened.
出处
《北京农学院学报》
2013年第4期73-75,共3页
Journal of Beijing University of Agriculture
基金
黑龙江省教育厅2011年度科学技术研究项目(No.12511102)
关键词
时空数据库
不确定对象
不确定Voronoi图
概率组最近邻查询
查询算法
spatio-temporal database
uncertain objects
uncertain-voronoi diagram
probabilistic group nearest neighbor queries
query algorithm
作者简介
作者简介：孙冬璞（1979-）,女,博士,副教授,硕士生导师,主要从事数据库理论与应用的研究,Tel：13936004337,E-mail：sundongpu@sina.com;通讯地址：黑龙江省哈尔滨市南岗区学府路52号哈尔滨理工大学西区160信箱（150080）
