US5666560A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Storage method and hierarchical padding structure for direct access storage device (DASD) data compression
Assignee: HGST Netherlands BV
•
Filing: 1995-08-03
•
Granted: 1997-09-09
•
Expires: 2015-08-03
Abstract
Abstract A data compression storage method and data compression hierarchical padding structure are provided for a direct access storage device (DASD) using fixed block architecture (FBA). A minimum page allocation defining a minimum number of sectors allocated for each logical compressed data page is selected. The DASD is segmented into at least one compression group. Each compression group has a fixed logical size and includes a selected number of DASD compressed data pages with an initial page allocation of a number of sectors. The initial page allocation is greater than or equal to the minimum page allocation. A minimum number of compressed data regions is allocated within each compression group. A selected number of additional compressed data regions including a plurality of sectors for padding is allocated within each compression group. The plurality of padding sectors are distributed between the compression pages. An exception region is allocated within each compression group. Compressed data is written to a selected DASD compressed data page and typically updated in place. Compressed data is written and updated to the selected DASD compressed data page using sector borrowing of available free sectors from adjacent pages if needed.
Inventors
- 👤 Daniel Frank Moertl
- 👤 John Douglas Stevens
- 👤 Gene Steven Van Grinsven
- 👤 Bruce Marshall Walk
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-02 21:21
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/06; G06F3/0601; G06F3/0602; G06F3/0608; G06F3/0628; G06F3/0629; G06F3/0631; G06F3/0638; G06F3/064; G06F3/0668; G06F3/0671; G06F3/0673; G06F3/0674; G11; G11B; G11B20/00; G11B20/00007; G11B20/10; G06F2212/00; G06F2212/40; G06F2212/401
Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
104 words
A data compression hierarchical padding structure for a computer readable direct access storage device (DASD) using fixed block architecture (FBA) comprising: storage, wherein said storage contains at least one compression group; each compression group having a fixed logical size including a selected number of compressed data pages with an initial page allocation of a number of sectors; each compression group having a selected minimum page allocation defining a minimum number of sectors allocated for each logical compressed data page; and each compression group having a selected number of additional padding sectors; said padding sectors being distributed to said selected number of compressed data pages.
Claim 2
Dependent Claim
104 words
A data compression hierarchical padding structure for a computer readable direct access storage device (DASD) using fixed block architecture (FBA) comprising: storage, wherein said storage contains at least one compression group; each compression group having a fixed logical size including a selected number of compressed data pages with an initial page allocation of a number of sectors; each compression group having a selected minimum page allocation defining a minimum number of sectors allocated for each logical compressed data page; and each compression group having a selected number of additional padding sectors; said padding sectors being distributed to said selected number of compressed data pages.
Claim 3
Dependent Claim
46 words
A data compression hierarchical padding structure for a direct access storage device (DASD) as recited in claim 1 wherein each compression group includes a minimum number of compression regions and a selected number of additional padding compression regions providing said selected number of additional padding sectors.
Claim 4
Dependent Claim
38 words
A data compression hierarchical padding structure for a direct access storage device (DASD) as recited in claim 1 wherein said initial page allocation of said number of sectors is greater than or equal to said minimum page allocation.
Claim 5
Dependent Claim
53 words
A data compression hierarchical padding structure for a direct access storage device (DASD) as recited in claim 1 wherein each compression group includes at least one compression region defining an exception region for storing a compression group directory and updated compressed data which exceeds an original storage space for corresponding original compressed data.
Claim 6
Dependent Claim
33 words
A data compression hierarchical padding structure for a direct access storage device (DASD) as recited in claim 1 wherein compressed data pages have a logical size equal to a host system page size.
Claim 7
Independent Claim
158 words
A method for storing compressed data in a direct access storage device (DASD) using fixed block architecture (FBA) comprising the computer executable steps of: selecting a minimum page allocation to define a minimum number of sectors allocated for each logical compressed data page; segmenting the DASD into at least one compression group; each compression group having a fixed logical size and including a selected number of compressed data pages with an initial page allocation of a number of sectors; said initial page allocation being greater than or equal to said minimum page allocation; allocating a minimum number of compressed data regions within each compression group; allocating a selected number of additional compressed data regions including a plurality of sectors for padding within each compression group; distributing said plurality of padding sectors between said compressed data pages; allocating an exception region within each compression group; and writing compressed data and updated compressed data to a selected compressed data page.
Claim 8
Independent Claim
158 words
A method for storing compressed data in a direct access storage device (DASD) using fixed block architecture (FBA) comprising the computer executable steps of: selecting a minimum page allocation to define a minimum number of sectors allocated for each logical compressed data page; segmenting the DASD into at least one compression group; each compression group having a fixed logical size and including a selected number of compressed data pages with an initial page allocation of a number of sectors; said initial page allocation being greater than or equal to said minimum page allocation; allocating a minimum number of compressed data regions within each compression group; allocating a selected number of additional compressed data regions including a plurality of sectors for padding within each compression group; distributing said plurality of padding sectors between said compressed data pages; allocating an exception region within each compression group; and writing compressed data and updated compressed data to a selected compressed data page.
Claim 9
Dependent Claim
93 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 6 wherein the step of writing compressed data and updated compressed data to said selected compressed data page includes the steps of: comparing the size of the compressed data or updated compressed data with an allocated space for said selected compressed data page; and when said allocated space is greater than or equal to the size of the compressed data or updated compressed data, writing the compressed data or updated compressed data within said allocated space.
Claim 10
Dependent Claim
68 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 7 further includes the step of: when said allocated space is less than the size of the compressed data or updated compressed data, comparing the size of the compressed data or updated compressed data with said allocated space for said selected compressed data page combined with free sectors from adjacent pages.
Claim 11
Dependent Claim
69 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 8 further includes the step of: when said allocated space combined with free sectors from adjacent pages is greater than or equal to the size of the compressed data or updated compressed data, writing the compressed data or updated compressed data within said allocated space combined with free sectors from adjacent pages.
Claim 12
Dependent Claim
65 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 9 further includes the step of: when said allocated space combined with free sectors from adjacent pages is less than the size of the compressed data or updated compressed data, comparing the size of the compressed data or updated compressed data with available space in said exception region.
Claim 13
Dependent Claim
63 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 10 further includes the step of: when said available space in said exception region is greater than or equal to the size of the compressed data or updated compressed data, writing the compressed data or updated compressed data within said available space in said exception region.
Claim 14
Dependent Claim
48 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 11 further includes the step of: when said available space in said exception region is less than the size of the compressed data or updated compressed data; reorganizing said compression group.
Claim 15
Dependent Claim
140 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 12 wherein the step of reorganizing said compression group includes the steps of: identifying an amount of DASD physical space required for the compression group utilizing an original compression group directory and said selected minimum page allocation, allocating a minimum number of compressed data regions within the compression group; allocating a selected number of additional compressed data regions including a plurality of sectors for padding within the compression group; distributing said plurality of padding sectors between said compressed data pages; allocating an exception region within the compression group; and generating a new compression group directory with all compressed data of said identified compression group reordered in ascending host logical block address sequence with said exception region being empty in a new compression group.
Claim 16
Dependent Claim
54 words
A method for storing compressed data in a direct access storage device (DASD) as recited in claim 13 further includes the steps of: utilizing said original compression group directory to read all data in said compression group; and utilizing said generated new compression group directory to write all data in said new compression group.
Claim 17
Independent Claim
136 words
A method for storing compressed data in a direct access storage device (DASD) using fixed block architecture (FBA) comprising the computer executable steps of: selecting a minimum page allocation to define a minimum number of sectors allocated for each logical compressed data page; segmenting the DASD into at least one compression group; each compression group having a fixed logical size; allocating a selected number of compressed data pages with an initial page allocation of a number of sectors within each compression group; said initial page allocation being greater than or equal to said minimum page allocation; distributing a selected number of padding sectors to said selected number of compressed data pages; and when writing compressed data to a selected compressed data page, dynamically using said padding sectors and available extra sectors from adjacent compressed data pages.
Claim 18
Independent Claim
136 words
A method for storing compressed data in a direct access storage device (DASD) using fixed block architecture (FBA) comprising the computer executable steps of: selecting a minimum page allocation to define a minimum number of sectors allocated for each logical compressed data page; segmenting the DASD into at least one compression group; each compression group having a fixed logical size; allocating a selected number of compressed data pages with an initial page allocation of a number of sectors within each compression group; said initial page allocation being greater than or equal to said minimum page allocation; distributing a selected number of padding sectors to said selected number of compressed data pages; and when writing compressed data to a selected compressed data page, dynamically using said padding sectors and available extra sectors from adjacent compressed data pages.
Claim 19
Dependent Claim
147 words
A computer program product for use in a computer system having a processor, and a direct access storage device (DASD) using fixed block architecture (FBA), the computer program product comprising: a computer readable recording medium; means, recorded on the recording medium, for selecting a minimum page allocation to define a minimum number of sectors allocated for each logical compressed data page; means, recorded on the recording medium, for segmenting the DASD into at least one compression group; each compression group having a fixed logical size and including a selected number of compressed dam pages with an initial page allocation of a number of sectors; and having a selected number of additional padding sectors; said padding sectors being distributed to said selected number of compressed data pages; and means, recorded on the recording medium, for writing compressed data and updated compressed data to a selected compressed data page.
Claim 20
Dependent Claim
147 words
A computer program product for use in a computer system having a processor, and a direct access storage device (DASD) using fixed block architecture (FBA), the computer program product comprising: a computer readable recording medium; means, recorded on the recording medium, for selecting a minimum page allocation to define a minimum number of sectors allocated for each logical compressed data page; means, recorded on the recording medium, for segmenting the DASD into at least one compression group; each compression group having a fixed logical size and including a selected number of compressed dam pages with an initial page allocation of a number of sectors; and having a selected number of additional padding sectors; said padding sectors being distributed to said selected number of compressed data pages; and means, recorded on the recording medium, for writing compressed data and updated compressed data to a selected compressed data page.
Claim 21
Dependent Claim
94 words
A computer program product as recited in claim 16 wherein said means, recorded on the recording medium, for writing compressed data and updated compressed data to said selected compressed data page include; means for comparing the size of the compressed data or updated compressed data to be written with an allocated space for said selected compressed data page; and means, responsive to said allocated space being greater than or equal to the size of the compressed data or updated compressed data, for writing the compressed data or updated compressed data within said allocated space.
Claim 22
Dependent Claim
67 words
A computer program product as recited in claim 17 further includes; means, responsive to said allocated space being less than the size of the compressed data or updated compressed data, for identifying free sectors from adjacent pages and for comparing the size of the compressed data or updated compressed data with said allocated space for said selected compressed data page combined with free sectors from adjacent pages.
Claim 23
Dependent Claim
60 words
A computer program product as recited in claim 18 further includes; means, responsive to said allocated space combined with free sectors from adjacent pages being greater than or equal to the size of the compressed data or updated compressed data, for writing the compressed data or updated compressed data within said allocated space combined with free sectors from adjacent pages.
Claim 24
Dependent Claim
89 words
A computer readable storage device, comprising: storage, wherein said storage contains at least one compression group; each compression group having a fixed logical size including a selected number of compressed data pages with an initial page allocation of a number of sectors; each compression group having a selected minimum page allocation defining a minimum number of sectors allocated for each logical compressed data page; and each compression group having a selected number of additional padding sectors; said padding sectors being distributed to said selected number of compressed data pages.
Claim 25
Dependent Claim
89 words
A computer readable storage device, comprising: storage, wherein said storage contains at least one compression group; each compression group having a fixed logical size including a selected number of compressed data pages with an initial page allocation of a number of sectors; each compression group having a selected minimum page allocation defining a minimum number of sectors allocated for each logical compressed data page; and each compression group having a selected number of additional padding sectors; said padding sectors being distributed to said selected number of compressed data pages.
Claim 26
Dependent Claim
37 words
The storage device as recited in claim 20, wherein each compression group further comprises a minimum number of compression regions and a selected number of additional padding compression regions providing said selected number of additional padding sectors.
Claim 27
Dependent Claim
28 words
A storage device as recited in claim 20, wherein said initial page allocation of said number of sectors is greater than or equal to said minimum page allocation.
Claim 28
Dependent Claim
44 words
A storage device as recited in claim 20, wherein each compression group further comprises at least one compression region defining an exception region for storing a compression group directory and updated compressed data which exceeds an original storage space for corresponding original compressed data.
Claim 29
Dependent Claim
23 words
A storage device as recited in claim 20, wherein compressed data pages have a logical size equal to a host system page size.
References Cited (Backward Citations)
US4499539A
Cited
US5021946A
Cited
US5113512A
Cited
US5325347A
Cited
US5410671A
Cited
US5237675A
Cited
US5390315A
Cited
US5394534A
Cited
US5488364A
Cited
US5537658A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2000-09-08 | 2001-03-10 | 2001-09-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2004-09-08 | 2005-03-10 | 2005-09-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2008-09-08 | 2009-03-10 | 2009-09-09 | $7700.00 | Window Closed / Lapsed |