Studies on Hashing PART-1: A Comparison of Hashing Algorithms with Key Deletion

スポンサーリンク

概要

• 論文の詳細を見る

• Four concepts σ(storage utility factor), U(average number of probes for Unsuccessful searching), l(that for Insertion), and S(that for Successful searching) are introduced to compare speed and memory tradeoffs of various hashing algorithms. An open addressing hashing scheme suited for frequent deletion of nonrelocatable keys is proposed and analyzed in terms of the four concepts.

• 一般社団法人情報処理学会の論文
• 1980-03-30

著者

• Goto Eiichi

  Institute For Physical And Chemical Research

• TAKAO GUNJI

  Department of Information Science, University of Tokyo

• Takao Gunji

  Department Of Information Science University Of Tokyo

関連論文

• Studies on Hashing PART-1: A Comparison of Hashing Algorithms with Key Deletion

スポンサーリンク