| Intensive KDB-Tree：一种有效的高维数据索引结构 |
| |
| 引用本文： | 余静,刘万军.Intensive KDB-Tree：一种有效的高维数据索引结构[J].世界科技研究与发展,2010,32(1):52-54. |
| |
| 作者姓名： | 余静 刘万军 |
| |
| 作者单位： | 辽宁工程技术大学电子与信息工程学院,葫芦岛,125105 |
| |
| 摘 要： | 本文并提出了高维空间中一种新的索引结构Intensive KDB-Tree,它采用一种新的数据插入算法和新的分裂策略,进而减小了索引结构,最后经实验证明,Intensive KDB-Tree的检索性能优于金字塔技术和KDB-Tree.
|
| 关 键 词： | 维度灾难 空间分割策略 分裂策略 Intensive KDB-Tree |
Intensive KDB-Tree:An Effective High-dimensional Indexing Structure |
| |
| YU Jing,LIU Wanjun.Intensive KDB-Tree:An Effective High-dimensional Indexing Structure[J].World Sci-tech R & D,2010,32(1):52-54. |
| |
| Authors: | YU Jing LIU Wanjun |
| |
| Institution: | (School of Electronic and Information, Liaoning Technical University, Huludao 125105 ) |
| |
| Abstract: | This paper analyzes the performance of static partitioning strategy and dynamic partitioning strategy in high-dimensional spaces.Our new index scheme can increase the storage utilization and reduce the index size to a smaller scale.As a result,our indexing method outperforms the Pyramid Technique and KDB-Tree and its variants. |
| |
| Keywords: | Intensive KDB-Tree dimensional disasters space partitioning strategy splitting policy Intensive KDB-Tree |
| 本文献已被 维普 万方数据 等数据库收录！ |
