| 摘要 |
PROBLEM TO BE SOLVED: To obtain better retrieval results, even for input data which are somewhat biased for a tree structure in a character string retrieval system used for data compression, without using hash table as in the prior art. SOLUTION: The character string retrieving method comprises a step of storing the emerging position of a character string in a multi-stage tree structure constituted, with the use of less significant bits of each character as keys in the retrieval of the same character string emerging in a fixed length window of input bytes, a step of deciding whether a previous character string emerging position has been stored in the same node, a step of checking if at least a specified number of characters coincide from the comparison of a now targeted character string, with a character string starting from the previous emerging position.
|
