| 摘要 |
A method for storing a keyword is disclosed. The method includes: performing a first Hash function operation and a second Hash function operation on the keyword to obtain an addresses of a first Hash bucket and an address of a second Hash bucket respectively; searching for the first Hash bucket and the second Hash bucket according to the address of the first Hash bucket and the address of the second Hash bucket; and if no compressed keyword in the first Hash bucket conflicts with a compressed keyword of the keyword: when the first Hash bucket has remaining space, storing the compressed keyword of the keyword and a pointer of the keyword into the first Hash bucket; and when the first Hash bucket has no remaining space, the second Hash bucket has remaining space, and no compressed keyword in the second Hash bucket conflicts with the compressed keyword of the keyword, storing the compressed keyword of the keyword and the pointer of the keyword into the second Hash bucket. Meanwhile, a method for searching for a keyword, an apparatus for storing a keyword, and an apparatus for searching for a keyword are disclosed. This greatly improves memory usage and saves storage space and bandwidths.
|
