期刊文献+

三维GIS中混合树空间索引结构的研究 被引量:3

Research on Spatial Index Structure of Hybrid Tree In 3D GIS
下载PDF
导出
摘要 目的在空间数据库应用中,解决随着数据量的增加,单一的空间索引结构制约检索性能的问题.方法提出一种三维GIS中基于八叉树和R*树的混合树空间索引结构OR*树,该结构在对三维索引空间进行八叉划分的基础上应用R*树索引技术,将操作空间限定在某一特定的区域.结果实现了R*树以及OR*树的试验程序,并通过均匀分布的随机数据测试了不同层数OR*树的空间开销与插入、删除、查找所访问的磁盘页数.结论试验数据分析表明,该方法有效降低了R*树的插入、删除与查询操作的开销,数据量越大OR*树的效率越高. In spatial database application, to solve the problem that a single special indexing structure constrains retrieval performance with the increment of the amount of data, a hybrid tree special indexing structure is proposed, and so is OR * -tree, which is based on Octree and R * -tree irl 3D GIS. It partitions the index space into eight subspaces in each level first, then creates a R * -tree structure for every index space. The experimental procedure of R * -tree and OR * -tree is accomplished, and the experiment has tested the special costs of different lever number OR * -tree and the accessed disk page number in the process of insertion, deletion and searching through uniformity distribution random data. The result of experiment indicates that the method reduces efficiently the operation costs of insertion, deletion and searching for R * -tree. The greater the amount of data is, the better the efficiency is.
出处 《沈阳建筑大学学报(自然科学版)》 EI CAS 2006年第3期478-482,共5页 Journal of Shenyang Jianzhu University:Natural Science
基金 国家科技攻关计划项目(2003BA808A21-6) 辽宁省自然科学基金资助项目(20032004)
关键词 3D GIS 空间索引 R*树 八叉树 OR*树 3D GIS spatial indexing R * -tree Octree OR * -tree
  • 相关文献

参考文献11

  • 1Chen L, Choubey R, Rundensteiner E A. Bulk - Insertions into R - trees using the Small- Tree - Large-Tree Approach [C].// Proceedings of ACM-GIS. 1998.161-162.
  • 2Guttman A. R- Tree: A Dynamic Index Structure for Spatial Searching[C].//Proc ACM SIGMOD. 1984.
  • 3Beckmann N, Kriegel H P, Schnieider R, et al. The R * - tree:An Efficient and Robust Access Method for Points and Rectangles[C].//USA:Proc ACM SIGMOD, 1990.
  • 4Ahn H K, Mamoulis N, Wong H M. A survey on multidimensional access methods[C].//The Netherlands: Technical Report, 2001.
  • 5ROBINSON J T. The K - D - B Tree: a search structure for large multidimensional dynamic index[C].//Proceeding of ACM SIGMOD International Conference on Management of Data, 1981:10-18.
  • 6Brakatsoulaz S, Pfoser D, Theodoridis Y. Revisiting R-tree construction principles[C].// Proceedings of the 6th ADBIS. Bratislava: Slovakia, 2002:149-162.
  • 7Lee T, Sukno. OMT: Overlap minimizing top - down bulk loading algorithm for R- tree[J]. Advanced Information Systems Engineering, 2003 (7): 69-72.
  • 8张明波,陆锋,申排伟,程昌秀.R树家族的演变和发展[J].计算机学报,2005,28(3):289-300. 被引量:94
  • 9宋扬,潘懋,朱雷.三维GIS中的R树索引研究[J].计算机工程与应用,2004,40(14):9-10. 被引量:11
  • 10谈国新.一体化空间数据结构及其索引机制研究[J].测绘学报,1998,27(4):293-299. 被引量:33

二级参考文献110

  • 1谈国新,林宗坚.二值图像的紧凑二叉树表示及其编码方法[J].武汉测绘科技大学学报,1995,20(3):219-223. 被引量:4
  • 2谈国新,林宗坚,卢健.多值图像的自适应空间索引结构研究[J].武汉测绘科技大学学报,1995,20(4):296-300. 被引量:4
  • 3李爱勤,武汉测绘科技大学学报,1995年,20卷,增刊,43页
  • 4龚健雅,整体SIS的数据组织与处理方法,1993年
  • 5Papadopoulos A.N., Manolopoulos Y.. Performance of nearest neighbor queries in R-trees. In: Proceedings of ICDT, Delphi, Greece, 1997, 394~408.
  • 6An N., Yang Zhen-Yu, Sivasubramaniam A.. Selectivity estimation for spatial joins. In: Proceedings of ICDE, Heidelberg, Germany, 2001, 368~375.
  • 7Sun Chengyu, Agrawal D., Abbadi A.E.. Selectivity estimation for spatial joins with geometric selections. In: Proceedings of EDBT, Prague, Czech Republic, 2002, 609~626.
  • 8Kamel I., Faloutsos C.. Parallel R-trees. In: Proceedings of SIGMOD, San Diego, California, 1992, 195~204.
  • 9Papadopoulos A., Manolopoulos Y.. Similarity query processing using disk arrays. In: Proceedings of SIGMOD, Seattle, Washington, USA, 1998, 225~236.
  • 10Koudas N., Faloutsos C., Kamel I.. Declustering spatial databases on a multi-computer architecture. In: Proceedings of EDBT, Avignon, France, 1996, 592~614.

共引文献142

同被引文献21

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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