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

基于分区技术的静态R树索引并行计算技术 被引量：4

Parallel Computation Technique for Static R-tree Index Based on Partition Technology
在线阅读 下载PDF
导出
摘要 海量空间数据静态R树索引的加载时耗很大。该文利用关系数据库的优势,以空间数据分区存储技术为基础,提出针对自上而下的贪婪分裂算法的静态R树并行加载方法。该方法提高了海量数据批量加载效率,支持分区粒度的索引重建。论证与实验结果表明,并行构建的R树在合理空间数据分区下可以获得更高查询效率。 Bulk-loading of static R-tree index for massive spatial data is time consuming. This paper utilizes the advantage of relational database. Aiming at the Top-down Greedy-Split（TGS） algorithm, it proposes parallel bulk-loading method of static R-tree based on the storage technology of spatial data. This method accelerates the mass data bulk loading efficient, and supports the index rebuild of partition grading. Argumentation and experimental results show that the parallel built R-tree has higher query efficiency under reasonable spatial data partition.
作者 周芹 钟耳顺 黄耀欢
机构地区 中国科学院地理科学与资源研究所 中国科学院研究生院 中国水利水电科学研究院
出处 《计算机工程》 CAS CSCD 北大核心 2009年第2期68-69,73,共3页 Computer Engineering
关键词 空间索引 静态R树 分区 并行计算 spatial index static R-tree partition parallel computation
分类号 TP311.13 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献4

  • 1张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量：95
  • 2Kamel I, Faloutsos C. On Packing R-trees[C]//Proceedings of the 2rid International Conference on Information and Knowledge Management. Washington, D. C., USA: [s. n.], 1993.
  • 3张立立.海量地理空间数据的高性能计算[z].中国科学院地理资源与环境研究所,2005.
  • 4Theodoridis Y, Sellis T. A Model for the Prediction of R-tree Performance[C]//Proceedings of the 15th ACM Symposium on Principles of Database Systems. Montreal, Canada: ACM Press, 1996: 161-171.

二级参考文献101

  • 1Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394～408.
  • 2An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368～375.
  • 3Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609～626.
  • 4Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195～204.
  • 5Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225～236.
  • 6Koudas N., Faloutsos C., Kamel I.. Declustering spatial databases on a multi-computer architecture. In: Proceedings of EDBT, Avignon, France, 1996, 592～614.
  • 7Brinkhoff T., Kriegel Hans-Peter, Seeger B.. Parallel processing of spatial joins using R-trees. In: Proceedings of ICDE, New Orleans, Louisiana, 1996, 258～265.
  • 8Papadopoulos A., Manolopoulos Y.. Parallel processing of nearest neighbor queries in declustered spatial data. In: Proceedings of ACM-GIS, Rockville, MD, 1996, 35～43.
  • 9Papadopoulos A., Manolopoulos Y.. Nearest neighbor queries in shared-nothing environments. Geoinformatica, 1997, 1(4): 369～392.
  • 10Fu X., Wang D., Zheng W.. GPR-tree: A global parallel index structure for multiattribute declustering on cluster of work- stations. In: Proceedings of APDC'97, Shanghai, China, 1997, 300～306.

共引文献94

同被引文献25

  • 1孙志伟.存在物理约束下的基于密度的空间聚类算法[J].计算机应用研究,2009,26(3):873-875. 被引量：1
  • 2张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量：95
  • 3A Cuttman.R-tree:A Dynamic Index Structure for Spatial Searching.In Proc.ACM Sigmod.International Conference on Management of Data[R].Boston,1984.
  • 4Leutenegger S,Edgington J M,Lopez M A.STR:A simple and efficient algorithm for R-tree packing[C].Birminghan,England:Proceedings of the 13th IEEE ICDE,1997:497-506.
  • 5Lee T,Sukho.OMT:Overlap minimizing top-aown bulk loading algorithm for R-tree[J].Advanced Information Systems Engineering,2003(7):69-72.
  • 6张明波,陆锋,申排伟,等.空间索引R树研究:回顾与展望[C].北京:中国地理信息系统协会第八届年会,2004:22-27.
  • 7Lee T,Bongki M,Lee S.Bulk Insertion for R-tree by Seeded Clustering[C]//Proc.of DEXA’03.Prague,Czech Republic: [s.n.],2003.
  • 8Lee T,Lee S.OMT: Overlap Minimizing Top-down Bulk Loading Algorithm for R-tree[J].Advanced Information Systems Engineering,2003,11(7): 69-72.
  • 9Leutenegger S,Edgington J M,Lopez M A.STR: A Simple and Efficient Algorithm for R-tree Packing[C]//Proc.of ICDE’07.Birmingham,UK: [s.n.],1997.
  • 10Jonk A,Smeulders A W.An axiomatic approach to clustering line-segments[C]//The 3rd International Conference on Document Analysis and Recognition.Montreal,Quebec,Aug.14-16,1995:386-389.

引证文献4

二级引证文献1

计算机工程
2009年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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