期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

球面上的K最近邻查询算法 被引量：4

Algorithms for K-Nearest Neighbor Query on Sphere
下载PDF
导出
摘要 针对球面上数据对象点集的特征和K最近邻查询的需求,提出2种处理球面上K最近邻查询的算法:基于查询轴的K最近邻查询算法(PAM方法)和基于查询圆面的K最近邻查询算法(PCM方法)。对2种算法进行实验比较,结果表明。 According to the characteristics of the datasets on the sphere, the algorithm of the K-Nearest Neighbor query based on the query axis （PAM） and the algorithm of the K-Nearest Neighbor query based on the query circular planar（PCM） are presented. Theoretical research and experimental results show that both the two methods can handle the problem of the K-Nearest Neighbor query on the sphere, compared with the PCM, PAM has advantages on the memory capacitance and the query efficiency, but the expansibility of PAM is poor and PCM has high scalability.
作者 张丽平 李松 郝晓红
机构地区 哈尔滨理工大学计算机科学与技术学院 哈尔滨理工大学计算中心
出处 《计算机工程》 CAS CSCD 北大核心 2011年第2期52-53,56,共3页 Computer Engineering
基金 黑龙江省教育厅科学技术研究基金资助项目(11551084)
关键词 最近邻 球面 查询轴 查询圆面 索引结构 nearest neighbor： sphere query axis query circular planar index structure
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献5

二级参考文献16

  • 1高晓燕,史银龙,邹德斌.GIS路网上的无线移动定位算法研究[J].计算机工程与设计,2006,27(5):758-761. 被引量：1
  • 2FLIP K, MUTHUKRISHNAN S. Influence sets based on reverse nearest neighbor queries[C]// International Conference on Management of Data. Proceedings of the 2000 ACM SIGMOD international conference on Management of Data. Dallas, USA, 2000.
  • 3YANG C, LINK I. An index structure for efficient reverse nearest neighbor queries[C]// Proceedings of the IEEE International Conference on Data Engineering. Heidelberg, Germany,2001.
  • 4STANOI I, AGRAWAL D, ABBADI A E. Reverse nearest neighbor queries for dynamic databases[C]// Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. Dallas, USA, 2000.
  • 5MAN L Y, PAPADIAS D, MAMOULIS N, TAO Y. Reverse nearest neighbors in large graphs [J]. IEEE Transactions on Knowledge and Data Engineering, 2006, 18(4) : 540-553.
  • 6MAN L Y, MAMOULIS N. Reverse nearest neighbors search in Ad-hoc subspaces [J]. IEEE Transactions on Knowledge and Data Engineering, 2007, 19(3) : 412-426.
  • 7SACL J R, URRUTIA J. Handbook on computational geometry[M]. Ottawa. Elsevier Science, 2000.
  • 8Stanoi I,Agrawal D,Abbadi A E.Reverse Nearest Neighbor Queries for Dynamic Databases[C]//Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.Dallas,USA:[s.n.],2000.
  • 9Achtert E,Bohm C,Kroger P,et al.Efficient Reverse K-nearest Neighbor Search in Arbitrary Metric Spaces[C]//Proc.of International Conference on Management of Data.Chicago,USA:[s.n.],2006.
  • 10Yang Congjun,Lin K I.An Index Structure for Efficient Reverse Nearest Neighbor Queries[C]//Proceedings of the 17th International Conf.on Data Engineering.Heidelberg,Germany:IEEE Computer Society,2001.

共引文献35

同被引文献21

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量：95
  • 2Leong H U, Mamoulis N, Yiu M L. Computation and Monitoring of Exclusive Closest Pairs[J]. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(12): 1641-1654.
  • 3Sacl J R, Urrutia J. Voronoi Diagrams[M]. Ottawa, Canada: Elsevier Science Press, 2000.
  • 4Skiadopoulos S, Koubarakis M. Composing Cardinal Direction Relations[J]. Artificial Intelligence, 2004, 152(2): 143-171.
  • 5Schockaert S, de Cock M, Kerre E E. Modeling Nearness and Cardinal Directions Between Fuzzy Regions[C] //Proc. of IEEE World Congress on Computational Intelligence. [S. l.] : IEEE Press, 2008.
  • 6Cheung K L, Fu A W. Enhanced Nearest Neighbour Search on the R-tree[J]. SIGMOD Record, 1998, 27(3): 16-21.
  • 7Song Zhexuan, Roussopoulos N. K-Nearest Neighbor Search for Moving Query Point[C] //Proc. of the 7th International Symposium on Advances in Spatial and Temporal Databases. Berlin, Germany: Springer-Verlag, 2001: 79-96.
  • 8Yiu M L, Mamoulis N. Aggregate Nearest Neighbor Queries in Road Networks[J]. IEEE Transactions on Knowledge and Data Engineering, 2005, 17(6): 820-833.
  • 9Leong H U, Mamoulis N, Yiu M L. Computation and Monitoring of Exclusive Closest Pairs[J]. IEEE Transactions on Knowledge and Data Engineering, 2008, 20(12): 1641-1654.
  • 10Sacl J R, Urrutia J. Handbook on Computational Geometry[M]. Ottawa, Canada: Elsevier Science, 2000.

引证文献4

二级引证文献10

计算机工程
2011年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部