An Alternative Analysis of Linear Probing Hashing with Buckets
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose a mathematical analysis of average search cost of linear probing hashing for external searching on secondary storage devices in consideration of both the bucket size and the frequency of access on each key. Then we propose the formulae to evaluate exactly the average and variance of the search cost and show some results of the numerical tests.
- 一般社団法人情報処理学会の論文
- 2001-10-15
著者
-
Nakamura Ryozo
Department Of Computer Science Faculty Of Engineering Kumamoto University
-
Itokawa Tsuyoshi
Department Of 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