JP2018007236A - Compression program, restoration program, compression method, restoration method, and information processing device - Google Patents

Abstract

PROBLEM TO BE SOLVED: To improve compression efficiency.SOLUTION: An information processing device 100 extracts prescribed delimiters and a character string sandwiched by two prescribed delimiters from compression object data 110. The information processing device 100 generates first data 121 obtained by arranging extracted delimiters so as to be able to specify a sequence in which the extracted delimiters appear in the compression object data 110. The information processing device 100 generates second data 122 obtained by arranging the extracted character strings so as to be able to specify a sequence in which character strings sandwiched by two delimiters of a combination of types appear in the compression object data 110 in each of the types of combinations of two delimiters. The information processing device 100 performs compression using a slide dictionary method of the generated first data 121 and second data 122.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a compression program, a restoration program, a compression method, a restoration method, and an information processing apparatus.

  Conventionally, there is a compression technique for compressing data to reduce the size of the data. The compression technique includes, for example, a lossless compression technique that can restore the compressed data to the data before compression. The lossless compression technique includes, for example, a compression technique using a compression algorithm “LZ77 (Lempel-Ziv 77)” and a compression algorithm “LZMA (Lempel-Ziv-Markov chain-Algorithm)”.

  As related prior art, for example, compression is performed by classifying a plurality of records in an information file into a set having a common classification data, and rearranging a plurality of classification data constituting one record for each classification type. There is. In addition, for example, log data is acquired, time information is extracted, time information is divided into predetermined data widths, a plurality of byte groups are generated, and the values before and after each byte group are compared, There is a technique in which difference value information is generated by calculating a difference value, and the difference value information is compressed by the LZ77 method.

JP-A-11-65902 JP 2012-235289 A

  However, in the above-described conventional technology, the compression efficiency may deteriorate. For example, compared with the case where the same character string appears continuously at a relatively close position in the compression target data, the size of the compressed data is larger when the same character string appears continuously at a relatively distant position. There is a tendency to become.

  In one aspect, an object of the present invention is to provide a compression program, a decompression program, a compression method, a decompression method, and an information processing apparatus that can improve compression efficiency.

  According to one aspect of the present invention, a predetermined delimiter character and a character string sandwiched between two delimiters are extracted from the compression target data, and the order in which the delimiter characters appear in the compression target data is specified. For each type of combination of the first data in which the delimiters are arranged and two delimiters, the character string sandwiched between the two delimiters of the combination of the types is included in the compression target data. A compression program that generates second data in which the character strings are arranged so that the order of appearance can be specified, and compresses the generated first data and the second data using a slide dictionary method A compression method and an information processing apparatus are proposed.

  In addition, according to one aspect of the present invention, for each type of combination of the first data in which the delimiters are arranged so that the order in which the predetermined delimiters appear in the compression target data can be specified, and the two delimiters The compression using the slide dictionary method with the second data in which the character strings are arranged so that the order in which the character string sandwiched between the two delimiters of the combination of the type appears in the compression target data can be specified The compressed data obtained by performing the decoding, referring to the second data obtained by decoding, and between the two delimiters in the first data obtained by decoding A restoration program, a restoration method, and an information processing apparatus for generating the compression target data by sequentially inserting the character strings associated with the combination types of delimiters The draft.

  According to one aspect of the present invention, there is an effect that compression efficiency can be improved.

FIG. 1 is an explanatory diagram of an example of the compression method according to the embodiment. FIG. 2 is a block diagram illustrating a hardware configuration example of the information processing apparatus 100. FIG. 3 is a block diagram illustrating a functional configuration example of the information processing apparatus 100. FIG. 4 is an explanatory diagram (part 1) illustrating an example of compressing the compression target data 400. FIG. 5 is an explanatory diagram (part 2) illustrating an example of compressing the compression target data 400. FIG. 6 is an explanatory diagram (part 3) illustrating an example of compressing the compression target data 400. FIG. 7 is an explanatory diagram (part 4) illustrating an example of compressing the compression target data 400. FIG. 8 is an explanatory diagram (part 5) illustrating an example of compressing the compression target data 400. FIG. 9 is an explanatory diagram (part 6) illustrating an example of compressing the compression target data 400. FIG. 10 is an explanatory diagram (part 7) illustrating an example of compressing the compression target data 400. FIG. 11 is an explanatory diagram (part 8) illustrating an example of compressing the compression target data 400. FIG. 12 is an explanatory diagram (part 1) illustrating an example of restoring the compression target data 400. FIG. 13 is an explanatory diagram (part 2) illustrating an example of restoring the compression target data 400. FIG. 14 is an explanatory diagram (part 3) illustrating an example of restoring the compression target data 400. FIG. 15 is an explanatory diagram (part 4) illustrating an example of restoring the compression target data 400. FIG. 16 is an explanatory diagram (part 5) illustrating an example of restoring the compression target data 400. FIG. 17 is an explanatory diagram (part 6) illustrating an example of restoring the compression target data 400. FIG. 18 is an explanatory diagram (part 7) illustrating an example of restoring the compression target data 400. FIG. 19 is an explanatory diagram (part 8) illustrating an example of restoring the compression target data 400. FIG. 20 is an explanatory diagram (No. 9) illustrating an example of restoring the compression target data 400. FIG. 21 is an explanatory diagram (part 10) illustrating an example of restoring the compression target data 400. FIG. 22 is an explanatory diagram (part 11) illustrating an example of restoring the compression target data 400. FIG. 23 is an explanatory diagram (part 12) illustrating an example of restoring the compression target data 400. FIG. 24 is a flowchart illustrating an example of the compression processing procedure. FIG. 25 is a flowchart illustrating an example of the restoration processing procedure.

  Hereinafter, embodiments of a compression program, a decompression program, a compression method, a decompression method, and an information processing apparatus according to the present invention will be described in detail with reference to the drawings.

(One Example of Compression Method According to Embodiment)
FIG. 1 is an explanatory diagram of an example of the compression method according to the embodiment. The information processing apparatus 100 is a computer that performs compression using a slide dictionary method. Examples of compression using the slide dictionary method include compression by “LZ77” and compression by “LZMA”.

  For example, in the compression using the slide dictionary method, when the same character string appears in the compression target data 110, the character string that appears later indicates the start position and length of the same character string that appears first. It is conceivable to convert the data to be compressed 110 by converting into data.

  However, in this case, the compression efficiency tends to vary greatly depending on the content of the compression target data 110. For example, when the same character string appears continuously at a relatively distant position compared to the case where the same character string continuously appears at a relatively close position in the compression target data 110, the size of the compressed data is reduced. It tends to be difficult to reduce, and compression efficiency tends to deteriorate.

  Specifically, in the compression using the slide dictionary method, if there is the same character string in a reference range called a slide window preceding the character string that appears later, the same character string that appears first after the character string that appears later Is converted into data indicating the start position and length. At this time, if the same character string appears at a relatively distant position, there is no same character string in the reference range before the character string that appears later, and the start position of the same character string that appears first after the character string that appears later In some cases, the data cannot be converted into data indicating the length. For this reason, the size of the data after compression tends not to be small, and the compression efficiency tends to deteriorate.

  On the other hand, if the character string that appears later is converted to data indicating the start position and length of the same character string that appears earlier at a relatively distant position by expanding the reference range, the start position is indicated. This increases the number of bits used for. For this reason, even if a character string that appears later is converted into data indicating the start position and length of the same character string that appears earlier, the size of the data after compression is difficult to reduce, and compression efficiency deteriorates. Tend.

  On the other hand, when the same character string appears at a relatively close position, there is the same character string in the reference range before the character string that appears later, and the character string that appears later is the start position of the same character string that appears first. There is a possibility that it can be converted into data indicating the length. For this reason, the compression efficiency tends not to deteriorate.

  If the same character string appears in a relatively close position, the character string that appears later is converted into data indicating the start position and length of the same character string that appears earlier even if the reference range is relatively narrow. The number of bits used to indicate the starting position is relatively small. For this reason, even if a character string that appears later is converted into data indicating the start position and length of the character string that appears earlier, the compression efficiency tends to be less likely to deteriorate.

  Therefore, in the present embodiment, based on the compression target data 110, the same character string is likely to appear continuously in relatively close positions, and data that can be returned to the compression target data 110 is generated. A compression method capable of performing compression using the slide dictionary method will be described.

  Specifically, when the compression target data 110 is a collection of data along a certain format separated by a predetermined delimiter character, a plurality of data sandwiched between two delimiters of the same type combination in the compression target data 110 Strings can be the same string. Therefore, in the present embodiment, based on the compression target data 110, the type of combination of two delimiters is used to generate data that is likely to appear continuously at relatively close positions, thereby compressing the data. Efficiency will be improved.

  In the example of FIG. 1, the information processing apparatus 100 receives compression target data 110. The compression target data 110 is data including a predetermined delimiter. The compression target data 110 is preferably log data in which, for example, logs along a certain format divided by a predetermined delimiter are aggregated, and the same character string appears repeatedly. In the example of FIG. 1, the compression target data 110 includes “$ 11: 03 # load: # jerase # load: # lrc # load: # isa $ 11: 03 # monmap $ 11: 03 # adding # auth # protocol: # none $ ".

  The delimiter is a character used to delimit a character string included in the compression target data 110 for convenience. The delimiter is, for example, a character other than a number or alphabet. The delimiter may be set by an operation input from the user. The delimiter is, for example, one character. The delimiter may include, for example, a character string having two or more characters. The delimiter may include a control character, for example.

  (1-1) The information processing apparatus 100 extracts a predetermined delimiter character and a character string sandwiched between two predetermined delimiter characters from the compression target data 110. A character string sandwiched between two predetermined delimiters is, for example, a character string that does not include a delimiter. The information processing apparatus 100 extracts, for example, a predetermined delimiter “$: #: ##: ##: # $: # $: ####: # $”. The information processing apparatus 100 extracts, for example, a character string “11 11 11 03 03 03 monmap adding auth load load protocol protocol isone none jerase lrc”.

  (1-2) The information processing apparatus 100 generates first data 121 in which the extracted delimiters are arranged so that the order in which the extracted delimiters appear in the compression target data 110 can be specified. For example, the information processing apparatus 100 generates, as the first data 121, data in which the extracted delimiters are arranged in the order of appearance. The first data 121 only needs to be able to specify the order in which delimiters appear in the compression target data 110, and may be data in which the extracted delimiters are arranged in reverse order of appearance.

  (1-3) The information processing apparatus 100 specifies, for each type of combination of two delimiters, the order in which the character string sandwiched between the two delimiters of the extracted combination of the type appears in the compression target data 110 The second data 122 in which the extracted character strings are arranged is generated. The combination is a combination that considers the order in which the delimiters are combined. The combination may include, for example, a combination of delimiters “:” and “#” and a combination of delimiters “#” and “:” as different combinations. Further, the combination may be a combination that does not consider the order of combining the delimiters.

  The type is a pattern in which two delimiters are combined. The type may be a combination of a plurality of patterns. For example, the information processing apparatus 100 may treat a combination pattern of delimiters “:” and “#” and a combination pattern of delimiters “#” and “:” as the same type of combination. .

  For example, the information processing apparatus 100 generates, as the second data 122, data in which the extracted character strings are arranged in the order of appearance by dividing each type of combination of two delimiters. The second data 122 only needs to be able to specify the order in which the character strings appear in the compression target data 110, and may be data in which the extracted character strings are arranged in reverse order of appearance. Further, the second data 122 may not include information indicating the type of combination of the two delimiters. The second data 122 uses, for example, a combination of two delimiters that can be specified from the first data 121, so that a character string sandwiched between two delimiters of each type of combination is a compression target. The order of appearance in the data 110 may be specified.

  (1-4) The information processing apparatus 100 performs compression using the slide dictionary method on the generated first data 121 and second data 122. For example, the information processing apparatus 100 concatenates the second data 122 to the generated first data 121 and performs compression by LZMA. Then, the information processing apparatus 100 outputs the compressed data 130 obtained by the compression. The information processing apparatus 100 may link the first data 121 and the second data 122 and perform compression by LZMA so that the first data 121 is not encoded.

  According to this, the information processing apparatus 100 can generate the first data 121 and the second data 122 that can be returned to the compression target data 110, and the same character is used in the second data 122. It is possible to make it easy for the columns to appear continuously in relatively close positions. As a result, the information processing apparatus 100 can easily reduce the number of bits used to indicate the start position, and can easily find and compress the same character string, thereby improving the compression efficiency.

  Specifically, the information processing apparatus 100 can easily improve the compression efficiency of the compression target data 110 in which data along a certain format divided by a predetermined delimiter is aggregated. For this reason, the information processing apparatus 100 can further improve the compression efficiency when the table data output from the spreadsheet software or the log data output from the log collection software is used as the compression target data 110. .

(Hardware configuration example of information processing apparatus 100)
Next, a hardware configuration example of the information processing apparatus 100 will be described with reference to FIG.

  FIG. 2 is a block diagram illustrating a hardware configuration example of the information processing apparatus 100. In FIG. 2, the information processing apparatus 100 includes a CPU (Central Processing Unit) 201, a memory 202, a network I / F (Interface) 203, a disk drive 204, a disk 205, and a recording medium I / F 206. . Each component is connected by a bus 200.

  Here, the CPU 201 governs overall control of the information processing apparatus 100. The memory 202 includes, for example, a ROM (Read Only Memory), a RAM (Random Access Memory), and a flash ROM. Specifically, for example, a flash ROM or ROM stores various programs, and a RAM is used as a work area of the CPU 201. The various programs may include, for example, a compression program and a restoration program according to the embodiment. The program stored in the memory 202 is loaded on the CPU 201 to cause the CPU 201 to execute the coded process.

  The network I / F 203 is connected to the network 210 through a communication line, and is connected to another computer via the network 210. The network I / F 203 controls an internal interface with the network 210 and controls data input / output from other computers. For example, a modem or a LAN (Local Area Network) adapter may be employed as the network I / F 203.

  The disk drive 204 controls reading / writing of data with respect to the disk 205 according to the control of the CPU 201. The disk drive 204 is, for example, a magnetic disk drive. The disk 205 is a non-volatile memory that stores data written under the control of the disk drive 204. The disk 205 is, for example, a magnetic disk or an optical disk.

  The recording medium I / F 206 is connected to the external recording medium 207, manages an internal interface with the external recording medium 207, and controls data input / output with respect to the external recording medium 207. The recording medium I / F 206 is, for example, a USB (Universal Serial Bus) port. The recording medium 207 is, for example, a USB memory. The recording medium 207 may store the compression program and decompression program according to the embodiment.

  In addition to the components described above, the information processing apparatus 100 may include, for example, an SSD (Solid State Drive), a semiconductor memory, a keyboard, a mouse, a display, and the like. Further, the information processing apparatus 100 may include an SSD, a semiconductor memory, and the like instead of the disk drive 204 and the disk 205. Specifically, the information processing apparatus 100 is a mobile phone, a smart phone, a tablet terminal, a PC (Personal Computer), a server, or the like.

(Functional configuration example of information processing apparatus 100)
Next, a functional configuration example of the information processing apparatus 100 will be described with reference to FIG.

  FIG. 3 is a block diagram illustrating a functional configuration example of the information processing apparatus 100. The information processing apparatus 100 includes an extraction unit 301, a generation unit 302, a compression unit 303, a decoding unit 304, and a restoration unit 305. The extraction unit 301 to the restoration unit 305 are functions serving as a control unit. Specifically, by causing the CPU 201 to execute a program stored in a storage area such as the memory 202 and the disk 205 illustrated in FIG. The function is realized by the network I / F 203. The processing result of each functional unit is stored in a storage area such as the memory 202 and the disk 205, for example.

  The extraction unit 301 extracts a predetermined delimiter character and a character string sandwiched between two predetermined delimiter characters from the compression target data 110. The compression target data 110 is data including a predetermined delimiter. The compression target data 110 is preferably log data in which, for example, logs along a certain format divided by a predetermined delimiter are aggregated, and the same character string appears repeatedly. More specifically, the compression target data 110 may be data created by an operation input from a user. Specifically, the compression target data 110 may be data transmitted from another computer to the information processing apparatus 100 and requested to be compressed.

  The delimiter is a character used to delimit a character string included in the compression target data 110 for convenience. The delimiter is, for example, a character other than a number or alphabet. The combination is a combination that considers the order in which the delimiters are combined. Further, the combination may be a combination that does not consider the order of combining the delimiters.

  For example, the extraction unit 301 extracts characters other than numerals and alphabets as delimiters from the compression target data 110, and extracts a character string sandwiched between two characters other than numerals and alphabets. Thereby, the extraction part 301 can classify | categorize a delimiter and a character string other than a delimiter.

  The extraction unit 301 may use a character string having two or more characters as a delimiter. For example, the extraction unit 301 uses “: #” as a delimiter. Thereby, the extraction unit 301 can easily increase the number of types of delimiters, and can easily increase the number of types of combinations of two delimiters. Therefore, the extraction unit 301 makes it easy for a character string sandwiched between two delimiters of the same type of combination to be a character string having the same attribute, and in the second data 122, the same character string is likely to gather relatively close And the compression efficiency can be improved.

  The extraction unit 301 may not use a character string having two or more characters as a delimiter, assuming that the number of delimiters is one. For example, the extraction unit 301 does not use “: #” as a delimiter and treats “: #” as the delimiters “:” and “#” appear in succession. For example, the extraction unit 301 may not use “: #” as a delimiter and may treat “: #” as an appearance of the delimiter “:”. Accordingly, the extraction unit 301 can hardly increase the number of types of delimiters and can hardly increase the number of types of combinations of two delimiters. For this reason, for each type of combination of two delimiters, the extraction unit 301 suppresses the size of a storage area used when classifying a character string sandwiched between two delimiters of the combination of the types, and stores It is possible to save the area and perform processing efficiently.

  The extraction unit 301 may use a control character as a delimiter. For example, the extraction unit 301 uses a control character indicating a line feed as a delimiter. Thus, when the extraction unit 301 classifies the character string for each type of combination of two delimiters, it can also classify the character string sandwiched between the two delimiters of the combination including the control character. As a result, the extraction unit 301 can easily gather the same character strings in the second data 122 and can improve the compression efficiency.

  The extraction unit 301 may accept designation of a predetermined delimiter and may extract from the compression target data 110 a character string sandwiched between the predetermined delimiter that has received the designation and the two delimiters that have accepted the designation. . For example, the extraction unit 301 receives designation of a predetermined delimiter character by an operation input from the user, and is sandwiched between the predetermined delimiter character that has received the designation and the two delimiter characters that have received the designation from the compression target data 110. Extract a string. Thereby, the extraction unit 301 can easily use delimiters in accordance with the format of the compression target data 110, and can easily collect the same character strings in the second data 122, thereby improving compression efficiency. Can be planned.

  The extraction unit 301 can handle the data to be compressed 110 as a control character indicating a line feed appears at the beginning. Thus, the extraction unit 301 can also classify the first character string of the compression target data 110 when classifying the character string for each type of combination of two delimiters.

  The generation unit 302 generates first data 121 and second data 122. The first data 121 is data in which delimiters are arranged so that the order in which delimiters appear in the compression target data 110 can be specified. The second data 122 is a character string that can specify the order in which the character string sandwiched between two delimiters of the combination of the types appears in the compression target data 110 for each type of combination of two delimiters. It is the arranged data. The type is a pattern in which two delimiters are combined. The type may be a combination of a plurality of patterns. For example, the combination of the delimiters “:” and “#” and the combination of the delimiters “#” and “:” may be treated as the same type of combination.

  For example, the generation unit 302 deletes a character other than the delimiter from the compression target data 110 so that the boundary between the delimiter and the delimiter can be determined. ”Is inserted, and the compression target data 110 is transformed into the first data 121. In addition, when the number of characters of the delimiter is fixed, the generation unit 302 does not need to clearly indicate the boundary between the delimiter and the delimiter, and thus a predetermined character “a” is inserted between the delimiter and the delimiter. It does not have to be inserted.

  For example, the generation unit 302 arranges dots corresponding to each of the types of combinations of two delimiters. Then, the generation unit 302 inserts a character string sandwiched between two delimiters of the combination of the types immediately before the dot corresponding to each of the combinations of the two delimiters, separated by “,”, Second data 122 is generated. Thereby, the generation unit 302 can generate the first data 121 and the second data 122 that can be returned to the compression target data 110, and the same character string is compared in the second data 122. It can be made easy to appear continuously at close positions.

  When the number of types of delimiters appearing in the compression target data 110 is greater than the threshold, the generation unit 302 may divide the compression target data 110 into partial data in which the number of types of delimiters appearing is equal to or less than the threshold. Also good. In this case, the generating unit 302 generates the first data 121 and the second data 122 for each partial data. In this case, the first data 121 is, for example, data in which delimiters are arranged so that the order in which the delimiters appear in the partial data can be specified. In this case, the second data 122 is, for example, the order in which a character string sandwiched between two delimiters of the combination of the types appears in the partial data for each type of combination of two delimiters that appears in the partial data. This is data in which character strings are arranged so that can be specified. Thereby, the generation unit 302 suppresses the size of the storage area used for classifying the character string sandwiched between the two delimiters of the combination of the types for each type of combination of the two delimiters, It is possible to save the area and perform processing efficiently.

  Specifically, the generation unit 302 generates first data 121 in which delimiters are alternately arranged with predetermined characters in the order of appearance in the compression target data 110. Specifically, for each type of combination of two delimiters, the generation unit 302 predetermines a character string sandwiched between two delimiters of the combination of the types in the order in which they appear in the compression target data 110. Second data 122 arranged alternately with the characters is generated. Thereby, the generation unit 302 can generate the first data 121 and the second data 122 that can be returned to the compression target data 110, and the same character string is compared in the second data 122. It can be made easy to appear continuously at close positions.

  The compression unit 303 compresses the generated first data 121 and second data 122 using a slide dictionary method. The compression is, for example, compression by the “LZ77” compression algorithm. The compression may be, for example, compression by various algorithms obtained by improving the compression algorithm of “LZ77”, and specifically, compression by a compression algorithm of “LZMA”.

  For example, the compression unit 303 performs compression using the LZ77 or LZMA compression algorithm on the generated first data 121 and second data 122. Specifically, the compression unit 303 concatenates the generated first data 121 and the second data 122 and indicates the boundary between the first data 121 and the second data 122 at the head of the concatenated data. After adding the metadata, compression using the LZMA compression algorithm is performed.

  The metadata may not be compressed. The metadata is, for example, a value indicating the start position of the second data 122, and specifically the size of the first data 121. The metadata may be inserted between the first data 121 and the second data 122. For example, when the metadata is inserted between the first data 121 and the second data 122, the metadata is represented by characters that do not appear in the first data 121 or the second data 122.

  Specifically, the compression unit 303 concatenates the first data 121 and the second data 122, adds the metadata, and then does not compress the metadata and the first data 121. The second data 122 may be compressed. Thereby, the compression unit 303 can improve the compression efficiency in the compression using the slide dictionary method for the second data 122 in which the same character string is likely to appear continuously at relatively close positions. In addition, the compression unit 303 can use an LZ77 or LZMA compression algorithm that is preferably used for compression of the second data 122, and can further reduce the size of the compressed data.

  The decoding unit 304 decodes the compressed data obtained by compressing the first data 121 and the second data 122 using the slide dictionary method. The decoding unit 304 performs decoding on the compressed data using a decoding algorithm corresponding to the LZ77 or LZMA compression algorithm. Thereby, the decoding unit 304 can acquire the first data 121 and the second data 122 that can be returned to the compression target data 110.

  The restoration unit 305 refers to the second data 122 obtained by decryption, and associates between the two delimiters in the first data 121 obtained by decryption with the combination type of the two delimiters The specified character string is inserted sequentially. Thus, the information processing apparatus 100 can restore the compression target data 110 that is the compression source from the compressed data that has been efficiently compressed.

  Here, the case where the information processing apparatus 100 has both the function of compressing the compression target data 110 and the function of restoring the compression target data 110 has been described, but the present invention is not limited thereto. For example, the information processing apparatus 100 may not have either a function for compressing the compression target data 110 or a function for restoring the compression target data 110.

(Example of compressing the compression target data 400)
Next, an example in which the information processing apparatus 100 compresses the compression target data 400 will be described with reference to FIGS.

  4-11 is explanatory drawing which shows an example which compresses the compression object data 400. FIG. In FIG. 4, the information processing apparatus 100 accepts input of compression target data 400. In the example of FIG. 4, the compression target data 400 is data including characters other than numerals and alphabets as predetermined delimiters. The predetermined delimiter may include a character string having two or more characters. The predetermined delimiter character may include a control character.

  Specifically, the first line of the compression target data 400 is “11:03 load: jerture load: lrc load: isa”, and is line-breaked at the end. The second line of the compression target data 400 is “11:03 monmap”, which is a line feed at the end. The third line of the compression target data 400 is “11:03 adding auth protocol: none”, and is line-breaked at the end. Control characters indicating line breaks are not displayed.

  In the following description, for the sake of convenience, a space may be expressed as “#”, and a control character indicating a line feed may be expressed as “$”. Therefore, in the following description, the compression target data 400 is “11: 03 # load: # jeraseure # load: # lrc # load: # isa $ 11: 03 # monmap $ 11: 03 # adding # auth # protocol: # None $ ". Here, the description shifts to the description of FIG.

  In FIG. 5, the information processing apparatus 100 prepares a compression table 500 based on the compression target data 400 that has received an input. The compression table 500 is a table used for classifying a character string sandwiched between two delimiters of a combination of patterns for each pattern of combinations of two delimiters that appear in the compression target data 400. The compression table 500 has a storage area for each combination of two delimiters appearing in the compression target data 400 for each combination of the patterns.

  For example, the information processing apparatus 100 counts the number of types of delimiters “4” based on the compression target data 400 and has a storage table of “16” squares of the number of types of delimiters “4”. Prepare. Here, the description shifts to the description of FIG.

  In FIG. 6, when the top of the compression target data 400 is not a delimiter, the information processing apparatus 100 assigns a predetermined delimiter to the top of the compression target data 400. In the example of FIG. 6, the information processing apparatus 100 adds a control character “$” indicating a line feed to the head of the compression target data 400. In addition, when the end of the compression target data 400 is not a delimiter, the information processing apparatus 100 may add a predetermined delimiter to the end of the compression target data 400.

  Next, the information processing apparatus 100 specifies a combination pattern of two delimiters based on the compression target data 400 according to a predetermined combination rule. The predetermined combination rule is, for example, a rule that selects in order from the delimiter that appears first, and combines the selected delimiter in order from the delimiter that appears first.

  In the example of FIG. 6, the information processing apparatus 100 selects a delimiter “$” that appears first, and a pattern in which the delimiter “$” that appears first is combined with the selected delimiter “$”. Identify. Similarly, the information processing apparatus 100, for the selected delimiter character “$”, the second delimiter character “:”, the third delimiter character “#”, and the last delimiter character “:”. # "Identify patterns that combine each. Similarly, the information processing apparatus 100 selects each of the delimiter “:” that appears second, the delimiter “#” that appears third, the delimiter “: #” that appears last, and Identify character combination patterns.

  Then, the information processing apparatus 100 stores each of the identified two delimiter combination patterns in each of the prepared storage areas, and associates each of the two specified delimiter combination patterns with each other. In the example of FIG. 6, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “$”. Further, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “:”, for example. Further, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “#”, for example. Further, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “: #”, for example.

  Here, a case has been described in which the information processing apparatus 100 also identifies a pattern that is not used for sandwiching a character string in the compression target data 400 among patterns of combinations of two delimiters, but is not limited thereto. . For example, the information processing apparatus 100 does not have to specify a pattern that is not used to sandwich a character string in the compression target data 400. In this case, the information processing apparatus 100 prepares a storage area corresponding to the pattern used to sandwich the character string in the compression target data 400 without preparing a storage area that is the square of the number of types of delimiters. do it. Here, the description shifts to the description of FIG.

  In FIG. 7, the information processing apparatus 100 extracts a character string sandwiched between two delimiters of a combination of patterns in the compression target data 400 for each pattern of combinations of two delimiters. Then, the information processing apparatus 100 causes a character string sandwiched between the two delimiters in the compression target data 400 to appear in the compression target data 400 in a storage area associated with each combination pattern of two delimiters. The specified order is stored in an identifiable manner.

  For example, the information processing apparatus 100 stores character strings “11”, “11”, and “2” sandwiched between two delimiters of the combination in a storage area associated with a combination pattern of delimiters “$” and “:”. 11 ”are separated by“, ”and stored in the order of appearance. Similarly, the information processing apparatus 100 stores character strings “03” and “03” sandwiched between two delimiters of the combination in a storage area associated with a combination pattern of delimiters “:” and “#”. “03” is separated by “,” and stored in the order of appearance. Further, the information processing apparatus 100 does not include a character string sandwiched between two delimiters of the combination in the storage area associated with the combination pattern of delimiters “$” and “$”. Do not remember. Here, the description shifts to the description of FIG.

  In FIG. 8, the information processing apparatus 100 deletes a predetermined delimiter character added to the head of the compression target data 400. In the example of FIG. 8, the information processing apparatus 100 deletes the control character “$” indicating a line feed attached to the head of the compression target data 400. In addition, if a predetermined delimiter is added to the end of the compression target data 400, the information processing apparatus 100 also deletes the predetermined delimiter added to the end of the compression target data 400.

  Then, the information processing apparatus 100 generates first data 800. The first data 800 is data in which delimiters are arranged so that the order in which delimiters appear in the compression target data 400 can be specified. For example, the information processing apparatus 100 deletes characters other than the delimiter from the compression target data 400 and inserts a predetermined character “a” between the delimiter and the delimiter, thereby causing the compression target data 400 to be the first The data 800 is transformed.

  In the example of FIG. 8, the information processing apparatus 100 deletes characters other than the delimiters from the compression target data 400 and changes the compression target data 400 to “: ##: ##: ##: ##: ##”: ##. #: # $ ". The information processing apparatus 100 inserts a predetermined character “a” between the delimiters and the first data 800 “a: a # a: # a # a: # a # a: #”. a $ a: a # a $ a: a # a # a # a: # a $ ".

  Here, a case has been described in which the information processing apparatus 100 deletes a predetermined delimiter character added to the head of the compression target data 400, but the present invention is not limited to this. For example, the information processing apparatus 100 may leave a predetermined delimiter character added to the head of the compression target data 400 as it is and delete it when the compression target data 400 is restored. . Here, the description shifts to the description of FIG. 9.

  In FIG. 9, the information processing apparatus 100 creates data 900 in which dots corresponding to respective patterns of combinations of two delimiters are arranged. Then, the information processing apparatus 100 inserts a character string sandwiched between two delimiters of the pattern combination immediately before the dot corresponding to each of the two delimiter combination patterns, and delimits the character string with “,”. .

  In the example of FIG. 9, the information processing apparatus 100 has data “...” arranged in 16 dots corresponding to each of 16 patterns of combinations of two delimiters. ... "is created. Here, in order from the first dot, the identified pattern corresponds to the combination pattern with the earlier order. In other words, the first dot corresponds to the combination pattern of the delimiters “$” and “$” specified first. The second dot corresponds to the combination pattern of the delimiters “$” and “:” specified second.

  Then, the information processing apparatus 100 immediately precedes the dot corresponding to the combination pattern of the delimiters “$” and “:”, and character strings “11”, “11”, and “11” sandwiched between the two delimiters of the combination. 11 ”are separated by“, ”and arranged in the order of appearance. In this way, the information processing apparatus 100 converts the data “...,. ... ".

  Similarly, the information processing apparatus 100 determines that the character strings “03” and “03” sandwiched between two delimiters of the combination immediately before the dot corresponding to the combination pattern of the delimiters “:” and “#”. Insert “03” in the order of appearance, separated by “,”. In addition, the information processing apparatus 100 does not include a character string sandwiched between two delimiters of the combination immediately before a dot corresponding to a combination pattern of delimiters “$” and “$”. Is not inserted. Here, the description shifts to the description of FIG.

  In FIG. 10, the information processing apparatus 100 sets the second data 1000 as data that has been transformed by inserting a character string sandwiched between two delimiters of each pattern and inserting it with “,”. The second data 1000 is a character string that can specify the order in which a character string sandwiched between two delimiters of the combination of patterns appears in the compression target data 400 for each pattern of two delimiter combinations. It is the arranged data.

  In the example of FIG. 10, the second data 1000 includes “.11, 11, 11... 03, 03. 03. monmap..adding, auth.load, load, load, protocol.isa, none. .. jeraseure, lrc. "

  Here, when restoring the compression target data 400, the information processing apparatus 100 uses the predetermined combination rule to match the order of the combination of the two delimiters specified in FIG. 6 from the first data 800. Pattern can be specified. For this reason, the second data 1000 uses a combination of two delimiters that can be specified from the first data 800 to compress a character string sandwiched between two delimiters of each type of combination. It is sufficient that the order of appearance in the target data 400 can be specified. As a result, the second data 1000 does not include information indicating the pattern of the combination of two delimiters. The second data 1000 may include information indicating the pattern of the combination of two delimiters. Here, the description shifts to the description of FIG.

  In FIG. 11, the information processing apparatus 100 concatenates first data 800 and second data 1000 and performs compression using an LZMA compression algorithm to generate a compressed file 1100. For example, when the second data 1000 is linked to the end of the first data 800, the information processing apparatus 100 sets the metadata indicating the boundary between the first data 800 and the second data 1000 as the first data 800. It is given at the beginning of. Then, the information processing apparatus 100 collects the linked first data 800 and second data 1000 and compresses them using an LZMA compression algorithm. The metadata may not be compressed.

(Example of restoring compression target data 400)
Next, an example in which the information processing apparatus 100 restores the compression target data 400 from the compressed file 1100 generated in FIG. 11 will be described with reference to FIGS.

  12 to 23 are explanatory diagrams illustrating an example of restoring the compression target data 400. FIG. In FIG. 12, the information processing apparatus 100 decrypts the compressed file 1100 using a decryption algorithm corresponding to the LZMA compression algorithm, and obtains first data 800 and second data 1000.

  For example, the information processing apparatus 100 decrypts the compressed file 1100 using a decryption algorithm corresponding to the LZMA compression algorithm. Then, the information processing apparatus 100 specifies the boundary between the first data 800 and the second data 1000 based on the top metadata, and acquires the first data 800 and the second data 1000 by dividing them. To do. Here, the description shifts to the description of FIG.

  In FIG. 13, the information processing apparatus 100 prepares a restoration table 1300 based on the acquired first data 800. The restoration table 1300 is a table used for classifying a character string sandwiched between two delimiters of a combination of the patterns for each pattern of combinations of two delimiters appearing in the first data 800. . The restoration table 1300 has a storage area corresponding to each combination of patterns for each combination pattern of two delimiters appearing in the first data 800. Hereinafter, the restoration table 1300 is created so as to have the same stored contents as the compression table 500.

  For example, the information processing apparatus 100 counts the number of types of delimiters “4” based on the first data 800 and has a storage table of “16” squares of the number of types of delimiters “4”. 1300 is prepared. Here, the description shifts to the description of FIG.

  In FIG. 14, the information processing apparatus 100 assigns a predetermined delimiter character to the head of the first data 800 when the head of the first data 800 is not a delimiter character. In the example of FIG. 14, the information processing apparatus 100 adds a control character “$” indicating a line feed to the top of the first data 800. Further, when the end of the first data 800 is not a delimiter, the information processing apparatus 100 may add a predetermined delimiter to the end of the first data 800.

  Next, the information processing apparatus 100 identifies a combination pattern of two delimiters based on the first data 800 according to a predetermined combination rule. The predetermined combination rule is, for example, a rule that selects in order from the delimiter that appears first, and combines the selected delimiter in order from the delimiter that appears first. The predetermined combination rule is the same as the combination rule when the information processing apparatus 100 specifies a combination pattern of two delimiters in FIG.

  In the example of FIG. 14, the information processing apparatus 100 selects the delimiter “$” that appears first, and combines the delimiter “$” that appears first with the selected delimiter “$”. Identify. Similarly, the information processing apparatus 100, for the selected delimiter character “$”, the second delimiter character “:”, the third delimiter character “#”, and the last delimiter character “:”. # "Identify patterns that combine each. Similarly, the information processing apparatus 100 selects each of the delimiter “:” that appears second, the delimiter “#” that appears third, the delimiter “: #” that appears last, and Identify character combination patterns.

  Then, the information processing apparatus 100 stores each of the identified two delimiter combination patterns in each of the prepared storage areas, and associates each of the two specified delimiter combination patterns with each other. In the example of FIG. 14, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “$”. Further, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “:”, for example. Further, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “#”, for example. Further, the information processing apparatus 100 associates the prepared storage area with a combination pattern of delimiters “$” and “: #”, for example.

  Here, a case has been described in which the information processing apparatus 100 also identifies a pattern that is not used to sandwich the predetermined character “a” in the first data 800 from among the combinations of the two delimiters. Not limited to this. For example, the information processing apparatus 100 may not specify a pattern that is not used to sandwich the predetermined character “a” in the first data 800. In this case, the information processing apparatus 100 corresponds to the pattern used to sandwich the predetermined character “a” in the first data 800 without preparing a storage area of the square number of types of delimiters. What is necessary is just to prepare the memory area to perform. Here, the description shifts to the description of FIG.

  In FIG. 15, the information processing apparatus 100 refers to the second data 1000 and extracts a character string arranged in association with the pattern for each combination pattern of two delimiters. Then, for each pattern of the combination of two delimiters, the information processing apparatus 100 stores a character string arranged in association with the combination of the patterns in the second data 1000 in the storage area associated with the pattern. Remember.

  For example, the information processing apparatus 100 stores the character string “11” arranged in association with the pattern in the second data 1000 in the storage area associated with the combination pattern of the delimiters “$” and “:”. , 11, 11 ". Similarly, the information processing apparatus 100 stores in the storage area associated with the combination pattern of the delimiters “:” and “#” the character string “ 03, 03, 03 "is stored. Further, the information processing apparatus 100 has no character string arranged in association with the pattern in the second data 1000 in the storage area associated with the combination pattern of the delimiters “$” and “$”. Therefore, the character string is not stored. Here, the description shifts to the description of FIG.

  In FIG. 16, the information processing apparatus 100 uses the combination 2 of the pattern in the first data 800 as the insertion destination of one of the character strings stored in the storage area corresponding to the combination pattern of the two delimiters. Specify the location between two delimiters.

  In the example of FIG. 16, for example, the information processing apparatus 100 searches for a place where the predetermined character “a” is present in the first data 800. Specifically, the information processing apparatus 100 detects a portion where the first character “a” appears in the first data 800 and is sandwiched between delimiters “$” and “:”. Identify. Here, the description shifts to FIG.

  In FIG. 17, the information processing apparatus 100 specifies a combination pattern of two delimiters that sandwich a portion where the specified character “a” is present. When the information processing apparatus 100 specifies the combination pattern of the delimiters “$” and “:”, the information processing apparatus 100 stores the combination pattern in association with the specified combination pattern of the delimiters “$” and “:”. The first character string “11” of the character string “11, 11, 11” is read. Then, the information processing apparatus 100 inserts the read character string “11” into the first data 800 instead of the character “a” at the specified location. Here, the description shifts to the description of FIG.

  In FIG. 18, the information processing apparatus 100 has read out the character strings “11, 11, 11” stored in the storage area associated with the combination pattern of the specified delimiters “$” and “:”. The first character string “11” is deleted. Here, the description shifts to FIG.

  In FIG. 19, similarly, the information processing apparatus 100 is a portion where the character “a” appears second in the first data 800 and is sandwiched between delimiters “:” and “#”. Identify the location. The information processing apparatus 100 specifies a combination pattern of two delimiters that sandwich a portion where the specified character “a” is located. When the information processing apparatus 100 identifies the combination pattern of the delimiters “:” and “#”, the information processing apparatus 100 stores the pattern in the storage area associated with the identified combination pattern of the delimiters “:” and “#”. The first character string “03” of the character string “03, 03, 03” is read. Then, the information processing apparatus 100 inserts the read character string “03” into the first data 800 instead of the character “a” at the specified location.

  The information processing apparatus 100 reads the first read out character string “03, 03, 03” stored in the storage area associated with the combination pattern of the specified delimiters “:” and “#”. The character string “03” is deleted. Here, the description shifts to the description of FIG.

  In FIG. 20, similarly, the information processing apparatus 100 is a portion where the third character “a” appears in the first data 800 and is sandwiched between delimiters “#” and “: #”. Identify the location. The information processing apparatus 100 specifies a combination pattern of two delimiters that sandwich a portion where the specified character “a” is located. The information processing apparatus 100 uses the first character string “load, load, load, protocol” stored in the storage area associated with the combination pattern of the specified delimiters “#” and “: #”. read "load". The information processing apparatus 100 inserts the read character string “load” into the first data 800 instead of the character “a” at the specified location.

  The information processing apparatus 100 has already read out the character string “load, load, load, protocol” stored in the storage area associated with the combination pattern of the specified delimiters “#” and “: #”. Delete some leading character string “load”. Here, the description shifts to the description of FIG.

  In FIG. 21, similarly, the information processing apparatus 100 is a portion where the character “a” that appears fourth in the first data 800 is present, and is sandwiched between delimiters “: #” and “#”. Identify the location. The information processing apparatus 100 specifies a combination pattern of two delimiters that sandwich a portion where the specified character “a” is located. The information processing apparatus 100 reads the first character string “jeraseure” of the character string “jeraseure, lrc” stored in the storage area associated with the specified combination pattern of the delimiters “: #” and “#”. . Then, the information processing apparatus 100 inserts the read character string “jeraseure” into the first data 800 instead of the character “a” at the specified location.

  The information processing apparatus 100 reads the first character that has been read out of the character string “jeraseure, lrc” stored in the storage area associated with the combination pattern of the specified delimiters “: #” and “#” Delete the column “jeraseure”. Here, the description shifts to the description of FIG.

  In FIG. 22, the information processing apparatus 100 similarly replaces the character “a” in the first data 800. The information processing apparatus 100 stores the first data 800 as “$ 11: 03 # load: # jerase # load: # lrc # load: # isa $ 11: 03 # monmap $ 11: 03 # adding # auth # protocol: # "none $". Here, the description shifts to the description of FIG.

  In FIG. 23, the information processing apparatus 100 deletes the control character indicating the line feed added to the head of the first data 800 and restores the compression target data 400. As a result, the information processing apparatus 100 can restore the compression target data 400 even from the compressed file 1100 compressed with improved compression efficiency.

  Although the information processing apparatus 100 that compresses the compression target data 400 and the information processing apparatus 100 that restores the compression target data 400 have been described here as being the same apparatus, the present invention is not limited thereto. For example, the information processing apparatus 100 that compresses the compression target data 400 and the information processing apparatus 100 that restores the compression target data 400 may be different apparatuses. In this case, the information processing apparatus 100 that compresses the compression target data 400 and the information processing apparatus 100 that restores the compression target data 400 use the same combination rule when specifying a combination pattern of two delimiters. It will be.

(Example of compression processing procedure)
Next, an example of the compression processing procedure will be described with reference to FIG.

  FIG. 24 is a flowchart illustrating an example of the compression processing procedure. In FIG. 24, the information processing apparatus 100 receives an input of a text file that is the compression target data 400 (step S2401).

  Next, the information processing apparatus 100 divides the text file into a delimiter character and a character string other than the delimiter character (step S2402). Then, the information processing apparatus 100 records all the delimiters side by side so that a predetermined character is sandwiched between the delimiters and the delimiter (step S2403).

  Next, the information processing apparatus 100 sorts all the character strings for each pattern of combinations of two delimiters that appear before and after (step S2404). Then, the information processing apparatus 100 records all the sorted character strings in such a manner that a combination pattern of two delimiters appearing before and after can be specified (step S2405).

  Next, the information processing apparatus 100 performs LZMA compression on the recorded delimiter character and the recorded character string (step S2406). Then, the information processing apparatus 100 outputs the compressed data obtained by the compression (step S2407) and ends the compression process. Thereby, the information processing apparatus 100 can compress the compression target data 400 so that it can be restored.

(Example of restoration processing procedure)
Next, an example of the restoration processing procedure will be described with reference to FIG.

  FIG. 25 is a flowchart illustrating an example of the restoration processing procedure. In FIG. 25, the information processing apparatus 100 prepares a character string array del [], a character string array data [] [] [], an integer array ID [], an integer i, and an integer array j [] [] (step S2501).

  The character string array del [] is an array in which the read delimiter characters are stored in order. The index of the character string array del [] is a serial number assigned to the read delimiter character, and is a number indicating the number of the delimiter character from the beginning of the restored data. For example, del [1] stores a delimiter that exists first from the beginning of the restored data.

  The character string array data [] [] [] is an array in which the read character strings are stored in order. The first index of the character string array data [] [] [] is a number assigned to the type of delimiter that appears immediately before the read character string. The second index of the character string array data [] [] [] is a number assigned to the type of delimiter character that appears immediately after the read character string.

  The third index of the character string array data [] [] [] is a serial number that is sequentially assigned to a character string sandwiched between combinations of delimiters of the types corresponding to the first and second indexes. For example, if the number assigned to the type of delimiter “$” is “1”, data [1] [1] [1] is a character sandwiched between two delimiters “$”. Among the columns, the character string existing first from the beginning of the restored data is stored.

  The integer array ID [] is an array in which numbers assigned to the types of delimiters are stored. The index of the integer array ID [] is a serial number assigned to the delimiter character, and is a number indicating the number of the delimiter character from the beginning of the restored data. For example, ID [1] stores a number assigned to the type of character string existing first from the top of the restored data.

  The integer i is a number indicating the number of delimiters existing from the beginning of the restored data. The integer i is the initial value 1.

  The integer array j [] [] is an array that stores, for each combination of delimiters, a number indicating the number of character strings to be specified among the character strings sandwiched between the combinations. The first index of the integer array j [] [] is a number assigned to the type of delimiter on the front side of the delimiter combination. The second index of the integer array j [] [] is a number assigned to the type of delimiter behind the combination of delimiters.

  j [] [] is an initial value of 1, respectively. For example, if the number assigned to the type of delimiter “$” is “1”, j [1] [1] is a character string between two combinations of delimiters “$”. , A number indicating which character string is to be specified is stored.

  Next, the information processing apparatus 100 performs decoding by LZMA on the compressed data, and obtains restored data in which all delimiters and all character strings are arranged (step S2502). Then, the information processing apparatus 100 reads all delimiters in del [] in order (step S2503).

  Next, the information processing apparatus 100 classifies all the character strings into patterns of combinations of two delimiters that appear before and after, and sequentially reads the data into data [] [] [] (step S2504). The information processing apparatus 100 records del [i] and adds 1 to i (step S2505).

  Next, the information processing apparatus 100 determines whether i exceeds the number of delimiters (step S2506). If the number of delimiters is exceeded (step S2506: Yes), the information processing apparatus 100 ends the restoration process.

  On the other hand, when the number of delimiters has not been exceeded (step S2506: No), the information processing apparatus 100 uses data [ID [del [i-1]]] [ID [del [i]]] [j [ID. [Del [i-1]]] [ID [del [i]]]] is recorded, and 1 is added to j [ID [del [i-1]]] [ID [del [i]]]. (Step S2507). Then, the information processing apparatus 100 returns to the process of step S2505. Thereby, the information processing apparatus 100 can restore the compression target data 400.

  As described above, the information processing apparatus 100 can extract a predetermined delimiter character and a character string sandwiched between two predetermined delimiter characters from the compression target data 400. Further, according to the information processing apparatus 100, it is possible to generate the first data 800 in which the delimiters are arranged so that the order in which the delimiters appear in the compression target data 400 can be specified. Further, according to the information processing apparatus 100, for each type of combination of two delimiters, a character string that can specify the order in which a character string sandwiched between two delimiters of the type combination appears in the compression target data 400. Second data 1000 in which columns are arranged can be generated. Further, according to the information processing apparatus 100, the generated first data 800 and second data 1000 can be compressed using a slide dictionary method. Thereby, the information processing apparatus 100 can generate the first data 800 and the second data 1000 that can be returned to the compression target data 400, and the same character string is included in the second data 1000. It can be made easy to appear continuously in relatively close positions. As a result, the information processing apparatus 100 can improve the compression efficiency by easily reducing the number of bits used to indicate the start position and making it easy to find and compress the same character string.

  Further, according to the information processing apparatus 100, it is possible to accept designation of a predetermined delimiter character. Further, according to the information processing apparatus 100, it is possible to extract from the compression target data 400 a predetermined delimiter character that has received a designation and a character string that is sandwiched between two delimiter characters that have accepted a designation. As a result, the information processing apparatus 100 can easily use delimiters in accordance with the format of the compression target data 400, and can easily collect the same character strings in the second data 1000, thereby improving compression efficiency. Can be achieved.

  Further, according to the information processing apparatus 100, when the number of types of delimiters appearing in the compression target data 400 is larger than the threshold, the compression target data 400 is divided into partial data in which the number of types of delimiters appearing is equal to or less than the threshold. can do. Further, according to the information processing apparatus 100, it is possible to generate the first data 800 in which the delimiters are arranged so that the order in which the delimiters appear in the partial data can be specified. Further, according to the information processing apparatus 100, for each type of combination of two delimiters, a character string is specified so that the order in which the character string sandwiched between the two delimiters of that type combination appears in the partial data can be specified. The arranged second data 1000 can be generated. Thereby, the information processing apparatus 100 suppresses the size of the storage area used when classifying the character string sandwiched between the two delimiters of the combination of the types for each type of combination of the two delimiters. It is possible to save the storage area and perform processing efficiently.

  Further, according to the information processing apparatus 100, it is possible to generate the first data 800 in which delimiters are alternately arranged with predetermined characters in the order in which they appear in the compression target data 400. According to the information processing apparatus 100, for each type of combination of two delimiters, a character string sandwiched between two delimiters of the combination of the types is a predetermined character in the order of appearance in the compression target data 400. The second data 1000 arranged alternately can be generated. Thereby, the information processing apparatus 100 can generate the first data 800 so that the boundary between the delimiter and the delimiter can be determined even if the delimiter is two or more. The information processing apparatus 100 can generate the second data 1000 so that the boundary between the character string and the character string can be determined.

  Further, according to the information processing apparatus 100, compression using an LZ77 or LZMA compression algorithm can be performed. Thereby, the information processing apparatus 100 can use the compression algorithm of LZ77 or LZMA that is preferably used for compression of the second data 1000, and can reduce the size of the compressed data.

  Moreover, according to the information processing apparatus 100, the delimiter can include a character string having two or more characters. As a result, the information processing apparatus 100 can easily increase the number of types of delimiters, and can easily increase the number of types of combinations of two delimiters. For this reason, the information processing apparatus 100 makes it easy for a character string sandwiched between two delimiters of the same type of combination to be a character string having the same attribute, and the same character strings are gathered relatively close in the second data 1000. The compression efficiency can be improved.

  Further, according to the information processing apparatus 100, the number of characters of the delimiter is 1, and the delimiter can be configured not to include a character string having two or more characters. Thereby, the information processing apparatus 100 can hardly increase the number of types of delimiters and can hardly increase the number of types of combinations of two delimiters. For this reason, the information processing apparatus 100 suppresses the size of the storage area used when classifying the character string sandwiched between the two delimiters of the combination of the types for each type of combination of the two delimiters, It is possible to save the storage area and perform processing efficiently. In addition, since the information processing apparatus 100 fixes the number of characters of the delimiter to 1, it is not necessary to clearly indicate the boundary between the delimiter and the delimiter in the first data 800, and the size of the first data 800 is reduced. Reduction can be achieved.

  Further, according to the information processing apparatus 100, the delimiter can include a control character. Accordingly, when the information processing apparatus 100 classifies the character strings for each combination type of the two delimiters, the information processing apparatus 100 can also classify the character strings sandwiched between the two delimiters of the combination including the control character. . As a result, the information processing apparatus 100 can easily gather the same character strings in the second data 1000 relatively close to each other, and can improve the compression efficiency.

  Further, according to the information processing apparatus 100, it is possible to generate the second data 1000 by treating the compression target data 400 as if a control character indicating a line feed appears at the top. Thus, the information processing apparatus 100 can also classify the first character string of the compression target data 400 when classifying the character string for each type of combination of two delimiters.

  Further, according to the information processing apparatus 100, it is possible to decode the compressed data obtained by compressing the first data 800 and the second data 1000 using the slide dictionary method. According to the information processing apparatus 100, the second data 1000 obtained by decoding is referred to, and the combination type of the two delimiters is between two delimiters in the first data 800 obtained by the decryption. Character strings associated with can be sequentially inserted. Thereby, the information processing apparatus 100 can restore the compression target data 400 that is the compression source from the compressed data that has been efficiently compressed.

  The compression method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This compression program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. The compression program may be distributed via a network such as the Internet.

  The following additional notes are disclosed with respect to the embodiment described above.

(Supplementary note 1)
Extracting a predetermined delimiter and a character string sandwiched between the two delimiters from the compression target data,
For each combination type of the first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Generating the second data in which the character string is arranged so that the order in which the character string sandwiched between characters appears in the compression target data can be specified;
Compressing the generated first data and the second data using a slide dictionary method;
A compression program characterized by causing processing to be executed.

(Supplementary note 2)
Accept the designation of the predetermined delimiter, execute the process,
The extraction process is:
The compression program according to appendix 1, wherein the predetermined delimiter that has received a designation and a character string sandwiched between the two delimiters are extracted from the compression target data.

(Supplementary note 3)
When the number of types of delimiters appearing in the compression target data is greater than a threshold, the compression target data is divided into partial data in which the number of types of delimiters appearing is equal to or less than the threshold,
The process to generate is
For each type of combination of first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the partial data can be specified and two delimiter characters that appear in the partial data, the combination of the types (2) generating the second data in which the character string is arranged so that the order in which the character string sandwiched between the two delimiter characters appears in the partial data can be specified The described compression program.

(Supplementary Note 4) The process to generate is as follows:
For each type of combination of the first data in which the delimiter character is alternately arranged with a predetermined character in the order of appearance in the compression target data and two delimiter characters, 2 of the combination of the type The second data in which the character string sandwiched between two delimiters is alternately arranged with a predetermined character in the order of appearance in the compression target data is generated. 4. The compression program according to any one of 3.

(Supplementary Note 5) The compression program according to any one of Supplementary Notes 1 to 4, wherein the compression is compression using a compression algorithm of LZ77 or LZMA.

(Supplementary note 6) The compression program according to any one of Supplementary notes 1 to 5, wherein the delimiter includes a character string having two or more characters.

(Supplementary note 7) The compression program according to any one of Supplementary notes 1 to 5, wherein the number of characters of the delimiter is one.

(Supplementary note 8) The compression program according to any one of Supplementary notes 1 to 7, wherein the delimiter includes a control character.

(Supplementary Note 9) The process to generate is
The compression program according to any one of appendices 1 to 8, wherein the compression data is handled as if a control character indicating a line feed appears at the beginning of the data to be compressed, and the second data is generated.

(Supplementary note 10)
Extracting a predetermined delimiter and a character string sandwiched between the two delimiters from the compression target data,
For each combination type of the first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Generating the second data in which the character string is arranged so that the order in which the character string sandwiched between characters appears in the compression target data can be specified;
Compressing the generated first data and the second data using a slide dictionary method;
A compression method characterized by executing processing.

(Supplementary Note 11) Extracting a predetermined delimiter and a character string sandwiched between the two delimiters from the compression target data,
For each combination type of the first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Generating the second data in which the character string is arranged so that the order in which the character string sandwiched between characters appears in the compression target data can be specified;
Compressing the generated first data and the second data using a slide dictionary method;
An information processing apparatus having a control unit.

(Supplementary note 12)
For each type of combination of first data in which the delimiter characters are arranged so that the order in which the predetermined delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Decoding compressed data obtained by performing compression using the slide dictionary method on the second data in which the character strings are arranged so that the order in which the character strings sandwiched between characters appear in the compression target data can be specified ,
The second data obtained by decoding is referred to, and the two delimiters in the first data obtained by decoding are associated with the combination type of the two delimiters The compression target data is generated by sequentially inserting the character strings.
A restoration program characterized by causing a process to be executed.

(Supplementary note 13)
For each type of combination of first data in which the delimiter characters are arranged so that the order in which the predetermined delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Decoding compressed data obtained by performing compression using the slide dictionary method on the second data in which the character strings are arranged so that the order in which the character strings sandwiched between characters appear in the compression target data can be specified ,
The second data obtained by decoding is referred to, and the two delimiters in the first data obtained by decoding are associated with the combination type of the two delimiters The compression target data is generated by sequentially inserting the character strings.
A restoration method characterized by executing processing.

(Supplementary Note 14) For each type of combination of first data in which the delimiter characters are arranged so that the order in which the predetermined delimiter characters appear in the compression target data can be specified and two delimiter characters, the combination of the type Compression obtained by performing compression using the slide dictionary method on the second data in which the character strings are arranged so that the order in which the character strings sandwiched between the two delimiters appear in the compression target data can be specified Decrypt the data,
The second data obtained by decoding is referred to, and the two delimiters in the first data obtained by decoding are associated with the combination type of the two delimiters The compression target data is generated by sequentially inserting the character strings.
An information processing apparatus having a control unit.

DESCRIPTION OF SYMBOLS 100 Information processing apparatus 110,400 Compression object data 121,122,800,900,1000 Data 130 Compression data 200 Bus 201 CPU
202 Memory 203 Network I / F
204 Disc drive 205 Disc 206 Recording medium I / F
207 recording medium 210 network 301 extraction unit 302 generation unit 303 compression unit 304 decoding unit 305 restoration unit 500 compression table 1100 compressed file 1300 restoration table

Claims (10)

On the computer,
Extracting a predetermined delimiter and a character string sandwiched between the two delimiters from the compression target data,
For each combination type of the first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Generating the second data in which the character string is arranged so that the order in which the character string sandwiched between characters appears in the compression target data can be specified;
Compressing the generated first data and the second data using a slide dictionary method;
A compression program characterized by causing processing to be executed. In the computer,
Accept the designation of the predetermined delimiter, execute the process,
The extraction process is:
The compression program according to claim 1, wherein the predetermined delimiter that has received a designation and a character string sandwiched between the two delimiters are extracted from the compression target data. In the computer,
When the number of types of delimiters appearing in the compression target data is greater than a threshold, the compression target data is divided into partial data in which the number of types of delimiters appearing is equal to or less than the threshold,
The process to generate is
For each type of combination of first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the partial data can be specified and two delimiter characters that appear in the partial data, the combination of the types 3. The second data in which the character string is arranged so that the order in which the character string sandwiched between the two delimiters of the character appears in the partial data can be specified is generated. The compression program described in.   The compression program according to claim 1, wherein the delimiter includes a character string having two or more characters.   The compression program according to any one of claims 1 to 4, wherein the number of delimiters is one. Computer
Extracting a predetermined delimiter and a character string sandwiched between the two delimiters from the compression target data,
For each combination type of the first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Generating the second data in which the character string is arranged so that the order in which the character string sandwiched between characters appears in the compression target data can be specified;
Compressing the generated first data and the second data using a slide dictionary method;
A compression method characterized by executing processing. Extracting a predetermined delimiter and a character string sandwiched between the two delimiters from the compression target data,
For each combination type of the first data in which the delimiter characters are arranged so that the order in which the delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Generating the second data in which the character string is arranged so that the order in which the character string sandwiched between characters appears in the compression target data can be specified;
Compressing the generated first data and the second data using a slide dictionary method;
An information processing apparatus having a control unit. On the computer,
For each type of combination of first data in which the delimiter characters are arranged so that the order in which the predetermined delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Decoding compressed data obtained by performing compression using the slide dictionary method on the second data in which the character strings are arranged so that the order in which the character strings sandwiched between characters appear in the compression target data can be specified ,
The second data obtained by decoding is referred to, and the two delimiters in the first data obtained by decoding are associated with the combination type of the two delimiters The compression target data is generated by sequentially inserting the character strings.
A restoration program characterized by causing a process to be executed. Computer
For each type of combination of first data in which the delimiter characters are arranged so that the order in which the predetermined delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Decoding compressed data obtained by performing compression using the slide dictionary method on the second data in which the character strings are arranged so that the order in which the character strings sandwiched between characters appear in the compression target data can be specified ,
The second data obtained by decoding is referred to, and the two delimiters in the first data obtained by decoding are associated with the combination type of the two delimiters The compression target data is generated by sequentially inserting the character strings.
A restoration method characterized by executing processing. For each type of combination of first data in which the delimiter characters are arranged so that the order in which the predetermined delimiter characters appear in the compression target data can be specified and two delimiter characters, the two delimiters of the combination of the type Decoding compressed data obtained by performing compression using the slide dictionary method on the second data in which the character strings are arranged so that the order in which the character strings sandwiched between characters appear in the compression target data can be specified ,
The second data obtained by decoding is referred to, and the two delimiters in the first data obtained by decoding are associated with the combination type of the two delimiters The compression target data is generated by sequentially inserting the character strings.
An information processing apparatus having a control unit.

Images