COMPRESSION METHOD FOR A DATA TRANSFER THAT IS INDEPENDENT OF COMPUTER ARCHITECTURE AND/OR DECOMPRESSION METHOD FOR A DATA RECORD
2 Assignments
0 Petitions
Accused Products
Abstract
A compression method for a data transfer that is independent of computer architecture and/or a decompression method for a data record that contains structural indicators and variable values are provided. The method includes the following steps: provision of a string automaton, which represents the structuring rules of the data record in a unit that compresses the original data record; input of the data record into the string automaton; generation of a second, shorter data record by the string automaton, the record containing the variable values of the first data record and control symbols that are specific to the string automaton equipment, the symbols representing a switch from an automaton condition to a sequence condition; and transmission of the second data record to a similar string automaton, which interprets the control symbols, whereby a copy of the original data record with an identical data structure is generated.
-
Citations
30 Claims
-
1-10. -10. (canceled)
-
11. A method for compressing of a data record, the method comprising:
-
providing a string automaton in a compression apparatus, wherein the string automaton represents predefined structuring rules of the data record; inputting the data record into the string automaton, wherein the data record comprises structure tags and unstructured values and complies with the predefined structuring rules; and processing the input data record by the string automaton to thereby produce a compressed data record, wherein the compressed data record comprises the un-structured values of the data record and control symbols representing state transitions of the string automaton'"'"'s flow path caused by the structure tags of the input data record. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A method for decompressing a compressed data record, the method comprising:
-
providing a string automaton in a decompression apparatus, wherein the string automaton represents predefined structuring rules of the data record; inputting the compressed data record into the string automaton, wherein the compressed data record comprises control symbols for the string automaton and un-structured values, and complies with the predefined structuring rules; and processing the input compressed data record by the string automaton to generate a decompressed data record, wherein the string automaton replaces the control symbols by structure tags to thereby generate the decompressed data record comprising structure tags and un-structured values. - View Dependent Claims (21, 22, 23)
-
-
24. A compression apparatus for compressing of a data record, the compression apparatus comprising:
-
circuitry implementing a string automaton representing predefined structuring rules of the data record, wherein the circuitry implementing the string automaton is operable to process a data record input to the string automaton to thereby produce a compressed data record, wherein the input data record comprises structure tags and unstructured values and complies with the predefined structuring rules, wherein the circuitry implementing the string automaton is further operable to add to the compressed data record the unstructured values of the data record and control symbols representing state transitions of the string automaton'"'"'s flow path caused by the structure tags of the input data record. - View Dependent Claims (25, 29)
-
-
26. A decompression apparatus for decompressing a compressed data record, the decompression apparatus comprising:
-
circuitry implementing a string automaton representing predefined structuring rules of the data record, wherein the circuitry implementing the string automaton is operable to process a compressed data record input to the string automaton to thereby produce a decompressed data record, wherein the input compressed data record comprises control symbols and unstructured values and complies with the predefined structuring rules, and wherein the control symbols of the compressed data record describe a flow path of the string automaton, wherein the circuitry implementing the string automaton is further operable to replace the control symbols by structure tags to thereby generate the decompressed data record comprising structure tags and unstructured values. - View Dependent Claims (27, 28, 30)
-
Specification