摘要
讨论了高维数据空间索引的基本结构、建树算法以及典型的查询方式 ,重点对几种有代表性的索引方法 ,如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.
出处
《红外与激光工程》
EI
CSCD
北大核心
2002年第1期77-81,共5页
Infrared and Laser Engineering
