一种基于共享前缀的两级索引结构
收稿日期: 2009-08-25
修回日期: 2010-01-23
网络出版日期: 2010-12-25
基金资助
国家自然科学基金资助项目(90604006)
A TwoLevel Index Structure Based on SharePrefix
Received date: 2009-08-25
Revised date: 2010-01-23
Online published: 2010-12-25
喻波,赵国鸿,陈曙晖 . 一种基于共享前缀的两级索引结构[J]. 计算机工程与科学, 2010 , 32(12) : 113 -116 . DOI: 10.3969/j.issn.1007130X.2010.
Most of the inverted index structures do not refer to the organization of the word table, and there are lots of word collisions in the conventional Hash algorithms. This paper proposes a twolevel index structure, which uses simply a coding method to map words beginning with the same word to the same position of the first level index, and uses a shareprefix tree as the second level index to find the address of the index files rapidly, and reduces the storage space of the index files. The experimental results show that, the compressing ratio of the size of index files to that of the source files reaches 0.59. Compared with the sequence index and the Hash index, we acquire a better spaceandtime efficiency.
/
| 〈 |
|
〉 |