The organization of the proposed file and algorithms for search and maintenance of the file are simpler than those of a similar key search file based on B+-tree. An experiment using 230,188 keys with length 1-16 shows the good performance of the file. The storage utilization of the file is about 68%.
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.
Copy
Shinji KAWADE, Eiichi TANAKA, "A Similar Key Search File Based on Extendible Hashing" in IEICE TRANSACTIONS on Information,
vol. E78-D, no. 9, pp. 1218-1220, September 1995, doi: .
Abstract: The organization of the proposed file and algorithms for search and maintenance of the file are simpler than those of a similar key search file based on B+-tree. An experiment using 230,188 keys with length 1-16 shows the good performance of the file. The storage utilization of the file is about 68%.
URL: https://global.ieice.org/en_transactions/information/10.1587/e78-d_9_1218/_p
Copy
@ARTICLE{e78-d_9_1218,
author={Shinji KAWADE, Eiichi TANAKA, },
journal={IEICE TRANSACTIONS on Information},
title={A Similar Key Search File Based on Extendible Hashing},
year={1995},
volume={E78-D},
number={9},
pages={1218-1220},
abstract={The organization of the proposed file and algorithms for search and maintenance of the file are simpler than those of a similar key search file based on B+-tree. An experiment using 230,188 keys with length 1-16 shows the good performance of the file. The storage utilization of the file is about 68%.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Similar Key Search File Based on Extendible Hashing
T2 - IEICE TRANSACTIONS on Information
SP - 1218
EP - 1220
AU - Shinji KAWADE
AU - Eiichi TANAKA
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 1995
AB - The organization of the proposed file and algorithms for search and maintenance of the file are simpler than those of a similar key search file based on B+-tree. An experiment using 230,188 keys with length 1-16 shows the good performance of the file. The storage utilization of the file is about 68%.
ER -