| 摘要 |
PURPOSE:To use the tree structure of a dictionary to realize LRU(least recently used) deletion heuristics and to offer the adaptive data compression system which flexibly handles data having various characteristics. CONSTITUTION:The dictionary 2 wherein reference numbers are given to part series of an input series is generated and when the same part series appears again, its reference number is outputted to register the extended series of the part series in the dictionary 2. At this time, the maximum value of the number of part series registered in the dictionary 2 is set previously and when the dictionary 2 becomes full, older part series are deleted by using the tree structure of the dictionary 2 to register new part series in obtained spaces. |
