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

空间网络数据库中基于M-tree索引的反最近邻查询算法
引用本文:朱彩云,金顺福,刘国华,齐峰,李金才. 空间网络数据库中基于M-tree索引的反最近邻查询算法[J]. 东北重型机械学院学报, 2009, 0(2)
作者姓名:朱彩云  金顺福  刘国华  齐峰  李金才
作者单位:燕山大学信息科学与工程学院
基金项目:国家自然科学基金资助项目(60773100)
摘    要:欧式空间中的反最近邻查询算法不适用于空间网络环境,故采用任意度量空间中的M-tree索引结构,进行空间网络数据库中的反最近邻查询处理。首先通过预计算的方法得到网络距离信息,依据此距离信息,对空间网络对象建立M-tree索引结构。然后,给出并证明了M-tree中间结点修剪定理,提出一种适用于空间网络环境的反最近邻查询算法。最后实验验证了该算法的有效性。

关 键 词:空间网络数据库  最近邻  反最近邻  M-tree

An algorithm for reverse k-nearest neighbor queries based on M-tree in spatial network databases
ZHU Cai-yun; JIN Shun-fu; LIU Guo-hua; QI-Feng; LI Jin-cai. An algorithm for reverse k-nearest neighbor queries based on M-tree in spatial network databases[J]. , 2009, 0(2)
Authors:ZHU Cai-yun   JIN Shun-fu   LIU Guo-hua   QI-Feng   LI Jin-cai
Affiliation:ZHU Cai-yun; JIN Shun-fu; LIU Guo-hua; QI-Feng; LI Jin-cai (College of Information Science and Engineering; Yanshan University; Qinhuangdao; Hebei 066004; China);
Abstract:Current work which focuses on Euclidean spatial for reverse -nearest neighbor queries cannot be applied to spatial net- work environment. On this issue, the M-tree index which is capable of indexing data in any metric space is presented for reverse k-nearest neighbor queries in spatial network. Firstly, the pre-computation s method is used to get the network distances information, based on this distance information, the M-tree index structure to the spatial network object is established. Then, the theorem t...
Keywords:spatial network databases  -nearest neighbor  reverse k-nearest neighbor  M-tree
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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