IEICE TRANSACTIONS on Information
Similar Key Search Files Based on Hashing
Summary :
The storage utilizations of existing similar key search files based on B+-tree and extensible hashing were under 70% and should be improved. A similar key search file based on extensible hashing with partial expansion and that on linear hashing with partial expansion are proposed. Computer simulations on about 230 thousand English words show that the storage utilizations of the files with 32 expansive steps are about 97%.
- Publication
- IEICE TRANSACTIONS on Information Vol.E80-D No.1 pp.101-105
- Publication Date
- 1997/01/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Databases
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sheng-ta YANG, Eiichi TANAKA, "Similar Key Search Files Based on Hashing" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 1, pp. 101-105, January 1997, doi: .
Abstract: The storage utilizations of existing similar key search files based on B+-tree and extensible hashing were under 70% and should be improved. A similar key search file based on extensible hashing with partial expansion and that on linear hashing with partial expansion are proposed. Computer simulations on about 230 thousand English words show that the storage utilizations of the files with 32 expansive steps are about 97%.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_1_101/_p
Copy
@ARTICLE{e80-d_1_101,
author={Sheng-ta YANG, Eiichi TANAKA, },
journal={IEICE TRANSACTIONS on Information},
title={Similar Key Search Files Based on Hashing},
year={1997},
volume={E80-D},
number={1},
pages={101-105},
abstract={The storage utilizations of existing similar key search files based on B+-tree and extensible hashing were under 70% and should be improved. A similar key search file based on extensible hashing with partial expansion and that on linear hashing with partial expansion are proposed. Computer simulations on about 230 thousand English words show that the storage utilizations of the files with 32 expansive steps are about 97%.},
keywords={},
doi={},
ISSN={},
month={January},}
Copy
TY - JOUR
TI - Similar Key Search Files Based on Hashing
T2 - IEICE TRANSACTIONS on Information
SP - 101
EP - 105
AU - Sheng-ta YANG
AU - Eiichi TANAKA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1997
AB - The storage utilizations of existing similar key search files based on B+-tree and extensible hashing were under 70% and should be improved. A similar key search file based on extensible hashing with partial expansion and that on linear hashing with partial expansion are proposed. Computer simulations on about 230 thousand English words show that the storage utilizations of the files with 32 expansive steps are about 97%.
ER -
English
