| KDT树:一种多维空间数据索引结构 |
| |
| 引用本文： | 邱永红,曾永年,邹滨.KDT树:一种多维空间数据索引结构[J].计算机工程与应用,2009,45(8):29-31. |
| |
| 作者姓名： | 邱永红 曾永年 邹滨 |
| |
| 作者单位： | 1. 湖南师范大学,资源与环境科学学院,长沙,410081;中南大学,信息物理工程学院,长沙,410083
2. 中南大学,信息物理工程学院,长沙,410083 |
| |
| 摘 要： | 通过扩展KD树索引结构,提出了一种新的多维空间数据索引结构——KDT树,给出了数据结构和算法描述,并通过与当前流行的空间数据索引结构——R树的对比,对其性能进行了测试与评估。实验表明,作为一种主存索引结构,KDT树在时间效率方面明显优于R树,并且此种优势随着索引记录数量的增多而越加明显。此外,KDT树亦能较好地解决常规KD树在索引占据一定空间范围的空间对象(如:线、面、体等)时存在的问题。
|
| 关 键 词： | KD树 KDT树 多维空间数据 索引结构 |
| 收稿时间： | 2008-11-7 |
| 修稿时间： | 2008-12-27
|
KDT tree:Multi-dimensional index structure for spatial data |
| |
| QIU Yong-hong,ZENG Yong-nian,ZOU Bin.KDT tree:Multi-dimensional index structure for spatial data[J].Computer Engineering and Applications,2009,45(8):29-31. |
| |
| Authors: | QIU Yong-hong ZENG Yong-nian ZOU Bin |
| |
| Affiliation: | QIU Yong-hong,ZENG Yong-nian,ZOU Bin 1.College of Resources , Environment Science,Hunan Normal University,Changsha 410081,China 2.School of Info-physics , Geomatics Engineering,Central South University,Changsha 410083,China |
| |
| Abstract: | Authors firstly propose an innovative multi-dimensional index structure for spatial data,namely KD Ternary tree(KDT),with the expansion of traditional KD-tree.Then,the data structure and algorithms of KDT are stated.Finally,the perfor-mance of KDT is tested and evaluated by comparing with R-tree which is currently the most popular spatial data index struc-ture.The results reveal that,as a main memory index structure,KDT surpasses R tree over temporal efficiency,and this character-istic of KDT can be enhance... |
| |
| Keywords: | KD tree KDT tree multi-dimensional spatial data index structure |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
