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

网络环境中近邻对的查询方法
引用本文:张丽平,李松.网络环境中近邻对的查询方法[J].微机发展,2008,18(6):119-121.
作者姓名:张丽平  李松
作者单位:辽宁工程技术大学电子与信息工程学院 辽宁葫芦岛125105(张丽平),哈尔滨理工大学计算机科学与技术学院 黑龙江哈尔滨150080(李松)
基金项目:黑龙江省创新科研基金资助项目(YJSCX 2006-13HLJ)
摘    要:网络环境下的数据集中的近邻对查询在地理信息系统、网络查询和空间数据库等领域有着重要的应用。为了对网络环境下的近邻对进行有效查询,基于Voronoi图对数据集中近邻对问题进行了详细研究,给出了网络环境下查询数据点集中近邻对的定理和算法;为了利用计算机对网络环境下的近邻对进行查询处理,设计了相应的数据存储结构;对在网络环境下的查询数据集中的近邻对问题进行了实验分析。该方法可较好地解决网络环境下的数据集中近邻对的查询问题,相应的维护代价较低。

关 键 词:Voronoi图  最近邻  最近对  近邻对
文章编号:1673-629X(2008)06-0119-03
修稿时间:2007年9月10日

Methods of Near Neighbor Pair Query in Network
ZHANG Li-ping,LI Song.Methods of Near Neighbor Pair Query in Network[J].Microcomputer Development,2008,18(6):119-121.
Authors:ZHANG Li-ping  LI Song
Affiliation:ZHANG Li-ping1,LI Song2
Abstract:The near neighbor pair query of the datasets in the network has important application in geographical information systems,query in the network and spatial database.To search the near neighbor pairs effectively in the network,the near neighbor pair query was studied detailedly based on the Voronoi diagram. The theorems and algorithms of searching the near neighbor pair of the datasets in the network were proposed.To search the points in the database,the corresponding structures of the database were constructed and the experiments for the algorithms were also given.The methods in this paper can deal with the near neighbor pair query of the datasets in the network and the costs of the maintenance are low.
Keywords:Voronoi diagram  nearest neighbor  closest pair  near neighbor pair
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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