Method of storing compressed data

• US 20050257019A1
• Filed: 05/13/2004
• Published: 11/17/2005
• Est. Priority Date: 05/13/2004
• Status: Active Grant

• Current Assignee: Primax Electronics Limited
• Original Assignee: Primax Electronics Limited
• Inventors: He, Jun
• Granted Patent: US 7,246,132 B2
• Time in Patent Office: Days
• US Class Current: 711/170
• CPC Class Codes: G06F 12/023 Free address space management
• CPC Class Codes: G06F 2212/401 Compressed data
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

A method of storing compressed data first compresses source data, generating compressed data, and computes the total compression length in each row of the compressed data. The number of rows of compressed data that the biggest memory block can accommodate is computed according to the total compression length of each row. The system receives an application for the required memory blocks for those rows of data. Finally, the system allocated memory blocks are received for storing the compressed data. Therefore, the system and method realize dynamical row storage of compressed data, which make good use of fragmented memory in the system.

Claims

1. A method of storing compressed data for dynamically storing compressed data in rows according to the size of largest memory space, the method comprising the steps of:

compressing source data to generated the compressed data;

computing the total compression length of each row in the compressed data;

extracting the currently largest memory space;

computing the number of rows of the compressed data that fits into the largest memory space according to the total compression length of each row;

applying for the required memory space for corresponding rows of the compressed data from the system; and

receiving the memory space allocated by the system and storing corresponding rows of the compressed data into the memory space.

2. The method of claim 1 further comprising the step of initializing the system through the steps of:

allocating a memory space for the source data; and

allocating a memory space for the compression function.

3. The method of claim 1, wherein the format of the compressed data is “

length of a row+the compressed data of the row.”

4. The method of claim 1, wherein the total compression length is the number of bits occupied by the compression length data of a row and the compressed data of the row.

5. The method of claim 1, wherein the step of extracting the currently largest memory space is achieved using the API function.

6. The method of claim 1, wherein the step of applying for the required memory space for corresponding rows of the compressed data from the system is comprising accumulating the memory size required for storing the compression data and applying the required size of memory from the system.

7. The method of claim 1 further comprising the step of determining whether there are still unsaved rows in the compressed data.

8. The method of claim 7, wherein the determination method refers to the quantity defined by the difference between the height of the source data and the number of rows that have been saved.

9. The method of claim 7, wherein if there are unsaved rows in the current compressed data the steps from extracting the currently largest memory space on are repeated until all the compressed data are saved.