書誌事項
- タイトル別名
-
- 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.
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.
収録刊行物
-
- 情報処理学会論文誌
-
情報処理学会論文誌 38 (4), 671-676, 1997-04-15
東京 : 情報処理学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1050282812863317376
-
- NII論文ID
- 110002721518
-
- NII書誌ID
- AN00116647
-
- ISSN
- 18827764
- 03875806
-
- NDL書誌ID
- 4182948
-
- 本文言語コード
- en
-
- 資料種別
- journal article
-
- データソース種別
-
- IRDB
- NDL
- CiNii Articles