CN109690522A - A kind of data-updating method, device and storage device based on B+ tree index - Google Patents
A kind of data-updating method, device and storage device based on B+ tree index Download PDFInfo
- Publication number
- CN109690522A CN109690522A CN201880002420.XA CN201880002420A CN109690522A CN 109690522 A CN109690522 A CN 109690522A CN 201880002420 A CN201880002420 A CN 201880002420A CN 109690522 A CN109690522 A CN 109690522A
- Authority
- CN
- China
- Prior art keywords
- node
- tree
- data
- index
- physical
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000013507 mapping Methods 0.000 claims abstract description 72
- 238000012986 modification Methods 0.000 claims description 23
- 230000004048 modification Effects 0.000 claims description 23
- 230000008859 change Effects 0.000 claims description 19
- 238000010276 construction Methods 0.000 claims description 7
- 230000006870 function Effects 0.000 claims description 7
- 230000008569 process Effects 0.000 description 11
- 238000010586 diagram Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 4
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000000151 deposition Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000010304 firing Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000003321 amplification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000003199 nucleic acid amplification method Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 239000011229 interlayer Substances 0.000 description 1
- 239000010410 layer Substances 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000000149 penetrating effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000007711 solidification Methods 0.000 description 1
- 230000008023 solidification Effects 0.000 description 1
- 235000019640 taste Nutrition 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
This application discloses a kind of data-updating method, device and storage devices based on B+ tree index, the method modifies to data in the way of copy-on-write, the described method includes: obtaining the node for needing the data updated, node includes physical node and dummy node, physical node represents a physical memory addresses, and dummy node represents a B+ tree node；The data updated will be needed to copy in a new physical memory, modify in new physical memory to data, form new physical memory addresses；Mapping table is modified, so that dummy node is directed toward new physical memory addresses, forms new physical node；Wherein, mapping table includes the mapping of dummy node to physical node.By the above-mentioned means, the application can eliminate the cascade CoW operation of CoW B+ tree, expense is reduced.
Description
Technical field
This application involves software technology fields, more particularly to a kind of data-updating method based on B+ tree index, device
And storage device.
Background technique
Copy-on-write (Copy-on-Write, CoW) B+ tree (B+-tree) technology is widely used in computer software,
Such as Btrfs (Butter FS) file system and LMDB (Lightning Memory-Mapped Database, LMDB) are counted
According to library.CoW technology is to realize a kind of means of Multi version concurrency control, and write operation can trigger the number that system generates a new version
According to, and read operation is still in current completed latest edition and carries out.This makes read-write operation in the data of different editions
It carries out, read operation is improved efficiency without block.Referring to Fig. 1, Fig. 1 is the read-write operation signal of copy-on-write in the prior art
Figure, if process P1 needs to modify to leaf node C, it will not directly modify data on data page C, but can answer
New data page C ' is produced, then process P1 modifies data on C '.In this case, read-write operation does not conflict mutually, without adding
Lock.Present inventor has found that there are certain drawbacks for this method in long-term research: the first, the generation of this modification
Valence is bigger, and the modification of leaf node can be diffused into the root node of tree all the way up.As shown in Figure 1, the modification meeting of leaf node C
CoW movement is caused to go on (C--- > B--- > A) along the path towards root node A.The second, CoW B+ tree is submitted in affairs
Moment after pointer modified is completed, can execute brush movement, this causes write-in amplification serious with random I/O problem.Third is
Reduce this copy-on-write bring cost to the greatest extent, leaf node will not be chained up by CoW B+ tree, for range-based searching
It is very unfriendly.
Summary of the invention
The application is mainly solving the technical problems that providing a kind of data-updating method based on B+ tree index, device and depositing
Storage device can eliminate cascade operation of the CoW B+ tree when updating modification, reduce expense.
In order to solve the above technical problems, the technical solution that the application uses is: providing a kind of based on B+ tree index
Data-updating method, wherein the method modifies to data in the way of copy-on-write, which comprises obtain
The node for the data for needing to update, node include physical node and dummy node, and physical node represents a physical memory addresses,
Dummy node represents a B+ tree node；The data updated will be needed to copy in a new physical memory, in new physics
It modifies in memory to data, forms new physical memory addresses；Mapping table is modified, is directed toward dummy node in new physics
Address is deposited, new physical node is formed；Wherein, mapping table includes the mapping of dummy node to physical node.
In order to solve the above technical problems, the technical solution that the application uses is: providing a kind of based on B+ tree index
Data update apparatus, wherein described device modifies to data in the way of copy-on-write, and described device includes: to obtain
Module, for obtaining the node for needing the data updated, node includes physical node and dummy node, and physical node represents one
Physical memory addresses, dummy node represent a B+ tree node；Update module, for the data for needing to update to be copied to one
It in new physical memory, modifies in new physical memory to data, forms new physical memory addresses；Modify mapping table
Module makes dummy node be directed toward new physical memory addresses, forms new physical node for modifying mapping table；Wherein, it maps
Table includes the mapping of dummy node to physical node.
In order to solve the above technical problems, another technical solution that the application uses is: providing a kind of based on B+ tree index
Data update apparatus, wherein described device modifies to data in the way of copy-on-write, described device include processing
Device, the processor are used to obtain the node for needing the data updated, and node includes physical node and dummy node, physical node
A physical memory addresses are represented, dummy node represents a B+ tree node；The data that processor is also used to need to update are answered
It makes into a new physical memory, modifies in new physical memory to data, form new physical memory addresses；Place
Reason device is also used to modify mapping table, so that dummy node is directed toward new physical memory addresses, forms new physical node；Wherein, it reflects
Firing table includes the mapping of dummy node to physical node.
In order to solve the above technical problems, another technical solution that the application uses is: providing a kind of with store function
Device, wherein described device is stored with program, and described program, which is performed, realizes the above-mentioned data indexed based on B+ tree more
New method.
The beneficial effect of the application is: be in contrast to the prior art, the application provide it is a kind of based on B+ tree index
Data-updating method, device and storage device, by adding mapping table in B+ tree index, physical node is mapped to by mapping table
Dummy node, it can be ensured that while the modification to the multiple references of the page is atomicity, CoW B+ tree can be eliminated and repaired in update
Cascade operation when changing reduces expense.
Detailed description of the invention
Fig. 1 is the read-write operation schematic diagram of copy-on-write in the prior art；
Fig. 2 is the flow diagram for the data-updating method first embodiment that the application is indexed based on B+ tree；
Fig. 3 is the flow diagram for the data-updating method second embodiment that the application is indexed based on B+ tree；
Fig. 4 is the structural schematic diagram for the data update apparatus first embodiment that the application is indexed based on B+ tree；
Fig. 5 is the structural schematic diagram for the data update apparatus second embodiment that the application is indexed based on B+ tree；
Fig. 6 is the structural schematic diagram for the device first embodiment that the application has store function.
Specific embodiment
It is right as follows in conjunction with drawings and embodiments to keep the purpose, technical solution and effect of the application clearer, clear
The application is further described.
The application provides a kind of data-updating method, device and storage device based on B+ tree index, and when data change makes
With CoW mechanism, achieve the effect that read-write does not conflict, building B+ tree introduces mapping table when indexing, and mapping table maps physical node
To dummy node, it can be ensured that while the modification to the multiple references of the page is atomicity, CoW B+ tree can be eliminated and updated
Cascade operation when modification reduces expense.
Referring to Fig. 2, Fig. 2 is the process signal for the data-updating method first embodiment that the application is indexed based on B+ tree
Figure；In this embodiment, this method comprises the following steps:
S201: the node for needing the data updated is obtained.
Wherein, node includes physical node and dummy node, and physical node represents a physical memory addresses, dummy node
Represent a B+ tree node.
Specifically, B+ tree be for disk or other auxiliary storage devices being directly accessed and design a kind of balance search
Tree, relatively good in terms of reducing magnetic disc i/o operand, a B+ tree includes root node, internal node and leaf node, root node
It may be a leaf node, it is also possible to which a node comprising two or more leaf nodes, B+ tree are commonly used in
In the file system of database and operating system.
S202: the data updated will be needed to copy in a new physical memory, to data in new physical memory
It modifies, forms new physical memory addresses.
Wherein, this method modifies update to data using copy-on-write technique, passes through copy-on-write technique, Neng Gouda
The effect not conflicted to read-write.Specifically, the basic idea of copy-on-write is, simultaneously if there is multiple callers (callers)
It is required that same asset, they can obtain identical index jointly and be directed toward identical resource, until some caller (caller) tastes
When examination modification resource, system just can really replicate a copy (private copy) to the caller, to avoid what is modified
Resource is directly perceived, this process is all penetrating (transparently) to other callers.
Also in other words, it is (physical node, interior to be directed toward identical physical space for Virtual Space (dummy node) different process
Deposit area), when there is the behavior of change correspondent section to occur in process, the corresponding section of Cai Huiwei process distributes physical space, then exists
It modifies in new physical space to data.
S203: modification mapping table makes dummy node be directed toward new physical memory addresses, forms new physical node；Wherein,
Mapping table includes the mapping of dummy node to physical node.
Wherein, there is no the pointers for being directed toward keyword specifying information for the internal node of B+ tree, therefore its internal node is smaller,
If the keyword of all same internal nodes is stored in same disk block, the keyword quantity that disk block can accommodate
More, the disposable keyword required to look up read in memory is also more, and comparatively IO reads and writes number and also just reduces,
So the disk read-write cost of B+ tree is lower.Simultaneously as the non-terminal point of B+ tree is not the knot for eventually pointing to file content
Point, and only in leaf node keyword index, so the lookup of any keyword must walk one from root node to leaf
The path length on the road of node, all keyword queries is identical, causes the search efficiency of each data suitable, so B+ tree
Search efficiency is more stable.
But the B+ tree of copy-on-write index is unfriendly to operation is updated, because CoW movement can be climing upwards from leaf node
It is extended down to root node, in addition, random IO cost of bring is bigger during this.To overcome the shortcomings of existing CoW B+ tree, this
Application adds a mapping table (Mapping Table) in B+ tree indexes, and mapping table includes dummy node to physical node
Mapping, in this way, when a data page physical address change after, it is only necessary to will be corresponded in mapping table
Entry be modified, it is only necessary to modify the mapping relations of dummy node and physical node in mapping table.It utilizes
The influence of data page change can be limited on the specific page by Mapping table, avoid the generation of cascade CoW phenomenon,
Accelerate to update operation, reduces random IO.
Wherein, in one embodiment, this method needs first to establish tree index, and tree index includes mapping table and B+ tree；It reflects
Firing table includes the mapping of dummy node to physical node；Physical node represents a physical memory addresses, and dummy node constructs shape
At B+ tree.Because of the presence of mapping table, physical address and B+ tree node has been isolated in mapping table, makes physical node more
Change and will not influence dummy node, so, the change of physical page caused by CoW can't impact other pages,
All it is atomicity, does not also need the root for the modification of leaf being traveled to tree.But page ID pair in Mapping table
The physical address Ptr answered can change with the change of the page.
It wherein, in one embodiment, in the B+ tree index of this method, is associated with by logical connection between dummy node
Get up.It is spread this is because the introducing of mapping table eliminates CoW movement along root node path is led to, to entire rope
Draw the defect impacted.Therefore, leaf node can be chained up, so preferably support range-based searching with merge, point
Split operation.
Wherein, in one embodiment, this method can be used for can be used for tree the modification of index pages data
The modification of data structure, such as one node of division or merge node.These modification operations are all made of CoW technology.
Wherein, in one embodiment, after the completion of modification, old physical node is recycled.Specifically, event is waited
(Latch-free, latch release) environment does not allow one shared data structure of exclusive access, that is to say, that even if the page exists
It is modified, can also be accessed.We are not intended to the still accessed memory of release one.Such as when solidification, thread
It is released when exchanging the old page and new page status, and recycle new state, but cannot have the old page of thread accesses again
It puts.Reclaim mechanism is exactly to protect the object discharged again for having access before.
Referring to Fig. 3, Fig. 3 is the process signal for the data-updating method second embodiment that the application is indexed based on B+ tree
Figure；In an application scenarios, this method comprises the following steps:
It establishes and sets index, wherein tree index includes mapping table and B+ tree, and mapping table includes that dummy node (ID) arrives physics section
The mapping (solid line pointer in figure) of point (Ptr), physical node (Ptr) represent a physical memory addresses, dummy node (ID) structure
It builds to form B+ tree.One B+ tree includes root node, internal node and leaf node, and each node is by pointer (Pointer, P)
Data constitute the combination of file address representated by (dotted line pointer in figure), keyword (Key, K) and keyword, a section
Point is stored on a disk block.
In the structural modification for needing to modify page data or set, first original page copy portion can be come out, so
It modifies on the new page, new address is put into the page physical address column of mapping table afterwards after modification,
Form new physical address.
When CoW affairs need to modify to some record, leaf (Leaf) node for arriving grey square frame is first searched and located.
Specifically, since root node, root node information is read, is searched in the keyword K1 ... ..., Kn that root node is included given
Keyword search success if finding the keyword equal to given value；Otherwise, can the keyword to be searched of determination in Ki
Between Kj, the node of fetching needle Pi meaning continues to search (Pi is the pointer for being directed toward subtree root node) at this time, until finding.
Then affairs leaf node copy portion can accordingly will come out, and be modified accordingly；It, will after modification is completed
Physical address Ptr is directed toward the memory address on the page border that modification is completed；In this way, later operational access is all after modification is completed
The page.And the grey page is to be recycled after the completion of all access operations etc..In this embodiment, layer is connect by an interlayer
Mapping table device can eliminate the cascade CoW problem of primary Copy-on-Write B+ tree, reduce write-in amplification
With random I/O problem.
Based on the above method, the application also provides a kind of data update apparatus based on B+ tree index, referring to Fig. 4, Fig. 4
It is the structural schematic diagram for the data update apparatus first embodiment that the application is indexed based on B+ tree, in this embodiment, institute
It states device to modify to data in the way of copy-on-write, device 40 includes processor 401, and processor 401 is for obtaining
The node for the data for needing to update, node include physical node and dummy node, and physical node represents a physical memory addresses,
Dummy node represents a B+ tree node.The data that processor 401 is also used to need to update copy in a new physics
It in depositing, modifies in new physical memory to data, forms new physical memory addresses.Processor 401 is also used to modify
Mapping table makes dummy node be directed toward new physical memory addresses, forms new physical node；Wherein, mapping table includes virtual section
Point arrives the mapping of physical node.
Wherein, in one embodiment, processor 401 is also used to establish tree index, and tree index includes mapping table and B+ tree；
Mapping table includes the mapping of dummy node to physical node；Physical node represents a physical memory addresses, dummy node building
Form the B+ tree.
Wherein, in one embodiment, processor 401 is also used to close between dummy node by logical connection
Connection.
Wherein, in one embodiment, processor 401 is also used to change to index pages data or to index tree knot
The change of structure.
Wherein, in one embodiment, processor 401 is also used to carry out node split to tree construction or node merges.
Wherein, in one embodiment, processor 401 is also used to recycle old physical node.
More than, it should can be used for executing the above-mentioned data based on B+ tree index based on the data update apparatus that B+ tree indexes and update
Method modifies update to data, and has corresponding beneficial effect, and detailed process please refers to retouching for above embodiment
It states, details are not described herein.Wherein the device can be the self-contained unit independently of background server, be also possible in server
A certain module or a certain processing unit.
Referring to Fig. 5, Fig. 5 is the structural representation for the data update apparatus second embodiment that the application is indexed based on B+ tree
Figure, in this embodiment, which modifies to data in the way of copy-on-write, and device 50 is certain in processor
One module specifically includes and obtains module 501, update module 502 and modification mapping table module 503.
Wherein, it obtains module 501 and is used to obtain the node for needing the data updated, node includes physical node and virtual section
Point, physical node represent a physical memory addresses, and dummy node represents a B+ tree node.
Update module 502 is for copying to the data for needing to update in one new physical memory, in new physics
It modifies in depositing to data, forms new physical memory addresses.
Modification mapping table module 503 makes dummy node be directed toward new physical memory addresses, is formed new for modifying mapping table
Physical node；Wherein, mapping table includes the mapping of dummy node to physical node.
Wherein, in one embodiment, which further includes creation module, and for establishing tree index, tree index includes reflecting
Firing table and B+ tree；Mapping table includes the mapping of dummy node to physical node；Physical node represents a physical memory addresses, empty
Quasi- node constructs to form the B+ tree.
Wherein, in one embodiment, update module 502 is also used to the change of index pages data or to index tree
The change of structure.The device can be used for executing the above-mentioned data-updating method based on B+ tree index, and detailed process please refers to above-mentioned
The description of embodiment, details are not described herein.
The application also provides a kind of device with store function, referring to Fig. 6, Fig. 6 is that the application has store function
Device first embodiment structural schematic diagram.In this embodiment, storage device 60 is stored with program 601, program 601
It is performed and realizes the above-mentioned data-updating method based on B+ tree index.One in specific work process and above method embodiment
It causes, therefore details are not described herein, please refers to the explanation of the above corresponding method step in detail.Wherein the device with store function can be with
It is portable storage media such as USB flash disk, CD, mobile hard disk, read-only memory (ROM, Read-Only Memory), arbitrary access
The various media that can store program code such as memory (RAM, Random Access Memory), magnetic disk, are also possible to end
End, server etc..
Above scheme, the application provide a kind of data-updating method based on B+ tree index, by building B+ tree index
When introduce mapping table, physical node is mapped to dummy node by mapping table, it can be ensured that the modification to the multiple references of the page is former
While sub- property, the cascade CoW operation of CoW B+ tree can be eliminated, expense is reduced.
In several embodiments provided herein, it should be understood that disclosed system, device and method can
To realize by another way.For example, device embodiments described above are only schematical, for example, the mould
The division of block or unit, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple
Unit or assembly can be combined or can be integrated into another system, or some features can be ignored or not executed.It is another
Point, shown or discussed mutual coupling, direct-coupling or communication connection can be through some interfaces, device or
The indirect coupling or communication connection of unit can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.Some or all of unit therein can be selected to realize present embodiment scheme according to the actual needs
Purpose.
In addition, each functional unit in each embodiment of the application can integrate in one processing unit, it can also
To be that each unit physically exists alone, can also be integrated in one unit with two or more units.It is above-mentioned integrated
Unit both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, the technical solution of the application is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
It is each that equipment (can be personal computer, server or the network equipment etc.) or processor (processor) execute the application
The all or part of the steps of embodiment the method.
The foregoing is merely presently filed embodiments, are not intended to limit the scope of the patents of the application, all to utilize this
Equivalent structure or equivalent flow shift made by application specification and accompanying drawing content, it is relevant to be applied directly or indirectly in other
Technical field is included within the scope of the present invention.
Claims (16)
1. a kind of data-updating method based on B+ tree index, wherein the method is in the way of copy-on-write to the number
According to modifying, which comprises
The node for needing the data updated is obtained, the node includes physical node and dummy node, and the physical node represents
One physical memory addresses, the dummy node represent a B+ tree node；
The data updated are needed to copy in a new physical memory by described, to the number in the new physical memory
According to modifying, new physical memory addresses are formed；
Mapping table is modified, so that the dummy node is directed toward the new physical memory addresses, forms new physical node；Wherein,
The mapping table includes the mapping of dummy node to physical node.
2. the data-updating method according to claim 1 based on B+ tree index, wherein described to obtain the number for needing to update
According to node before include:
Tree index is established, the tree index includes mapping table and B+ tree；The mapping table includes dummy node to physical node
Mapping；The physical node represents a physical memory addresses, and the dummy node constructs to form the B+ tree.
3. the data-updating method according to claim 2 based on B+ tree index, wherein the dummy node constructs to be formed
The B+ tree includes:
It is associated between the dummy node by logical connection.
4. the data-updating method according to claim 1 based on B+ tree index, wherein described to modify packet to data
It includes:
Change to the index pages data or the change to the index tree construction.
5. the data-updating method according to claim 4 based on B+ tree index, wherein described pair of index tree construction is more
Change and includes:
Node split is carried out to the tree construction or node merges.
6. the data-updating method according to claim 1 based on B+ tree index, wherein the modification mapping table makes institute
It states dummy node and is directed toward the new physical memory addresses, form new physical node includes: later
The old physical node is recycled.
7. a kind of data update apparatus based on B+ tree index, wherein described device is in the way of copy-on-write to the number
According to modifying, described device includes processor, and the processor is used to obtain the node for needing the data updated, the node
Including physical node and dummy node, the physical node represents a physical memory addresses, and the dummy node represents a B
+ tree node；
The processor is also used to need the data updated to copy in a new physical memory for described, in the new object
It modifies in reason memory to the data, forms new physical memory addresses；
The processor is also used to modify mapping table, and the dummy node is made to be directed toward the new physical memory addresses, is formed new
Physical node；Wherein, the mapping table includes the mapping of dummy node to physical node.
8. the data update apparatus according to claim 7 based on B+ tree index, wherein the processor is also used to establish
Tree index, the tree index includes mapping table and B+ tree；The mapping table includes the mapping of dummy node to physical node；It is described
Physical node represents a physical memory addresses, and the dummy node constructs to form the B+ tree.
9. the data update apparatus according to claim 8 based on B+ tree index, wherein the processor is also used to institute
It states and is associated between dummy node by logical connection.
10. the data update apparatus according to claim 7 based on B+ tree index, wherein the processor is also used to pair
The change of the index pages data or to it is described index tree construction change.
11. the data update apparatus according to claim 10 based on B+ tree index, wherein the processor is also used to pair
The tree construction carries out node split or node merges.
12. the data update apparatus according to claim 7 based on B+ tree index, wherein the processor is also used to pair
The old physical node is recycled.
13. a kind of data update apparatus based on B+ tree index, wherein described device is in the way of copy-on-write to the number
According to modifying, described device includes:
Module is obtained, the node of data updated for obtaining needs, the node includes physical node and dummy node, described
Physical node represents a physical memory addresses, and the dummy node represents a B+ tree node；
Update module, for needing the data updated to copy in a new physical memory for described, in the new physics
It modifies in memory to the data, forms new physical memory addresses；
Mapping table module is modified, for modifying mapping table, so that the dummy node is directed toward the new physical memory addresses, is formed
New physical node；Wherein, the mapping table includes the mapping of dummy node to physical node.
14. the data update apparatus according to claim 13 based on B+ tree index, wherein described device further include:
Creation module, for establishing tree index, the tree index includes mapping table and B+ tree；The mapping table includes dummy node
To the mapping of physical node；The physical node represents a physical memory addresses, and the dummy node constructs to form the B+
Tree.
15. the data update apparatus according to claim 13 based on B+ tree index, wherein the update module is also used to
Change to the index pages data or the change to the index tree construction.
16. a kind of device with store function, wherein described device is stored with program, and described program is performed realization power
Benefit requires 1 to 6 described in any item data-updating methods based on B+ tree index.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2018/102555 WO2020041950A1 (en) | 2018-08-27 | 2018-08-27 | Data update method, device, and storage device employing b+ tree indexing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109690522A true CN109690522A (en) | 2019-04-26 |
| CN109690522B CN109690522B (en) | 2024-02-27 |
Family
ID=66191858
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201880002420.XA Active CN109690522B (en) | 2018-08-27 | 2018-08-27 | Data updating method and device based on B+ tree index and storage device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109690522B (en) |
| WO (1) | WO2020041950A1 (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111475508A (en) * | 2020-03-31 | 2020-07-31 | 浙江大学 | Efficient indexing method for optimizing leaf node merging operation |
| CN112579602A (en) * | 2020-12-22 | 2021-03-30 | 杭州趣链科技有限公司 | Multi-version data storage method and device, computer equipment and storage medium |
| CN112698956A (en) * | 2021-01-19 | 2021-04-23 | 腾讯科技（深圳）有限公司 | Data object processing method, device, equipment and storage medium |
| TWI789168B (en) * | 2021-12-16 | 2023-01-01 | 威聯通科技股份有限公司 | File versioning management method and file system |
| CN115576868A (en) * | 2022-11-24 | 2023-01-06 | 苏州浪潮智能科技有限公司 | Multi-level mapping framework, data operation request processing method and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425041A (en) * | 2007-10-30 | 2009-05-06 | 安凯（广州）软件技术有限公司 | Optimizing method for establishing FAT file systems on NAND FLASH memory |
| US20110153979A1 (en) * | 2009-12-22 | 2011-06-23 | Nathanial Kiel Boyle | Modified b+ tree to store nand memory indirection maps |
| US20130346725A1 (en) * | 2012-06-20 | 2013-12-26 | Microsoft Corporation | Structuring storage based on latch-free b-trees |
| CN105183915A (en) * | 2015-10-14 | 2015-12-23 | 江苏师范大学 | Multi-version management method for reducing index maintenance overhead |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6859808B1 (en) * | 2001-05-31 | 2005-02-22 | Oracle International Corporation | Mapping logical row identifiers for primary B+tree-like structures to physical row identifiers |
| CN103823865A (en) * | 2014-02-25 | 2014-05-28 | 南京航空航天大学 | Database primary memory indexing method |
-
2018
- 2018-08-27 CN CN201880002420.XA patent/CN109690522B/en active Active
- 2018-08-27 WO PCT/CN2018/102555 patent/WO2020041950A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101425041A (en) * | 2007-10-30 | 2009-05-06 | 安凯（广州）软件技术有限公司 | Optimizing method for establishing FAT file systems on NAND FLASH memory |
| US20110153979A1 (en) * | 2009-12-22 | 2011-06-23 | Nathanial Kiel Boyle | Modified b+ tree to store nand memory indirection maps |
| US20130346725A1 (en) * | 2012-06-20 | 2013-12-26 | Microsoft Corporation | Structuring storage based on latch-free b-trees |
| CN105183915A (en) * | 2015-10-14 | 2015-12-23 | 江苏师范大学 | Multi-version management method for reducing index maintenance overhead |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111475508A (en) * | 2020-03-31 | 2020-07-31 | 浙江大学 | Efficient indexing method for optimizing leaf node merging operation |
| CN111475508B (en) * | 2020-03-31 | 2022-05-03 | 浙江大学 | Efficient indexing method for optimizing leaf node merging operation |
| CN112579602A (en) * | 2020-12-22 | 2021-03-30 | 杭州趣链科技有限公司 | Multi-version data storage method and device, computer equipment and storage medium |
| CN112698956A (en) * | 2021-01-19 | 2021-04-23 | 腾讯科技（深圳）有限公司 | Data object processing method, device, equipment and storage medium |
| CN112698956B (en) * | 2021-01-19 | 2024-04-12 | 腾讯科技（深圳）有限公司 | Data object processing method, device, equipment and storage medium |
| TWI789168B (en) * | 2021-12-16 | 2023-01-01 | 威聯通科技股份有限公司 | File versioning management method and file system |
| US11874806B2 (en) | 2021-12-16 | 2024-01-16 | Qnap Systems, Inc. | File versioning management method and file system |
| CN115576868A (en) * | 2022-11-24 | 2023-01-06 | 苏州浪潮智能科技有限公司 | Multi-level mapping framework, data operation request processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020041950A1 (en) | 2020-03-05 |
| CN109690522B (en) | 2024-02-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109690522A (en) | A kind of data-updating method, device and storage device based on B+ tree index | |
| CN100353325C (en) | Method for realing sharing internal stored data base and internal stored data base system | |
| US10545981B2 (en) | Virtual repository management | |
| CN100550019C (en) | OODB Object Oriented Data Base access method and system | |
| US8271530B2 (en) | Method and mechanism for managing and accessing static and dynamic data | |
| CN106294814B (en) | The device and method of HBase the secondary index building and inquiry of database based on memory | |
| US10733172B2 (en) | Method and computing device for minimizing accesses to data storage in conjunction with maintaining a B-tree | |
| US7720869B2 (en) | Hierarchical structured abstract file system | |
| US7949687B1 (en) | Relational database system having overlapping partitions | |
| CN104424219B (en) | A kind of management method and device of data file | |
| US10963454B2 (en) | System and method for bulk removal of records in a database | |
| US11151081B1 (en) | Data tiering service with cold tier indexing | |
| CN108959538A (en) | Text retrieval system and method | |
| CN102314506A (en) | Distributed buffer management method based on dynamic index | |
| KR101621385B1 (en) | System and method for searching file in cloud storage service, and method for controlling file therein | |
| CN114138776A (en) | Method, system, apparatus and medium for graph structure and graph attribute separation design | |
| US11907251B2 (en) | Method and system for implementing distributed lobs | |
| CN104598652B (en) | A kind of data base query method and device | |
| US20180011897A1 (en) | Data processing method having structure of cache index specified to transaction in mobile environment dbms | |
| CN107133183A (en) | A kind of cache data access method and system based on TCMU Virtual Block Devices | |
| CN106874329A (en) | The implementation method and device of database table index | |
| CN110413724A (en) | A kind of data retrieval method and device | |
| KR102594377B1 (en) | Hybrid Database System Using Private Blockchain | |
| CN111061759A (en) | Data query method and device | |
| CN108256019A (en) | Database key generation method, device, equipment and its 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |