A New Analysis of Tree Hashing Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
A new mathematical analysis is proposed to evaluate exactly the average search cost of tree hashing algorithm in consideration of the frequency of access on each key. The proposed analysis clarifies the relationship between the inserting order and its locating position for each key. It is shown that the evaluation formulae derived by the proposed analysis make it possible to evaluate exactly the average search cost in accordance with any probability distribution of the frequency of access. Besides this, it can see that under the assumption that the frequency of access is uniform the proposed evaluation formula of the average search cost is more correct and concise than that of the traditional analysis.
- 一般社団法人情報処理学会の論文
- 1997-04-15
著者
-
NAKASHIMA Takuo
Department of Electron Engineering and Computer Science, Faculty of Engineering, Kumamoto University
-
Nakamura Ryozo
Department Of Computer Science Faculty Of Engineering Kumamoto University
-
Itokawa Tsuyoshi
The Graduate School Of Science And Technology Kumamoto University
-
Nakashima Takuo
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