CN109241058A - A kind of method and apparatus from key-value pair to B+ tree batch that being inserted into - Google Patents
A kind of method and apparatus from key-value pair to B+ tree batch that being inserted into Download PDFInfo
- Publication number
- CN109241058A CN109241058A CN201810981320.8A CN201810981320A CN109241058A CN 109241058 A CN109241058 A CN 109241058A CN 201810981320 A CN201810981320 A CN 201810981320A CN 109241058 A CN109241058 A CN 109241058A
- Authority
- CN
- China
- Prior art keywords
- tree
- key
- value pair
- existing
- new
- 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
Abstract
This application provides a kind of method and apparatus for being inserted into key-value pair in batches to B+ tree, which comprises that reads the existing B+ tree of needs batch insertion is inserted into key-value pair, obtains insertion and gathers；The corresponding existing key-value pair of all leaf nodes for reading the existing B+ tree, obtains being inserted into set；To be inserted into described in the insertion set key-value pair be merged into it is described be inserted into set, be inserted into set；Using the key-value pair being inserted into set as new leaf node, new B+ tree is generated.Using method provided by the present application, the speed for being inserted into key-value pair in batches into B+ tree is improved, to improve performance of the system in the case where storing high concurrent environment.
Description
Technical field
The present invention relates to computer data field of storage more particularly to a kind of method to B+ tree batch insertion key-value pair and
Device.
Background technique
Since B+ tree has the characteristics that disk read-write cost is low, search efficiency is sufficiently stable, system is stored in computer at present
Generally data are retrieved or managed using B+ tree in system.Usually to the insertion operation of B+ tree all using serial insertion key-value pair
Method, i.e., key-value pair needs be individually sequentially inserted into B+ tree, the insertion operation of next key-value pair has to wait for a key
Value to complete insertion operation after just can be carried out.
For the computer memory system in the case where storing high concurrent environment, due to concurrent insertion operation within the unit time
Number of requests is very high, and the handling capacity and processing capacity to computer memory system have higher requirement, using traditional
Often efficiency is very low for the method for serial insertion key-value pair, and computer memory system can be made to generate performance bottleneck.
Summary of the invention
In order to solve technical problem of the existing technology, key-value pair is inserted into B+ tree batch this application provides a kind of
Method and apparatus can be realized and batch key-value pair is inserted into B+ tree, improve the insertion efficiency of B+ tree.
The present invention provides a kind of methods for being inserted into key-value pair to B+ tree batch, which comprises
That reads the existing B+ tree of needs batch insertion is inserted into key-value pair, obtains insertion and gathers；
The corresponding existing key-value pair of all leaf nodes for reading the existing B+ tree, obtains being inserted into set；
To be inserted into described in the insertion set key-value pair be merged into it is described be inserted into set, be inserted into collection
It closes；
Using the key-value pair being inserted into set as new leaf node, new B+ tree is generated.
Optionally, during to key-value pair is inserted into described in the existing B+ tree batch insertion, not to the existing B
+ tree is modified.
Optionally, after the new B+ tree generates, the new B+ tree is directed toward in the root node address of the existing B+ tree
Root node, while deleting the existing B+ tree.
Optionally, when the existing B+ tree is not present, which comprises
The identical key-value pair of type for not needing to be inserted into the existing B+ number and index value is read, key-value pair set is obtained；
Using the key-value pair in the key-value pair set as new leaf node, new B+ tree is generated.
Optionally, using the key-value pair being inserted into set as new leaf node, generating new B+ tree includes:
Retain the node that the existing B+ tree is not changed during generating the new B+ tree, by the node that do not change
Directly along for the new B+ tree.
The embodiment of the present application also provides a kind of device of B+ tree batch insertion, described device includes:
First reading unit, for read need batch to be inserted into existing B+ tree be inserted into key-value pair, obtain insertion and gather；
Second reading unit is obtained for reading the corresponding existing key-value pair of all leaf nodes of the existing B+ tree
It is inserted into set；
Combining unit is merged into for will be inserted into key-value pair described in insertion set and described is inserted into set
In, it has been inserted into set；
First generation unit, for generating new B+ tree using the key-value pair being inserted into set as new leaf node.
Optionally, described device further include:
Subelement is stored, it is not right during for being inserted into key-value pair described in be inserted into the existing B+ tree batch
The existing B+ tree is modified.
Optionally, described device further include:
Subelement is replaced, is used for after the new B+ tree generates, described in the root node address direction by the existing B+ tree
The root node of new B+ tree, while deleting the existing B+ tree.
Optionally, when the existing B+ tree is not present, described device further include:
Third reading unit does not need to be inserted into the identical key assignments of type of the existing B+ number and index value for reading
It is right, obtain key-value pair set；
Second generation unit, for generating new B+ tree using the key-value pair in the key-value pair set as new leaf node.
Optionally, the generation unit, for generating using the key-value pair being inserted into set as new leaf node
New B+ tree further include:
Retain the node that the existing B+ tree is not changed during generating the new B+ tree, by the node that do not change
Directly along for the new B+ tree.
Compared with prior art, the application has at least the following advantages:
The application takes full advantage of the principle of B+ tree insertion algorithm, needs batch to be inserted into existing B+ tree by reading first
It is inserted into key-value pair, the key-value pair of batch insertion is made into disposed of in its entirety, obtains insertion set；Then the existing B+ tree is read
The corresponding existing key-value pair of all leaf nodes, obtains being inserted into set；Key is inserted into described in gathering the insertion
Value to be merged into it is described be inserted into set, complete the merging for being inserted into key-value pair and existing key-value pair, be inserted into collection
It closes；Finally using the key-value pair being inserted into set as new leaf node, new B+ tree is generated according to new leaf node, i.e., it is complete
Has B+ tree at batch key-value pair to be inserted into.
Using method and device described herein, the method for traditional serial insertion key-value pair is revised as batch and is inserted
Enter, improve the speed for being inserted into key-value pair in batches into B+ tree, to improve performance of the system in the case where storing high concurrent environment.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, 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
The some embodiments recorded in application, for those of ordinary skill in the art, without creative efforts,
It can also be obtained according to these attached drawings other attached drawings.
Fig. 1 is a kind of method flow diagram that key-value pair is inserted into B+ tree batch that the embodiment of the present application one provides；
Fig. 2 is a kind of method flow diagram that key-value pair is inserted into B+ tree batch that the embodiment of the present application two provides；
Fig. 3 is a kind of method flow diagram that key-value pair is inserted into B+ tree batch that the embodiment of the present application three provides；
Fig. 4 is a kind of structure drawing of device that key-value pair is inserted into B+ tree batch that the embodiment of the present application four provides；
Fig. 5 is a kind of structure drawing of device that key-value pair is inserted into B+ tree batch that the embodiment of the present application five provides；
Fig. 6 is a kind of structure drawing of device that key-value pair is inserted into B+ tree batch that the embodiment of the present application six provides.
Specific embodiment
In order to enable those skilled in the art to better understand the solution of the present invention, below in conjunction in the embodiment of the present invention
Attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is only this
Invention a part of the embodiment, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art exist
Every other embodiment obtained under the premise of creative work is not made, shall fall within the protection scope of the present invention.
Embodiment one:
This application provides a kind of methods for being inserted into key-value pair to B+ tree batch, illustrate it below with reference to embodiment one
Principle.
Referring to Fig. 1, which is a kind of method flow that key-value pair is inserted into B+ tree batch that the embodiment of the present application one provides
Figure.
Described method includes following steps in the present embodiment:
S101: that reads the existing B+ tree of needs batch insertion is inserted into key-value pair, obtains insertion and gathers.
In order to realize the purpose for being inserted into key-value pair to B+ tree batch, the key-value pair that is inserted into of batch is put into collection in this step
Disposed of in its entirety is done in conjunction.
In the present embodiment, key-value pair (Key-value) includes the index value (Key) and storage value of insertion data
(value).Wherein index value can be numeric type, such as 3,5.5, π etc., or text type, such as character string
(string) type, can also be byte Type, and index value can be used for the sequence of key-value pair.Storage value can be character string, chain
Table, set, ordered set etc. include data information in storage value.
System receives the insertion operation request of key-value pair, may include one or more keys for needing to be inserted into the request
Value pair.
In order to improve the efficiency that batch is inserted into key-value pair, all in the time cycle insert can be obtained with preset period of time
Enter the key-value pair for including in operation requests, as the key-value pair for needing batch insertion.
According to the index Value Types for being inserted into key-value pair can find it is matching be inserted into B+ tree, each key-value pair is only
It is inserted into matching B+ tree, is illustrated below:
Has b+ tree A, the index value of the key-value pair on leaf node is numeric type, and existing b+ tree B, leaf
The index value of key-value pair in child node is text type, if system needs the rope of several key-value pairs of batch insertion at this time
Drawing value is respectively 1,2,3, a, b, c, then the corresponding key-value pair of index value 1,2,3 needs to be inserted into b+ tree A, and index value a, b, c couple
The key-value pair answered needs to be inserted into b+ tree B.
Above example illustrates the matching principles of key-value pair and B+, for convenience of explanation, method and step hereinafter exist with
Lower premise:
Batch be inserted into key-value pair with same type index value and key-value pair be matched to corresponding B+ tree.
It should be noted that needing batch to be inserted into existing when being inserted into key-value pair of B+ tree reading, can will be inserted into
The index value of key-value pair sequential from small to large constitutes in order and is inserted into set, does so convenient for the new B+ tree of S104 generation
When sequence to leaf node.
S102: the corresponding existing key-value pair of all leaf nodes of the existing B+ tree is read, obtains being inserted into set.
In this step, " reading " is the data structure in order not to destroy existing B+ tree, obtain being inserted into set be in order to
Disposed of in its entirety is done to existing key-value pair.
In the present embodiment, the existing key-value pair is suitable according to from small to large on the leaf node of the existing B+ tree
Sequence arrangement, and each leaf node pointer is sequentially connected from left to right.So at the time of reading, as long as finding leftmost leaf section
Point, then all existing key-value pairs are read to may make up by sequence is inserted into set, and the key-value pair being inserted into set at this time can
It is put in order with retaining original, does so sequence when generating new B+ tree convenient for S104 to leaf node.
It should be noted that the execution sequence of above-mentioned steps does not constitute the restriction to the application, those skilled in the art
It can also arrange by oneself, such as S101 and S102 can be replaced according to actual needs.
S103: will be inserted into described in the insertion set key-value pair be merged into it is described be inserted into set, obtain
Insertion set.
The merging for gathering and being inserted into set by insertion, realizes and batch key-value pair is merged into existing key-value pair
Purpose.
S104: using the key-value pair being inserted into set as new leaf node, new B+ tree is generated.
It should be noted that the key-value pair on new leaf node is needed according to manipulative indexing value sequential from small to large,
Following two mode can be used by completing the arrangement:
Mode one: the alignment processes can be completed in S103, if insertion set that S101 and S102 are generated and being inserted into
Key-value pair in set arranged in sequence then can will be inserted into key-value pair according to corresponding rope in insertion set in S103
The size for drawing value, which is merged into, to be inserted into set, and the obtained key-value pair being inserted into set has been completed to sort, then in S104
In be inserted into set in key-value pair do not need minor sort again.
Mode two: if the non-arranged in sequence of key-value pair that the insertion that S101 and S102 is generated is gathered and is inserted into set,
Can directly the key assignments that is inserted into insertion set be merged into and is inserted into set in S103, need not move through sequence；Sequence
Process is completed when can generate new B+ tree in S104.
The node that the existing B+ tree is not changed during generating the new B+ tree can be retained when generating new B+ tree, it will
The node that do not change can reduce batch insertion key assignments clock synchronization to calculator memory directly along the new B+ tree is used in this way
Use.
Using the method provided by the embodiments of the present application for being inserted into key-value pair to B+ tree batch, solves conventional serial insert key
It is worth the problem low to method time efficiency, improves the speed for being inserted into key-value pair in batches into B+ tree, exist to improve system
Store the performance under high concurrent environment.
Embodiment two:
Above-described embodiment mainly describes the method for being inserted into key-value pair to B+ tree batch, in order to not influence entirely to B+ tree batch
Read operation during amount insertion key-value pair to existing B+ tree, the embodiment of the present application provide a kind of solution, tie below
Attached drawing is closed to illustrate.
Referring to fig. 2, which is a kind of method flow that key-value pair is inserted into B+ tree batch that the embodiment of the present application two provides
Figure.
The present embodiment the described method includes:
S201: during to key-value pair is inserted into described in the existing B+ tree batch insertion, not to the existing B+
Tree is modified.
In the S102 of above-described embodiment one, obtains being inserted into set using the method for " reading ", do not destroy existing B+
The data structure of tree, it is possible to during batch is inserted into key-value pair, completely retain existing B+ tree.
S202: after the new B+ tree generates, the root node address of the existing B+ tree is directed toward to the root of the new B+ tree
Node, while deleting the existing B+ tree.
Using method provided by the embodiments of the present application, during being inserted into key-value pair to existing B+ tree batch insertion,
Still complete to retain existing B+ tree, just existing B+ tree is deleted in replacement after new B+ tree generates, and will not influence be inserted into batch in this way
To the read operation of existing B+ tree during key-value pair, the performance of storage system is further improved.
Embodiment three:
The method for being inserted into key-value pair to existing B+ tree batch is described in above-described embodiment, introducing with reference to the accompanying drawing ought not
There are when the existing B+ tree, i.e., the side of batch key-value pair is handled when the index value of key-value pair can not be matched to any one B+ tree
Method.
Referring to Fig. 3, which is a kind of method flow that key-value pair is inserted into B+ tree batch that the embodiment of the present application three provides
Figure.
Described method includes following steps in the present embodiment:
S301: the identical key-value pair of type for not needing to be inserted into the existing B+ number and index value is read, key-value pair is obtained
Set.
For certain key-value pairs with same index Value Types, because its index Value Types can not be with existing B+ tree
Match, that is, belong to new type, just needs to generate new B+ tree using the key-value pair as leaf node at this time.
S302: using the key-value pair in the key-value pair set as new leaf node, new B+ tree is generated.
In the embodiment of the present application, because existing B+ tree is not present before batch is inserted into key-value pair, batch is inserted into
Key-value pair be new B+ tree leaf node.Using the method for the embodiment of the present application, when there is no the existing B+ trees, i.e. key
The index value of value pair can generate new B+ tree according to the key-value pair of batch when can not be matched to any one B+ tree.
Example IV:
The method for being inserted into key-value pair to B+ tree batch provided based on the above embodiment, the embodiment of the present application provide one kind
It is inserted into the device of key-value pair to B+ tree batch, is specifically described with reference to the accompanying drawing.
Referring to fig. 4, which is a kind of apparatus structure that key-value pair is inserted into B+ tree batch that the embodiment of the present application four provides
Figure.
In the present embodiment, described device includes: the first reading unit 401, the second reading unit 402, combining unit 403
With generation unit 404.
First reading unit 401, for read need batch to be inserted into existing B+ tree be inserted into key-value pair, obtain insertion and collect
It closes；
Second reading unit 402 is obtained for reading the corresponding existing key-value pair of all leaf nodes of the existing B+ tree
Gather to being inserted into；
Combining unit 403 is merged into for will be inserted into key-value pair described in insertion set and described is inserted into collection
In conjunction, it is inserted into set；
First generation unit 404, for generating new B+ using the key-value pair being inserted into set as new leaf node
Tree.
During generation unit 404 generates new B+ tree, the existing B+ tree can be retained and generating the new B+ tree
The node that do not change in the process can reduce batch in this way and insert by the node that do not change directly along the new B+ tree is used for
Use when entering key-value pair to calculator memory.
Using the device provided by the embodiments of the present application for being inserted into key-value pair to B+ tree batch, solves conventional serial insert key
It is worth the problem low to method time efficiency, improves the speed for being inserted into key-value pair in batches into B+ tree, exist to improve system
Store the performance under high concurrent environment.
Embodiment five:
Above-described embodiment mainly describes the device that key-value pair is inserted into B+ tree batch, in order to not influence entirely to B+ tree batch
Read operation to existing B+ tree during amount insertion key-value pair, the embodiment of the present application also provides a kind of solving device, below
It is illustrated in conjunction with attached drawing.
Referring to Fig. 5, which is a kind of apparatus structure that key-value pair is inserted into B+ tree batch that the embodiment of the present application five provides
Figure.
In the present embodiment, described device includes: storing sub-units 501 and replacement subelement 502.
Subelement 501 is stored, during for being inserted into key-value pair described in be inserted into the existing B+ tree batch, no
The existing B+ tree is modified.
Subelement 502 is replaced, for after the new B+ tree generates, institute to be directed toward in the root node address of the existing B+ tree
The root node of new B+ tree is stated, while deleting the existing B+ tree.
Using device provided by the embodiments of the present application, during being inserted into key-value pair to existing B+ tree batch insertion,
Still complete to retain existing B+ tree, just existing B+ tree is deleted in replacement after new B+ tree generates, and will not influence be inserted into batch in this way
To the read operation of existing B+ tree during key-value pair, the performance of storage system is further improved.
Embodiment six:
The device for being inserted into key-value pair to existing B+ tree batch is described in above-described embodiment, introduces one kind with reference to the accompanying drawing
There are no the data structures of B+ tree in memory, i.e. the device of the key assignments clock synchronization of batch insertion for the first time.
Referring to Fig. 6, which is a kind of apparatus structure that key-value pair is inserted into B+ tree batch that the embodiment of the present application six provides
Figure.
In the present embodiment, described device includes: third reading unit 601 and the second generation unit 602.
Third reading unit 601 does not need to be inserted into the identical key of type of the existing B+ number and index value for reading
Value pair, obtains key-value pair set.
Second generation unit 602, for generating new B+ using the key-value pair in the key-value pair set as new leaf node
Tree.
Because existing B+ tree is not present before batch is inserted into key-value pair, the key-value pair of batch insertion is new B+ tree
Leaf node.Using device provided by the embodiments of the present application, when being not present the existing B+ tree, i.e., the index value of key-value pair without
Method can generate new B+ tree according to the key-value pair of batch when being matched to any one B+ tree.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, there is no the portion being described in detail in some embodiment
Point, reference can be made to the related descriptions of other embodiments.
It should be appreciated that in this application, " at least one (item) " refers to one or more, and " multiple " refer to two or two
More than a."and/or" indicates may exist three kinds of relationships, for example, " A and/or B " for describing the incidence relation of affiliated partner
It can indicate: only exist A, only exist B and exist simultaneously tri- kinds of situations of A and B, wherein A, B can be odd number or plural number.Word
Symbol "/" typicallys represent the relationship that forward-backward correlation object is a kind of "or"." at least one of following (a) " or its similar expression, refers to
Any combination in these, any combination including individual event (a) or complex item (a).At least one of for example, in a, b or c
(a) can indicate: a, b, c, " a and b ", " a and c ", " b and c ", or " a and b and c ", and wherein a, b, c can be individually, can also
To be multiple.
The above described is only a preferred embodiment of the present invention, being not intended to limit the present invention in any form.Though
So the present invention has been disclosed as a preferred embodiment, and however, it is not intended to limit the invention.It is any to be familiar with those skilled in the art
Member, without departing from the scope of the technical proposal of the invention, all using the methods and technical content of the disclosure above to the present invention
Technical solution makes many possible changes and modifications or equivalent example modified to equivalent change.Therefore, it is all without departing from
The content of technical solution of the present invention, according to the technical essence of the invention any simple modification made to the above embodiment, equivalent
Variation and modification, all of which are still within the scope of protection of the technical scheme of the invention.
Claims (10)
1. a kind of method for being inserted into key-value pair to B+ tree batch, which is characterized in that the described method includes:
That reads the existing B+ tree of needs batch insertion is inserted into key-value pair, obtains insertion and gathers；
The corresponding existing key-value pair of all leaf nodes for reading the existing B+ tree, obtains being inserted into set；
To be inserted into described in the insertion set key-value pair be merged into it is described be inserted into set, be inserted into set；
Using the key-value pair being inserted into set as new leaf node, new B+ tree is generated.
2. the method according to claim 1, wherein the described method includes:
During to key-value pair is inserted into described in the existing B+ tree batch insertion, the existing B+ tree is not changed
It is dynamic.
3. according to the method described in claim 2, it is characterized in that, which comprises
After the new B+ tree generates, the root node address of the existing B+ tree is directed toward to the root node of the new B+ tree, simultaneously
Delete the existing B+ tree.
4. the method according to claim 1, wherein when the existing B+ tree is not present, which comprises
The identical key-value pair of type for not needing to be inserted into the existing B+ number and index value is read, key-value pair set is obtained；
Using the key-value pair in the key-value pair set as new leaf node, new B+ tree is generated.
5. the method according to claim 1, wherein using the key-value pair being inserted into set as new leaf
Node, generating new B+ tree includes:
Retain the node that the existing B+ tree is not changed during generating the new B+ tree, the node that do not change is direct
Along for the new B+ tree.
6. a kind of device of B+ tree batch insertion, which is characterized in that described device includes:
First reading unit, for read need batch to be inserted into existing B+ tree be inserted into key-value pair, obtain insertion and gather；
Second reading unit obtains to be inserted for reading the corresponding existing key-value pair of all leaf nodes of the existing B+ tree
Enter set；
Combining unit, for will be inserted into described in the insertion set key-value pair be merged into it is described be inserted into set, obtain
Gather to being inserted into；
First generation unit, for generating new B+ tree using the key-value pair being inserted into set as new leaf node.
7. device according to claim 6, which is characterized in that further include:
Subelement is stored, during for being inserted into key-value pair described in be inserted into the existing B+ tree batch, not to described
Existing B+ tree is modified.
8. device according to claim 7, which is characterized in that further include:
Subelement is replaced, for after the new B+ tree generates, the new B+ to be directed toward in the root node address of the existing B+ tree
The root node of tree, while deleting the existing B+ tree.
9. device according to claim 6, which is characterized in that when the existing B+ tree is not present, described device is also wrapped
It includes:
Third reading unit does not need to be inserted into the identical key-value pair of type of the existing B+ number and index value for reading, obtains
To key-value pair set；
Second generation unit, for generating new B+ tree using the key-value pair in the key-value pair set as new leaf node.
10. device according to claim 6, which is characterized in that the generation unit, for being inserted into described in set
Key-value pair as new leaf node, generate new B+ tree further include:
Retain the node that the existing B+ tree is not changed during generating the new B+ tree, the node that do not change is direct
Along for the new B+ tree.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810981320.8A CN109241058A (en) | 2018-08-27 | 2018-08-27 | A kind of method and apparatus from key-value pair to B+ tree batch that being inserted into |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810981320.8A CN109241058A (en) | 2018-08-27 | 2018-08-27 | A kind of method and apparatus from key-value pair to B+ tree batch that being inserted into |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109241058A true CN109241058A (en) | 2019-01-18 |
Family
ID=65069247
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810981320.8A Withdrawn CN109241058A (en) | 2018-08-27 | 2018-08-27 | A kind of method and apparatus from key-value pair to B+ tree batch that being inserted into |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109241058A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110569396A (en) * | 2019-09-03 | 2019-12-13 | 上海赜睿信息科技有限公司 | Data searching method, electronic equipment and computer readable storage medium |
| CN111949656A (en) * | 2020-07-25 | 2020-11-17 | 苏州浪潮智能科技有限公司 | Method and system for realizing pairing check of multiple concurrent data based on B + tree |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103488645A (en) * | 2012-06-13 | 2014-01-01 | 镇江华扬信息科技有限公司 | Structural designing method for updating data of internet of things |
| CN104408128A (en) * | 2014-11-26 | 2015-03-11 | 上海爱数软件有限公司 | Read optimization method for asynchronously updating indexes based on B+ tree |
| CN108140024A (en) * | 2015-07-07 | 2018-06-08 | 华为技术有限公司 | Merge index structure in MOLAP and keep the mechanism of inquiry consistency |
-
2018
- 2018-08-27 CN CN201810981320.8A patent/CN109241058A/en not_active Withdrawn
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103488645A (en) * | 2012-06-13 | 2014-01-01 | 镇江华扬信息科技有限公司 | Structural designing method for updating data of internet of things |
| CN104408128A (en) * | 2014-11-26 | 2015-03-11 | 上海爱数软件有限公司 | Read optimization method for asynchronously updating indexes based on B+ tree |
| CN108140024A (en) * | 2015-07-07 | 2018-06-08 | 华为技术有限公司 | Merge index structure in MOLAP and keep the mechanism of inquiry consistency |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110569396A (en) * | 2019-09-03 | 2019-12-13 | 上海赜睿信息科技有限公司 | Data searching method, electronic equipment and computer readable storage medium |
| CN110569396B (en) * | 2019-09-03 | 2022-05-06 | 上海赜睿信息科技有限公司 | Data searching method, electronic equipment and computer readable storage medium |
| CN111949656A (en) * | 2020-07-25 | 2020-11-17 | 苏州浪潮智能科技有限公司 | Method and system for realizing pairing check of multiple concurrent data based on B + tree |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6362316B2 (en) | Method, system and computer program product for hybrid table implementation using buffer pool as resident in-memory storage for memory resident data | |
| US8073874B2 (en) | Bit string searching apparatus, searching method, and program | |
| US20170063695A1 (en) | Full flow retrieval optimized packet capture | |
| CN101996250B (en) | Hadoop-based mass stream data storage and query method and system | |
| US8190591B2 (en) | Bit string searching apparatus, searching method, and program | |
| US20080126739A1 (en) | Parallel Execution of Operations for a Partitioned Binary Radix Tree on a Parallel Computer | |
| CN108205577B (en) | Array construction method, array query method, device and electronic equipment | |
| US20160055191A1 (en) | Executing constant time relational queries against structured and semi-structured data | |
| US20090234802A1 (en) | Coupled node tree splitting/conjoining method and program | |
| US20120016901A1 (en) | Data Storage and Processing Service | |
| CN103593440B (en) | The reading/writing method and device of journal file | |
| CN105320775A (en) | Data access method and apparatus | |
| CN102426609A (en) | Index generation method and index generation device based on MapReduce programming architecture | |
| CN111444192B (en) | Method, device and equipment for generating Hash of global state in block chain type account book | |
| WO2011126995A1 (en) | Columnar storage representations of records | |
| CN114064984B (en) | World state increment updating method and device based on sparse array linked list | |
| US11074133B2 (en) | Method, electronic device and computer readable medium of file management | |
| WO2015010508A1 (en) | One-dimensional linear space-based method for implementing trie tree dictionary storage and management | |
| CN103914483A (en) | File storage method and device and file reading method and device | |
| US20020065793A1 (en) | Sorting system and method executed by plural computers for sorting and distributing data to selected output nodes | |
| CN114443646A (en) | Bi-directional linear linked list directory retrieval based multi-way tree structure, electronic device and readable storage medium | |
| CN109241058A (en) | A kind of method and apparatus from key-value pair to B+ tree batch that being inserted into | |
| CN115525580A (en) | Namespace setting method and device and readable storage medium | |
| Iacob et al. | Gpu accelerated information retrieval using bloom filters | |
| CN110413724A (en) | A kind of data retrieval 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 | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20190118 |