Patent US5280600A successfully refreshed from Google Patents.
US5280600A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Storage of compressed data with algorithm
Assignee: HP Inc
•
Filing: 1991-01-18
•
Granted: 1994-01-18
•
Expires: 2011-01-18
Abstract
Abstract The present invention provides a data storage method for storing compressed user data and associated information on magnetic tape. User data from a host computer is organized into a plurality of records. The user data is then compressed according to a compression algorithm. The compressed data and information related to the data compression (DC) algorithm are then stored on magnetic tape. The DC algorithm information pertains to at least one stored record of compressed data and is stored in a record header field. The DC algorithm information may provide for example, an algorithm number and/or an indicator for starting a data dictionary used for data compression and decompression. The user data may further be organized into groups having a group index for incorporating the DC algorithm information. The data records may be further organized into entities having at least one record. The DC algorithm information associated with an entity is incorporated into the group index of the group in which the entity of records is contained.
Inventors
- 👤 David J. Van Maren
- 👤 Peter Bramhall
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 06:21
CPC Classifications
G; G11; G11B; G11B20/00; G11B20/00007
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
63 words
A data storage method for storing compressed user data and associated information on tape comprising the steps of: accepting user data organized into a plurality of records; compressing the user data according to a data compression (DC) algorithm; writing the compressed user data to the tape, and writing information indicative of the DC algorithm used to compress the user data to the tape.
Claim 2
Dependent Claim
63 words
A data storage method for storing compressed user data and associated information on tape comprising the steps of: accepting user data organized into a plurality of records; compressing the user data according to a data compression (DC) algorithm; writing the compressed user data to the tape, and writing information indicative of the DC algorithm used to compress the user data to the tape.
Claim 3
Dependent Claim
29 words
The method according to claim 1 further comprising the step of writing the DC algorithm information to the tape so that it is associated with at least open record.
Claim 4
Dependent Claim
26 words
The method according to claim 2, further comprising the step of writing the DC algorithm information into a header field associated with at least one record.
Claim 5
Dependent Claim
16 words
The method according to claim 1, wherein the DC algorithm information comprises a DC algorithm number.
Claim 6
Dependent Claim
46 words
The method according to claim 1, wherein the DC algorithm information further comprises information identifying a starting point in the user data at which codewords are generated from a sequence of the user data beginning at the point, the codewords so generated forming a data dictionary.
Claim 7
Dependent Claim
24 words
The method according to claim 1, wherein the DC algorithm information further comprises information indicating that the user data has not undergone data compression.
Claim 8
Dependent Claim
38 words
The method according to claim 1, further comprising the step of writing user data to the tape in groups independently of record structure, each group having an associated index containing information indicative of the contents of the group.
Claim 9
Dependent Claim
20 words
The method according to claim 7, further comprising the step of writing the DC algorithm information to the group indices.
Claim 10
Dependent Claim
35 words
The method according to claim 7, further comprising the steps of: organizing records into entities, each entity comprising at least one record; and writing the DC algorithm information related to the entities to the tape.
Claim 11
Dependent Claim
30 words
The method according to claim 9, further comprising the step of writing the DC algorithm information to the tape so that the information is associated with at least one entity.
Claim 12
Independent Claim
72 words
An apparatus for storing compressed user data and associated information on tape comprising: interface means for accepting user data organized into a plurality of records; compression means for compressing the user data according to a data compression (DC) algorithm; first writing means for writing the compressed user data to the tape, and second writing means for writing information indicative of the DC algorithm used to compress the user data to the tape.
Claim 13
Independent Claim
72 words
An apparatus for storing compressed user data and associated information on tape comprising: interface means for accepting user data organized into a plurality of records; compression means for compressing the user data according to a data compression (DC) algorithm; first writing means for writing the compressed user data to the tape, and second writing means for writing information indicative of the DC algorithm used to compress the user data to the tape.
Claim 14
Dependent Claim
29 words
The apparatus according to claim 11, wherein the second writing means writes the DC algorithm information to the tape so that it is associated with at least one record.
Claim 15
Dependent Claim
26 words
The apparatus according to claim 12, wherein the second writing means writes the DC algorithm information into a header field associated with at least one record.
Claim 16
Dependent Claim
16 words
The apparatus according to claim 11, wherein the DC algorithm information comprises a DC algorithm number.
Claim 17
Dependent Claim
46 words
The apparatus according to claim 11, wherein the DC algorithm information further comprises information identifying a starting point in the user data at which codewords are generated from a sequence of the user data beginning at the point, the codewords so generated forming a data dictionary.
Claim 18
Dependent Claim
24 words
The apparatus according to claim 11, wherein the DC algorithm information further comprises information indicating that the user data has not undergone data compression.
Claim 19
Dependent Claim
39 words
The apparatus according to claim 11, further comprising a grouping means for writing user data to the tape in groups independently of record structure, each group having an associated index containing information indicative of the contents of the group.
Claim 20
Dependent Claim
20 words
The apparatus according to claim 17, wherein the second writing means writes the DC algorithm information to the group indices.
Claim 21
Dependent Claim
39 words
The apparatus according to claim 17, further comprising: entity means for organizing records into entities, each entity comprising at least one record, wherein the second writing means writes the DC algorithm information related to the entities to the tape.
Claim 22
Dependent Claim
30 words
The apparatus according to claim 19, wherein the second writing means writes the DC algorithm information to the tape so that the information is associated with at least one entity.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-01-17 | 1997-07-19 | 1998-01-18 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-01-17 | 2001-07-19 | 2002-01-18 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-01-17 | 2005-07-19 | 2006-01-18 | $7700.00 | Window Closed / Lapsed |