电子学报2001，Vol.29Issue(2)：192-195,4.
LIFT：一种用于高维数据的索引结构
LIFT:An Index Structure for High Dimensional Data
摘要
Abstract
A new method for indexing large amounts of points inhigh-dimensional space is proposed.The basic principle is as follows:uniformly partition the data space by Lattice vector quantization,store the lattice points by Inverted File,organize the inverted file by Trie tree，and fast access the inverted file by Trie parallel search algorithm.We called this index structure LIFT.Compared with the traditional index methods,the LIFT can build the index structure with low complexity,support very high dimensionality,and take advantage of sparsity of data points in high-dimensional space,etc.The experiments show that for high-dimensional data,the LIFT outperforms the well-known R-tree.关键词
索引结构/相似性检索/矢量量化分类
信息技术与安全科学引用本文复制引用
薛向阳,罗航哉,吴立德..LIFT：一种用于高维数据的索引结构[J].电子学报,2001,29(2):192-195,4.基金项目
自然科学基金重点项目(No.69935010) （No.69935010）
国家863-317-01-07-99；自然科学基金项目(No.60003017) （No.60003017）
