计算机工程2011，Vol.37Issue(24)：22-24,3.DOI:10.3969/j.issn.1000-3428.2011.24.008
高维主存的反向K最近邻查询及连接
High-dimensional Main-memory Reverse K Nearest Neighbor Query and Join
摘要
Abstract
The Reverse K Nearest Neighbor(RKNN) problem is a generalization of the reverse nearest neighbor problem which receives increasing attention recently, but high-dimensional RKNN problem is little explored. This paper studies on the high-dimensional main-memory RKNN queries, proposes an indexing structure called A-RdKNN-tree, precomputes KNN distances of points in the dataset by main-memory KNN self-join based on this index and propagates these distances to higher level index nodes. Main-memory RKNN query algorithm based on this index is proposed and main-memory RKNN join algorithm is given for set-oriented RKNN queries. Analysis shows that the two algorithms are effective in high dimension space.关键词
高维/主存/反向K最近邻查询/反向K最近邻连接/预处理Key words
high-dimensional/ main-memory/ Reverse K Nearest Neighbor(RKNN) query/ Reverse K Nearest Neighbor(RKNN) join/ preprocess-ing分类
信息技术与安全科学引用本文复制引用
刘艳,郝忠孝..高维主存的反向K最近邻查询及连接[J].计算机工程,2011,37(24):22-24,3.基金项目
黑龙江省自然科学基金资助项目(F2006-01) （F2006-01）
