通信学报2017，Vol.38Issue(z1)：127-134,8.DOI:10.11959/j.issn.1000-436x.2017245
FGBC-iDistance:细粒度位码过滤的高维索引
FGBC-iDistance: fine-grained bit-code filter based high-dimensional index
摘要
Abstract
In the high-dimensional vector retrieval, distance computation is a very time-consuming operation, the current research trend is to reduce the distance computation using divide and conquer algorithm. iDistance algorithm divides the vector space into subspace of clustering by pivot, BC-iDistance algorithm divides the subspace into 2 partitions in each dimension. A more fine-grained partition algorithm and index structure was proposed, each part corresponded with a unique FGBC code (fine-grained bit code), which realized the candidate sets filtered more precisely. The distance com-putation times of FGBC-iDistance can be reduced to 1/22d of iDistance.The distance computation frequency comparison:FGBC-iDistance≤BC-iDistance≤iDistance. The experiment results show that when the scope radius of the range query is 0.08, FGBC-iDistance distance computation times is about 20,000, which is far less than other algorithms, the running time is also reduced.关键词
距离计算/细粒度/iDistance/范围查询Key words
distance computation/more fine-grained/iDistance/range query分类
信息技术与安全科学引用本文复制引用
袁鑫攀,汪灿飞,龙军,章成源,满君丰..FGBC-iDistance:细粒度位码过滤的高维索引[J].通信学报,2017,38(z1):127-134,8.基金项目
国家自然科学基金资助项目(No.61402165, No.S1651002) （No.61402165, No.S1651002）
湖南省重点研发计划基金资助项目(No.2016JC2018) （No.2016JC2018）
2016年湖南工业大学研究生校级创新基金资助项目(No.CX1606)The National Natural Science Foundation of China (No.61402165, No.S1651002), The Key Research and Devel-opment Plan of Hunan Province (No.2016JC2018), The Graduate Student Innovation Plan of Hunan University of Technology (No.CX1606) （No.CX1606）
