期刊文献+

GSHR-Tree:一种基于动态空间槽和哈希表的网格环境下的空间索引树 被引量:1

GSHR-Tree:A Spatial Index Tree Based on Dynamic Spatial Slot and Hash Table in Grid Environments
原文传递
导出
摘要 为提高网格环境下海量空间数据管理与并行化处理效率,将网格环境下的分布并行处理技术与空间索引相融合,提出了一种空间索引框架(grid slot and hash Rtree,GSHR-Tree).该索引树结构基于散列hash表和动态空间槽,结合R树结构的范围查询优势和哈希表结构的高效单key查询,分析改进了索引结构的组织和存储.构造了适合于大规模空间数据的网格并行空间计算的索引结构,该索引树算法根据空间数据划分策略,动态分割空间槽,并将它们映射到多个节点机上.每个节点机再将其对应空间槽中的空间对象组织成R树,以大节点R树方式在多个节点上分布索引数据.以空间范围查询并行处理的系统响应时间为性能评估指标,通过模拟实验证明,该GSHR-Tree索引满足了当前网格环境空间索引的需要,并具有设计合理、性能高效的特点. In order to improve the efficiency of parallel processing of a spatial mass data under the distributed parallel computing grid environment,this paper presents a new grid slot hash parallel spatial index GSHR-Tree structure established with the parallel spatial indexing mechanism.Based on the hash table and dynamic spatial slot,we have improved the structure of the classical parallel R-tree index.The GSHR-Tree index makes full use of the good qualities of R-Tree and hash data structure.A new parallel spatial index is constructed to meet the needs of parallel grid computing about the magnanimous spatial data in the distributed network.This arithmetic splits space into multi-slots by multiplying and reverting and maps these slots to sites in distributed and parallel system.Each site constructs the spatial objects in its spatial slot into an R-tree.On the basis of this tree structure,the index data is distributed among multiple nodes in the grid networks by using large node R-tree method.Instead of spatial object's recursive comparison where original R-tree has been used,the algorithm builds the spatial index by applying binary code operation in which computer runs more efficiently,and extends dynamic hash code for bit comparison,using the system response time of the parallel processing of spatial scope query algorithm as the performance evaluation factor.The result of the simulated the experiments shows GSHR-Tree is performed to prove the reasonable design and the high performance of the indexing structure presented in the paper.
出处 《地球科学(中国地质大学学报)》 EI CAS CSCD 北大核心 2010年第3期463-470,共8页 Earth Science-Journal of China University of Geosciences
基金 国家重点"863"项目(No.2007AA120503) 中央高校基本科研业务费专项资金(No.CUGL090251) 国家自然科学基金(No.40771165)
关键词 空间数据索引 分布式空间索引 R-树 散列hash表 动态空间槽 网格计算 地理信息系统 geospatial data index distributed parallel index R-Tree hash index dynamic spatial slot grid computing geographic information system(GIS)
  • 相关文献

参考文献2

二级参考文献25

  • 1Azzedine Boukerche, Amber Roy. In search of data distribution management in large scale distributed simulations, http://www.scs. org/scsarchive/getDoc, cfm? id = 864, 2000-07-20.
  • 2Come Raczy, Jun Yu, Gary Tan, et al. Adaptive data distribution management for HLA RTI. http://siso. sc. ist. ucf.edu/conferenee/download, cfm? Phase_ ID = 2&FileName = 02E-SIW-043. doe, 2002-06-26.
  • 3Mikel D. Petty, Amar Mukherjee. Experimental comparison of d-rectangle intersection algorithms applied to HLA data distribution, http://siso. sc. ist. ucf. edu/doclib/doelib, efm? SISO_FID-405, 1997-09-12.
  • 4Douglas Wood. Implementation of DDM in the MAK high performance RTI. http://siso. sc. ist. ucf. edu/conference/download, cfm? Phase-ID = 2&FileName = 02S-SIW-056.doc,2002-03-15.
  • 5A, Guttman. R-trees: A dynamic index structure for spatial searching. ACM SIGMOD Int'1 Conf. Management of Data,Boston, Massachusetts, 1984.
  • 6Y. Theodoridis, E. Stefanakis, T. Sellis. Efficient cost models for spatial queries using R-trees. IEEE Transactions on Knowledge and Data Engineering, 2000, 12 ( 1 ) : 19 - 32.
  • 7IEEE Std 1516.1-2000. IEEE standard for modeling and simulation (M&S) high level architecture ( HLA)-federate interface specification, http://www. ieee. org, 2000.
  • 8Yu Jun, Come Raczy, Gary Tan. Evaluation of sort-based matching algorithm for the DDM. The 16th Workshop on Parallel and Distributed Simulation, Washington, USA, 2002.
  • 9Guttman A. R-Trees: A Dynamic Index Structure for Spatial Searching. In: 1984 Proc. ACM SIGMOD Conf, , 1984.47-57
  • 10Ciferri R R, Salgado A C, et al. A performance comparison among the traditional R trees, the hilbert R-tree and the SR-tree.In:2003 Proe. SCCC Conf. ,2003. 3-12

共引文献10

同被引文献13

  • 1张旭,李增元,邓广,陈艳,雷振宇,范东璞,杨彦臣.数字林业平台技术研究与实现[J].林业科学,2006,42(z1):37-40. 被引量:14
  • 2左朝树,刘心松,陈小辉,顾攀.DPsIR^+:一种基于动态空间槽的分布式并行空间索引树[J].计算机科学,2006,33(2):121-126. 被引量:5
  • 3田波,丁丽霞,周云轩,汤臣栋.多层分布式林业信息服务平台的构建[J].浙江林学院学报,2006,23(4):429-434. 被引量:6
  • 4Kamel I, Faloutsos C. Parallel R-Trees [C]//Proceedings of the t992 ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1992: 195-204.
  • 5FU Xiao-dong, WANG Ding-xing, ZHENG Wei-min. GPR-Tree: A Global Parallel Index Structure for Multiattribute Declustering on Cluster of Workstations [C]//Proeeedings on Advances in Parallel and Distributed Computing. Piscataway: IEEE Computer Society, 1997: 300-306.
  • 6Lawder J K, King P J H. Using Space-Filling Curves for Multidimensional Indexing [C]//Proceedings of the 17th British National Conference on Databases: Advances in Databases. London: Springer, 2000: 20-25.
  • 7Breinholt G, Schierz C. Generating Hilberts Space-Filling Curve by Recursion [J]. ACM Transactions on Mathematical Software, 1998, 24(2): 184-189.
  • 8Kamel I, Faloutsos C. Hilbert R-Tree: An Improved R-Tree Using Fractals [C]//Proceedings of the 20th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann Publisher Inc, 1994: 500-509.
  • 9张冬有,臧淑英,冯仲科.黑龙江省林业地理信息公共服务平台设计[J].北京林业大学学报,2007,29(S2):26-30. 被引量:7
  • 10于波,郝忠孝.基于DPR树的分布式并行空间索引机制的研究[J].计算机技术与发展,2010,20(6):39-42. 被引量:3

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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