CN108694129A - Determine the method that position is ultimately written in the memory block of flash storage - Google Patents
Determine the method that position is ultimately written in the memory block of flash storage Download PDFInfo
- Publication number
- CN108694129A CN108694129A CN201810239262.1A CN201810239262A CN108694129A CN 108694129 A CN108694129 A CN 108694129A CN 201810239262 A CN201810239262 A CN 201810239262A CN 108694129 A CN108694129 A CN 108694129A
- Authority
- CN
- China
- Prior art keywords
- memory block
- search section
- ultimately written
- data item
- written
- 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
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0238—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory
- G06F12/0246—Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory in block erasable memory, e.g. flash memory
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The present invention relates to a kind of methods that position is ultimately written in memory block of determining flash storage, including:The first position and the second position of memory block are set, memory block is planned to multiple search sections;The writable state that different traversal methods are examined at least one position in each search section is respectively adopted, position is ultimately written with determination.It can not only promote the storage, lookup and delete operation of data, additionally it is possible to help to extend flash storage service life.
Description
Technical field
The present invention relates to flash storage technical fields, more specifically to a kind of depositing for determining flash storage
The method that position is ultimately written in storage area.
Background technology
Flash storage is a kind of common mass data storage chip, inner space using sector as storage cell, with
Byte is write-in unit.Wherein, data erasing is unable to single byte to carry out, and erasable number is limited, excessively frequently erasable to make
It is reduced at its service life.In addition, no data index structure in Flash.Conventional flash storage wiring method is to write full one
Rewriting is wiped in a sector again, and in such a way, long term frequent storage mass data can cause larger abrasion, reduction to make memory
Use the service life.
In the prior art, it is also possible to an index data structure is safeguarded using a special sector space, but in this way
Limited space resources can not only be consumed, and this sector similarly needs to be subjected to frequent erasable, causes concentrated wear tight
Weight.
Therefore, a certain amount of data record is effectively preserved in storage region, and takes into account flash storage use simultaneously
Service life, data access are easily considered, and are the targets of those skilled in the art's concern.
Invention content
One of the objects of the present invention is to provide a kind of methods that position is ultimately written in determining memory block, can promote
Efficient read-write to flash storage helps to overcome defect in the prior art.
To achieve the above object, it is as follows to provide a kind of technical solution by the present invention:
A kind of method that position is ultimately written in the memory block of determining flash storage, including:A), it is arranged the first of memory block
Memory block is planned to multiple search sections by position and the second position;B) it different traversal methods, is respectively adopted is examined in and respectively search
The writable state of at least one position in rope section is ultimately written position with determination.
Preferably, traversal method includes:Order traversal;Inverted order traverses;And dichotomy traversal.
Preferably, step b) is specifically included:B1 the writable state of first position), is checked, if first position is writable
State is then ultimately written position in the lookup of the first search section;Wherein, the first search section be located at the initial position of memory block with
Between first position;B2), check the second position writable state, if the second position be can not write state, searched second
Rope area segment search is ultimately written position;Wherein, the second search section is located between the second position and final position of memory block;With
And b3), third search section lookup be ultimately written position;Wherein, third search section is located at first position and the second position
Between.
Another object of the present invention is to provide a kind of method that data are efficiently written.
To achieve the above object, it is as follows to provide a kind of technical solution by the present invention:
A method of new data being written in flash storage, including:Step 1: planning multiple storages in flash storage
Area;Step 2: one of multiple memory blocks to be determined as to the memory block of current operation;Step 3: using determining as described above
The method that position is ultimately written in memory block is searched in the memory block of current operation is ultimately written position;And Step 4: base
It is ultimately written position in the memory block for determining current operation, new data is cyclically written between different memory blocks.
Another object of the present invention is to provide a kind of efficiently method of searching data item in memory block, can promote
Reduce the abrasion to flash storage.
To achieve the above object, the present invention also provides a kind of technical solution is as follows:
A method of the searching data item in the memory block of flash storage, including:A), the first position of memory block is set
And the second position, memory block is planned to multiple search sections;B) different traversal methods, are respectively adopted successively in each search section
It is inside searched, to determine whether data item is stored in the search section.
Invention additionally discloses a kind of methods that data are deleted in memory block from flash storage, including:A), according to such as
What the method that position is ultimately written in the upper determining memory block determined memory block is ultimately written position;B) it, is ultimately written position certainly
It has been set that, searched in memory block in data to be deleted based on the corresponding storage sequencing relationship of each storage location in memory block
First data item to be deleted, to determine the first delete position;Wherein, the first data item data to be deleted to be deleted are included
Any of at least one data item to be deleted;And entry c), based at least one data item to be deleted, to store
Each data item to be deleted in sequencing relationship before or after the first delete position adds deletion label respectively.
Various embodiments of the present invention are respectively provided in the side of method, searching data item that data are written in memory/storage areas
Method and delete data method, these methods can not only promote the efficient storage to data, positioning, or search, modification and
Delete operation, additionally it is possible to help to extend flash storage service life.
Description of the drawings
Fig. 1 shows that according to an embodiment of the invention searched in the memory block of current operation using dichotomy is ultimately written
The flow diagram of position.
Fig. 2 shows the methods of the searching data item according to an embodiment of the invention in the memory block of flash storage
Flow diagram.
Fig. 3 shows the storage location schematic diagram in the memory block of flash storage according to an embodiment of the invention.
Specific implementation mode
Detail is proposed in the following description, in order to provide thorough understanding of the present invention.However, the technology of this field
Personnel will clearly know, can implement the embodiment of the present invention without these details.In the present invention, it can carry out
Specific numeric reference, such as " first element ", " second device " etc..But be understood not to must for specific number reference
Its literal sequence must be submitted to, but should be understood that " first element " is different from " second element ".
Detail proposed by the invention is exemplary, and detail can change, but still fall into the present invention
Spirit and scope within.Term " coupling ", which is defined to indicate that, is directly connected to component or via another component and in succession
It is connected to component.
Below by way of the preferred embodiment for the mthods, systems and devices for being described with reference to be adapted for carrying out the present invention.Though
Right each embodiment be described for single combine of element, however, it is understood that the present invention include all of disclosed element can
It can combination.Therefore, if one embodiment includes element A, B and C, and second embodiment includes element B and D, then of the invention
Other residue combinations of A, B, C or D should be believed to comprise, even if not disclosing clearly.
It should be noted that according to various embodiments of the present invention, memory may include one or more memory blocks, each to store
Area can have identical or different memory capacity, can be to apply write-in provided by the present invention on either of which memory block
The method of data.Term " position " in the present invention is it will be appreciated that be physical location, mapping position, and, logical place.
First embodiment of the invention provides a kind of method that position is ultimately written in the memory block of determining flash storage,
It includes that following steps are rapid.
Step 1: the first position and the second position of setting memory block, and then memory is planned to multiple search sections.
Step 2: the writable shape that different traversal methods are examined at least one position in each search section is respectively adopted
State is ultimately written position with determination.
As an example, in step 1, the first search section will be determined as between the initial position and first position of memory block,
It will be determined as the second search section between the second position and final position of memory block, it will be true between first position and the second position
It is set to third search section.As a kind of preferred embodiment, first position is located at the 25% of memory block(Initial position with
Memory capacity between first position accounts for the 25% of whole memory capacity), the second position is located at the 75% of memory block(Initial position
Memory capacity between the second position accounts for the 75% of whole memory capacity).
As an example, in the first stage of step 2, the writable state of first position is first checked for, if it is writable
State(Position is ultimately written to be located at before first position), it means that the first search section is not write completely, then in first field of search
Segment search is ultimately written position;If it is can not write state, it means that the first search section has been write full, then carries out second-order
The inspection of section.
In the second stage of step 2, the writable state of the second position is checked, if the second position is can not write state
(It has been write before the second position completely, being ultimately written position should be after the second position), this indicates that the second search section may not write
It is full, then it is ultimately written position in the lookup of the second search section;If the second position is writable state(Position is ultimately written second
Before position), it is full that this indicates that third search section may not write, then carries out the inspection of phase III.
In the phase III of step 2, is searched in third search section and be ultimately written position.
As a kind of improvement to above-mentioned first embodiment, in above-mentioned steps two, adopted in the first, second search section
Rearmost position is searched with order traversal method or inverted order traversal method, and uses dichotomy traversal side in third search section
Method is searched.This dichotomy and sequence(Inverted order)The limitation of dichotomy can be avoided by traversing the lookup method being combined, together
When promote to flash storage(And memory block therein)Efficient read-write.
Second embodiment of the invention provides a kind of method that data being written in flash storage comprising following steps
Suddenly.
Step 1: multiple memory blocks are planned in flash storage, for example, the first, second memory block.
Step 2: one of multiple memory blocks to be determined as to the memory block of current operation.
Specifically, in implementation process, memory block may include mark 1 and mark 2.Mark 1 can be used to refer to currently
The memory block of operation, mark 2 can be used for indicating whether the memory block is filled with.It is current operation that the first memory block, which can be given tacit consent to,
Memory block, the second memory block is as spare memory block.
If the mark 1 of the first memory block indicates that it is the memory block of current operation, and mark 2 indicates that it is not filled with, then
Data need that the first memory block is written, and the first memory block is still the memory block of current operation;If mark 2 indicates the first memory block
It has been be filled with that, then data need that the second memory block is written, and the second memory block should be set to the memory block of current operation.Similarly, if
The mark 1 of second memory block indicates that it is the memory block of current operation, and mark 2 indicates that it is not filled with, then data write-in second
Memory block(Still as the memory block of current operation);If mark 2 indicates that the second memory block has been filled with, data should be written first and deposit
Storage area(First memory block is changed to the memory block of current operation).When the first, second memory block has been filled with, may be selected to wipe
Except the first memory block, and it is reset to the memory block of current operation, in case write-in new data.
Step 3: being ultimately written storage of the method in current operation of position using the determination that above-mentioned first embodiment provides
It is searched in area and is ultimately written position.
Step 4: being ultimately written position based on the memory block for determining current operation, recycled between different memory blocks
New data is written in ground.
According to another improvement embodiment of the present invention, searched in the memory block of current operation using dichotomy in step 3
It is ultimately written position, can be executed by such as following multiple sub-steps, as shown in Figure 1.
Step S10, the memory block of current operation is checked(Hereinafter, if not particularly pointing out, memory block will be appreciated that currently
The memory block of operation)The writable state of middle first position;If writable state(For example, status indication is blank or writeable
Enter), then that memory block is searched between the initial position of memory block and first position is ultimately written position, and then advances to step
S140(For the sake of simplicity, it is not shown in the accompanying drawings).
Wherein, take flash storage capacity be 8M as an example, first position is initially set to the first memory block
In section, the first storage section is the part between the 22.5%-27.5% of the memory block;For example, first position is located at memory block
At 25%.
Because the data in the memory block of flash storage are stored in the way of cycle, if first position is writable
State then means that the position that is ultimately written of memory block is located between the initial position and first position of memory block(Below by this
One section of storage region is labeled as the first search section), as shown in Figure 3.At this moment, it is searched in the first search section to obtain
Memory block is ultimately written position.Once acquisition is ultimately written position, then four can be entered step new data is written.
Wherein, it is searched in the first search section and is ultimately written position and can be realized by following concrete mode:First
It is traversed position by position in search section, until determine flash storage is ultimately written position.
Step S11, the writable state of the second position in memory block is checked;If can not write state, then in memory block
The second position and final position between search be ultimately written position.
Wherein, the second position is initially set in the second storage section, is taken flash storage capacity to be used as 8M and is shown
Example, the second storage section are the part between the 72.5%-77.5% of memory block;For example, the second position is located at the 75% of memory block
Place.
Specifically, in step slo if it is determined that first position be can not write state, this expression, be ultimately written position position
After first position, both this includes again situation, i.e.,:It is ultimately written the second position and final position that position is located at memory block
Between(This section of storage region is labeled as the second search section below), alternatively, being ultimately written position is located at memory block
Between one position and the second position.
In step S11, determines and be ultimately written whether position is located in the second search section.Specifically, because of Flash
Data in memory are stored in the way of cycle, if the second position is can not write state, then it represents that be ultimately written position
In the second search section.At this moment, memory block can be found most in the second search section for example by way of traversal
Writing position afterwards, then, since be in close proximity to be ultimately written next position of position from be written new data.If on the contrary, second
Position is writable state, then it represents that is ultimately written position between first position and the second position, at this moment, is determined to be final
It is ultimately written position, S12 will be followed the steps below.
Step S12, check whether the third place between the first location and the second location is to be ultimately written position.
Specifically, the third place is preferably the centre position between first position and the second position.As an example, by first
The serial number of position and the serial number averaged of the second position seek mathematics median, are taken as the average value or median
After whole, the serial number as the third place.
Herein, take centre position to accelerate the lookup to being ultimately written position, this thought source in mathematics two
Point-score is searched, and traversal lookup mode is substantially better than on search efficiency.
In step s 12, if the third place is to be ultimately written position, four can be entered step new data is written;Otherwise,
Follow the steps below S130-S131(S132).
Step S130, determine whether the third place is writable state.
The step is undertaken in determines that the third place is not to be ultimately written position in step s 12, at this moment, is divided according to mathematics two
The thought that method is searched, will start iterative process.Following steps S131(S132)The parameter used in iteration is reset, S131 is with S132
The step of alternative executes.
Specifically, if the third place is writable state, this expression is ultimately written position and is located in third search section(The
Between one position and the third place), as shown in figure 3, at this moment selection executes step S131, using the third place as the second position,
In case carrying out binary search in third search section.
If on the contrary, the third place be can not write state, this expression is ultimately written position and is located in the 4th search section(The
Between three positions and the 4th position), as shown in figure 3, at this moment selection executes step S132, using the third place as first position,
In case carrying out binary search in the 4th search section.
In step S131(S132)Later, iterative step is executed(It can execute arbitrary multiple):Repeat step S12,
S130-S131(S132), until determining that the third place is to be ultimately written position.Iterative step is in fig. 1 only with arrow of turning back
(It is directed toward the inlet step S12)It shows.
According to another improvement embodiment of the present invention position is ultimately written in the memory block of current operation in step 4
Next position rise write-in new data.
Specifically, if being ultimately written position not and being the final position of the memory block of current operation, next position is
It is in close proximity to the next position for being ultimately written position in position in the memory block of current operation;If it is to work as to be ultimately written position
The final position of the memory block of preceding operation, next position are:First position of the memory block of blank;Or, another is stored
The next position for being ultimately written position in area;Or, first position of another memory block.
In addition, in step 4, when new data is written, if the memory block of current operation is arrived in the write-in part of new data
Final position, then the still unwritten parts of new data are written from following position:First position of the memory block of blank;
Or, the next position for being ultimately written position of another memory block;Or, first position of another memory block.
It is appreciated that realize the cycle memory module of flash storage, if current behaviour is arrived in the write-in part of new data
The memory block of work(Such as first memory block)Final position and new data not yet writes, then by the still unwritten parts of new data
From another memory block(Second memory block)Original position write-in.
Find suitable writing position(It is ultimately written next position of position)Afterwards, it other than new data, can write together
Enter check bit.After writing data, then reads data and be compared with former data;If consistent, expression is written successfully.After success,
Write-in Success Flag is set on side after data recording.And if inconsistent, indicate write-in failure, it at this moment, can be presently written
Data are re-write at next position of position.
According to above-mentioned first embodiment the reading to flash storage can be reduced by realizing the orderly storage to data
Frequency is write, to can not only easily access data, additionally it is possible to reduce the abrasion to flash storage.
Third embodiment of the invention provides a kind of searching specific data item in the memory block of flash storage
Method comprising following steps.
Step 1: the first position and the second position of setting memory block, multiple search sections are planned to by memory block.
It is searched in each search section successively Step 2: different traversal methods are respectively adopted, with determination number to be found
Whether it is stored in the search section according to item.Wherein, traversal method includes order traversal, inverted order traversal and dichotomy traversal.
As a kind of improvement realization method of above-mentioned 3rd embodiment, a kind of more specific implementation steps presented below.Such as
Shown in Fig. 2.
Step S20, the specific data item is searched between the initial position of memory block and first position.
Specifically, if in the first search section(As shown in Figure 3)In find the data item, then ending method.It was searching
The method of traversal may be used to carry out in Cheng Zhong.
Step S21, the specific data item is searched between the second position of memory block and final position.
Specifically, if in the second search section(As shown in Figure 3)In find the data item, then ending method.Furthermore, it is possible to
Understand, step S20, S21 can be executed in a reverse order, alternatively, parallel execute, not influence the technology effect of the present invention
Fruit, to which protection scope of the present invention should be fallen into.
Step S22, check whether the third place between the first location and the second location is stored with data item.
Specifically, if finding, the third place stores the specific data item, and lookup terminates.If it is not, then being looked into according to dichotomy
The thought looked for will be iterated lookup, to accelerate entire search procedure.
Preferably, the serial number in centre position of the third place between first position and the second position, centre position can press
Serial number(The serial number of first position, the second position)Average value or the mode of median rounding acquire.
Step S230, storage label and first position, the second position and the third place of data item respectively institute are determined respectively
Precedence relationship between the storage label of storage.
As described above, because the data in flash storage are stored in the way of cycle, stored at each storage location
Data item in can further include one storage label, can show that the data item deposit flash storage priority
The time of ordinal relation or deposit, or it is presented as that label is completed in a kind of deposit.To by by the first, second storage location institute
Including storage label compared respectively with the storage of the specific data item searched label, it is specific that this can be more quickly determined
Specific location of the data item in flash storage.
According to precedence relationship determined by step S230, one of following steps S231, S232 is selected to execute.
It is marked after the storage label that first position is included and in the third place institute in the storage of the specific data item
Including storage label before in the case of(It is denoted as the first relationship below), selection execution step S231:Using the third place as
The second position.First relationship can show that, according to the sequencing relationship that each position data item is stored in, specific data item is located at the
It, at this moment, will be in third search section between one position and the third place(As shown in Figure 3)Middle execution binary search.
And in the storage label of the specific data item before the storage label that the second position is included and in the third place
Including storage label after in the case of(It is denoted as the second relationship below), selection execution step S232:Made with the third place
For the second position.Second relationship shows specific data item between the third place and the second position, at this moment, will be searched the 4th
Rope section(As shown in Figure 3)Middle execution binary search.
Iterative step(It is shown with the arrow of turning back for being directed toward step 22 inlet in Fig. 2)In will repeat step S22,
S230-S231(S232), until finally determining that the third place is stored with specific data item to be found.
According to the second embodiment, specific data item quickly can be positioned or found in flash storage, is also helped
In reducing the read-write frequency to flash storage, to extend the service life of flash storage.
Fourth embodiment of the invention provides a kind of method that data are deleted in the memory block from flash storage(Attached drawing is not
It shows), this method includes following steps.
Step S40, determine memory block is ultimately written position.
Wherein, it is ultimately written position for determination, the method provided in above-mentioned first embodiment can be directly provided.
Step S41, from being ultimately written position, based on the corresponding storage sequencing relationship of each storage location in memory block
The first data item to be deleted in data to be deleted is searched in memory block, to determine the first delete position.
Wherein, any at least one data item to be deleted that the first data item to be deleted includes by data to be deleted
It is a.
Step S42, the entry based at least one data item to be deleted, to be in first in storage sequencing relationship
Delete position first and/or after each data item to be deleted add respectively deletion mark.
According to fourth embodiment, since the data item deposit in memory block has storage sequencing relationship, based on waiting deleting
Except the entry of data, from the first delete position this sequentially forward or backward(Or simultaneously to forward direction after), can be quick
Ground determines the position of other data item to be deleted, then carries out deletion action(Add deletion mark respectively for each data item to be deleted
Note).
In subsequent steps, as unit of the sector in flash storage, each data item in a sector is all added
After deleting label, erasing operation can be executed to entire sector.
Above description is not lain in and is limited the scope of the invention only in the preferred embodiment of the present invention.Ability
Field technique personnel may make various modifications design, the thought without departing from the present invention and subsidiary claim.
Claims (16)
1. a kind of method that position is ultimately written in memory block of determining flash storage, including:
A), the first position and the second position of the memory block are set, the memory block is planned to multiple search sections;
B) the writable state that different traversal methods are examined at least one position in each described search section, is respectively adopted,
To be ultimately written position described in determination.
2. according to the method described in claim 1, it is characterized in that, the traversal method includes:
Order traversal;Inverted order traverses;And dichotomy traversal.
3. according to the method described in claim 2, it is characterized in that, step b) is specifically included:
B1 the writable state of the first position), is checked, if the first position is writable state, in the first search
Section is ultimately written position described in searching;Wherein, first search section be located at the initial position of the memory block with it is described
Between first position;
B2), check the writable state of the second position, if the second position be can not write state, searched second
It is ultimately written position described in rope area segment search;Wherein, second search section is located at the second position of the memory block
Between final position;And
B3 position is ultimately written described in), being searched in third search section;Wherein, the third search section is located at described first
Between position and the second position.
4. according to the method described in claim 3, it is characterized in that, in first search section and second field of search
It is ultimately written position described in being searched using order traversal method or inverted order traversal method in section, in the third search section
It is ultimately written position described in being searched using dichotomy traversal method.
5. method according to claim 1 to 4, which is characterized in that the position includes:
Physical location;Mapping position;And logical place.
6. a kind of method that new data being written in flash storage, including:
Step 1: planning multiple memory blocks in the flash storage;
Step 2: one of the multiple memory block to be determined as to the memory block of current operation;
Step 3: being searched finally in the memory block of the current operation using the method described in any one of claim 1-5
Writing position;And
Step 4: position is ultimately written described in memory block based on the determination current operation, in the different memory blocks
Between new data is cyclically written.
7. according to the method described in claim 6, it is characterized in that, step 4 includes:
Play write-in new data in next position that position is ultimately written described in the memory block of the current operation;
Wherein, if the final position of the memory block for being ultimately written position not and be the current operation, next position
It is set to and is in close proximity to the next position for being ultimately written position in position in the memory block of the current operation;
If the final position for being ultimately written the memory block that position is the current operation, next position is:
(1), first position of the memory block of blank;
(2), the next position for being ultimately written position of another memory block;Or
(3), first position of another memory block.
8. according to the method described in claim 6, it is characterized in that, in step 4:
If the final position of the memory block of the current operation is arrived in the write-in part of the new data, by the new number
According to still unwritten parts be written from following position:
(1), first position of the memory block of blank;
(2), the next position for being ultimately written position of another memory block;Or
(3), first position of another memory block.
9. a kind of method of the searching data item in the memory block of flash storage, including:
A), the first position and the second position of the memory block are set, the memory block is planned to multiple search sections;
B) different traversal methods, are respectively adopted to be searched in each described search section successively, are with the determination data item
It is no to be stored in the search section.
10. according to the method described in claim 9, it is characterized in that, the traversal method includes:
Order traversal;Inverted order traverses;And dichotomy traversal.
11. according to the method described in claim 10, it is characterized in that, step b) includes:
B1), the data item is searched in the first search section;Wherein, first search section is located at rising for the memory block
Beginning position and the first position between;
B2), the data item is searched in the second search section;Wherein, second search section is located at the institute of the memory block
It states between the second position and final position;And
B3), the data item is searched in third search section;Wherein, the third search section be located at the first position with
Between the second position.
12. according to the method for claim 11, which is characterized in that in first search section and second search
The data item is searched using order traversal method or inverted order traversal method in section, is used in the third search section
Dichotomy traversal method searches the data item.
13. the method according to any one of claim 9 to 12, which is characterized in that the position includes:
Physical location;Mapping position;And logical place.
14. a kind of method that data are deleted in memory block from flash storage, including:
What a), method according to any one of claims 1-5 determined the memory block is ultimately written position;
B), from it is described be ultimately written position, based on the corresponding storage sequencing relationship of each storage location in the memory block
The first data item to be deleted in data to be deleted is searched in the memory block, to determine the first delete position;Wherein, described
Any of at least one data item to be deleted that first data item to be deleted includes by the data to be deleted;And
C) entry, based at least one data item to be deleted, to be in described in the storage sequencing relationship
Each data item to be deleted before or after first delete position adds deletion label respectively.
15. a kind of machine readable storage medium, is stored thereon with computer executable instructions, which is characterized in that the computer
Executable instruction when executed by the processor, realize any one of any one of claim 1 to 5 or claim 6 to 8 or
Any one of claim 9 to 13 or method of claim 14.
16. a kind of computer control system, which is characterized in that the computer control system is being implemented to be stored in memory
When computer executable instructions, perform claim requires any one of any one of 1 to 5 or claim 6 to 8 or claim
Any one of 9 to 13 or the step of method of claim 14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810239262.1A CN108694129B (en) | 2018-03-22 | 2018-03-22 | Method for determining last writing position in storage area of Flash memory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810239262.1A CN108694129B (en) | 2018-03-22 | 2018-03-22 | Method for determining last writing position in storage area of Flash memory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108694129A true CN108694129A (en) | 2018-10-23 |
| CN108694129B CN108694129B (en) | 2021-06-22 |
Family
ID=63844253
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810239262.1A Active CN108694129B (en) | 2018-03-22 | 2018-03-22 | Method for determining last writing position in storage area of Flash memory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108694129B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109933542A (en) * | 2019-02-27 | 2019-06-25 | 记忆科技(深圳)有限公司 | Based on solid state hard disk AES key dynamic management approach and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1627272A (en) * | 2003-12-10 | 2005-06-15 | 上海贝豪通讯电子有限公司 | Method for managing files in flash memory of mobile terminal |
| US20100064110A1 (en) * | 2006-12-14 | 2010-03-11 | Joern Boettcher | Method for reading out data from a storage medium |
| CN103294615A (en) * | 2012-02-24 | 2013-09-11 | 北京四达时代软件技术股份有限公司 | Method for storing user information of set top box |
| CN103729303A (en) * | 2014-01-20 | 2014-04-16 | 飞天诚信科技股份有限公司 | Data writing and data reading methods of Flash |
| CN104794065A (en) * | 2015-05-04 | 2015-07-22 | 常州工学院 | Multi-group fixed length data circulation access method |
-
2018
- 2018-03-22 CN CN201810239262.1A patent/CN108694129B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1627272A (en) * | 2003-12-10 | 2005-06-15 | 上海贝豪通讯电子有限公司 | Method for managing files in flash memory of mobile terminal |
| US20100064110A1 (en) * | 2006-12-14 | 2010-03-11 | Joern Boettcher | Method for reading out data from a storage medium |
| CN103294615A (en) * | 2012-02-24 | 2013-09-11 | 北京四达时代软件技术股份有限公司 | Method for storing user information of set top box |
| CN103729303A (en) * | 2014-01-20 | 2014-04-16 | 飞天诚信科技股份有限公司 | Data writing and data reading methods of Flash |
| CN104794065A (en) * | 2015-05-04 | 2015-07-22 | 常州工学院 | Multi-group fixed length data circulation access method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109933542A (en) * | 2019-02-27 | 2019-06-25 | 记忆科技(深圳)有限公司 | Based on solid state hard disk AES key dynamic management approach and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108694129B (en) | 2021-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10509730B2 (en) | Aggregation of write traffic to a data store | |
| CN102779180B (en) | The operation processing method of data-storage system, data-storage system | |
| CN105335098B (en) | A kind of log file system performance improvement method based on storage level memory | |
| CN1760875B (en) | Transparent migration of files among various types of storage volumes based on file access properties | |
| CN107391774B (en) | The rubbish recovering method of log file system based on data de-duplication | |
| US10565075B2 (en) | Storage device and block storage method based on the storage device | |
| CN103229164B (en) | Data access method and device | |
| CN1645516B (en) | Data recovery apparatus and method used for flash memory | |
| CN105242871A (en) | Data writing method and apparatus | |
| CN103544110A (en) | Block-level continuous data protection method based on solid-state disc | |
| CN104516959A (en) | Method and device for managing database logs | |
| CN107665219B (en) | Log management method and device | |
| CN109582593A (en) | A kind of FTL address mapping method and data read-write method based on calculating | |
| CN110134645B (en) | File system storage management method, file system storage reading method, file system storage management device and file system storage reading device | |
| CN104978148A (en) | Data writing method and device and data reading method and device | |
| US20150205538A1 (en) | Storage apparatus and method for selecting storage area where data is written | |
| CN108694129A (en) | Determine the method that position is ultimately written in the memory block of flash storage | |
| CN113253932B (en) | Read-write control method and system for distributed storage system | |
| US20120317384A1 (en) | Data storage method | |
| KR100725415B1 (en) | Log compaction method and apparatus of database | |
| CN105677244B (en) | A method of reducing the solid state disk write amplification of TLC flash memory | |
| WO2019136969A1 (en) | High-efficiency method for mapping physical position to logical mapping position | |
| CN102981964B (en) | The management method of data space and system | |
| CN109144423A (en) | memory bad block management method, device and flash memory | |
| CN112817520B (en) | Data disk refreshing method and device |
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 |