期刊文献+

基于DPR树的分布式并行空间索引机制的研究 被引量:3

Research of Distributed and Parallel Spatial Index Mechanism Based on DPR-tree
下载PDF
导出
摘要 针对分布式并行环境下海量空间数据管理与并行化处理的效率问题,以提高分布式并行空间数据的查询效率为目的,根据现有的空间索引结构与并行化技术,提出一种新的分布式并行空间索引结构——DPR树。DPR树是空间索引技术与并行化技术优化结合的成果。DPR树在数据的总体划分与部分查询中所采用的均是基于高效处理技术。它在原有的并行Master-client R树的基础上进行改进,采用了HCSDP数据划分技术,并将其应用到分布式环境下,且每个节点机中各子树采用了改进的R树——R*Q树。通过性能分析表明,该索引结构具有高效的查询性能。 On account of the problem of mass spatial data manage ment and parallelizable efficiency which in distributed parallel environment and in order to improve the querying efficiency,a new struct of distributing parallel spatial index struct-DPR tree is offered which based on existed spatial index struct and parallelizable technologies.DPR tree is spatial index struct and parallelization technology optimized composed.DPR tree adopts high efficiency processing technique both on the total divide and partial query.It is based on parallel Master-client R tree and improves,at the same time,introducing HCSDP division technology,and applying it to distributed environment,moreover,every subtree uses the improving R tree—R*Q tree.By performance analysis indicate that the index struct has efficient query performance.
作者 于波 郝忠孝
出处 《计算机技术与发展》 2010年第6期39-42,共4页 Computer Technology and Development
基金 黑龙江省自然科学基金资助项目(F2007-01)
关键词 空间数据库 空间索引 并行索引 DPR树 spatial database spatial index parallel index DPR tree
  • 相关文献

参考文献8

二级参考文献131

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:95
  • 2Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394~408.
  • 3An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368~375.
  • 4Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609~626.
  • 5Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195~204.
  • 6Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225~236.
  • 7Koudas N., Faloutsos C., Kamel I.. Declustering spatial databases on a multi-computer architecture. In: Proceedings of EDBT, Avignon, France, 1996, 592~614.
  • 8Brinkhoff T., Kriegel Hans-Peter, Seeger B.. Parallel processing of spatial joins using R-trees. In: Proceedings of ICDE, New Orleans, Louisiana, 1996, 258~265.
  • 9Papadopoulos A., Manolopoulos Y.. Parallel processing of nearest neighbor queries in declustered spatial data. In: Proceedings of ACM-GIS, Rockville, MD, 1996, 35~43.
  • 10Papadopoulos A., Manolopoulos Y.. Nearest neighbor queries in shared-nothing environments. Geoinformatica, 1997, 1(4): 369~392.

共引文献122

同被引文献51

引证文献3

二级引证文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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