| 基于区位码和距离的Chord网络高维数据范围检索 |
| |
| 引用本文： | 孟宪福,孟泓汐,张振强.基于区位码和距离的Chord网络高维数据范围检索[J].大连理工大学学报,2011,51(3):433-439. |
| |
| 作者姓名： | 孟宪福 孟泓汐 张振强 |
| |
| 作者单位： | 大连理工大学计算机科学与技术学院;大连海事大学信息科学技术学院; |
| |
| 摘 要： | 结构化对等网络对数据的范围检索等相似查询缺乏有效的支持.由于利用iDistance索引进行范围查询时会引入很多"误中点",提出了一种利用区位码和距离来建立高维数据索引的方法.该方法首先利用Code-Distance技术来建立高维数据的一维索引,并采用位置保持哈希函数给予每个索引值一个唯一标识,该标识将被保存在Chord...
|
| 关 键 词： | P2P 范围检索 iDistance 位置保持哈希函数 区位码 |
Bit-code and distance-based range query for high-dimensional data in Chord network |
| |
| MENG Xianfu,MENG Hongxi,ZHANG Zhenqiang.Bit-code and distance-based range query for high-dimensional data in Chord network[J].Journal of Dalian University of Technology,2011,51(3):433-439. |
| |
| Authors: | MENG Xianfu MENG Hongxi ZHANG Zhenqiang |
| |
| Institution: | MENG Xian-fu*1,MENG Hong-xi2,ZHANG Zhen-qiang1(1.School of Computer Science and Technology,Dalian University of Technology,Dalian 116024,China,2.Information Science and Technology College,Dalian Maritime University,Dalian 116026,China) |
| |
| Abstract: | A structured P2P network is not suitable for similarity search,such as range query.Since a lot of false hits may be obtained by using iDistance indexing technique,a high-dimensional data indexing algorithm based on bit-code and distance is proposed.The Code-Distance technique and locality-preserving hashing function are utilized to respectively construct one-dimensional index from data with high-dimension and assign a unique identifier for each index,and those identifiers are kept into nodes to establish BM... |
| |
| Keywords: | P2P range query iDistance locality-preserving hashing function bit-code |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《大连理工大学学报》浏览原始摘要信息 |
| 点击此处可从《大连理工大学学报》下载免费的PDF全文 |
