高维数据空间索引方法的研究  

Study on High Dimensional Data Space Index Methods

作　　者：于静洋[1] 于俊洋[2] YU Jing-yang, YU Jun-yang （1.College of Computer and Information Engineering, He＇nan University, Kaifeng 475001, China; 2.Network Information Center Office, He＇nan University, Kaifeng 475001, China）

机构地区：[1]河南大学计算机与信息工程学院,河南开封475001 [2]河南大学网络信息中心,河南开封475001

出　　处：《电脑知识与技术》2009年第6期4103-4104,共2页Computer Knowledge and Technology

摘　　要：讨论了高维数据空间索引的基本结构、建树算法，重，最对几种有代表性的索引方法，如R—Tree，X-Tree，M—tree，VP-tree在重叠、插入原则、分裂原则、再插入等方面进行了比较研究。该文中主要介绍了一些索引结构的特点和一些具有代表性的索引结构。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.

关 键 词：高维数据空间 索引 查询 

分 类 号：TP391[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]