期刊文献+

基于闭区域和开区域修剪的MTRNN过滤算法研究

Study on filter-MTRNN algorithm based on closed and open region pruning
下载PDF
导出
摘要 传统的多类型反向最近邻(multiple type reverse nearest neighbor,MTRNN)查询算法没有过滤搜索空间中的数据,因此效率低下。为有效提高MTRNN查询的效率,在概述MTRNN基础上采用几何方法开发了基于R-tree的闭区域和开区域修剪方法并进一步提出了高效的过滤算法。过滤算法通过构造闭修剪区域和开修剪区域来修剪查询空间,对大数据下的MTRNN查询过滤效果十分显著。最后通过实验验证了算法的有效性。 The original MTRNN query algorithm dose not filter any data in the search space, so it is very inefficient. Based on MTRNN query, this paper developed a closed region and open region pruning strategy with R-tree, and then presented a filte- ring algorithm to reduce the search space by constructing closed regions and open regions. The filtering effect of the algorithm was obvious on large data for MTRNN queries. Finally, the experimental results demonstrate the filtering algorithm' s effective- ness.
出处 《计算机应用研究》 CSCD 北大核心 2013年第10期2986-2990,共5页 Application Research of Computers
基金 南宁市粮食保障(指挥)系统项目(南发高技(2009)10号)
关键词 多类型反向最近邻查询 闭区域修剪 开区域修剪 multiple type reverse nearest neighbor query closed region pruning open region pruning
  • 相关文献

参考文献14

  • 1KORM F, MUTHUKRISHNAN S. Influence sets based on reversenearest neighbor queries [ C] //Proc of ACM SIGMOD InternationalConference on Management of Data. New York ; ACM Press ^ 2000 ;201-212.
  • 2STANOI I,AGRAWAL D, ABBADI A E. Reverse nearest neighborqueries for dynamic databases [ C] //Proc of ACM SIGMOD Workshopon Research Issues in Data Mining and Knowledge Discovery. NewYork: ACM Press,2000:44-53.
  • 3YANG Cong-jun, LIN K I. An index structure for efficient reversenearest neighbor queries [ C] //Proc of the 17th International Confe-rence on Data Engineering. Washington DC : IEEE Computer Socie-ty ,2001 :485-492.
  • 4CHEEMA M A,ZHANG Wen-jie, LIN Xue-min, et al. Continuousreverse K nearest neighbors queries in Euclidean space and in spatialnetworks[ J]. The VLDB Journal,2012,21 (1) :69-95.
  • 5TRAN Q T,TANIAR D, SAFAR M. Bichromatic reverse nearestneighbor search in mobile systems[ J]. Systems Journal,2010,4(2):230-242.
  • 6BERNECKER T,EMRICH T, KRIEGEL H P, et al. Efficient prob-abilistic reverse nearest neighbor query processing on uncertain data[J]. Proc of the VLDB Endowment,2011,4(10) :669-680.
  • 7MAK C L,LIU Chuan-ming, YEH W C. Reverse nearest neighborssearch in wireless broadcast environments [ C]//Proc of the 9 th Inter-national Conference on UIC/ATC. Washington DC:IEEE Compu-terSociety,2012 :863-868.
  • 8CHEEMA M A, ZHANG Wen-jie, LIN Xue-min, et al. Efficientlyprocessing snapshot and continuous reverse K nearest neighbors que-ries[J]. The VLDB Journal,2012,21 (5) :703-728.
  • 9MA Xiao-bin,SHEKHAR S, XIONG Hui, et al. Exploiting pagelevel upper bound for multi-type nearest neighbor queries [ C]//Procof the 14th Annual ACM International Symposium on Advances inGeo-graphic Information Systems. New York : ACM Press ,2006 : 179-186.
  • 10SHARIFZADEH M,KOLAHDOUZAN M, SHAHABI M. The opti-mal sequenced route query [J]. The VLDB Journal, 2008,17(4):765-787.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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