计算机应用研究2011，Vol.28Issue(8)：2889-2892,4.DOI:10.3969/j.issn.1001-3695.2011.08.025
基于△-tree的自底向上的深度递归KNN查询算法
A-tree based bottom-up and deep recursion algorithm of KNN search
摘要
Abstract
A-tree is a novel multi-level index structure,that can speed up the high-dimensional query in main memory environment. This paper proposed a modified algorithm for main-memory KNN search called BU_DF_knn_Search, which used the efficient main memory index A-tree as the underlying index structure. BU_DF_knn_Search was designed through the location technology for query point,bottom up,depth-first search and filtering strategy. It could solve the hard problem that the distance from query point to its k nearest neighbors was unknown apriori and improved the KNN search efficiency. Conducted the experiments on high dimensional datasets. The results illustrate that the proposed algorithm appears to be much faster than the existing KNN search algorithm for main memory index A-tree.关键词
高维索引/主存/k最近邻查询/深度优先搜索Key words
high-dimensional index/ main-memory/ k nearest neighbor search/ depth-first search分类
信息技术与安全科学引用本文复制引用
刘艳,郝忠孝..基于△-tree的自底向上的深度递归KNN查询算法[J].计算机应用研究,2011,28(8):2889-2892,4.基金项目
黑龙江省自然科学基金资助项目(F200601) （F200601）
