期刊文献+

一种面向道路网3维数据的空间索引方法 被引量:5

A Spatial Indexing Approach on Road Network Data
在线阅读 下载PDF
导出
摘要 根据数据沿道路呈线性分布,道路相互连通的特点,提出连通拓扑和动态分段相结合的混合索引机制,分两步来实现查询过程:第一步通过连通索引来进行粗略查询;第二步根据粗略查询结果,利用动态分段索引完成精确查询。以此建立的道路网及沿线3维数据的空间索引具有很高的查询速度,能确保数据的快速动态装载,可满足道路网3维可视化的要求。最后通过实验对算法进行实现,并在空间效率和时间效率上与R树索引进行了比较。 It is well known that the data is along the road in a linear way and the roads connect to each other. According to the above characteristic, a hybrid index mechanism combining connection topology with dynamic segmentation is proposed in this paper, which can realize the querying process in two steps. The first step is to search rough by connecting index. Based on the results of the first step, the second step can finish the exact query process satisfactorily using dynamic segmentation index. This index mechanism with high query speed for loading data dynamically, and fulfills the demand of visualization of road network. Finally, some experiments had been made with the algorithm and given a comparison in space efficiency and time efficiency with R-tree index.
出处 《测绘学报》 EI CSCD 北大核心 2006年第1期57-63,共7页 Acta Geodaetica et Cartographica Sinica
基金 国家自然科学基金项目(40301040 40271093)
关键词 道路网 空间索引 连通索引 动态分段索引 road net work spatial index connective index dynamic segmentation index
作者简介 左小清(1972-),江西水新人,男,博士生,现从事3维GIS、GIS-T的理论与应用研究。E-mail:zuoxq@163.com。
  • 相关文献

参考文献23

  • 1FINKEL R,BENTLEY J L.Quadtree:A Data Structure for Retrieval of Composite Keys[J].Acta Informatica,1974,(4):1-9.
  • 2BENTLEY J L.Multidimensional Binary Search Trees Used for Associative Searching[J].Communications of the ACM,1975,18(9):509-517.
  • 3ABEL D J,SMITH J L.Data Structure and Algorithm Based on a Linear Key for Rectangle Retrieval Problems[J].Computer Vision,Graphics and Image Processing,1983,24(1):1-13.
  • 4GUNTHER O.The Design of the Cell Tree:An Object-oriented Index Structure for Geometric Databases[A].Proc of the 5th Int Conf on Data Engineering[C].Los Angeles:IEEE,1989.598-605.
  • 5ABEL D J.A B +-Tree Structure for Large Quadtree[J].Computer Vision,Graphics and Image Processing,1984,27(1):19-31.
  • 6SAMET H.The Design and Analysis of Spatial Data Structures[M].[s.l.]:Addison-Wesley,Reading,MA,1990.
  • 7ROBINSON J T.The K-D-B Tree:A Search Structure for Large Multidimensional Dynamic Indexes[A].Proc of ACM SIGMOD[C].Boston:ACM Press,1981.10-18.
  • 8DANDAMUNDI S,SORENSON P.An Empirical Performance Comparison of Some Variations of the K-D Tree and BD Tree[J].International Journal of Computer Information Science,1985,14(3):135-159.
  • 9GUTTMAN A.R-trees:A Dynamic Index Structure for Spatial Searching[A].Proc of ACM SIGMOD[C].Boston:ACM Press,1984.547-557.
  • 10FREESTON M.The Comparative Performance of BANG Indexing for Spatial Objects[A].Proc of the 5th International Symposium on Spatial Data Handling[C].London:Taylor & Francis Ltd,1992.190-198.

二级参考文献2

共引文献26

同被引文献154

引证文献5

二级引证文献106

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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