期刊文献+

空间索引技术研究 被引量:13

Research on the Technology of Spatial Index
在线阅读 下载PDF
导出
摘要 空间索引可以提高空间数据库的操作效率,目前人们的研究工作更多地集中在空间数据的多维索引的研究上。文中全面地总结了当前空间数据库领域中空间索引以及时空索引的研究进展,描述了R树系列索引的构建思想,节点插入与分裂操作的不同。通过实验深入分析了R树以及R树变体的磁盘访问率,插入,删除,更新的CPU时间,验证了在数据激增的情况下,R树系列索引的复杂性带来的重叠问题会指数递增。由于R树当前应用的深度和广度,研究基于R树的高效时空高维索引技术是解决索引应用问题一个有效方法。提出了索引性能改进的方向在于多种索引技术的结合,尤其是树形结构索引和网状结构索引的结合。 Spatial index can improve operational efficiency of the spatial database.Research is now more focused on the multi-dimensional spatial data research on the index.In this paper,a comprehensive summary of the current field of spatial database research space indexed and spatiotemporal index by a number of experimental pop-depth analysis of the index structure,describes the construction thinking,node insertion and split operation of the R tree index series,through experiments in-depth analysis the CPU time which the R tree and R tree variants's disk access,insert,delete,update.Verify the case of surge in the data,R tree family index of overlap caused by the complexity of the problem exponentially.As the R tree depth and breadth of the current application,it is an effective way to solve application problems of index that research on the efficient tree-based on R tree high dimensional space-time techniques.Finally proposed to improve the performance of the direction of the index is a combination of a variety of indexing techniques,in particular,the index tree structure network structure and the combination of the index.
出处 《计算机技术与发展》 2010年第10期219-223,227,共6页 Computer Technology and Development
基金 湖北省自然科技基金(2007ABA025)
关键词 空间数据 R-TREE 空间索引 高维索引 时空索引 spatial data R-tree spatial index high dimensional index spatiotemporal index
  • 相关文献

参考文献32

  • 1Finkel R A,Bentley J L.Quadtrees:A data structure for retrieval on compositive keys[J].Acta Informatic,1974,4(1):1-9.
  • 2Bentley J L.Multidimensional Binary Search Trees used for Associative serching[J].Communications of the ACM,1975,18(9):509-517.
  • 3Bentley J L.Multidimensional Binary Search Trees in Database Applications[J].IEEE Transactions on Software Engineering,1979,5(4):333-340.
  • 4Robinson J T.The K-D-B-tree:a search structure for large multidimensional dynamic indexes[C] //In:Proceedings of the 1981 ACM SIGMOD international conference on Management of data.New York:ACM,1981:10-18.
  • 5Guttman A.R-Trees:A Dynamic Index Structure for Spatial Searching[C] //In:ACM SIGMOD Record.New York:ACM,1984:47-57.
  • 6Matsuvama T,Hao L V,Nagao M.A file organization for geographic information systems based on spatial proximity[J].Int Journal Comp Vision,Graphics,and Image Processing,1984,26(3):303-318.
  • 7Nievergelt J,Hinterberger H,Sevcik K C.The Grid File:An Adaptable,Symmetric Multikey File Structure[J].ACM Trans Database Sys,1984,9(1):38-71.
  • 8Hutflesz A,Six H-W,Widmayer P.The R-File:An Efficient Access Structure for Proximity Queries[C] //In:Proceedings of the Sixth International Conference on Data Engineering.Washington:IEEE Computer Society,1990:372-379.
  • 9Ralf H-G,Praktische I-IV,FernUniversit t H.An introduction to spatial database systems[J].SPECIAL ISSUE:Special issue on spatial database systems,1994,3(4):357-399.
  • 10Biswas S.One-dimensional B-B polynomial and Hilbert scan for graylevel image coding[J].Elsevier Science,Oxford,2004,37(4):789-800.

二级参考文献176

共引文献235

同被引文献119

引证文献13

二级引证文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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