Extensible Hashing for Retrieval of the Korean-Chinese Pinyin Dictionary

In this paper, we design an extensible hashing method for efficient storage and fast retrieval of a Korean-Chinese Pinyin dictionary, which is used in a Korean-Chinese Pinyin input system.Extensible hashing is an excellent method for storing and retrieving large-scale data, such as dictionaries, as it supports fast hashing searches while dynamically managing buckets to optimize storage space.In extensible hashing, the number of buckets where data is stored and the size of the directory that points to these buckets determine storage efficiency.As data is uniformly distributed across each bucket, the number of buckets used and the directory size decrease, thereby improving storage efficiency.Therefore, we propose a more storage-efficient extensible hashing method compared to existing techniques in this paper.The extensible hashing method introduced in this paper minimizes the number of buckets required and reduces the directory size by evenly distributing keys in the buckets based on the frequency of referenced bits, thus providing an efficient implementation of extensible hashing.We also conducted experiments to verify the performance of the proposed method, which proved that its performance is superior.This extensible hashing method is expected to be applicable not only to Korean-Chinese Pinyin dictionaries but also to other dictionary search systems, enhancing search performance.