陈代于. 伪拉链法的一个改进方案[J]. 北京工业大学学报, 1981, 7(4): 114-121.
    引用本文: 陈代于. 伪拉链法的一个改进方案[J]. 北京工业大学学报, 1981, 7(4): 114-121.
    Chen Dai-yu. An Improved Scheme for Pseudochaining[J]. Journal of Beijing University of Technology, 1981, 7(4): 114-121.
    Citation: Chen Dai-yu. An Improved Scheme for Pseudochaining[J]. Journal of Beijing University of Technology, 1981, 7(4): 114-121.

    伪拉链法的一个改进方案

    An Improved Scheme for Pseudochaining

    • 摘要: 本文提出的改进方案,是把伪拉链法1的每一个链域分成两个,实现了第一、第二溢出项的"拉链",从而进一步减少了检索一项所需的平均查找次数。
      本文导出了改进的伪拉链法的效率。结果表明,它优于均匀法、伪拉链法和Brent法

       

      Abstract: The improved scheme presented in this paper achieves"chaining" of the first and the second overflow items by dividing each link field of the pseudochaining (10) into two. The mean number of probes needed to retrieve an item are further reduced herewith.
      The efficiency of the improved pseudochaining is derived. The result indicates that it is better than uniform method, pseudochaining and method.

       

    /

    返回文章
    返回