An efficient dictionary mechanism based on double-byte

Authors:
Lei Yang;Jian-Yun Shang;Yan-Ping Zhao
Affiliations:
Dept. of Computer Science, Beijing Institute of Technology, Beijing, P.R. China;Dept. of Computer Science, Beijing Institute of Technology, Beijing, P.R. China;School of Management and Economics, Beijing Institute of Technology, Beijing, P.R. China
Venue:
ICADL'07 Proceedings of the 10th international conference on Asian digital libraries: looking back 10 years and forging new frontiers
Year:
2007

Citing 2
Cited 0

An Efficient Digital Search Algorithm by Using a Double-Array Structure

IEEE Transactions on Software Engineering
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dictionary is an efficient management of large sets of distinct strings in memory. It has significant influence on Natural Language Process, Information Retrieval and other areas. In this paper, we propose an efficient dictionary mechanism, which is suitable for Double-Byte coding languages. Compared with other five popular dictionary mechanisms, this mechanism performs the best of all. It improves the search performance greatly and reduces the complexity of the construction and maintenance of the dictionary. It can be well applied in large-scale and real-time processing systems. Since Unicode is a typical double-byte code which can represents all kinds of characters in the world, this dictionary will be applicable for multi-language dictionaries.