CN107122130A - A kind of data delete method and device again - Google Patents
A kind of data delete method and device again Download PDFInfo
- Publication number
- CN107122130A CN107122130A CN201710239910.9A CN201710239910A CN107122130A CN 107122130 A CN107122130 A CN 107122130A CN 201710239910 A CN201710239910 A CN 201710239910A CN 107122130 A CN107122130 A CN 107122130A
- Authority
- CN
- China
- Prior art keywords
- data
- logical address
- value
- written
- delete
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
- G06F3/0607—Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
- G06F3/0641—De-duplication techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application provides a kind of data and deletes method and device again, and methods described is applied to storage device, it may include：Logical address map record is successively read from the logical address mapping table；Whether the value for judging the default flag in the logical address map record read is the first preset value；If the value of the flag is the first preset value, based on it is default it is heavy delete strategy corresponding written data mapped to the logical address deleted processing again.Due to that can be that the first preset value is determined without the overweight written data for deleting processing from default flag value, so as to being deleted processing again without deleting the written data of processing again, therefore the efficiency for deleting processing again can be improved.
Description
Technical field
The application is related to field of storage, more particularly to a kind of data delete technology again.
Background technology
The technology of deleting is a kind of automatic search repeated data again, and identical data is retained to the memory technology of unique copy.It is logical
It is overweight to delete processing, the redundant data of storage system can be eliminated, the demand to memory capacity is reduced.
The technology of deleting again popular at present is to delete skill again online based on what Hash (being translated into hash or Hash) algorithm was realized
Art.Such as, the hashed value of data block is calculated, by Hash value matches, retains newly-increased data, deleting duplicated data.However, hashed value
Calculate and matching process needs to consume substantial amounts of system resource, especially carry out weight again to the data block deleted again
Processing is deleted, the consumption of system resource is more considerably increased, the efficiency deleted again is reduced.
The content of the invention
In view of this, the application provides a kind of data and deletes method and device again, and efficiency is deleted again to improve.
Specifically, the application is achieved by the following technical solution：
Method is deleted according to the first aspect of the application again there is provided a kind of data, methods described is applied to storage device, described
Storage device includes pre-configured logical address mapping table, and the logical address mapping table includes some logical address mapping notes
Record；The logical address map record includes the mapping of logical address, physical address and the default flag of written data
Relation；Wherein, do not complete in the corresponding logical address map record of written data for deleting processing again, the default flag
Value is the first preset value, and methods described includes：
Logical address map record is successively read from the logical address mapping table；
Whether the value for judging the default flag in the logical address map record read is the first preset value；
If the value of the flag is the first preset value, the logical address is reflected based on default heavy strategy of deleting
Penetrate corresponding written data and deleted processing again.
Device is deleted according to the second aspect of the application again there is provided a kind of data, described device is applied to storage device, described
Storage device includes pre-configured logical address mapping table, and the logical address mapping table includes some logical address mapping notes
Record；The logical address map record includes the mapping of logical address, physical address and the default flag of written data
Relation；Wherein, do not complete in the corresponding logical address map record of written data for deleting processing again, the default flag
Value is the first preset value, and described device includes：
Logical address map record is successively read from the logical address mapping table；
Whether the value for judging the default flag in the logical address map record read is the first preset value；
If the value of the flag is the first preset value, the logical address is reflected based on default heavy strategy of deleting
Penetrate corresponding written data and deleted processing again.
The application proposes a kind of heavy method for deleting processing, by the logical address map record of logical address mapping table
Increase mark deletes the default flag of state again, and storage device is described pre- in the logical address map record for judging to read
If the value of flag maps corresponding have been written into for that after the first preset value, can be based on default heavy strategy of deleting to the logical address
Data are deleted processing again.
Treat to delete the default flag for deleting state again of data again due to adding mark, storage device can be distinguished without weight
The written data of processing is deleted, processing is then deleted again without deleting the written data of processing again to this again, therefore drop significantly
The low consumed resource for deleting processing again, improves the efficiency for deleting processing again.
Brief description of the drawings
Fig. 1 is that a kind of related data shown in the exemplary embodiment of the application one is deleted in technology and deletes schematic diagram again again；
Fig. 2 is the flow chart that a kind of data shown in the exemplary embodiment of the application one delete method again；
Fig. 3 is that a kind of data shown in the exemplary embodiment of the application one are deleted in method and delete schematic diagram again again；
Fig. 4 is the hardware structure diagram of equipment a kind of data shown in the exemplary embodiment of the application one delete device again where；
Fig. 5 is the block diagram that a kind of data shown in the exemplary embodiment of the application one delete device again.
Embodiment
Here exemplary embodiment will be illustrated in detail, its example is illustrated in the accompanying drawings.Following description is related to
During accompanying drawing, unless otherwise indicated, the same numbers in different accompanying drawings represent same or analogous key element.Following exemplary embodiment
Described in embodiment do not represent all embodiments consistent with the application.On the contrary, they be only with it is such as appended
The example of the consistent apparatus and method of some aspects be described in detail in claims, the application.
It is the purpose only merely for description specific embodiment in term used in this application, and is not intended to be limiting the application.
" one kind ", " described " and "the" of singulative used in the application and appended claims are also intended to including majority
Form, unless context clearly shows that other implications.It is also understood that term "and/or" used herein refers to and wrapped
It may be combined containing one or more associated any or all of project listed.
It will be appreciated that though various information, but this may be described using term first, second, third, etc. in the application
A little information should not necessarily be limited by these terms.These terms are only used for same type of information being distinguished from each other out.For example, not departing from
In the case of the application scope, the first information can also be referred to as the second information, similarly, and the second information can also be referred to as
One information.Depending on linguistic context, word as used in this " if " can be construed to " ... when " or " when ...
When " or " in response to determining ".
The technology of deleting is a kind of automatic search repeated data again, and identical data is retained to the memory technology of unique copy.It is logical
It is overweight to delete processing, the redundant data of storage system can be eliminated, the demand to memory capacity is reduced.
Generally, the technology of deleting may include that online delete again is deleted again with backstage again.
Wherein, delete and refer to again online, storage device, can be first to the number of targets in write IO request after write IO request is received
According to being deleted processing again, then based on the state deleted after processing again, it is determined whether write the target data.
Backstage is deleted again to be referred to, storage device reads the target data locally having been written into, then the target data read is entered
Row deletes processing again.
It should be noted that it is online delete again with backstage delete again to delete processing procedure again essentially identical, simply delete master again online
The data to be written to be directed in write IO request are deleted processing again, and backstage is deleted again, is by logical address mapping table
The corresponding written data of logical address map record is deleted processing again.
In order to more fully understand the application, the data being described in detail below in lower correlation technique delete the flow of processing again.
Referring to Fig. 1, Fig. 1 is that a kind of related data shown in the exemplary embodiment of the application one is deleted deleting again in technology and shown again
It is intended to.
Wherein, Fig. 1 (a1) is logical address mapping table.The logical address mapping table has been written into number including some records
According to logical address and physical address logical address map record.
(b1) in Fig. 1, which attaches most importance to, deletes mapping table.The heavy mapping table of deleting has completed to delete having write for processing again including some
The hashed value and physical address for entering data delete map record again.
When deleting again, storage device can calculate target data (such as Data_0) hashed value (such as H_x), then can delete again
The hashed value (such as H_x) with calculating is searched in mapping table to match and delete map record again, is determined by deleting map record again with being somebody's turn to do
The corresponding physical address (such as B_x1) for having completed the written data for deleting processing again of hashed value (such as H_x).
Storage device can read this and completed to delete the written data of processing again (as schemed by above-mentioned physical address B_x1
Data_0 shown in b2), and after the written data that having completed of judging that this reads deletes processing is identical with target data again,
The physical address (such as B_x) of the target data in the corresponding logical address map record of target data is revised as above-mentioned complete
Cheng Chong deletes the physical address (such as B_x1) of the written data of processing.
However, in above-mentioned related data delete technology again, due to be difficult confirm target data whether by online or
Processing is deleted on person backstage again, so as to cause to carry out backstage again to the target data for having completed to delete processing again to delete processing again, is taken significantly
The resource of equipment, reduces the efficiency that backstage is deleted again.
Further, since it is above-mentioned it is related delete technology again and lack to automatically control online delete or start and stop that backstage is deleted again and cut again
The mechanism changed, greatly reduces the flexibility for deleting scheduling again.
The application proposes a kind of heavy method for deleting processing, by the logical address map record of logical address mapping table
Increase mark deletes the default flag of state again, and storage device is described pre- in the logical address map record for judging to read
If the value of flag maps corresponding have been written into for that after the first preset value, can be based on default heavy strategy of deleting to the logical address
Data are deleted processing again.
On the one hand, the default flag for deleting state again of target data is identified due to adding, storage device can determine that
Without the overweight target data for deleting processing, processing is then deleted again to the target data again, therefore greatly reduce and delete place again
The consumed resource of reason, improves the efficiency for deleting processing again.
On the other hand, note is mapped because storage device can count the logical address that default flag value is the first preset value
The number of record, either current IO performance indications judge the occupancy or storage device of the memory space of current storage devices
Current IO performance states, what is deleted and deleted again online again with dynamic progress backstage deletes scheduling again.
Referring to Fig. 2, Fig. 2 is the flow chart that a kind of data shown in the exemplary embodiment of the application one delete method again.The number
Storage device is can be applied to according to the method deleted again, it may include step as follows.
Step 201：Logical address map record is successively read from the logical address mapping table；
Step 202：Whether the value for judging the default flag in the logical address map record that reads is the
One preset value；
Step 203：If the value of the flag is the first preset value, patrolled based on default heavy strategy of deleting described
Collect the corresponding written data of address of cache and deleted processing again.
Wherein, above-mentioned storage device stored has logical address mapping table and deletes mapping table again.
Referring to Fig. 3, Fig. 3 is that a kind of data shown in the exemplary embodiment of the application one are deleted in method and delete signal again again
Figure.
Some logics are included in the logical address mapping table that Fig. 3 (a1) proposes for the application, the logical address mapping table
Address of cache is recorded.The logical address map record includes the logical address of written data, the physical address of written data
And the mapping relations of default flag.
The value difference again deleting processing state, preset flag of the above-mentioned default flag to identify written data,
Its corresponding data having been written into delete processing state again different.For example, the data for not deleted processing again, flag
Value is the first preset value, for example, can be 0.Data for being deleted processing again, the value of flag can be pre- for second
If value, for example, can be 1.For hashed value conflict (i.e. one hashed value correspondence two it is different completed delete having write for processing again
Enter data) data, it is believed that the data delete processing without overweight, and the value of flag can be the first preset value, for example, can be
0.Certainly, the data conflicted for hashed value, the value of flag can also be the 3rd preset value etc., as long as hash can be identified
The data of value conflict are without the overweight data for deleting processing.
Under normal circumstances, in above-mentioned logical address map record, the length of the logical address of written data is 8 words
Section, i.e. 64bit, the length of the physical address of written data is also 8 bytes., can when design logic address of cache is recorded
1 bit will be separated in the physical address length as flag, 1 bit can be also separated in logical address length as mark
Position.Herein, it is not carried out especially to setting flag bit exemplarily to be illustrated in logical address map record simply
Limit.
It should be noted that marking off a bit in logical address mapping table as flag, on the one hand, can save
Memory headroom, does not bring more memory headrooms to consume；
On the other hand, logic is extended as flag by then passing through one bit of division in logical address mapping table
Address mapping table, rather than identify by increasing other tables or other mapping relations written data delete processing shape again
State, treats to delete the step of the deleting state again of target data of processing again, improves and delete processing again so as to reduce with imitating for identification
Efficiency.
What is more important, logical address mapping table can typically be deposited as the core metadata of storage device in Cache
Address information of internal memory etc. where containing the logical address mapping table, therefore the default flag is arranged on logical address mapping
On table, the speed for deleting processing state again of storage device access written data can be effectively improved.
Referring to Fig. 3, Fig. 3 (b1), which attaches most importance to, deletes mapping table.The heavy mapping table of deleting deletes map record again including some.Delete and reflect again
The hashed value for penetrating written data of the record including having completed to delete processing again has completed to delete the written data of processing again with this
The mapping relations of physical address.
Above-mentioned default heavy strategy of deleting may include：Storage device can calculate the hashed value for the target data for treating to delete processing again,
And the hashed value that can obtain calculating is matched successively with the heavy hashed value deleted in mapping table.
If storage device does not match the hashed value in mapping table in above-mentioned heavy delete, storage device can be by the target data
The value of the default flag in corresponding logical address map record is second preset value.
In a kind of optional implementation, for deleting online again, storage device can be empty for target data distribution storage
Between, and write the target data.Storage device can be the target data generation logical address be the target data logical address,
The logical address mapping note that physical address is the address of the memory space of the distribution, the value of default flag is the second preset value
Record, and the logical address map record is added to logical address mapping table.
In another optional implementation, deleted again for backstage, storage device can increase in mapping table is deleted again should
The hashed value of target data deletes map record again with the physical address of the target data.Meanwhile, storage device is by logical address
The default flag value of the logical address map record for the target data in mapping table is set to the second preset value.
If matching the hashed value in mapping table is deleted again, storage device, which can be read to exist with the hashed value, to be mapped
The physical address of the relation corresponding written data for having completed to delete processing again, and may compare the target data and read
The written data for having completed to delete processing again.
If the target data is different with the written data that this read has completed to delete processing again, storage device can be by
The value of the default flag in the corresponding logical address map record of the target data is first preset value.
In a kind of optional implementation, for deleting online again, storage device can be empty for target data distribution storage
Between, and generate the address for the memory space that logical address is the logical address of the target data, physical address is the distribution, preset
The value of flag is the logical address map record of the first preset value, and by the logical address map record added to logically
In the mapping table of location.
In another optional implementation, deleted again for backstage, if the target data and read this is complete
The written data that Cheng Chong deletes processing is different, and storage device can be by logic corresponding with the target data in logical address mapping table
The value of default flag in address of cache record is set to the first preset value.
If the data that the target data has completed to delete the written data of processing with this read are identical again, storage is set
It is standby the value of default flag in the corresponding logical address map record of the target data to be set to the second preset value, thing
Reason address is set to complete to delete the physical address of the written data of processing again.
In a kind of optional implementation, for deleting online again, the discardable target data of storage device, meanwhile, it is raw
Into the logical address map record for the target data, the logical address in the logical address map record of the generation is the mesh
The logical address of data is marked, physical address has completed the physical address for the written data for deleting processing again for this, presets flag
Value is the second preset value.
In another optional implementation, deleted again for backstage, if the target data and read this is complete
The data that Cheng Chong deletes the written data of processing are identical, during storage device can record logical address corresponding with the target data
Physical address be revised as having completed deleting the physical address of the written data of processing again, it is second to preset to preset flag value
Value.Meanwhile, the recyclable target data of storage device.
It should be noted that for delete online again, it is above-mentioned to treat that the target data for deleting processing again be in IO write requests
Data to be written.It is above-mentioned to treat that the target data for deleting processing again be logical address map record pair deleted for backstage again for
The written data answered.
In the embodiment of the present application, storage device online or backstage can again be deleted the failed data to be written of processing or
Person does not carry out the data to be written deleted again online, and the default flag value of generation maps note for the logical address of the first preset value
Record.Deleted on backstage again during, storage device can based on it is default it is heavy delete strategy, only to default in logical address mapping table
Flag carries out backstage for the corresponding written data of logical address map record of the first preset value and deletes processing again.Due to no longer
Backstage can be carried out again to the data for having completed to delete processing again and delete processing again, so be greatly improved the efficiency that backstage is deleted again.
Deleted again with backstage in terms of two from deleting online again separately below, method of being deleted again to the data that the application is proposed carries out detailed
Carefully illustrate.
1) delete again online
In the embodiment of the present application, in order to while storage device current IO performances are met, reduce the write-in of data, deposit
Equipment is stored up after write IO request is received, can determine whether to meet the online trigger condition deleted again, if it is satisfied, then can carry out
Line is deleted again.
When realizing, storage device can count current each IO performance indications, and can determine whether each IO performance indications for counting on
Whether pre-configured Performance Counter Threshold is met respectively, if each IO performance indications are satisfied by pre-configured Performance Counter Threshold,
Then show that current storage devices there are enough resources delete again online, by deleting online again, reduce the write-in of data.
If any IO performance indications do not meet pre-configured Performance Counter Threshold, storage device can be not turned on online weight
Delete, the data to be written carried in the write IO request received are write to local, while default for the data generation to be written
Flag value is the logical address map record of the first preset value.
Wherein, above-mentioned IO performances may include IO quantity, IO delays and I/O throughput etc., and merely just IO performances are shown
Illustrate to example property, it is not carried out specifically defined.
Above-mentioned pre-configured Performance Counter Threshold may include IO amount thresholds, IO delay thresholds and I/O throughput threshold value etc.,
It can be configured etc., merely just Performance Counter Threshold and its configuration mode exemplarily be illustrated, not to it by user
Carry out specifically defined.
After it is determined that each IO performance indications are satisfied by pre-configured Performance Counter Threshold, storage device can calculate what is received
The hashed value of the data to be written carried in write IO request.
It should be noted that storage device can calculate dissipating for the written data by the computational methods of Hash hashed value
Train value, can also be calculated by the computational methods of other hashed values, here meter not to the hashed value of written data
Calculation is especially limited.
After calculating obtains above-mentioned hashed value, storage device can will calculate obtained hashed value and heavy be deleted with above-mentioned in mapping table
Hashed value matched successively.
If not matching the hashed value in mapping table in heavy delete, storage device can be data distribution storage to be written
Space, and the writable data to be written.Storage device can be that the data generation logical address to be written is the data to be written
Logical address, the logic that physical address is the address of the memory space of the distribution, default flag value is the second preset value
Address of cache is recorded.
If matching the hashed value in mapping table in heavy delete, physical address corresponding with the hashed value can be read,
And by the physical address, reading has completed to delete the written data of processing again.
Storage device may compare the data to be written and completed to delete again processing written data it is whether identical.If should
Data to be written are identical with the written data for having completed to delete processing again, then can be that the data generation logical address to be written is this
Physical address, pre- bidding that the logical address of data to be written, physical address have completed the written data for deleting processing again for this
Will position value is the logical address map record of the second preset value.Meanwhile, the discardable data to be written of storage device.
If the data to be written and completed to delete the written data of processing and differ again, storage device can be to be written for this
Enter data distribution memory space, and the writable data to be written.Storage device can be the data generation logical address to be written
For the logical address of the data to be written, physical address is that the address of the memory space of the distribution, default flag value are the
The logical address map record of one preset value.
For example, as shown in Figure 3, it is assumed that above-mentioned data to be entered are Data_0, storage device can calculate Data_0 hashed value,
Assuming that it is H_x to calculate the obtained hashed value.Storage device can delete mapping table again as shown in Fig. 3 (b1), search with should
Map record is deleted in H_x matchings again, and by this it is heavy delete map record, it is determined that corresponding with the H_x completed to delete processing again
The physical address of data, such as B_x1.
As shown in Fig. 3 (b2), the corresponding written data for having completed to delete processing again of B_x1 can be read in storage device
Data_0.Determine that the data Data_0 to be written and having completed of reading delete the written data of processing again in storage device
After Data_0 is identical, the logical address map record as shown in Fig. 3 (a1) can be generated for the data to be written.The logical address is reflected
The logical address penetrated in record is the logical address Addr_0 of the data to be written, and physical address has completed to delete processing again for this
The physical address B_x1 of written data, flag value is the second preset value 1.Storage device, which can map the logical address, to be remembered
Record is added to logical address mapping table.Meanwhile, the discardable data to be written of storage device.
If above-mentioned data to be written are Data_1, storage device can calculate Data_1 hashed value, it is assumed that calculating is obtained
The hashed value be H_y.Storage device can delete mapping table again as shown in Fig. 3 (b1), search deleting again of being matched with the H_y
Map record, and by this it is heavy delete map record, it is determined that the data for having completed to delete processing corresponding with the H_y are physically again
Location, such as B_y1.
The corresponding written data Data_m for having completed to delete processing again of B_y1 can be read in storage device.It is true in storage device
Fixed written data Data_m is different with the written data Data_0 that having completed of reading deletes processing again after, storage device
Memory space, and the writable data to be written can be distributed for the data distribution to be written.Storage device can be the number to be written
According to logical address map record of the generation as shown in Fig. 3 (a1), the logical address in the logical address map record is that this is to be written
Enter the logical address (such as Addr_1) of data, physical address is the address (such as B_y) of the memory space of the distribution, default flag
Value is the logical address map record of the first preset value (such as 0).The logical address map record can be added to by storage device
Above-mentioned logical address mapping table.
If above-mentioned data to be written are Data_2, storage device can calculate Data_2 hashed value, it is assumed that calculating is obtained
The hashed value be H_q.Storage device can delete mapping table again as shown in Fig. 3 (b1), search deleting again of being matched with the H_q
Map record.Storage device confirm not find match with the H_q delete map record again after, storage device can be that this is to be written
Enter data distribution memory space, and the writable data to be written.Storage device can be the data generation such as Fig. 3 (a1) to be written
Logical address in shown logical address map record, the logical address map record is the logical address of the data to be written
(such as Addr_2), physical address is the address (such as B_q) of the memory space of the distribution, presets flag value for the second preset value
The logical address map record of (such as 1).
2) backstage is deleted again
In order to carry out start-up and shut-down control that backstage is deleted etc. according to storage device current memory space occupancy again, realize timely
Reduce storage device current memory space occupancy, the trigger condition that storage device can again be deleted based on backstage, come determine whether into
Delete again on row backstage.
The trigger condition that backstage is deleted again may include：Storage device can count the default mark in above-mentioned logical address mapping table
Position value is the number of the logical address map record of the first preset value.Storage device can determine whether the logical address mapping counted on
Whether the number of record reaches predetermined threshold value, if the number of the logical address map record counted on reaches predetermined threshold value,
Then show that the current memory space occupancy of storage device is too high, backstage can be opened and deleted again, to reduce memory space occupancy.Such as
Really the number not up to predetermined threshold value of the logical address map record counted on, then show the current memory space of storage device
Storage demand is also enough met, backstage can be now not turned on and delete again.
After it is determined that the number of the logical address map record counted on reaches predetermined threshold value, storage device can be patrolled from above-mentioned
Collect in address mapping table and be successively read logical address map record.Then, storage device can determine whether that the logical address read is reflected
Whether the value for the default flag penetrated in record is the first preset value.If the value of the flag is the first preset value,
Demonstrate the need for being deleted processing again to the corresponding written data of logical address map record.
When deleting processing again, storage device can calculate the hashed value of the written data, and dissipating of can obtaining the calculating
Train value is matched successively with the above-mentioned heavy hashed value deleted in mapping table.
, can be by the corresponding logic of above-mentioned written data if not matching above-mentioned hashed value in mapping table in heavy delete
Flag value in address of cache record is set to the second preset value, while in mapping table is deleted again, increasing this and having been written into number
According to the physical address of hashed value and the written data delete map record again.
If matching the hashed value in mapping table in heavy delete, it can be read and corresponding with the hashed value completed to delete again
The physical address of the written data of processing.And based on the physical address, read the written data for having completed to delete processing again.
Whether the written data that storage device may compare the written data with this has completed to delete processing again is identical, if
The written data is identical with the written data that this has completed to delete processing again, then can be corresponding logically by the written data
Flag value in the map record of location is set to the second preset value, and this in the logical address map record is had been written into number
According to physical address be revised as having completed deleting the physical address of the written data of processing again.
If the written data and the written data for having completed to delete processing are differed again, storage device can not be changed
The corresponding logical address map record of the written data, the flag value of the logical address map record is still preset for first
Value.
If for example, as shown in figure 3, the written data corresponding to the above-mentioned logical address map record read is figure
Data_0 shown in 3 (a2), storage device can calculate Data_0 hashed value, it is assumed that it is H_x to calculate the obtained hashed value.Deposit
Storage equipment can delete mapping table again as shown in Fig. 3 (b1), and what lookup was matched with the H_x deletes map record again, and passes through this
Map record is deleted again, it is determined that the physical address for having completed the data for deleting processing again corresponding with the H_x, such as B_x1.
As shown in Fig. 3 (b2), the corresponding written data Data_ for having completed to delete processing again of B_x1 can be read in storage device
0., can be by after storage device written data Data_0 is identical with the data Data_0 that having completed of reading deletes processing again
The corresponding physical address B_x of Data_0 in the corresponding logical address map records of written data Data_0 are revised as complete
Cheng Chong deletes the corresponding physical address B_x1 of written data of processing, and value of the default flag is revised as into second preset
Value, such as the second preset value can be 1.The recyclable written data Data_0 of storage device.
If the written data corresponding to the above-mentioned logical address map record read is shown in Fig. 3 (a2)
Data_1, storage device can calculate Data_1 hashed value, it is assumed that it is H_y to calculate the obtained hashed value.Storage device can be
Deleting again in mapping table as shown in Fig. 3 (b1), what lookup was matched with the H_y deletes map record again, and maps note by heavy delete
Record, it is determined that the physical address for having completed the data for deleting processing again corresponding with the H_y, such as B_y1.
The corresponding written data Data_m for having completed to delete processing again of B_y1 can be read in storage device.It is true in storage device
, can not be to this fixed written data Data_m is different with the written data Data_0 that having completed of reading deletes processing again after
The corresponding logical address map record of written data is modified, and the flag value of the logical address map record is still the
One preset value (such as 0).
If the written data corresponding to the above-mentioned logical address map record read is shown in Fig. 3 (a2)
Data_2, storage device can calculate Data_2 hashed value, it is assumed that it is H_q to calculate the obtained hashed value.Storage device can be
Deleting again in mapping table as shown in Fig. 3 b1, searches and the H_q is matched deletes map record again.Confirm not look into storage device
Deleting again after map record of being matched with the H_q is found, storage device can remember the corresponding logical address mapping of the written data
Default flag value in record is revised as the second preset value (such as 1).
In the embodiment of the present application, if the written data is different with the written data that this has completed to delete processing again,
It then can be shown that the situation of hashed value conflict occur, storage device can determine that deleting again for the written data handles failed.Storage
Equipment can not change the logical address map record that the corresponding flag value of the written data is the first preset value.
The application proposes a kind of heavy method for deleting processing, by the logical address map record of logical address mapping table
Increase mark deletes the default flag of state again, and storage device is described pre- in the logical address map record for judging to read
If the value of flag maps corresponding have been written into for that after the first preset value, can be based on default heavy strategy of deleting to the logical address
Data are deleted processing again.
On the one hand, treat to delete the default flag for deleting state again of data again due to adding mark, storage device can determine that
Go out to delete the written data of processing again without online or backstage, then carry out backstage to the written data again deletes place again
Reason, therefore the consumed resource that processing is deleted on backstage again is greatly reduced, improve the efficiency that processing is deleted on backstage again.
On the other hand, note is mapped because storage device can count the logical address that default flag value is the first preset value
The number of record, either current IO performance indications judge that the memory space occupancy or storage device of current storage devices are worked as
Preceding IO performance states, are deleted and delete scheduling again with deleting start and stop and switching etc. again online again with dynamic progress backstage.
The embodiment for deleting method again with aforementioned data is corresponding, deletes the embodiment of device again present invention also provides data.
The embodiment that the application data delete device again can be using on a storage device.Device embodiment can pass through software
Realize, can also be realized by way of hardware or software and hardware combining.Exemplified by implemented in software, as on a logical meaning
Device, be to be read corresponding computer program instructions in nonvolatile memory by the processor of storage device where it
Into internal memory, operation is formed.For hardware view, as shown in figure 4, storage device where deleting device again for the application data
A kind of hardware structure diagram, in addition to the processor shown in Fig. 4, internal memory, network outgoing interface and nonvolatile memory,
Storage device in embodiment where device can also include other hardware generally according to the actual functional capability of the storage device, right
This is repeated no more.
It refer to Fig. 5, Fig. 5 is the block diagram that a kind of data shown in the exemplary embodiment of the application one delete device again.It is described
Device is applied to storage device, and the storage device stored includes logical address mapping table, and the logical address mapping table includes
Some logical address map records, the logical address map record includes the logical address of written data, physical address
And the mapping relations of default flag；Wherein, the corresponding logical address mapping note of written data for deleting processing again is not completed
The value that flag is preset described in record is the first preset value, and described device includes：Reading unit 510, judging unit 520 and again
Delete processing unit 530.
Reading unit 510, for being successively read logical address map record from the logical address mapping table；
The value of the default flag in judging unit 520, the logical address map record read for judgement
Whether it is the first preset value；
Processing unit 530 is deleted again, if the value for the flag is the first preset value, heavy is deleted based on default
Strategy maps corresponding written data to the logical address and is deleted processing again.
In a kind of optional implementation, described device also includes：Indexing unit 540, in response to receiving
Write IO request, based on it is default it is heavy delete strategy processing deleted again to the data to be written that are carried in the write IO request, if
Do not delete and handle successfully again for the data to be written；Or, do not enter for the data to be written carried in the write IO request
Row deletes processing again, is that the value that the data to be written generate the default flag is described in the logical address mapping table
The logical address map record of first preset value.
In another optional implementation, the storage device also deletes mapping table again including pre-configured；Residing weight
Delete mapping table and delete map record again including some；Wherein, the heavy map record of deleting includes having completed to delete having write for processing again
Enter the hashed value of data and the mapping relations of physical address；
The default heavy strategy of deleting includes：Calculate the hashed value for the target data for treating to delete processing again；It will calculate what is obtained
Hashed value is matched successively with the heavy hashed value deleted in mapping table；If it is described it is heavy delete match in mapping table it is described
Hashed value, read it is corresponding with the physical address that the hashed value has mapping relations completed to delete processing again have been written into number
According to；Compare the target data and the written data for having completed to delete processing again read；If the target data
With read described in completed to delete again processing written data it is different, then the corresponding logical address of the target data is mapped
The value of the default flag in record is first preset value.
In another optional implementation, the default heavy strategy of deleting also includes：If heavy deleting mapping described
The hashed value is not matched in table, then by the default flag in the corresponding logical address map record of the target data
Value be second preset value.
In another optional implementation, the default heavy strategy of deleting also includes：If the target data and
The data for having completed the written data for deleting processing again are identical, then by the corresponding logical address map record of the target data
In the value of the default flag be set to second preset value, physical address is set to complete to have deleted processing again
Write the physical address of data.
In another optional implementation, described device also includes the first trigger element 550, is patrolled for counting described
Collect and number of the flag value for the logical address map record of the first preset value is preset described in address mapping table；Judge statistics
The number of the logical address map record whether reach predetermined threshold value, if it is, performing from the logical address mapping table
In the step of be successively read logical address map record.
In another optional implementation, described device also includes：Second trigger element 560, it is current for counting
Each IO performance indications；Judge whether each IO performance indications counted on meet pre-configured Performance Counter Threshold respectively, such as
Fruit is to perform heavy to delete the step of strategy deletes the data to be written that carry in the write IO request again based on default；Such as
It is really no, processing is not deleted again for the data to be written carried in the write IO request.
The function of unit and the implementation process of effect specifically refer to correspondence step in the above method in said apparatus
Implementation process, will not be repeated here.
For device embodiment, because it corresponds essentially to embodiment of the method, so related part is real referring to method
Apply the part explanation of example.Device embodiment described above is only schematical, wherein described be used as separating component
The unit of explanation can be or may not be physically separate, and the part shown as unit can be or can also
It is not physical location, you can with positioned at a place, or can also be distributed on multiple NEs.Can be according to reality
Selection some or all of module therein is needed to realize the purpose of application scheme.Those of ordinary skill in the art are not paying
In the case of going out creative work, you can to understand and implement.
The preferred embodiment of the application is the foregoing is only, not to limit the application, all essences in the application
God is with principle, and any modification, equivalent substitution and improvements done etc. should be included within the scope of the application protection.
Claims (14)
1. a kind of data delete method, it is characterised in that methods described is applied to storage device again, the storage device includes prewired
The logical address mapping table put, the logical address mapping table includes some logical address map records；The logical address
Map record includes the mapping relations of logical address, physical address and the default flag of written data；Wherein, do not complete
In the corresponding logical address map record of written data for deleting processing again, the value of the default flag is preset for first
Value, methods described includes：
Logical address map record is successively read from the logical address mapping table；
Whether the value for judging the default flag in the logical address map record read is the first preset value；
If the value of the flag is the first preset value, based on default heavy strategy of deleting to logical address mapping pair
The written data answered is deleted processing again.
2. according to the method described in claim 1, it is characterised in that methods described also includes：
In response to the write IO request received, based on default heavy strategy of deleting to the data to be written that are carried in the write IO request
Processing is deleted again, is handled successfully if do not deleted for the data to be written again；Or,
The data to be written carried in the write IO request are not directed to and are deleted processing again, are in the logical address mapping table
The value that the data to be written generate the default flag is the logical address map record of first preset value.
3. method according to claim 1 or 2, it is characterised in that the storage device is also reflected including pre-configured deleting again
Firing table；Residing mapping table of deleting again deletes map record again including some；Wherein, the heavy map record of deleting includes having completed to delete again
The hashed value of the written data of processing and the mapping relations of physical address；
The default heavy strategy of deleting includes：
Calculate the hashed value for the target data for treating to delete processing again；
The hashed value that calculating is obtained is matched successively with the heavy hashed value deleted in mapping table；
If matching the hashed value in mapping table in heavy delete, the physics that there are mapping relations with the hashed value is read
The corresponding written data for having completed to delete processing again in address；
Compare the target data and the written data for having completed to delete processing again read；
If the target data is different with the written data for having completed to delete processing read again, by the number of targets
It is first preset value according to the value of the default flag in corresponding logical address map record.
4. method according to claim 3, it is characterised in that the default heavy strategy of deleting also includes：
If not matching the hashed value in mapping table in heavy delete, the corresponding logical address of the target data is mapped
The value of the default flag in record is second preset value.
5. method according to claim 3, it is characterised in that the default heavy strategy of deleting also includes：
If the target data is identical with the data for having completed the written data for deleting processing again, by the target data
The value of the default flag in corresponding logical address map record is set to second preset value, and physical address is set
It is set to the physical address for the written data for having completed to delete processing again.
6. according to the method described in claim 1, it is characterised in that be successively read described from the logical address mapping table
Before logical address map record, in addition to：
Count the logical address map record for presetting that flag value is the first preset value described in the logical address mapping table
Number；
Judge whether the number of the logical address map record of statistics reaches predetermined threshold value, patrolled if it is, performing from described
Collect the step of being successively read logical address map record in address mapping table.
7. method according to claim 2, it is characterised in that based on default heavy strategy of deleting in the write IO request
The data to be written carried are deleted before processing again, in addition to：
The current each IO performance indications of statistics；
Judge whether each IO performance indications counted on meet pre-configured Performance Counter Threshold respectively, if it is, performing
Heavy the step of strategy is deleted again to the data to be written that are carried in the write IO request is deleted based on default；If not, not pin
Processing is deleted again to the data to be written carried in the write IO request.
8. a kind of data delete device, it is characterised in that described device is applied to storage device again, the storage device includes prewired
The logical address mapping table put, the logical address mapping table includes some logical address map records；The logical address
Map record includes the mapping relations of logical address, physical address and the default flag of written data；Wherein, do not complete
In the corresponding logical address map record of written data for deleting processing again, the value of the default flag is preset for first
Value, described device includes：
Reading unit, for being successively read logical address map record from the logical address mapping table；
Judging unit, for judging whether the value of the default flag in the logical address map record that reads is the
One preset value；
Delete processing unit again, if the value for the flag is the first preset value, based on it is default it is heavy delete strategy it is right
The logical address maps corresponding written data and is deleted processing again.
9. device according to claim 8, it is characterised in that described device also includes：Indexing unit, in response to connecing
The write IO request received, heavy deleted strategy and is deleted place again to the data to be written that are carried in the write IO request based on default
Reason, is handled successfully if do not deleted for the data to be written again；Or, it is to be written not for what is carried in the write IO request
Data are deleted processing again, generate the value of the default flag for the data to be written in the logical address mapping table
For the logical address map record of first preset value.
10. device according to claim 8 or claim 9, it is characterised in that the storage device is also reflected including pre-configured deleting again
Firing table；Residing mapping table of deleting again deletes map record again including some；Wherein, the heavy map record of deleting includes having completed to delete again
The hashed value of the written data of processing and the mapping relations of physical address；
The default heavy strategy of deleting includes：
Calculate the hashed value for the target data for treating to delete processing again；
The hashed value that calculating is obtained is matched successively with the heavy hashed value deleted in mapping table；
If matching the hashed value in mapping table in heavy delete, the physics that there are mapping relations with the hashed value is read
The corresponding written data for having completed to delete processing again in address；
Compare the target data and the written data for having completed to delete processing again read；
If the target data is different with the written data for having completed to delete processing read again, by the number of targets
It is first preset value according to the value of the default flag in corresponding logical address map record.
11. device according to claim 10, it is characterised in that the default heavy strategy of deleting also includes：
If not matching the hashed value in mapping table in heavy delete, the corresponding logical address of the target data is mapped
The value of the default flag in record is second preset value.
12. device according to claim 10, it is characterised in that the default heavy strategy of deleting also includes：
If the target data is identical with the data for having completed the written data for deleting processing again, by the target data
The value of the default flag in corresponding logical address map record is set to second preset value, and physical address is set
It is set to the physical address for the written data for having completed to delete processing again.
13. device according to claim 8, it is characterised in that described device also includes：First trigger element, for uniting
Count and number of the flag value for the logical address map record of the first preset value is preset described in the logical address mapping table；
Judge whether the number of the logical address map record of statistics reaches predetermined threshold value, if it is, perform from it is described logically
The step of logical address map record is successively read in the mapping table of location.
14. device according to claim 9, it is characterised in that described device also includes：Second trigger element, for uniting
The current each IO performance indications of meter；Judge whether each IO performance indications counted on meet pre-configured performance indications threshold respectively
Value, heavy the step that strategy is deleted again to the data to be written that are carried in the write IO request is deleted if it is, performing based on default
Suddenly；If not, not being directed to the data to be written carried in the write IO request is deleted processing again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710239910.9A CN107122130B (en) | 2017-04-13 | 2017-04-13 | Data deduplication method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710239910.9A CN107122130B (en) | 2017-04-13 | 2017-04-13 | Data deduplication method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107122130A true CN107122130A (en) | 2017-09-01 |
| CN107122130B CN107122130B (en) | 2020-04-21 |
Family
ID=59724660
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710239910.9A Active CN107122130B (en) | 2017-04-13 | 2017-04-13 | Data deduplication method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107122130B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107632944A (en) * | 2017-09-22 | 2018-01-26 | 郑州云海信息技术有限公司 | A kind of method and device for reading data |
| CN110399096A (en) * | 2019-06-25 | 2019-11-01 | 苏州浪潮智能科技有限公司 | Metadata of distributed type file system caches the method, apparatus and equipment deleted again |
| CN110795031A (en) * | 2019-10-17 | 2020-02-14 | 北京浪潮数据技术有限公司 | Data deduplication method, device and system based on full flash storage |
| CN111443874A (en) * | 2020-03-28 | 2020-07-24 | 华中科技大学 | Solid-state disk memory cache management method and device based on content awareness and solid-state disk |
| CN113297105A (en) * | 2021-05-08 | 2021-08-24 | 阿里巴巴新加坡控股有限公司 | Cache processing method and device for converted address |
| CN113535708A (en) * | 2021-09-17 | 2021-10-22 | 苏州浪潮智能科技有限公司 | Data deduplication method, system, storage medium and equipment |
| CN115437579A (en) * | 2022-11-04 | 2022-12-06 | 苏州浪潮智能科技有限公司 | Metadata management method and device, computer equipment and readable storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101630290A (en) * | 2009-08-17 | 2010-01-20 | 成都市华为赛门铁克科技有限公司 | Method and device of processing repeated data |
| CN101882141A (en) * | 2009-05-08 | 2010-11-10 | 北京众志和达信息技术有限公司 | Method and system for implementing repeated data deletion |
| CN102761596A (en) * | 2011-04-28 | 2012-10-31 | 汤姆森许可贸易公司 | Method for uploading a file in an on-line storage system and corresponding on-line storage system |
| CN102799659A (en) * | 2012-07-05 | 2012-11-28 | 广州鼎鼎信息科技有限公司 | Overall repeating data deleting system and method based on non-centre distribution system |
| US20140143213A1 (en) * | 2012-11-22 | 2014-05-22 | Kaminario Technologies Ltd. | Deduplication in a storage system |
| CN104933010A (en) * | 2014-03-18 | 2015-09-23 | 华为技术有限公司 | Duplicated data deleting method and apparatus |
| US20160224588A1 (en) * | 2015-01-29 | 2016-08-04 | Sk Hynix Memory Solutions Inc. | Data integrity and loss resistance in high performance and high capacity storage deduplication |
| CN106095332A (en) * | 2016-06-01 | 2016-11-09 | 杭州宏杉科技有限公司 | A kind of data heavily delete method and device |
| US20160371347A1 (en) * | 2015-06-18 | 2016-12-22 | International Business Machines Corporation | Conversion of forms of user data segment ids in a deduplication system |
| CN106528703A (en) * | 2016-10-26 | 2017-03-22 | 杭州宏杉科技股份有限公司 | Deduplication mode switching method and apparatus |
| CN106527973A (en) * | 2016-10-10 | 2017-03-22 | 杭州宏杉科技股份有限公司 | A method and device for data deduplication |
-
2017
- 2017-04-13 CN CN201710239910.9A patent/CN107122130B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101882141A (en) * | 2009-05-08 | 2010-11-10 | 北京众志和达信息技术有限公司 | Method and system for implementing repeated data deletion |
| CN101630290A (en) * | 2009-08-17 | 2010-01-20 | 成都市华为赛门铁克科技有限公司 | Method and device of processing repeated data |
| CN102761596A (en) * | 2011-04-28 | 2012-10-31 | 汤姆森许可贸易公司 | Method for uploading a file in an on-line storage system and corresponding on-line storage system |
| CN102799659A (en) * | 2012-07-05 | 2012-11-28 | 广州鼎鼎信息科技有限公司 | Overall repeating data deleting system and method based on non-centre distribution system |
| US20140143213A1 (en) * | 2012-11-22 | 2014-05-22 | Kaminario Technologies Ltd. | Deduplication in a storage system |
| CN104933010A (en) * | 2014-03-18 | 2015-09-23 | 华为技术有限公司 | Duplicated data deleting method and apparatus |
| US20160224588A1 (en) * | 2015-01-29 | 2016-08-04 | Sk Hynix Memory Solutions Inc. | Data integrity and loss resistance in high performance and high capacity storage deduplication |
| US20160371347A1 (en) * | 2015-06-18 | 2016-12-22 | International Business Machines Corporation | Conversion of forms of user data segment ids in a deduplication system |
| CN106095332A (en) * | 2016-06-01 | 2016-11-09 | 杭州宏杉科技有限公司 | A kind of data heavily delete method and device |
| CN106527973A (en) * | 2016-10-10 | 2017-03-22 | 杭州宏杉科技股份有限公司 | A method and device for data deduplication |
| CN106528703A (en) * | 2016-10-26 | 2017-03-22 | 杭州宏杉科技股份有限公司 | Deduplication mode switching method and apparatus |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107632944A (en) * | 2017-09-22 | 2018-01-26 | 郑州云海信息技术有限公司 | A kind of method and device for reading data |
| CN107632944B (en) * | 2017-09-22 | 2021-06-18 | 郑州云海信息技术有限公司 | Method and device for reading data |
| CN110399096B (en) * | 2019-06-25 | 2022-12-23 | 苏州浪潮智能科技有限公司 | Method, device and equipment for deleting metadata cache of distributed file system again |
| CN110399096A (en) * | 2019-06-25 | 2019-11-01 | 苏州浪潮智能科技有限公司 | Metadata of distributed type file system caches the method, apparatus and equipment deleted again |
| CN110795031A (en) * | 2019-10-17 | 2020-02-14 | 北京浪潮数据技术有限公司 | Data deduplication method, device and system based on full flash storage |
| CN111443874A (en) * | 2020-03-28 | 2020-07-24 | 华中科技大学 | Solid-state disk memory cache management method and device based on content awareness and solid-state disk |
| CN111443874B (en) * | 2020-03-28 | 2021-07-27 | 华中科技大学 | Solid-state disk memory cache management method and device based on content awareness and solid-state disk |
| CN113297105A (en) * | 2021-05-08 | 2021-08-24 | 阿里巴巴新加坡控股有限公司 | Cache processing method and device for converted address |
| CN113297105B (en) * | 2021-05-08 | 2024-01-09 | 阿里巴巴新加坡控股有限公司 | Cache processing method and device for converting address |
| CN113535708A (en) * | 2021-09-17 | 2021-10-22 | 苏州浪潮智能科技有限公司 | Data deduplication method, system, storage medium and equipment |
| WO2023040200A1 (en) * | 2021-09-17 | 2023-03-23 | 苏州浪潮智能科技有限公司 | Data deduplication method and system, and storage medium and device |
| CN115437579A (en) * | 2022-11-04 | 2022-12-06 | 苏州浪潮智能科技有限公司 | Metadata management method and device, computer equipment and readable storage medium |
| CN115437579B (en) * | 2022-11-04 | 2023-03-24 | 苏州浪潮智能科技有限公司 | Metadata management method and device, computer equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107122130B (en) | 2020-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107122130A (en) | A kind of data delete method and device again | |
| CN103345472B (en) | De-redundant file system based on limited binary tree Bloom filter and construction method thereof | |
| CN104850358B (en) | A kind of magneto-optic electricity mixing storage system and its data acquisition and storage method | |
| CN100541453C (en) | Large capacity cache implementation method and storage system | |
| CN105677580A (en) | Method and device for accessing cache | |
| CN107436725A (en) | A kind of data are write, read method, apparatus and distributed objects storage cluster | |
| CN109800185B (en) | Data caching method in data storage system | |
| CN102467408A (en) | Method and device for accessing data of virtual machine | |
| CN105095116A (en) | Cache replacing method, cache controller and processor | |
| CN110321301A (en) | A kind of method and device of data processing | |
| CN105117355A (en) | Memory, memory system and data process method | |
| CN108733306A (en) | A kind of Piece file mergence method and device | |
| CN105917319A (en) | Memory unit and method | |
| CN106407224A (en) | Method and device for file compaction in KV (Key-Value)-Store system | |
| CN105117351A (en) | Method and apparatus for writing data into cache | |
| CN110147331B (en) | Cache data processing method and system and readable storage medium | |
| CN114860785B (en) | Cache data processing system, method, computer device and storage medium | |
| CN103635887A (en) | Data caching method and storage system | |
| CN115543938A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN109766318A (en) | File reading and device | |
| CN109407985B (en) | Data management method and related device | |
| CN109684238A (en) | A kind of storage method, read method and the solid state hard disk of solid state hard disk mapping relations | |
| CN107341114A (en) | A kind of method of directory management, Node Controller and system | |
| CN106095332A (en) | A kind of data heavily delete method and device | |
| CN110442533A (en) | A kind of method, equipment and storage medium improving access performance |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |