An Alternative Analysis of the Algorithm for Separate Chaining Technique of the Hashing Method
スポンサーリンク
概要
- 論文の詳細を見る
A mathematical analysis is proposed to evaluate exactly the number of probes for the separate chaining technique of the hashing method in consideration of the frequency of access on each key. The proposed analysis is compared to the traditional one, so the reasons why the evaluation formulae are different even in the uniform probing case are discussed. It is then shown that the proposed analysis makes it possible to evaluate accurately the number of probes of the separate chaining technique.
- 一般社団法人情報処理学会の論文
- 1993-03-31
著者
-
Nakamura Ryozo
Department Of Computer Science Faculty Of Engineering Kumamoto University
-
Nakamura Ryozo
Department Of Electrical Engineering And Computer Science Faculty Of Engineering Kumamoto University
関連論文
- An Analysis of the AVL Balanced Tree Insertion Algorithm
- Severity of Neurological Disorders in Elderly Residents of a Farming Town in Kyushu, Japan; Prevalence of Disability in Activities of Daily Living
- An Approximate Analysis of the AVL Balanced Tree Insertion Algorithm(Special Issue on Generation Database Technology for Internet, Multimedia and Mobile computing)
- A New Analysis of Hashing Algorithm for External Searching
- An Alternative Analysis of Linear Probing Hashing with Buckets
- An Alternative Analysis of Dynamic Hashing Algorithms
- An Alternative Analysis of the Algorithm for Separate Chaining Technique of the Hashing Method
- A New Analysis of Tree Hashing Algorithm
- An Alternative Analysis of Linear Dynamic Hashing Algorithm
- An Alternative Analysis of the Algorithm for Separate Chaining Technique of the Hashing Method