| 支持k近邻查询的X*树索引结构 |
| |
| 引用本文： | 章德斌,曹丽君,梁永欣,张忠平.支持k近邻查询的X*树索引结构[J].计算机工程与应用,2011,47(5):123-125. |
| |
| 作者姓名： | 章德斌 曹丽君 梁永欣 张忠平 |
| |
| 作者单位： | 1. 燕山大学信息科学与工程学院,河北秦皇岛,066004
2. 河北科技师范学院,河北秦皇岛,066004 |
| |
| 基金项目： | 国家自然科学基金，河北省教育厅科研计划项目 |
| |
| 摘 要： | 通过分析已有的索引结构在进行k近邻查询时效率上的不足,提出了适合进行k近邻查询的X*树索引结构,采用了新的结点分裂算法,同时不需要额外存储结点分裂的历史信息。实验结果表明它比X树的时间和空间性能更好,更适合k近邻查询的应用。
|
| 关 键 词： | k近邻查询 高维索引结构 结点分裂 带权重叠率 |
| 修稿时间： | |
X*tree index structure for k nearest neighbor queries |
| |
| ZHANG Debin,CAO Lijun,LIANG Yongxin,ZHANG Zhongping.X*tree index structure for k nearest neighbor queries[J].Computer Engineering and Applications,2011,47(5):123-125. |
| |
| Authors: | ZHANG Debin CAO Lijun LIANG Yongxin ZHANG Zhongping |
| |
| Affiliation: | 1.College of Information Science and Engineering,Yanshan University,Qinhuangdao,Hebei 066004,China 2.Hebei Normal University of Science & Technology,Qinhuangdao,Hebei 066004,China |
| |
| Abstract: | By analyzing the inefficiency of k nearest neighbor query in existing index structures,this paper presents X＊tree index structure which is suitable to perform k nearest neighbor query.A new node splitting algorithm is adopted,and the Split History field is omitted.The experiment shows that it has better performance than X＊tree in time and space complexity,and it is more suitable to k nearest neighbor query. |
| |
| Keywords: | k nearest neighbor query high dimensional index structure node splitting weighted overlap |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
