WEKO3
アイテム
A New Analysis of Tree Hashing Algorithm
https://ipsj.ixsq.nii.ac.jp/records/13415
https://ipsj.ixsq.nii.ac.jp/records/1341539fecfa2-68ba-41f2-a9b3-f8bd496e4138
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL3804001.pdf (649.8 kB)
|
Copyright (c) 1997 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1997-04-15 | |||||||
| タイトル | ||||||||
| タイトル | A New Analysis of Tree Hashing Algorithm | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | A New Analysis of Tree Hashing Algorithm | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| その他タイトル | ||||||||
| その他のタイトル | アルゴリズム理論 | |||||||
| 著者所属 | ||||||||
| Department of Computer Science Faculty of Engineering Kumamoto University | ||||||||
| 著者所属 | ||||||||
| The Graduate School of Science and Technology Kumamoto University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science Faculty of Engineering Kumamoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Faculty of Engineering, Kumamoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| The Graduate School of Science and Technology, Kumamoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Faculty of Engineering, Kumamoto University | ||||||||
| 著者名 |
Ryozo, Nakamura
× Ryozo, Nakamura
|
|||||||
| 著者名(英) |
Ryozo, Nakamura
× Ryozo, Nakamura
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 38, 号 4, p. 671-676, 発行日 1997-04-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
