| 基于网格划分的几种空间索引 |
| |
| 引用本文： | 张丽芬,王晓华,胡景松,宋维佳,龙斌.基于网格划分的几种空间索引[J].北京理工大学学报,2004,24(2):140-144. |
| |
| 作者姓名： | 张丽芬 王晓华 胡景松 宋维佳 龙斌 |
| |
| 作者单位： | 北京理工大学,信息科学技术学院计算机科学工程系,北京,100081;北京理工大学,信息科学技术学院计算机科学工程系,北京,100081;北京理工大学,信息科学技术学院计算机科学工程系,北京,100081;北京理工大学,信息科学技术学院计算机科学工程系,北京,100081;北京理工大学,信息科学技术学院计算机科学工程系,北京,100081 |
| |
| 摘 要： | 分析了基本的规则网格空间索引的优缺点,阐述了基于网格划分的各种改进算法的原理,并且针对地图开窗显示的实际应用,设计了每种算法的实现步骤.通过对改进算法时间复杂度和空间复杂度的分析,得出各自的优缺点和适用程度,并根据实际地图数据编程实现这些算法.实验结果表明,在地图开窗显示方面,理论分析符合实际应用情况,每种改进算法时间复杂度都不超过O(N).
|
| 关 键 词： | 地理信息系统 空间索引 复杂度 |
| 文章编号： | 1001-0645(2004)02-0140-05 |
| 收稿时间： | 2003/1/16 0:00:00 |
| 修稿时间： | 2003年1月16日 |
Spatial Indices Based on Grid Partition |
| |
| ZHANG Li-fen,WANG Xiao-hu,HU Jing-song,SONG Wei-jia and LONG Bin.Spatial Indices Based on Grid Partition[J].Journal of Beijing Institute of Technology(Natural Science Edition),2004,24(2):140-144. |
| |
| Authors: | ZHANG Li-fen WANG Xiao-hu HU Jing-song SONG Wei-jia and LONG Bin |
| |
| Institution: | Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Computer Science and Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China |
| |
| Abstract: | Based on the fundamental regular grid spatial index, the paper analyzes its advantages and disadvantages, discusses the principles of algorithm improvement based on grid partition, and designs the steps of implementation for each searching algorithm for regional query applications. The time and space complexity of these algorithm improvements are analyzed in detail, and their advantages and disadvantages are presented. Finally, based on practical map data, these searching algorithms are programmed. Experimental results show that for use in region query, analyses in theory accords well with practical applications, and time complexity of every algorithm improvement does not exceed O(N). |
| |
| Keywords: | geographic information system (GIS) spatial index complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
|
