摘要
一般Hash算法中溢出桶与常规桶是通过指针连接的。对于海量数据的等值查询来说,通过指针查询是低效的。本文提出一种类似二次Hash的算法,在常规桶与桶地址表之间建立一个二叉排序树的结构,使得我们能够通过折半查找直接找到对应的桶。实验表明,该算法能够显著提高查询效率。
In hash algorithm, the bucket and flow-bucket are linked by the pointers. It is very much inefficient to search a value corresponding to a flow-bucket. In this paper, we present a novel compound index structure which includes a balanced binary tree. The experiment indicates that its performance is better than other indexing algorithm such as ordered indices and hash indices.
出处
《微电子学与计算机》
CSCD
北大核心
2004年第10期71-73,共3页
Microelectronics & Computer
