WEKO3
アイテム
An Alternative Analysis of Linear Probing Hashing with Buckets
https://ipsj.ixsq.nii.ac.jp/records/11846
https://ipsj.ixsq.nii.ac.jp/records/118460e5e9bad-fb1f-4f0c-8127-2157981b3845
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL4210006.pdf (184.7 kB)
|
Copyright (c) 2001 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2001-10-15 | |||||||
| タイトル | ||||||||
| タイトル | An Alternative Analysis of Linear Probing Hashing with Buckets | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | An Alternative Analysis of Linear Probing Hashing with Buckets | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 論文 | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| その他タイトル | ||||||||
| その他のタイトル | プログラミング技術 | |||||||
| 著者所属 | ||||||||
| Department of Computer Science Faculty of Engineering Kumamoto University | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science Faculty of Engineering Kumamoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Faculty of Engineering, Kumamoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, Faculty of Engineering, Kumamoto University | ||||||||
| 著者名 |
Tsuyoshi, Itokawa
× Tsuyoshi, Itokawa
|
|||||||
| 著者名(英) |
Tsuyoshi, Itokawa
× Tsuyoshi, Itokawa
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | In this paper we propose a mathematical analysis of average searchcost of linear probing hashing for external searching on secondary storage devices in consideration ofboth the bucket size and the frequency of access on each key.Then we propose the formulae to evaluate exactly the average andvariance of the search cost and show some results of the numericaltests. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | In this paper, we propose a mathematical analysis of average searchcost of linear probing hashing for external searching on secondary storage devices in consideration ofboth the bucket size and the frequency of access on each key.Then we propose the formulae to evaluate exactly the average andvariance of the search cost and show some results of the numericaltests. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 42, 号 10, p. 2423-2428, 発行日 2001-10-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
