| 摘要 |
<p>The present invention, for a segment (sg2(1)), performs an AND computation of: an aggregation occurrence map of a compressed code (P(person)) for a character information unit "person," an aggregation occurrence map of a compressed code (P(shape)) for a character information unit "shape," and an aggregation deletion map. The result of the AND is "1100," and therefore, it can be understood that there is a possibility that the character information units "person" and "shape" exist in segments (sg1(1)) and (sg1(2)). On the basis of the result of the AND, segments (sg1(1)) and (sg1(2)) are specified, and therefore, an AND computation is executed. As a result, segments (sg0(1)) and (sg0(5)) are specified, and an AND computation is executed. As a result, file number 3 is specified on the basis of segment (sg0(1)), and file number 19 is specified on the basis of segment (sg0(5)). Accordingly, it can be understood that both of character information units "person" and "shape" exist in compressed files (f3) and (f19).</p> |
