CN103049388B - A kind of Compression manager method of Fragmentation device and device - Google Patents

A kind of Compression manager method of Fragmentation device and device Download PDF

Info

Publication number
CN103049388B
CN103049388B CN201210519408.0A CN201210519408A CN103049388B CN 103049388 B CN103049388 B CN 103049388B CN 201210519408 A CN201210519408 A CN 201210519408A CN 103049388 B CN103049388 B CN 103049388B
Authority
CN
China
Prior art keywords
page data
written
write
dictionary
page
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201210519408.0A
Other languages
Chinese (zh)
Other versions
CN103049388A (en
Inventor
郭丹
梁小庆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZHONGSHAN JIANGBOLONG ELECTRONICS CO., LTD.
Original Assignee
Shenzhen Netcom Electronics Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Netcom Electronics Co Ltd filed Critical Shenzhen Netcom Electronics Co Ltd
Priority to CN201210519408.0A priority Critical patent/CN103049388B/en
Publication of CN103049388A publication Critical patent/CN103049388A/en
Application granted granted Critical
Publication of CN103049388B publication Critical patent/CN103049388B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

The present invention is applicable to memory technology field, provide a kind of Compression manager method and device of Fragmentation device, described method comprises: be that unit sets up dictionary with page, records the physical page address of page data, described page data characteristic of correspondence code and described page data write in described dictionary; Obtain write order, described write order includes the logical page address of page data to be written and described page data write to be written; Obtain the condition code of page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.The problem of management of the memory device being minimum memory unit effectively can be solved with page by the present invention.

Description

A kind of Compression manager method of Fragmentation device and device
Technical field
The invention belongs to memory technology field, particularly relate to a kind of Compression manager method and device of Fragmentation device.
Background technology
Current general data compression method comprises lossless data compression and damages data compression, and the compress technique as Corpus--based Method model and the compress technique based on dictionary model are lossless data compression technology; Multimedia data compression comprises audio compression, compression of images, video compress etc. and is then mostly and damages data compression technique; For memory device, harmless data compression scheme must be used.
Existing lossless data compression mode comprises:
One, dictionary type data compression method, as shown in table 1:
Index String
1 Prince
2 Love
3 Princess
4 Forever
Table 1
Such as need compression Yes! The dictionary that PrincelovePrincessforever then provides according to table 1 obtains compression result:
& 1 & 2 & 3 & 4(wherein & is special symbol, if need to export &, packed data is & &)
Shortcoming: size and the quality of dictionary directly affect compression result.Then cannot compress completely.
Two, run-length encoding type data compression method
The ultimate principle of run-length encoding is: the continuous symbol (continuous symbol constitutes one section of continuous print " stroke ") by a value of symbol or the long replacement of string with identical value, makes symbol lengths be less than the length of raw data.When the code of each row or each column data changes, once record the number that this code and same code repeat, thus realize the compression of data.
Such as: 5555557777733322221111111
Run-length encoding is: (5,6) (7,5) (3,3) (2,4) (1,7).Visible, the figure place of run-length encoding is far less than the figure place of original character string.
But, not all run-length encoding all far less than the figure place of original character string, such as: 555555 is 6 characters, and (5,6) are 5 characters, and this also exists the problem of decrement.In addition, run-length encoding may than no compression is also not large for the compression coding out of random data.
Three, Huffman type data compression method
Existing Huffman type data compression method needs when carrying out data compression to build Huffman tree, and space expense is excessive.And, length after compression is a changing value, being not easy to take page as the memory device of minimum memory unit, such as, when the data of 8k being compressed, having compressed may be 7.5k, for the memory device taking page as minimum memory unit, if the size of its page is 8k, then after compression, remaining 0.5k cannot use substantially.
In sum, there is following problem in existing data compression method: (1) is excessive or too high to storage space requirement to computing overhead; (2) effect compressed cannot ensure; (3) compression result be not easy to page be minimum memory unit memory device management.
Summary of the invention
The object of the embodiment of the present invention is a kind of Compression manager method providing Fragmentation device, to solve that existing Compression manager method is excessive or too high to storage space requirement to computing overhead, compression effectiveness cannot ensure and compression result is not easy to the problem of the memory device management taking page as minimum memory unit.
The embodiment of the present invention is achieved in that a kind of Compression manager method of Fragmentation device, and described method comprises:
Steps A, be that unit sets up dictionary with page, in described dictionary, record the physical page address of page data, described page data characteristic of correspondence code and described page data write;
Step B, acquisition write order, described write order includes the logical page address of page data to be written and described page data write to be written; Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.
Another object of the embodiment of the present invention is the Compression manager device providing a kind of Fragmentation device, and described device comprises:
Unit set up by dictionary, for being that unit sets up dictionary with page, records the physical page address of page data, described page data characteristic of correspondence code and described page data write in described dictionary;
Processing unit, for obtaining write order, described write order includes the logical page address of page data to be written and described page data write to be written; Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.
As can be seen from technique scheme, in the embodiment of the present invention, the least unit of data compression is page, data in page do not carry out compression and decompression, the writing and reading of data are also in units of page, and the Compression manager method that therefore embodiment of the present invention provides is applicable to adopting the Fragmentation device that arithmetic capability is not enough or cost is low very much.And the Compression manager method that the embodiment of the present invention provides, data to be written in current write order stored in dictionary, then do not write data, therefore effectively can improve the data write efficiency of Fragmentation device, reduce the write number of times of data, and then reduce the wearing and tearing of Fragmentation device.
Accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the realization flow figure of the Fragmentation device Compression manager method that the embodiment of the present invention one provides;
Fig. 2 is the realization flow figure of the Fragmentation device Compression manager method that the embodiment of the present invention two provides;
Fig. 3 is the realization flow figure of the Fragmentation device Compression manager method that the embodiment of the present invention three provides;
Fig. 4 is the composition structural drawing of the Fragmentation device Compression manager device that the embodiment of the present invention four provides.
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
In order to technical solutions according to the invention are described, be described below by specific embodiment.
embodiment one:
Fig. 1 shows the realization flow of the Fragmentation device Compression manager method that the embodiment of the present invention one provides, and details are as follows for the method process:
In step S101, be that unit sets up dictionary with page, in described dictionary, record the information such as the physical page address of page data, described page data characteristic of correspondence code and described page data write.
In the present embodiment, described Fragmentation device is take page as the memory device of minimum memory unit, namely presses block erasing, memory device by page read-write, such as flash storage device etc.Described page data is the data stored in page.
In step s 102, obtain write order, described write order includes the information such as the logical page address of page data to be written and described page data write to be written.
In step s 103, obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary, if judged result is "Yes", then perform step S105, if judged result is "No", then perform step S104.
In the present embodiment, obtain the condition code of described page data to be written, all condition codes in the condition code of acquisition and described dictionary are compared, judge whether there is the condition code identical with obtained condition code in described dictionary, if, then represent that page data to be written in current write order is stored in described dictionary, perform step S105; If not, step S104 is performed.
In the condition code of page data to be written described in the present embodiment and described dictionary, the condition code of page data all can adopt identical algorithm to obtain.Preferably, obtained by hash algorithm.Other algorithms can certainly be adopted to obtain, at this not in order to limit the present invention.
Hash (Hash) algorithm belongs to and carries out message extracts to large data, obtains the condition code of this segment data, is mainly used in password authentification and data integrity validation, also may be used for judging that whether two segment datas are identical fast simultaneously.
For MD5 hash algorithm, such as, in table 2 following several segment datas:
Page data MD5 value
1234567890abcdefg 7206ddfa511b6ab05734b603c1b88be6
2234567890abcdefg 628cb0947d31075fa305699029ddfecc
0234567890abcdefg df9e94f848b6608dd2af317b693744ba
1234567890abcdefgh ad91a28a12e83ce4999b23260f7785c3
1234567890abcdef 996ce17f6abc9fe126b57aa5f1d8c92c
1234567890abcdefg 7206ddfa511b6ab05734b603c1b88be6
Table 2
As can be seen from Table 2, even if page data only changes a little, the condition code after hash algorithm calculates all can produce and significantly change, and therefore adopts hash algorithm to calculate condition code, can reduce the repetition rate of coding.
In step S104, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written, be stored to the physical address corresponding with described logical address by described page data to be written.
In step S105, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.
In the present embodiment, write before page data to be written in described write order, when being namely present in Fragmentation device, do not perform described write command, the physical page address that the page data that the logical page address sensing only write by described page data to be written and described page data to be written have same characteristic features code writes, and these data of reminding user write, therefore the data write efficiency of Fragmentation device can effectively be improved, reduce the write number of times of data, and then reduce the wearing and tearing of Fragmentation device.
It should be noted that, the page data address of recording in dictionary described in the present embodiment is physical page address, but also can be logical page address, it is out-of-date to have write before page data to be written in write order, only the write logical page address of page data to be written in current write order need be pointed to the logical page address of the raw data write with same characteristic features code.In addition, when record be logical page address time, need logical page address to be converted to physical page address when sense data.
As another preferred embodiment of the present invention, in order to reduce the repetition rate of coding, the condition code of page data to be written in described acquisition write order, judges whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, do not perform described write order, the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes specifically comprised:
When multiple hash algorithm supported by described Fragmentation device, carry out repeatedly message to the page data to be written in current write order to take passages, obtain the condition code after each message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages with described each message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after message extracts;
Or, when a kind of hash algorithm supported by described Fragmentation device, the message of the page data to be written in current write order being carried out repeatedly to different skew is taken passages, obtain the condition code after each different offset message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages from described each different offset message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after different offset message extracts;
Or, when described Fragmentation device is supported bug check and is corrected ECC code, obtain the ECC code of page data to be written in current write order and message take passages after condition code, judge the condition code after whether simultaneously there is this ECC code and message extracts in described dictionary, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code after the ECC code of page data and message extracts;
Or, obtain the condition code of page data to be written in current write order, when there is the condition code identical with obtained condition code in described dictionary, judge that whether the N number of byte in the page data that N number of byte in described page data to be written is corresponding with same characteristic features code in described dictionary is all identical, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, wherein said N is the integer being greater than zero and being less than or equal to the size of page in described paging memory, if namely in described paging memory, the size of page is 8k byte, then described N is less than or equal to 8k byte.It should be noted that, in order to not affect efficiency of data compression, above-mentioned comparison procedure can adopt hardware comparator to realize.
Preferably, in order to ensure when dictionary is larger, can improve the efficiency of data compression further, the condition code of page data to be written in described acquisition write order, judges whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, do not perform described write order, the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes specifically comprised:
Obtain the condition code of page data to be written in current write order, message is carried out to described condition code and takes passages acquisition secondary extracts value, judge in described dictionary, whether to there is described secondary extracts value, if exist, judge whether there is described condition code in described dictionary again, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, in wherein said dictionary, record the secondary extracts value of page data character pair code.Wherein, described secondary extracts value be less than condition code size and the repetition rate of coding allow scope in.
In the present embodiment, set up feature code table and secondary extracts value table in advance, described feature code table and secondary extracts value table are respectively used to the condition code of record page data and the secondary extracts value of described condition code.Owing to just starting the secondary extracts value table only needing matched data amount little, only when there is identical secondary extracts value, just needing to compare the large feature code table of data volume, therefore, it is possible to greatly improve matching efficiency, and then improving efficiency of data compression.
Describe in detail below by way of illustrating:
When dictionary is larger, such as there are 1024 pages, the condition code that every page data adopts hash algorithm to carry out and generates after message is taken passages is 32 bytes, then the feature code table generated has 1024 × 32 bytes, carries out searching for System Hardware Requirement higher in such scope.So carry out secondary extracts to described feature code table, this secondary take passages after value much smaller than 32 bytes, and the repetition rate of coding allow scope in, as shown in table 3.
Raw data Feature code value Secondary extracts value
555555555555555555 130668ae34911a14e4288367b071447a 130668ae
aaaaaaaaaaaaaaaaaaaa 22d42eb002cefa81e9ad604ea57bc01d 22d42eb0
000000000000000000 3ea032bf79e8c116b05f4698d5a8e044 3ea032bf
ffffffffffffffffffffffffffffffff c78068577ec5dc1d06605f291a79174f c7806857
Table 3
Getting front 4 bytes of feature code value (MD5 value) in table 3 is secondary cryptographic hash (secondary extracts value), for whether there being the secondary extracts value of coupling in fast search feature code table, if there is the value identical with the secondary extracts value of page data to be written in current write order in dictionary, then carry out the coupling of feature code value again.
In the present embodiment, the least unit of data compression is page, data in page do not carry out compression and decompression, the writing and reading of data are also in units of page, and the Compression manager method that therefore embodiment of the present invention provides is applicable to adopting the Fragmentation device that arithmetic capability is not enough or cost is low very much.And the Compression manager method that the embodiment of the present invention provides, data to be written in current write order stored in dictionary, then do not write data, therefore effectively can improve the data write efficiency of Fragmentation device, reduce the write number of times of data, and then reduce the wearing and tearing of Fragmentation device.
embodiment two:
Fig. 2 shows the realization flow of the Fragmentation device Compression manager method that the embodiment of the present invention two provides, and details are as follows for the method process:
In step s 201, be that unit sets up static dictionary with page, record write number of times in described static dictionary and be greater than or equal to the information such as the physical page address of page data, described page data characteristic of correspondence code and the described page data write that the page data of first threshold and/or user are concerned about.
In the present embodiment, described static dictionary is fixed in described Fragmentation device, and do not allow the dictionary upgraded, described static dictionary can create according to following condition:
1, according to the memory capacity of described Fragmentation device, setting meets the dictionary size (memory capacity) of certain proportion (as 1%), and such as, when the memory capacity of Fragmentation device is 100M, the size (memory capacity) of dictionary is 1M;
2, sample in a large number according to the main range of application of described Fragmentation device, after statistical study, draw best dictionary; Such as, write number of times is greater than or equal to the data of first threshold (10 times) as the page data in dictionary;
3, self needs (i.e. the data of user's care) are selected according to user, setting dictionary content.
In step S202, obtain write order, described write order includes the information such as the logical page address of page data to be written and described page data write to be written;
In step S203, obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary, if judged result is "Yes", then perform step S205, if judged result is "No", then perform step S204;
Preferably, judge whether there is the condition code identical with obtained condition code in described static dictionary, if judged result is "Yes", then perform step S205, if judged result is "No", then perform step S204;
In step S204, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written, be stored to the physical address corresponding with described logical address by described page data to be written;
In step S205, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.
As another preferred embodiment of the present invention, in order to reduce the repetition rate of coding, the condition code of page data to be written in described acquisition write order, judges whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, do not perform described write order, the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes specifically comprised:
When multiple hash algorithm supported by described Fragmentation device, carry out repeatedly message to the page data to be written in current write order to take passages, obtain the condition code after each message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages with described each message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after message extracts;
Or, when a kind of hash algorithm supported by described Fragmentation device, the message of the page data to be written in current write order being carried out repeatedly to different skew is taken passages, obtain the condition code after each different offset message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages from described each different offset message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after different offset message extracts;
Or, when described Fragmentation device is supported bug check and is corrected ECC code, obtain the ECC code of page data to be written in current write order and message take passages after condition code, judge the condition code after whether simultaneously there is this ECC code and message extracts in described dictionary, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code after the ECC code of page data and message extracts;
Or, obtain the condition code of page data to be written in current write order, when there is the condition code identical with obtained condition code in described dictionary, judge that whether the N number of byte in the page data that N number of byte in described page data to be written is corresponding with same characteristic features code in described dictionary is all identical, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, wherein said N is the integer being greater than zero and being less than or equal to the size of page in described paging memory, if namely in described paging memory, the size of page is 8k byte, then described N is less than or equal to 8k byte.It should be noted that, in order to not affect efficiency of data compression, above-mentioned comparison procedure can adopt hardware comparator to realize.
Preferably, in order to ensure when dictionary is larger, can improve the efficiency of data compression further, the condition code of page data to be written in described acquisition write order, judges whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, do not perform described write order, the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes specifically comprised:
Obtain the condition code of page data to be written in current write order, message is carried out to described condition code and takes passages acquisition secondary extracts value, judge in described dictionary, whether to there is described secondary extracts value, if exist, judge whether there is described condition code in described dictionary again, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, in wherein said dictionary, record the secondary extracts value of page data character pair code.Wherein, described secondary extracts value be less than condition code size and the repetition rate of coding allow scope in.
In the present embodiment, set up feature code table and secondary extracts value table in advance, described feature code table and secondary extracts value table are respectively used to the condition code of record page data and the secondary extracts value of described condition code.Owing to just starting the secondary extracts value table only needing matched data amount little, only when there is identical secondary extracts value, just needing to compare the large feature code table of data volume, therefore, it is possible to greatly improve matching efficiency, and then improving efficiency of data compression.
In the present embodiment, judge whether described page data to be written writes before, owing to comprising the data of regular write in this static dictionary, thus effectively can improve the efficiency of judgement according to the static dictionary set up in advance.
embodiment three:
Fig. 3 shows the realization flow of the Fragmentation device Compression manager method that the embodiment of the present invention three provides, and details are as follows for the method process:
In step S301, be that unit sets up dynamic dictionary with page, in described dynamic dictionary, record the information such as the physical page address of page data, described page data characteristic of correspondence code and described page data write.
In the present embodiment, described dynamic dictionary is the dictionary allowing to be updated.
In step s 302, setting Second Threshold (such as 10 times), counts the write number of times of the page data of write Fragmentation device.
In step S303, obtain write order, described write order includes the logical page address of page data to be written and described page data write to be written.
In step s 304, obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dynamic dictionary, if judged result is "Yes", then perform step S305, if judged result is "No", then perform step S306.
In step S305, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.
In step S306, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written.
In step S307, judge whether the write number of times of described page data to be written reaches described Second Threshold, if judged result is "Yes", then perform step S308, if judged result is "No", then terminate this operation.
In step S308, this page data to be written is updated in described dynamic dictionary.
Specifically comprise this page data to be written, this page data characteristic of correspondence code to be written and the write of this page data to be written the information updating such as physical page address in described dynamic dictionary.
As another preferred embodiment of the present invention, in order to prevent described dynamic dictionary from becoming increasing, affecting the efficiency of data compression and search, also comprising:
When the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete entry invalid in described dynamic dictionary or untapped entry in Preset Time, described invalid entry is that the writing address of the page data stored in described dynamic dictionary has been written with other data, causes this page data invalid; In described Preset Time, untapped entry is that page data corresponding to this entry did not write paging memory part in Preset Time.
Or, continue to count the write number of times of described page data after the write number of times of described page data reaches described Second Threshold, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete in described dynamic dictionary the page data writing number of times and be less than the 4th threshold value.The page data write number of times of such as full 0 x8f reaches 10 times, then this page data is updated to described dynamic dictionary, but the counting of each page data is still in continuation in described dynamic dictionary, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, when the write number of times of full 0 x8f page data is less than the 4th threshold value (as 15 times), full 0 x8f page data is deleted from described dynamic dictionary.
As another preferred embodiment of the present invention, in order to reduce the repetition rate of coding, the condition code of page data to be written in described acquisition write order, judges whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, do not perform described write order, the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes specifically comprised:
When multiple hash algorithm supported by described Fragmentation device, carry out repeatedly message to the page data to be written in current write order to take passages, obtain the condition code after each message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages with described each message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after message extracts;
Or, when a kind of hash algorithm supported by described Fragmentation device, the message of the page data to be written in current write order being carried out repeatedly to different skew is taken passages, obtain the condition code after each different offset message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages from described each different offset message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after different offset message extracts;
Or, when described Fragmentation device is supported bug check and is corrected ECC code, obtain the ECC code of page data to be written in current write order and message take passages after condition code, judge the condition code after whether simultaneously there is this ECC code and message extracts in described dictionary, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code after the ECC code of page data and message extracts;
Or, obtain the condition code of page data to be written in current write order, when there is the condition code identical with obtained condition code in described dictionary, judge that whether the N number of byte in the page data that N number of byte in described page data to be written is corresponding with same characteristic features code in described dictionary is all identical, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, wherein said N is the integer being greater than zero and being less than or equal to the size of page in described paging memory, if namely in described paging memory, the size of page is 8k byte, then described N is less than or equal to 8k byte.It should be noted that, in order to not affect efficiency of data compression, above-mentioned comparison procedure can adopt hardware comparator to realize.
Preferably, in order to ensure when dictionary is larger, can improve the efficiency of data compression further, the condition code of page data to be written in described acquisition write order, judges whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, do not perform described write order, the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes specifically comprised:
Obtain the condition code of page data to be written in current write order, message is carried out to described condition code and takes passages acquisition secondary extracts value, judge in described dictionary, whether to there is described secondary extracts value, if exist, judge whether there is described condition code in described dictionary again, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, in wherein said dictionary, record the secondary extracts value of page data character pair code.Wherein, described secondary extracts value be less than condition code size and the repetition rate of coding allow scope in.
In the present embodiment, set up feature code table and secondary extracts value table in advance, described feature code table and secondary extracts value table are respectively used to the condition code of record page data and the secondary extracts value of described condition code.Owing to just starting the secondary extracts value table only needing matched data amount little, only when there is identical secondary extracts value, just needing to compare the large feature code table of data volume, therefore, it is possible to greatly improve matching efficiency, and then improving efficiency of data compression.
As another preferred embodiment of the present invention, described dictionary can also comprise static dictionary and dynamic dictionary simultaneously; Page data in described static dictionary is that write number of times is greater than or equal to the data of first threshold and/or the data of user's care;
Described method also comprised before the step obtaining write order:
Setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
The condition code of the described page data to be written of described acquisition, judges that whether there is the condition code identical with obtained condition code in described dictionary specifically comprises:
Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described static dictionary, if not, judge that described page data to be written is the need of being updated to described dynamic dictionary according to the number of times of described page data write Fragmentation device to be written.
embodiment four:
Fig. 4 shows the composition structure of the Fragmentation device Compression manager device that the embodiment of the present invention four provides, and for convenience of explanation, illustrate only the part relevant to the embodiment of the present invention.
This Fragmentation device Compression manager device can be applied in memory device, can be the software unit run in memory device, the unit that combines of hardware cell or software and hardware, also can be integrated in memory device as independently suspension member or run in the application system of memory device.
This Fragmentation device Compression manager device comprises dictionary and sets up unit 41 and processing unit 42.Wherein, the concrete function of each unit is as follows:
Unit 41 set up by dictionary, for being that unit sets up dictionary with page, records the physical page address of page data, described page data characteristic of correspondence code and described page data write in described dictionary;
Processing unit 42, for obtaining write order, described write order includes the logical page address of page data to be written and described page data write to be written; Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes.
Preferably, described dictionary is static dictionary, and the page data in described static dictionary is that write number of times is greater than or equal to the data of first threshold and/or the page data of user's care.
Preferably, described dictionary is dynamic dictionary;
Described processing unit 42 before acquisition write order also for, setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
Described processing unit 42 is at the described write order of execution, after the described page data to be written of logical page address write according to described page data write to be written, also for when the write number of times of described page data reaches described Second Threshold, this page data is updated in described dynamic dictionary.
Preferably, described dictionary comprises static dictionary and dynamic dictionary; Page data in described static dictionary is that write number of times is greater than or equal to the data of first threshold and/or the data of user's care;
Described processing unit 42 before acquisition write order also for, setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
Described processing unit 42, for obtaining the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described static dictionary, if not, judge that described page data to be written is the need of being updated to described dynamic dictionary according to the number of times of described page data write Fragmentation device to be written.
Be further, described processing unit 42 also for, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete entry invalid in described dynamic dictionary or untapped entry in Preset Time, described invalid entry is that the writing address of the page data stored in described dynamic dictionary has been written with other data, causes this page data invalid; In described Preset Time, untapped entry is that page data corresponding to this entry did not write paging memory part in Preset Time; Or,
Continue to count the write number of times of described page data after the write number of times of described page data reaches described Second Threshold, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete in described dynamic dictionary the page data writing number of times and be less than the 4th threshold value.
Further, described processing unit 42 specifically for,
When multiple hash algorithm supported by described Fragmentation device, carry out repeatedly message to the page data to be written in current write order to take passages, obtain the condition code after each message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages with described each message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after message extracts;
Or, when a kind of hash algorithm supported by described Fragmentation device, the message of the page data to be written in current write order being carried out repeatedly to different skew is taken passages, obtain the condition code after each different offset message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages from described each different offset message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after different offset message extracts;
Or, when described Fragmentation device is supported bug check and is corrected ECC code, obtain the ECC code of page data to be written in current write order and message take passages after condition code, judge the condition code after whether simultaneously there is this ECC code and message extracts in described dictionary, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code after the ECC code of page data and message extracts;
Or, obtain the condition code of page data to be written in current write order, when there is the condition code identical with obtained condition code in described dictionary, judge that whether the N number of byte in the page data that N number of byte in described page data to be written is corresponding with same characteristic features code in described dictionary is all identical, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, wherein said N is the integer being greater than zero and being less than or equal to the size of page in described paging memory.
Further, described processing unit 42 specifically for,
Obtain the condition code of page data to be written in current write order, again message is carried out to described condition code and take passages acquisition secondary extracts value, judge in described dictionary, whether to there is described secondary extracts value, if exist, judge whether there is described condition code in described dictionary again, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, in wherein said dictionary, record the secondary extracts value of page data character pair code.
In the present embodiment, the condition code of described page data can be obtained by hash algorithm.
The Fragmentation device Compression manager device that the present embodiment provides can be used in the Fragmentation device Compression manager method of aforementioned correspondence, and details, see the associated description of above-mentioned Fragmentation device Compression manager embodiment of the method one to three, do not repeat them here.
One of ordinary skill in the art will appreciate that the unit included by above-described embodiment four is carry out dividing according to function logic, but be not limited to above-mentioned division, as long as corresponding function can be realized; In addition, the concrete title of each functional unit, also just for the ease of mutual differentiation, is not limited to protection scope of the present invention.
In sum, in the embodiment of the present invention, the least unit of data compression is page, data in page do not carry out compression and decompression, the writing and reading of data are also in units of page, and the Compression manager method that therefore embodiment of the present invention provides is applicable to adopting the Fragmentation device that arithmetic capability is not enough or cost is low very much.And the Compression manager method that the embodiment of the present invention provides, data to be written in current write order stored in dictionary, then do not write data, therefore effectively can improve the data write efficiency of Fragmentation device, reduce the write number of times of data, and then reduce the wearing and tearing of Fragmentation device.In addition, the embodiment of the present invention, by multiple manner of comparison, effectively can reduce the repetition rate of coding in comparison procedure, and can improve efficiency and the efficiency of data compression of coupling, has stronger ease for use and practicality.
Above content is in conjunction with concrete preferred implementation further description made for the present invention, can not assert that specific embodiment of the invention is confined to these explanations.For general technical staff of the technical field of the invention; make some equivalent alternative or obvious modification without departing from the inventive concept of the premise; and performance or purposes identical, all should be considered as belonging to the scope of patent protection that the present invention is determined by submitted to claims.

Claims (16)

1. a Compression manager method for Fragmentation device, is characterized in that, described method comprises:
Steps A, be that unit sets up dictionary with page, record the physical page address of page data, described page data characteristic of correspondence code and described page data write in described dictionary, in wherein said dictionary, also record the secondary extracts value of page data character pair code;
Step B, acquisition write order, described write order includes the logical page address of page data to be written and described page data write to be written; Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes;
Described step B specifically comprises:
Obtain the condition code of page data to be written in current write order, message is carried out to described condition code and takes passages acquisition secondary extracts value, judge in described dictionary, whether to there is described secondary extracts value, if exist, judge whether there is described condition code in described dictionary again, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes.
2. the method for claim 1, is characterized in that, described dictionary is static dictionary, and the page data in described static dictionary is the data that write number of times is greater than or equal to first threshold.
3. the method for claim 1, is characterized in that, described dictionary is dynamic dictionary, and described dynamic dictionary is the dictionary allowing to be updated;
Described method also comprised before the step obtaining write order:
Setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
At the described write order of described execution, also comprise according to after the described page data step to be written of logical page address write of described page data write to be written:
When the write number of times of described page data to be written reaches described Second Threshold, this page data to be written is updated in described dynamic dictionary.
4. the method for claim 1, is characterized in that, described dictionary comprises static dictionary and dynamic dictionary; Page data in described static dictionary is the data that write number of times is greater than or equal to first threshold, and described dynamic dictionary is the dictionary allowing to be updated;
Described method also comprised before the step obtaining write order:
Setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
The condition code of the described page data to be written of described acquisition, judges that whether there is the condition code identical with obtained condition code in described dictionary specifically comprises:
Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described static dictionary, if not, judge that described page data to be written is the need of being updated to described dynamic dictionary according to the number of times of described page data write Fragmentation device to be written.
5. the method as described in claim 3 or 4, is characterized in that, described method also comprises:
When the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete entry invalid in described dynamic dictionary or untapped entry in Preset Time, described invalid entry is that the writing address of the page data stored in described dynamic dictionary has been written with other data, causes this page data invalid; In described Preset Time, untapped entry is that page data corresponding to this entry did not write paging memory part in Preset Time.
6. the method as described in claim 3 or 4, is characterized in that, described method also comprises:
Continue to count the write number of times of described page data after the write number of times of described page data reaches described Second Threshold, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete in described dynamic dictionary the page data writing number of times and be less than the 4th threshold value.
7. the method for claim 1, is characterized in that, described step B specifically also comprises:
When multiple hash algorithm supported by described Fragmentation device, carry out repeatedly message to the page data to be written in current write order to take passages, obtain the condition code after each message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages with described each message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after message extracts;
Or, when a kind of hash algorithm supported by described Fragmentation device, the message of the page data to be written in current write order being carried out repeatedly to different skew is taken passages, obtain the condition code after each different offset message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages from described each different offset message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after different offset message extracts;
Or, when described Fragmentation device is supported bug check and is corrected ECC code, obtain the ECC code of page data to be written in current write order and message take passages after condition code, judge the condition code after whether simultaneously there is this ECC code and message extracts in described dictionary, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code after the ECC code of page data and message extracts;
Or, obtain the condition code of page data to be written in current write order, when there is the condition code identical with obtained condition code in described dictionary, judge that whether the N number of byte in the page data that N number of byte in described page data to be written is corresponding with same characteristic features code in described dictionary is all identical, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, wherein said N is the integer being greater than zero and being less than or equal to the size of page in described paging memory.
8. the method as described in any one of Claims 1-4, is characterized in that, the condition code of the described page data to be written of described acquisition specifically comprises:
The condition code of described page data to be written is obtained by hash algorithm.
9. a Compression manager device for Fragmentation device, is characterized in that, described device comprises:
Unit set up by dictionary, for being that unit sets up dictionary with page, record the physical page address of page data, described page data characteristic of correspondence code and described page data write in described dictionary, in wherein said dictionary, also record the secondary extracts value of page data character pair code;
Processing unit, for obtaining write order, described write order includes the logical page address of page data to be written and described page data write to be written; Obtain the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described dictionary; If not, perform described write order, according to the described page data to be written of logical page address write of described page data write to be written; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of described page data write to be written writes;
Described processing unit specifically for,
Obtain the condition code of page data to be written in current write order, again message is carried out to described condition code and take passages acquisition secondary extracts value, judge in described dictionary, whether to there is described secondary extracts value, if exist, judge whether there is described condition code in described dictionary again, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If so, described write order is not performed, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes.
10. device as claimed in claim 9, it is characterized in that, described dictionary is static dictionary, and the page data in described static dictionary is the data that write number of times is greater than or equal to first threshold.
11. devices as claimed in claim 9, it is characterized in that, described dictionary is dynamic dictionary, and described dynamic dictionary is the dictionary allowing to be updated;
Described processing unit before acquisition write order also for, setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
Described processing unit is at the described write order of execution, after the described page data to be written of logical page address write according to described page data write to be written, also for when the write number of times of described page data reaches described Second Threshold, this page data is updated in described dynamic dictionary.
12. devices as claimed in claim 9, it is characterized in that, described dictionary comprises static dictionary and dynamic dictionary; Page data in described static dictionary is the data that write number of times is greater than or equal to first threshold, and described dynamic dictionary is the dictionary allowing to be updated;
Described processing unit before acquisition write order also for, setting Second Threshold, counts the write number of times of the page data of write Fragmentation device;
Described processing unit, for obtaining the condition code of described page data to be written, judge whether there is the condition code identical with obtained condition code in described static dictionary, if not, judge that described page data to be written is the need of being updated to described dynamic dictionary according to the number of times of described page data write Fragmentation device to be written.
13. devices as described in claim 11 or 12, it is characterized in that, described processing unit also for, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete entry invalid in described dynamic dictionary or untapped entry in Preset Time, described invalid entry is that the writing address of the page data stored in described dynamic dictionary has been written with other data, causes this page data invalid; In described Preset Time, untapped entry is that page data corresponding to this entry did not write paging memory part in Preset Time.
14. devices as described in claim 11 or 12, is characterized in that, described processing unit also for,
Continue to count the write number of times of described page data after the write number of times of described page data reaches described Second Threshold, when the memory capacity of described dynamic dictionary reaches the 3rd threshold value, delete in described dynamic dictionary the page data writing number of times and be less than the 4th threshold value.
15. devices as claimed in claim 9, is characterized in that, described processing unit specifically for,
When multiple hash algorithm supported by described Fragmentation device, carry out repeatedly message to the page data to be written in current write order to take passages, obtain the condition code after each message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages with described each message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after message extracts;
Or, when a kind of hash algorithm supported by described Fragmentation device, the message of the page data to be written in current write order being carried out repeatedly to different skew is taken passages, obtain the condition code after each different offset message extracts, judge in described dictionary, whether to there is all identical condition code of the condition code after taking passages from described each different offset message, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code of page data repeatedly after different offset message extracts;
Or, when described Fragmentation device is supported bug check and is corrected ECC code, obtain the ECC code of page data to be written in current write order and message take passages after condition code, judge the condition code after whether simultaneously there is this ECC code and message extracts in described dictionary, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, the logical page address of page data to be written write in current write order is pointed to the physical page address that the page data that has same characteristic features code with described page data to be written write, in wherein said dictionary, record the condition code after the ECC code of page data and message extracts;
Or, obtain the condition code of page data to be written in current write order, when there is the condition code identical with obtained condition code in described dictionary, judge that whether the N number of byte in the page data that N number of byte in described page data to be written is corresponding with same characteristic features code in described dictionary is all identical, if not, perform current write order, according to the described page data to be written of logical page address write of page data write to be written in current write order; If, do not perform described write order, by the physical page address that the page data that logical page address points to and described page data to be written has same characteristic features code of page data write to be written in current write order writes, wherein said N is the integer being greater than zero and being less than or equal to the size of page in described paging memory.
16. devices as described in any one of claim 9 to 12, be is characterized in that, described processing unit, for being obtained the condition code of described page data to be written by hash algorithm.
CN201210519408.0A 2012-12-06 2012-12-06 A kind of Compression manager method of Fragmentation device and device Active CN103049388B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210519408.0A CN103049388B (en) 2012-12-06 2012-12-06 A kind of Compression manager method of Fragmentation device and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210519408.0A CN103049388B (en) 2012-12-06 2012-12-06 A kind of Compression manager method of Fragmentation device and device

Publications (2)

Publication Number Publication Date
CN103049388A CN103049388A (en) 2013-04-17
CN103049388B true CN103049388B (en) 2015-12-23

Family

ID=48062035

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210519408.0A Active CN103049388B (en) 2012-12-06 2012-12-06 A kind of Compression manager method of Fragmentation device and device

Country Status (1)

Country Link
CN (1) CN103049388B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11042328B2 (en) 2015-06-01 2021-06-22 Samsung Electronics Co., Ltd. Storage apparatus and method for autonomous space compaction
US10216418B2 (en) * 2015-06-01 2019-02-26 Samsung Electronics Co., Ltd. Storage apparatus and method for autonomous space compaction
CN106970826B (en) * 2017-03-10 2020-05-08 浙江大学 Large page-based missing page abnormity solving method

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6374266B1 (en) * 1998-07-28 2002-04-16 Ralph Shnelvar Method and apparatus for storing information in a data processing system
CN101067800A (en) * 2007-07-05 2007-11-07 炬力集成电路设计有限公司 Memory deterioration balance method based on local sampling
CN101630290A (en) * 2009-08-17 2010-01-20 成都市华为赛门铁克科技有限公司 Method and device of processing repeated data
CN101719099A (en) * 2009-11-26 2010-06-02 成都市华为赛门铁克科技有限公司 Method and device for reducing write amplification of solid state disk
CN102646069A (en) * 2012-02-23 2012-08-22 华中科技大学 Method for prolonging service life of solid-state disk
CN102722455A (en) * 2012-05-22 2012-10-10 深圳市江波龙电子有限公司 Method and device for storing data in flash memory equipment

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6374266B1 (en) * 1998-07-28 2002-04-16 Ralph Shnelvar Method and apparatus for storing information in a data processing system
CN101067800A (en) * 2007-07-05 2007-11-07 炬力集成电路设计有限公司 Memory deterioration balance method based on local sampling
CN101630290A (en) * 2009-08-17 2010-01-20 成都市华为赛门铁克科技有限公司 Method and device of processing repeated data
CN101719099A (en) * 2009-11-26 2010-06-02 成都市华为赛门铁克科技有限公司 Method and device for reducing write amplification of solid state disk
CN102646069A (en) * 2012-02-23 2012-08-22 华中科技大学 Method for prolonging service life of solid-state disk
CN102722455A (en) * 2012-05-22 2012-10-10 深圳市江波龙电子有限公司 Method and device for storing data in flash memory equipment

Also Published As

Publication number Publication date
CN103049388A (en) 2013-04-17

Similar Documents

Publication Publication Date Title
CN103678638B (en) A kind of target cache method based on disk
CN108427538B (en) Storage data compression method and device of full flash memory array and readable storage medium
CN104298680B (en) Data statistical approach and data statistics device
CN103488709B (en) A kind of index establishing method and system, search method and system
WO2016107272A1 (en) Solid state disk storage device, and data accessing method for solid state disk storage device
CN104238962B (en) The method and device of data is write into caching
US20120254559A1 (en) Method and Apparatus For Detecting The Presence of Subblocks in a Reduced Redundancy Storing System
WO2022143540A1 (en) Block chain index storage method and apparatus, computer device and medium
CN106537327A (en) Flash memory compression
EP3316150B1 (en) Method and apparatus for file compaction in key-value storage system
CN102143039B (en) Data segmentation method and equipment for data compression
CN103326732A (en) Method for packing data, method for unpacking data, coder and decoder
CN108427539A (en) Offline duplicate removal compression method, device and the readable storage medium storing program for executing of buffer memory device data
CN101916228A (en) Flash translation layer (FTL) with data compression function and implementation method
CN103678158B (en) A kind of data layout optimization method and system
CN111723059B (en) Data compression method and device, terminal equipment and storage medium
CN103049388B (en) A kind of Compression manager method of Fragmentation device and device
CN106202213A (en) A kind of FPGA binary file compression, decompressing method and compression, decompression device
CN103473266A (en) Solid state disk and method for deleting repeating data thereof
CN104410424B (en) The fast and lossless compression method of embedded device internal storage data
TWI634421B (en) Electronic apparatus for data access and data access method therefor
CN105447168A (en) Method for restoring and recombining fragmented files in MP4 format
CN107423425B (en) Method for quickly storing and inquiring data in K/V format
CN103049387B (en) A kind of Compression manager method of Fragmentation device and device
CN104679493A (en) Improved method for process event handling mechanism

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20171124

Address after: 528400 Zhongshan Zhongshan Torch Development Zone, Guangdong Province, No. 191, No. seven

Patentee after: ZHONGSHAN JIANGBOLONG ELECTRONICS CO., LTD.

Address before: 518000, Guangdong, Nanshan District Province, Shenzhen Road, No. 8 financial services technology innovation base, 8 floor, A, B, C, D, E,, F1

Patentee before: Shenzhen jiangbolong Electronic Co., Ltd.