高维数据空间索引的研究  

Study on the index of high dimensional data space

作　　者：梅承力[1] 周源华[1] 

机构地区：[1]上海交通大学图像通信与信息处理研究所,上海200030

出　　处：《红外与激光工程》2002年第1期77-81,共5页Infrared and Laser Engineering

摘　　要：讨论了高维数据空间索引的基本结构、建树算法以及典型的查询方式 ,重点对几种有代表性的索引方法 ,如K D Tree ,R Tree ,R Tree ,X Tree ,TV Tree ,HilbertR Tree在节点形状、重叠、插入原则、分裂原则。The general structure and the method of constructing index tree and typical query types in high\|dimensional data space are investigated. Analytical comparison among several representative high dimensional indexing methods as K\|D\|Tree, R\|Tree, R\+*\|Tree, X\|Tree, TV\|Tree, Hilbert R\|Tree is represented in such aspects as node shape, overlapping, insert principle, division principle and re\|insert at the end.

关 键 词：高维数据空间 索引 查询方式 算法 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]