CN109471813A - A kind of data insertion method and relevant apparatus - Google Patents
A kind of data insertion method and relevant apparatus Download PDFInfo
- Publication number
- CN109471813A CN109471813A CN201811359492.8A CN201811359492A CN109471813A CN 109471813 A CN109471813 A CN 109471813A CN 201811359492 A CN201811359492 A CN 201811359492A CN 109471813 A CN109471813 A CN 109471813A
- Authority
- CN
- China
- Prior art keywords
- node
- destination node
- address mapping
- mapping information
- destination
- 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.)
- Withdrawn
Links
- 238000012966 insertion method Methods 0.000 title claims abstract description 31
- 238000013507 mapping Methods 0.000 claims abstract description 92
- 238000003780 insertion Methods 0.000 claims abstract description 39
- 230000037431 insertion Effects 0.000 claims abstract description 39
- 238000004590 computer program Methods 0.000 claims description 9
- 238000000034 method Methods 0.000 claims description 6
- 230000000694 effects Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 8
- 238000010276 construction Methods 0.000 description 4
- 238000013506 data mapping Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000149 penetrating effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
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/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/10—Address translation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a kind of data insertion methods, first determination is inserted into address mapping information, the corresponding destination node of the information is determined according to address mapping information is inserted into, when destination node does not have vacant position, destination address map information in destination node is inserted into the brotgher of node of destination node, then in the insertion for completing to be inserted into address mapping information.Therefore, even if vacant position is not present in destination node, the node new to memory application is not needed, the insertion for being inserted into address mapping information can be completed using the brotgher of node of destination node yet.To both reduce the use of memory, memory source is saved, when traversing tree due to there is no increase node to can also be improved the efficiency of search.Present invention also provides a kind of data insertion system, device and computer readable storage mediums, and above-mentioned technical effect equally may be implemented.
Description
Technical field
The present invention relates to technical field of data storage, more specifically to a kind of data insertion method, system, device
And computer readable storage medium.
Background technique
In full flash memory system, the LBA (Logical Block Address, logical block addresses) Dao PBA of data
Mapping, the mapping of PBA to LBA and the mapping of HASH to PBA of (Physics Block Address, physical block address)
It can be with the processing to data and by frequent lookup, acquisition.
And these address mapping informations are searched for convenience, it will usually reflect using this data structure of B+ tree come management address
Penetrate information.Specific map information is stored in the leaf node of B+ tree, and leaf node is only stored in non-leaf nodes
Index, thus when searching a certain group of mapping relations, by indexing the leaf for finding this group of mapping relations of storage in layer
Node, the characteristics of according to B+ tree, when searching mapping relations, search speed can improve a lot than traditional data structure.
But during tree grows up, that is, it is necessary to continuous right when be inserted into tree new map information
The node of tree divided, union operation, and these operations just need continuous storage allocation, however continuous storage allocation
The performance of system can be reduced.
Therefore, the division number for how reducing tree is those skilled in the art's problem to be solved.
Summary of the invention
The purpose of the present invention is to provide a kind of data insertion method, system, device and computer readable storage medium, with
Solve the problems, such as how to reduce the division number of tree.
To achieve the above object, the embodiment of the invention provides following technical solutions:
A kind of data insertion method, comprising:
Determination is inserted into address mapping information；
The corresponding destination node of address mapping information is inserted into described in determining in goal tree；
When vacant position is not present in the destination node, the destination address map information in the destination node is pressed
Preset order is inserted into the brotgher of node of the destination node, and the address mapping information that is inserted into is inserted into the target section
The target position of point.
Wherein, the address mapping information includes:
The mapping of the PBA and HASH of data are believed in the map information or flash memory system of the LBA and PBA of data in flash memory system
Breath.
Wherein, described to be inserted into after the corresponding destination node of address mapping information described in determination in goal tree, also wrap
It includes:
When there are when vacant position, the address mapping information that is inserted into is inserted into the target section in the destination node
The target position of point.
Wherein, the destination address map information in the destination node is inserted into the brother of the destination node by preset order
In younger brother's node, by the target position for being inserted into address mapping information and being inserted into the destination node, comprising:
Judge the brotgher of node of the destination node with the presence or absence of vacant position；
If so, the destination address map information in the destination node is inserted into the destination node by preset order
The brotgher of node in, by the target position for being inserted into address mapping information and being inserted into the destination node；
If it is not, then adding new node, the insertion that address mapping information is inserted into described in new node completion is utilized.
Wherein, the addition new node includes:
New node is added between the destination node and the brotgher of node；
It is then described to utilize the insertion that address mapping information is inserted into described in new node completion, comprising:
Destination address map information in the destination node is inserted into the new node, is inserted into address for described
Map information is inserted into the target position of the destination node.
Wherein, the addition new node includes:
New node is added between the destination node and the brotgher of node；
It is then described to utilize the insertion that address mapping information is inserted into described in new node completion, comprising:
The address mapping information of the rear predetermined number of the destination node is inserted into the new node by preset order, by institute
The address mapping information for stating the preceding predetermined number of the brotgher of node is inserted into the new node；
By the target position for being inserted into address mapping information and being inserted into the destination node.
Present invention also provides a kind of data insertion systems, comprising:
First determining module is inserted into address mapping information for determination；
Second determining module, for being inserted into the corresponding destination node of address mapping information described in the determination in goal tree；
It is inserted into module, is used for when vacant position is not present in the destination node, by the target in the destination node
Address mapping information is inserted into the brotgher of node of the destination node by preset order, is inserted into address mapping information for described
It is inserted into the target position of the destination node.
Wherein, the address mapping information includes:
The mapping of the HASH and PBA of data are believed in the map information or flash memory system of the LBA and PBA of data in flash memory system
Breath.
Present invention also provides a kind of data insertion devices, comprising:
Memory, for storing computer program；
Processor, realization is as described in power the step of data insertion method when for executing the computer program.
Present invention also provides a kind of computer readable storage medium, meter is stored on the computer readable storage medium
Calculation machine program is realized when the computer program is executed by processor such as the step of the data insertion method.
By above scheme it is found that a kind of data insertion method provided by the invention, comprising: determination is inserted into address of cache
Information；The corresponding destination node of address mapping information is inserted into described in determining in goal tree；When not deposited in the destination node
At vacant position, the destination address map information in the destination node is inserted into the destination node by preset order
In the brotgher of node, by the target position for being inserted into address mapping information and being inserted into the destination node.
It can be seen that a kind of data insertion method provided by the present application, first determination is inserted into address mapping information, according to
Insertion address mapping information determines the corresponding destination node of the information, when destination node does not have vacant position, by destination node
In destination address map information be inserted into the brotgher of node of destination node, then complete to be inserted into inserting for address mapping information
Enter.Therefore, even if vacant position is not present in destination node, the node new to memory application is not needed, destination node is utilized yet
The brotgher of node can complete the insertion for being inserted into address mapping information.To both reduce the use of memory, memory is saved
Resource, when traversing tree due to not having increase node to can also be improved the efficiency of search.Present invention also provides a kind of data to insert
Enter system, device and computer readable storage medium, above-mentioned technical effect equally may be implemented.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is a kind of data insertion method flow chart disclosed by the embodiments of the present invention；
Fig. 2 is a kind of specific tree construction schematic diagram disclosed by the embodiments of the present invention；
Fig. 3 is a kind of specific data insertion method flow chart disclosed by the embodiments of the present invention；
Fig. 4 is a kind of specific data insertion method flow chart disclosed by the embodiments of the present invention；
Fig. 5 to Figure 10 is respectively a kind of specific tree construction schematic diagram disclosed by the embodiments of the present invention；
Figure 11 is a kind of data insertion system structural schematic diagram disclosed by the embodiments of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
The embodiment of the invention discloses a kind of data insertion method, system, device and computer readable storage mediums, with solution
The problem of certainly how reducing the division number of tree.
Referring to Fig. 1, a kind of data insertion method provided in an embodiment of the present invention is specifically included:
S101, determination are inserted into address mapping information.
In the present solution, determining the address mapping information being inserted into first.Address mapping information includes dodging in this programme
In deposit system in the mapping relations of data LBA and PBA or flash memory system the PBA and HASH of data mapping relations.
Above-mentioned mapping relations include the mapping of LBA → PBA, the mapping of PBA → LBA, the mapping of PBA → HASH again.It needs
Illustrate, one tree is only used to manage a kind of mapping relations.It should be noted that HASH value herein is received according to front end
IO calculate, for judging whether it is repeated data, if need data de-duplication.
S102 is inserted into the corresponding destination node of address mapping information described in determination in goal tree.
Goal tree is exactly to be inserted into the address mapping information tree to be inserted into.In goal tree, determine that this is inserted into address and reflects
Penetrating information specifically will be inserted on which node in tree, this node is as destination node.
S103 maps the destination address in the destination node when vacant position is not present in the destination node
Information is inserted into the brotgher of node of the destination node by preset order, is inserted into described described in address mapping information insertion
The target position of destination node.
It should be noted that tree in each node in can have certain space for storage address map information,
And when needing to be inserted into address mapping information to destination node insertion, vacant position is not present in the possibility of corresponding destination node
Address information is inserted into accommodate.
It is different from the prior art, in this application, when vacant position is not present in the destination node, not directly to interior
One node of application is deposited, but the destination address map information in destination node is first inserted into the brother of destination node in sequence
In younger brother's node, destination node will have vacant position, the mesh that then will be inserted into address mapping information again and be inserted into destination node
Cursor position.
It should be noted that identical as B+ tree, in this application, each node is arranged according to certain sequence in tree
Column, the information of each node are also to arrange according to certain sequence.Such as, in same node layer, data therein are all according to its KEY
Value is arranged from small to large.
Referring to fig. 2, Fig. 2 shows a kind of specific tree constructions.In Fig. 2, the first layer of tree only has a node, this section
Include two group informations in point, be (1, P1) and (25, P2) respectively, 1,25 are used as KEY, P1, P2 Value, in intra-node, number
According to arrangement be from small to large tactic by KEY.The second layer of tree includes two nodes, the two nodes are first
The child node of node layer, and first group of data in each node are the data of its father node, and all data of the second layer it
Between, and arranged according to the descending order of KEY.
Therefore in the present solution, no matter to destination node insertion be inserted into address mapping information, or to its brotgher of node
It is inserted into destination address map information, is all to be sequentially inserted into according to this, and target position is namely sequentially determined according to this
Position.
For example, the KEY for being inserted into address mapping information is 12, it is worth for V7, since 12 between 1 and 25, and the second layer the
The data saved in one node, KEY value is the data between 1 to 25 (not including 25), it is thus determined that its destination node is
First node of the second layer.Further, due to 12 in first node between 10 and 13, it is thus determined that its target position
After the data for being 10 for KEY, before the data that KEY is 13.
Since first node of the second layer is currently without vacant position, so needing to insert destination address map information
Enter the brotgher of node to first node, that is, second layer second node.Since the arrangement of data is according to KEY value size
Arrangement, it is therefore desirable to which the data for being 14 using KEY in first node are inserted into second section as destination address map information
In point, in sequence, destination address map information should be inserted into first position of second node.
It should be noted that since the data of first position of second node are changed, it is also necessary to corresponding
The data of its father node are modified, that is, need original (1, P1) and (25, P2) being revised as (1, P1) and (14, V2).
In this application, the data of each node are the KEY that leaf node saves for example, in practical applications
It can be actual address mapping information with VALUE, if KEY saves the LBA of data, VALUE saves the PBA of data.
In a specific embodiment, when, there are when vacant position, being inserted into ground for described in the destination node
Location map information is inserted into the target position of the destination node.
When there are when vacant position, will directly be inserted into address mapping information insertion in destination node.
It can be seen that a kind of data insertion method provided by the present application, first determination is inserted into address mapping information, according to
Insertion address mapping information determines the corresponding destination node of the information, when destination node does not have vacant position, by destination node
In destination address map information be inserted into the brotgher of node of destination node, then complete to be inserted into inserting for address mapping information
Enter.Therefore, even if vacant position is not present in destination node, the node new to memory application is not needed, destination node is utilized yet
The brotgher of node can complete the insertion for being inserted into address mapping information.To both reduce the use of memory, memory is saved
Resource, when traversing tree due to not having increase node to can also be improved the efficiency of search.
A kind of specific data insertion method provided by the embodiments of the present application is introduced below, one kind described below
The data insertion method of collection can be cross-referenced with above-described embodiment.
Referring to Fig. 3, a kind of specific data insertion method provided by the embodiments of the present application is specifically included:
S201, determination are inserted into address mapping information；
S202 is inserted into the corresponding destination node of address mapping information described in determination in goal tree；
S203, when in the destination node be not present vacant position when, judge the destination node the brotgher of node whether
There are vacant positions, if so, S204 is executed, if it is not, then executing S205.
Destination address map information in the destination node is inserted into the destination node by preset order by S204
In the brotgher of node, by the target position for being inserted into address mapping information and being inserted into the destination node.
S205 adds new node, utilizes the insertion that address mapping information is inserted into described in new node completion.
It should be noted that when insertion is inserted into address mapping information, the brother of possible its destination node and destination node
The case where vacant position is all not present in node, and in this case, the application just needs to add new node, and then column use new node
Complete the insertion for being inserted into address mapping information.
In a specific embodiment, new node is added between the destination node and the brotgher of node；It will
Destination address map information in the destination node is inserted into the new node, and the address mapping information that is inserted into is inserted
Enter the target position of the destination node.
It is excellent in order to reduce the movement of data in the present solution, in view of the data in node will arrange in sequence
It is selected between destination node and its brotgher of node and adds new node.If in one new node of last addition of all nodes,
With regard to needing that the partial data of the brotgher of node is first initially inserted into new node, the then vacant out position of the brotgher of node, then by target section
Destination address map information is inserted into the brotgher of node in point, finally completes the insertion of ingress to be inserted again.Movement is needed in this way
Data volume will be very much, if being inserted into a new node between destination node and the brotgher of node, to only need mobile target
Destination address map information in node.
A kind of specific data insertion method provided by the embodiments of the present application is introduced below, one kind described below
Specific data insertion method can be cross-referenced with any of the above-described embodiment.
Referring to fig. 4, a kind of specific data insertion method provided by the embodiments of the present application is to new node in above-described embodiment
Further restriction and explanation are done, on the basis of the above embodiments, the S205 is specifically included:
S301 adds new node between the destination node and the brotgher of node.
The address mapping information of the rear predetermined number of the destination node is inserted into the new section by preset order by S302
The address mapping information of the preceding predetermined number of the brotgher of node is inserted into the new node by point.
Specifically, after in the present solution, adding new node between destination node and its brotgher of node, first by destination node
The address mapping information of rear predetermined number and the address mapping information of preceding predetermined number of its brotgher of node be inserted into new node
It is interior, so that destination node, the former brotgher of node, new node be made to have vacant position, when being inserted into address mapping information, either to
Which node insertion in these three nodes, can be inserted directly into.
S303, by the target position for being inserted into address mapping information and being inserted into the destination node.
A kind of specific data insertion method provided by the embodiments of the present application is introduced below, the embodiment of the present application can
With cross-referenced with above-mentioned any embodiment.
Referring to Fig. 5 to Fig. 9, Fig. 5 to Fig. 9 is respectively a kind of specific tree construction schematic diagram provided by the embodiments of the present application.
In initial tree, including a node, wherein data are (1, V1) (14, V2), (25, V3), (30, V4).It needs
Bright, in the present solution, P is that pointer (point) is directed toward next child node, V is Value, for specific value.
It needs to add the data that a KEY is 10 at this time and then needs to add one since present node does not have the brotgher of node
Node has a vacant position to make to add latter two node of new node, and this programme is by latter two data in first node
It has been inserted into second node, and has generated new root node, completed the insertion for the data that KEY is 10, the structure set at this time is shown
It is intended to as shown in Figure 6.
Further, the data that a KEY is 13 are inserted into, KEY is there are also spare bits in the 13 corresponding destination node of data
It sets, is inserted directly into, the structural schematic diagram set at this time is as shown in Figure 7.
Further, the data that insertion KEY is 12, the corresponding destination node of the data has been expired at this time, does not apply adding at this time
New node, but first determine the target position for the data being inserted into, that is, between 10 and 13, it then will be more in destination node
The data that KEY out is 14 are inserted into first position of the brotgher of node in order, modify root node, the KEY that will be inserted into
It is inserted into for 12 data, the structural schematic diagram set at this time is as shown in Figure 8.
Further, the data that insertion KEY is 32, corresponding destination node are second node of the second layer, and the node
There is vacant position, be inserted directly into, the structural schematic diagram set at this time is as shown in Figure 9.
Further, the data that insertion KEY is 2, corresponding destination node are first node of the second layer, at this time target section
Point and the brotgher of node are without vacant position, it is therefore desirable to add new node.In the present solution, in destination node and the brotgher of node
Between add new node, and before rear the 1/4 of destination node data and the brotgher of node 1/4 data are inserted into new node,
The KEY the being inserted into data for being 2 are inserted into destination node, the structural schematic diagram set at this time is as shown in Figure 10.
A kind of data insertion system provided by the embodiments of the present application is introduced below, a kind of data described below are inserted
Entering system can be cross-referenced with any of the above-described embodiment.
Referring to Figure 11, a kind of data insertion system provided by the embodiments of the present application is specifically included:
First determining module 401 is inserted into address mapping information for determination.
Second determining module 402, for being inserted into the corresponding target section of address mapping information described in the determination in goal tree
Point.
It is inserted into module 403, is used for when vacant position is not present in the destination node, by the mesh in the destination node
Mark address mapping information is inserted into the brotgher of node of the destination node by preset order, is inserted into address of cache letter for described
Breath is inserted into the target position of the destination node.
Wherein, the HASH and PBA of data in the map information or flash memory system of the LBA and PBA of data in flash memory system
Map information.
The data insertion system of the present embodiment is for realizing data insertion method above-mentioned, therefore in data insertion system
The embodiment part of the visible data insertion method hereinbefore of specific embodiment, for example, the first determining module 401, second really
Cover half block 402 is inserted into module 403, is respectively used to realize step S101, S102, S103 and S104 in above-mentioned data insertion method,
So specific embodiment is referred to the description of corresponding various pieces embodiment, details are not described herein.
A kind of data insertion devices provided by the embodiments of the present application are introduced below, a kind of data described below are inserted
Entering device can be cross-referenced with above-mentioned any embodiment.
A kind of data insertion devices provided by the embodiments of the present application, specifically include:
Memory, for storing computer program；
Processor, realizing the data insertion method as described in above-mentioned any embodiment when for executing the computer program
Step.
Specifically, memory 100 includes non-volatile memory medium, built-in storage.Non-volatile memory medium storage
There are operating system and computer-readable instruction, which is that the operating system and computer in non-volatile memory medium can
The operation of reading instruction provides environment.Processor 200 provides calculating and control ability for data inserting apparatus, may be implemented above-mentioned
Step provided by one data insertion method embodiment.
Present invention also provides a kind of computer readable storage mediums, are stored thereon with computer program, the computer
Step provided by above-described embodiment may be implemented when program is executed by processor.The storage medium may include: USB flash disk, movement
Hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory,
RAM), the various media that can store program code such as magnetic or disk.
Each embodiment in this specification is described in a progressive manner, the highlights of each of the examples are with other
The difference of embodiment, the same or similar parts in each embodiment may refer to each other.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest scope of cause.
Claims (10)
1. a kind of data insertion method characterized by comprising
Determination is inserted into address mapping information；
The corresponding destination node of address mapping information is inserted into described in determining in goal tree；
When vacant position is not present in the destination node, by the destination address map information in the destination node by default
It is sequentially inserted into the brotgher of node of the destination node, the address mapping information that is inserted into is inserted into the destination node
Target position.
2. the method according to claim 1, wherein the address mapping information includes:
In flash memory system in the map information or flash memory system of the LBA and PBA of data the PBA and HASH of data map information.
3. the method according to claim 1, wherein described be inserted into address of cache described in determination in goal tree
After the corresponding destination node of information, further includes:
When, there are when vacant position, the address mapping information that is inserted into being inserted into the destination node in the destination node
Target position.
4. according to claim 1 to method described in 3 any one, which is characterized in that the destination address in the destination node
Map information is inserted into the brotgher of node of the destination node by preset order, is inserted into address mapping information insertion for described
The target position of the destination node, comprising:
Judge the brotgher of node of the destination node with the presence or absence of vacant position；
If so, the destination address map information in the destination node to be inserted into the brother of the destination node by preset order
In younger brother's node, by the target position for being inserted into address mapping information and being inserted into the destination node；
If it is not, then adding new node, the insertion that address mapping information is inserted into described in new node completion is utilized.
5. according to the method described in claim 4, it is characterized in that, the addition new node includes:
New node is added between the destination node and the brotgher of node；
It is then described to utilize the insertion that address mapping information is inserted into described in new node completion, comprising:
Destination address map information in the destination node is inserted into the new node, is inserted into address of cache for described
Information is inserted into the target position of the destination node.
6. according to the method described in claim 4, it is characterized in that, the addition new node includes:
New node is added between the destination node and the brotgher of node；
It is then described to utilize the insertion that address mapping information is inserted into described in new node completion, comprising:
The address mapping information of the rear predetermined number of the destination node is inserted into the new node by preset order, by the brother
The address mapping information of the preceding predetermined number of younger brother's node is inserted into the new node；
By the target position for being inserted into address mapping information and being inserted into the destination node.
7. a kind of data insertion system characterized by comprising
First determining module is inserted into address mapping information for determination；
Second determining module, for being inserted into the corresponding destination node of address mapping information described in the determination in goal tree；
It is inserted into module, is used for when vacant position is not present in the destination node, by the destination address in the destination node
Map information is inserted into the brotgher of node of the destination node by preset order, is inserted into address mapping information insertion for described
The target position of the destination node.
8. system according to claim 7, which is characterized in that the address mapping information includes:
In flash memory system in the map information or flash memory system of the LBA and PBA of data the HASH and PBA of data map information.
9. a kind of data insertion devices characterized by comprising
Memory, for storing computer program；
Processor, realizing the data insertion method as described in any one of claim 1 to 6 when for executing the computer program
Step.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program realizes the step of the data insertion method as described in any one of claim 1 to 6 when the computer program is executed by processor
Suddenly.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811359492.8A CN109471813A (en) | 2018-11-15 | 2018-11-15 | A kind of data insertion method and relevant apparatus |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811359492.8A CN109471813A (en) | 2018-11-15 | 2018-11-15 | A kind of data insertion method and relevant apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109471813A true CN109471813A (en) | 2019-03-15 |
Family
ID=65673702
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811359492.8A Withdrawn CN109471813A (en) | 2018-11-15 | 2018-11-15 | A kind of data insertion method and relevant apparatus |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109471813A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111523783A (en) * | 2020-04-14 | 2020-08-11 | 西云图科技(北京)有限公司 | Data storage method of water affair system |
-
2018
- 2018-11-15 CN CN201811359492.8A patent/CN109471813A/en not_active Withdrawn
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111523783A (en) * | 2020-04-14 | 2020-08-11 | 西云图科技(北京)有限公司 | Data storage method of water affair system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10901949B2 (en) | Method and apparatus for compressing metadata in a file system | |
| CN111125447A (en) | Metadata access method, device and equipment and readable storage medium | |
| US20060212674A1 (en) | Run level address mapping table and related method of construction | |
| CN110147204B (en) | Metadata disk-dropping method, device and system and computer-readable storage medium | |
| CN105468642A (en) | Data storage method and apparatus | |
| KR20200122994A (en) | Key Value Append | |
| CN104079613A (en) | Method and system for multiple tenants to share application program objects | |
| CN103229164B (en) | Data access method and device | |
| GB2476536A (en) | Modified B+ tree to map logical addresses to physical addresses in NAND flash memory | |
| US11392314B2 (en) | Sequentially writing metadata into a solid state disk by redirect-on-write | |
| CN101983376A (en) | Access device, information recording device, information recording system, file management method, and program | |
| CN109460406B (en) | Data processing method and device | |
| CN112148217B (en) | Method, device and medium for caching deduplication metadata of full flash memory system | |
| US11287996B2 (en) | Method, device and computer program product for storing data | |
| CN108664577B (en) | File management method and system based on FLASH idle area | |
| CN102253985A (en) | File system data management method and system | |
| CN109471813A (en) | A kind of data insertion method and relevant apparatus | |
| CN112463055A (en) | Method, system, equipment and medium for optimizing and using L2P table of solid state disk | |
| US10067966B2 (en) | Leveraging hierarchy in a tree data structure to dynamically allocate keys | |
| CN111625198A (en) | Metadata caching method and metadata caching device | |
| US9189382B2 (en) | Noncontiguous representation of an array | |
| CN110334057B (en) | File access method and system thereof | |
| EP4134802A1 (en) | Method and apparatus for data access of nand flash file, and storage medium | |
| CN110781101A (en) | One-to-many mapping relation storage method and device, electronic equipment and medium | |
| CN112035380B (en) | Data processing method, device and equipment and readable storage medium |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20190315 |
|
| WW01 | Invention patent application withdrawn after publication |