← Back to Patent Explorer
EP0789309A2 Expired / Lapsed EP ⏱️ 0.0 years remaining

Compression of structured data

Assignee: International Business Machines Corp
•
Filing: 1997-01-29
•
Granted: —
•
Expires: 2017-01-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The present invention provides a system and method for compressing a data sequence comprising a plurality of records, each record having a plurality of fields and each field being arranged to contain a data item. The system comprises: comparison means which, for a current field within a current record other than the first record in the data sequence, is arranged to compare the data item in the current field with the data item in the corresponding field of a preceding record; and match indication means, responsive to a signal from the comparison means indicating that the data item matches the data item in the corresponding field, for replacing the current field data item by a token indicating the match. The comparison means is arranged to repetitively perform the comparison process on a predetermined number of fields in a plurality of records of the data sequence. Preferably the system is incorporated within a server computer, the server being arranged to output the data records of the data sequence as compressed by the system for transfer over a network to a client computer. The technique of the present invention is a very quick algorithm, taking very little resource. It does not prevent the use of more traditional compression techniques, and is simple. Further, it recognises the field structure of the data and uses this as a method to achieve good compression. Its algorithm is not affected by the host computer architecture nor that of the transport layers. Additionally, it can reduce the CPU resources required at the client side, thereby improving performance above and beyond the data reductions.

Inventors

  • 👤 Keith Holmes

Bibliographic Details

Application Number —
Jurisdiction EP
Data Source google_patents
Last Synchronized 2026-10-24 20:42
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/28; G06F16/284; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99942

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 121 words
A method of compressing a data sequence comprising a plurality of records, each record having a plurality of fields and each field being arranged to contain a data item, the method comprising the steps of: (a) for a current field within a current record other than the first record in the data sequence: (i) comparing (250) the data item in the current field with the data item in the corresponding field of a preceding record; (ii) if the data item matches the data item in the corresponding field, replacing (270) the current field data item by a token indicating the match; and (b) repeating step (a) for a predetermined number of fields in a plurality of records of the data sequence.
Claim 2
Dependent Claim 26 words
A method as claimed in Claim 1, wherein said step (a) is repeated for said predetermined number of fields in every record of the data sequence.
Claim 3
Dependent Claim 23 words
A method as claimed in Claim 1 or Claim 2, wherein the predetermined number of fields is every field in the current record.
Claim 4
Independent Claim 94 words
A method as claimed in any of claims 1 to 3, wherein, at step (a) (i), the data item in the current field is compared with the data item in the corresponding field of the immediately preceding record, and the method further comprises, subsequent to performing the comparison step (a) for the predetermined number of fields in the current record, the step (290) of storing the uncompressed current record as the immediately preceding record for use in the performance of said step (a) (i) on the predetermined number of fields of a subsequent record.
Claim 5
Independent Claim 52 words
A method as claimed in preceding claim, wherein steps (a) and (b) are performed by a processor of a server computer (30), the method comprising the further step of sending the data records of the data sequence as compressed by steps (a) and (b) over a network to a client computer (10).
Claim 6
Independent Claim 16 words
A method as claimed in any preceding claims wherein the token is a predetermined single character.
Claim 7
Dependent Claim 14 words
A method as claimed in Claim 6, wherein the token is the '.' character.
Claim 8
Independent Claim 82 words
A method of decompressing a data sequence compressed according to the method as claimed in any preceding claim, comprising the steps of: (A) for each field within a current record other than the first record in the data sequence: determining whether the field contains the token; if the field does contain the token, replacing the token by the data item in the corresponding field of a preceding record; and (B) repeating step (A) for a plurality of records of the data sequence.
Claim 9
Independent Claim 143 words
A system for compressing a data sequence comprising a plurality of records, each record having a plurality of fields and each field being arranged to contain a data item, the system comprising: comparison means (60) which, for a current field within a current record other than the first record in the data sequence, is arranged to compare the data item in the current field with the data item in the corresponding field of a preceding record; and match indication means (70), responsive to a signal from the comparison means (60) indicating that the data item matches the data item in the corresponding field, for replacing the current field data item by a token indicating the match; the comparison means (60) being arranged to repetitively perform the comparison process on a predetermined number of fields in a plurality of records of the data sequence.
Claim 10
Dependent Claim 32 words
A system as claimed in Claim 9, wherein the comparison means (60) is arranged to perform the comparison process on the predetermined number of fields in every record of the data sequence.
Claim 11
Dependent Claim 23 words
A system as claimed in Claim 9 or Claim 10, wherein the predetermined number of fields is every field in the current record.
Claim 12
Independent Claim 101 words
A system as claimed in any of claims 9 to 11, wherein the comparison means (60) is arranged to compare the data item in the current field with the data item in the corresponding field of the immediately preceding record, and the system further comprises storing means operable, subsequent to the comparison means having performed the comparison for the predetermined number of fields in the current record, to store (290) the uncompressed current record as the immediately preceding record for use by the comparison means (60) when performing the comparison step on the predetermined number of fields of a subsequent record.
Claim 13
Independent Claim 49 words
A system as claimed in any of claims 9 to 12, wherein the system is incorporated within a server computer (30), the server being arranged to output the data records of the data sequence as compressed by the system for transfer over a network to a client computer (10).
Claim 14
Independent Claim 19 words
A system as claimed in any of claims 9 to 13, wherein the token is a predetermined single character.

References Cited (Backward Citations)

No citation records indexed.

USPTO Annuity & Maintenance Windows

Maintenance schedule is calculated for granted US utility patents.

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag