首页 | 本学科首页   官方微博 | 高级检索  
     检索      

连续近邻查询方法的研究
引用本文:刘岩峰.连续近邻查询方法的研究[J].齐齐哈尔大学学报(自然科学版),2006,22(6):53-55.
作者姓名:刘岩峰
作者单位:齐齐哈尔大学计算机与控制工程学院,黑龙江,齐齐哈尔,161006
摘    要:连续近邻查询(CNN)是时空数据库中一种重要的查询类型。Voronoi图解决连续近邻查询问题,思想简单明晰,但Voronoi图构造代价太高,尤其是高阶的Voronoi图。本文利用分枝限界的思想去界定预创建Voronoi图生成点范围的上限。提出了一种动态地创建局部Voronoi图的办法解决连续近邻查询问题。这种方法只是在给定查询段上所有点的k个近邻范围上限内创建一个局部的k阶Voronoi图,这样会大大降低基于Voronoi图的连续k近邻查询的代价。

关 键 词:连续近邻查询  时空数据库  k阶Voronoi图
文章编号:1007-984X(2006)06-0053-03
收稿时间:2006-10-19
修稿时间:2006年10月19

Research for the methods of continuous nearest neighbor queries
LIU Yan-feng.Research for the methods of continuous nearest neighbor queries[J].Journal of Qiqihar University(Natural Science Edition),2006,22(6):53-55.
Authors:LIU Yan-feng
Institution:College of Computer and Control Engineering, Qiqihar University, Heilongjiang Qiqihar 161006, China
Abstract:Continuous nearest neighbors(CNN)inquiry is important in spatial-temporal database.Voronoi diagrams is employed to resolve CNN inquiry,which is explicit and simple in thought.But the cost of constructing higher-order Voronoi Diagrams is too high,particularly to a high-order Voronoi Diagrams.This paper is based on the conception of division and bound to decide the upper bound of scope of Voronoi generaters,this paper proposed a method which dy-namically constructs partial Voronoi diagrams to resolve CNN inquiry.This method take points of k nesaest neighbors of every point on given line segment as generaters to construct a k-order Voronoi diagram to resolve kCNN inquiry.So sharply lowered the cost of the continuous k nearest neighbors inquiry.
Keywords:continuous nearest neighbors inquiry  spatial-temporal database  order-k Voronoi diagrams
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号