| 散列表的一致对半探测方法 |
| |
| 引用本文： | 王昌福,杨秀谦.散列表的一致对半探测方法[J].福州大学学报(自然科学版),2002,30(2):188-191. |
| |
| 作者姓名： | 王昌福 杨秀谦 |
| |
| 作者单位： | 福州大学信息科学与技术学院,福建,福州,350002 |
| |
| 摘 要： | 给出构造一致对半探测序列的算法 ,利用所构造的序列得到一致对半探测方法 .该方法在假设散列函数是均匀的和处理冲突后产生地址是均匀的条件下 ,和二次、随机探测方法有着相同的平均查找长度 .数值计算的结果表明 ,该方法具有更好的实际效果
|
| 关 键 词： | 散列表 探测方法 一致对半探测 |
| 文章编号： | 1000-2243(2002)02-0188-04 |
| 修稿时间： | 2001年9月2日 |
The probing method of uniform and half for HASH table |
| |
| WANG Chang-fu,YANG Xiu-qian.The probing method of uniform and half for HASH table[J].Journal of Fuzhou University(Natural Science Edition),2002,30(2):188-191. |
| |
| Authors: | WANG Chang-fu YANG Xiu-qian |
| |
| Institution: | (College of Information Science and Technology, Fuzhou university, Fujian Fuzhou 350002, China) |
| |
| Abstract: | A method of constructing uniform and half probing sequence is proposed, with the contructed sequence, a new probing method for HASH table is obtained which is named the probing method of uniform and half. On condition that HASH function and new address derived from handling collision are symmetrical. The new method has the same average searching length compared with the probing methods of square and random, but the results obtained from a mass of numerical examples show that the method presented is more efficient and practical. |
| |
| Keywords: | HASH table probing method uniform half probing |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《福州大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《福州大学学报(自然科学版)》下载免费的PDF全文 |
