A KIND OF HIGHLY EFFICIENT DATA STRUCTURE FOR CHINESE ELECTRONIC THESAURUS

In this paper, a kind of highly efficient data structure for Chinese electronic thesaurus is suggested based on Chinese encoding architecture and some characteristics of Chinese words. And algorithms for data retrieval, insertion, deletion, and update are developed by means of hashing plus binary search. In theory, the above data structure can achieve much more efficiency than other methods such as B \++ trees. RDBMS, which is proved by the experiments in this paper.