| 高维数据空间索引方法的研究 |
| |
| 引用本文： | 于静洋,于俊洋.高维数据空间索引方法的研究[J].数字社区&智能家居,2009(16). |
| |
| 作者姓名： | 于静洋 于俊洋 |
| |
| 作者单位： | 河南大学计算机与信息工程学院;河南大学网络信息中心; |
| |
| 摘 要： | 讨论了高维数据空间索引的基本结构、建树算法,重点对几种有代表性的索引方法,如R-Tree,X-Tree,M-tree,VP-tree在重叠、插入原则、分裂原则、再插入等方面进行了比较研究。该文中主要介绍了一些索引结构的特点和一些具有代表性的索引结构。
|
| 关 键 词： | 高维数据空间 索引 查询 |
Study on High Dimensional Data Space Index Methods |
| |
| YU Jing-yang,YU Jun-yang.Study on High Dimensional Data Space Index Methods[J].Digital Community & Smart Home,2009(16). |
| |
| Authors: | YU Jing-yang YU Jun-yang |
| |
| Affiliation: | YU Jing-yang1,YU Jun-yang2 (1.College of Computer , Information Engineering,He'nan University,Kaifeng 475001,China,2.Network Information Center Office,China) |
| |
| Abstract: | The general structure and the method of constructing index tree in high-dimensional data space are investigated. Analytical comparison among several representative high dimensional indexing methods as R-Tree, X-Tree, M-tree, VP-tree is represented in such aspects as node shape, overlapping, insert principle, division principle and re-insert at the end. In this paper, we classify mainly these index structures by their intrinsic features, and introduce some representative index structures. |
| |
| Keywords: | high-dimensional data space index query |
| 本文献已被 CNKI 等数据库收录！ |
|
