CN102156759B - Binary tree parallel inquiry method and device - Google Patents
Binary tree parallel inquiry method and device Download PDFInfo
- Publication number
- CN102156759B CN102156759B CN 201110136760 CN201110136760A CN102156759B CN 102156759 B CN102156759 B CN 102156759B CN 201110136760 CN201110136760 CN 201110136760 CN 201110136760 A CN201110136760 A CN 201110136760A CN 102156759 B CN102156759 B CN 102156759B
- Authority
- CN
- China
- Prior art keywords
- key word
- subtree
- checked
- data
- parallel
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the invention relates to a binary tree parallel inquiry method and a device thereof. The binary tree parallel inquiry method comprises the following steps of: dividing the binary tree into a plurality of sub-tress via a selected sub-tree order; constructing a common key word to each sub-tree, comprising extracting the same high-bit data of all the node data in the sub-tree as the common key word from the high bit of each node data of each sub-tree; constructing a high-bit key word to be inquired from the data construction to be inquired according to the bit number of the common key word of the sub-tree, comprising extracting the high bit data of the data to be inquired as the high-bit key word to be inquired from the highest bit according to the bit number of the common key word; comparing the high-bit key word to be inquired with the common key word of the sub-tree, determining the direction of the sub-tree to be inquired next time if the high-bit key word to be inquired is not equal to the common key word of the sub-tree, and comparing the direction of the sub-tree to be inquired next time according to parallel key words if the high-bit key word to be inquired is equal to the common key word of the sub-tree. Via the embodiment of the invention, the binary tree is compressed into a low-order sub-tree to reduce the height of the target inquiry tree; the common key word of each sub-tree is extracted; and a parallel inquiry key words to each sub-tree is constructed so that the access time of a data memory region is greatly reduced, and the inquiring efficiency is improved.
Description
Technical field
The embodiment of the present invention relates to the communications field, is specifically related to binary tree parallel inquiry method and equipment.
Background technology
Binary tree is widely used in various searching in structure, and it is simple in structure, search performance only with the height correlation of tree.Binary tree based on traditional can not effectively be improved the search performance of binary tree.Prior art, when carrying out binary tree search, must complete finally and search by the mode of successively node comparison.Because needs successively carry out node relatively, the binary tree that is therefore H for a height, need to internally deposit into capable H access.Use the existing technology of searching, can't have breakthrough on search performance again.
Summary of the invention
The technical matters that the embodiment of the present invention will solve on the one hand is to reduce the internal storage access number of times, and improves binary tree search efficiency.
The embodiment of the present invention has proposed a kind of binary tree parallel inquiry method, comprising: with the subtree exponent number of selecting, binary tree is divided into to a plurality of subtrees, this subtree exponent number is more than or equal to 3; Construct common key word for each subtree, comprising: from the most significant digit of each node data of each subtree, extract in subtree all identical high position datas of node datas, as the common key word of the subtree of this subtree; According to the figure place of the common key word according to subtree, from data configuration to be checked high-order key word to be checked, comprising: according to the figure place of common key word, from most significant digit, extract the high position data of data to be checked, as high-order key word to be checked; High-order key word more to be checked and the common key word of subtree, when the comparative result of high-order key word to be checked and the common key word of subtree is unequal, determine the subtree direction of next time searching according to comparative result.
A kind of equipment for the binary tree parallel search, equipment comprises: compression module, for the subtree exponent number to select, binary tree is divided into to a plurality of subtrees, this subtree exponent number is more than or equal to 3; Parallel search key word constructing module, be used to each subtree to construct common key word, comprise: from the most significant digit of each node data of each subtree, extract the identical high position data of whole node datas in subtree, as the common key word of the subtree of this subtree, parallel search key word constructing module is for the figure place according to the common key word according to subtree, from data configuration to be checked high-order key word to be checked, comprise: according to the figure place of common key word, from most significant digit, extract the high position data of data to be checked, as high-order key word to be checked; Comparison module, for high-order key word more to be checked and the common key word of subtree, control module, when unequal for the comparative result at high-order key word to be checked and the common key word of subtree, determine the subtree direction of next time searching according to comparative result.
According to the embodiment of the present invention, by the subtree of the low exponent number of binary tree boil down to, extract the common key word of each subtree and, for each subtree structure parallel search key word, can greatly reduce the access times of data memory area, thereby improve search efficiency.
The accompanying drawing explanation
In order to be illustrated more clearly in the technical scheme of the embodiment of the present invention, below will the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.In the accompanying drawings:
Fig. 1 is the process flow diagram of embodiment of the present invention method;
Fig. 2 is the structural drawing of the embodiment of the present invention binary tree of using;
Fig. 3 is the structural drawing of the equipment of the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, rather than whole embodiment.Embodiment based in the present invention, those of ordinary skills, not making under the creative work prerequisite the every other embodiment obtained, belong to the scope of protection of the invention.
The design of the embodiment of the present invention is, while carrying out the node comparison in binary tree, at first binary tree (for example is divided into to the low order subtree, 3 rank subtrees), the high position data of the node data of each subtree is extracted, described high position data and data high position data to be checked are compared, if the common key word of the high position data of data to be checked and subtree is unequal, according to the comparative result of high position data, directly determine next time more selected low order subtree.When the high position data of data to be checked is greater than the common key word of subtree, illustrate that data to be checked are greater than whole node datas of current subtree, search the subtree of choosing is subtree maximum in lower one deck low order subtree next time.When the high position data of data to be checked is less than the common key word of subtree, illustrate that data to be checked are less than whole node datas of current subtree, search the subtree of choosing is subtree minimum in lower one deck low order subtree next time.Utilize this mode, can fall the high position data subtree different from the high position data of subtree node data of data to be checked by fast filtering, and avoid the comparison low data, accelerated seek rate, improved search efficiency.When the high position data of data to be checked equals the high position data of node data, utilize the low data structure parallel search key word of a location number of subtree node data, by disposable comparison, determine and search selected subtree next time.Can reduce comparison step like this, accelerate seek rate.The concrete example of the embodiment of the present invention will be described in detail referring to accompanying drawing.
Fig. 1 is the process flow diagram of the binary tree search method of the embodiment of the present invention.The method comprises:
110: with the subtree exponent number of selecting, described binary tree is divided into to a plurality of subtrees;
120: construct common key word for each subtree, comprising: from the most significant digit of each node data of each subtree, extract in described subtree all identical high position datas of node datas, as the common key word of the subtree of this subtree;
130: according to the figure place of the common key word according to described subtree, from data configuration to be checked high-order key word to be checked, comprising: according to the figure place of described common key word, from most significant digit, extract the high position data of data to be checked, as high-order key word to be checked;
140: more described high-order key word to be checked and the common key word of described subtree, when the comparative result of described high-order key word to be checked and the common key word of described subtree is unequal, determine the subtree direction of next time searching according to comparative result.
Referring to Fig. 2, the method for the embodiment of the present invention is described with concrete example.Fig. 2 is the structural drawing of binary tree of implementing the binary tree search method of the embodiment of the present invention.It should be noted that, what in Fig. 2, provide is complete binary tree, but the embodiment of the present invention is applicable to non-complete binary tree comparably.In addition, the binary tree that the embodiment of the present invention is used is ordered binary tree.For example, binary tree shown in Fig. 2 is ordered binary tree, and wherein the magnitude relationship of node data is that A to G increases progressively.According to the embodiment of the present invention, for example binary tree shown in Fig. 2 is divided into to 3 rank subtrees, wherein node A to G forms 3 rank subtree SS, and respectively there are two 3 rank subtrees node A, C, E and G below, and giving respectively Reference numeral is S0 to S7.It should be noted that, it is a kind of illustrating that binary tree is divided into to 3 rank subtrees.It will be understood by those skilled in the art that can be according to computing power and actual needs, and for example binary tree is non-complete binary tree, and left subtree or right subtree lack a plurality of nodes, binary tree can be divided into to 4 rank subtrees, 5 rank subtrees, to improve search efficiency.
After binary tree is divided into 3 rank subtrees, will be each subtree, comprise that subtree SS, S0-S7 construct common key word.For example, in Fig. 2, the data of the node A-G of SS subtree are as shown in the table:
Table 1
| ? | 19 | 18 | 17 | 16 | 15 | 14 | 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 32 | 1 | 0 |
| A | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 00 | 1 | 1 |
| B | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 00 | 1 | 1 |
| C | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 11 | 0 | 0 |
| D | 1 | 1 | 0 | 0 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 1 | 1 | 11 | 0 | 0 |
| E | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 | 0 | 1 | 0 | 11 | 0 | 0 |
| F | 1 | 1 | 0 | 1 | 0 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 00 | 1 | 0 |
| G | 1 | 1 | 0 | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 00 | 1 | 0 |
At first, extract the identical high position data of node A-G.As can be seen from Table 1, the 17-19 bit data of node A-G is identical, this 3 bit data is extracted, as the common key word CmSS of the subtree of SS subtree.Then, extract the 17-19 bit data from data K to be checked, as high-order key word CmK to be checked.
Like this, just can first compare the to be checked high-order key word CmK of K and the common key word CmSS of subtree of SS subtree, if CmK > CmSS, K is described > G, therefore search next time and directly enter the S7 subtree; If CmK<CmSS, illustrate K<A, search next time and directly enter the S0 subtree.So, will no longer compare K and the Node B size to F, and also no longer compare the 0-16 bit data of K and the 0-16 bit data of node A to G, greatly accelerate seek rate.
In the situation that CmK=CmSS, illustrate that K likely equates with node A-G is some, perhaps search next time and will enter subtree S1 to S6, in order further to determine K with which node in A-G equates, perhaps searching next time and will enter which subtree, is subtree SS structure parallel search key word.
Specifically, as shown in table 1, from the high position of node A-G, after being connected on CmSS, extract 8 bit data, i.e. the 9-16 bit data, be called the compression key word, according to order from left to right, by node A-G from big to small, from G to A, the compression key word cG-cA of each node is stitched together, before each compression key word, sign bit s is set, the value of sign bit s is set to 0, forms thus the data of 63.Then the effective marker position v that initial value is 1 was set before this 63 bit data most significant digit, forms 64 bit data, be called the parallel search key word of subtree SS.Take binary tree shown in Fig. 2 as example, and the compression key word of node A-G is respectively:
cA:00101001
cB:00101010
cC:00110000
cD:00110001
cE:10000011
cF:10000100
cG:11000100
Parallel search key word P0 according to following form structure subtree SS:
v-s-cG-s-cF-s-cE-s-cD-s-cC-s-cB-cA
The parallel search key word P0 that obtains subtree SS is:
1011000100010000100010000011000110001000110000000101010000101001
For example, data K to be checked is as shown in table 2:
Table 2
| ? | 19 | 18 | 17 | 16 | 15 | 14 | 13 | 12 | 11 | 10 | 9 | 8 | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
| K | 1 | 1 | 0 | 0 | 0 | 1 | 0 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 0 | 1 | 1 | 1 | 0 |
Now, the 17-19 bit data CmK of K equates with CmSS, is 110.In this case, the low 9-16 bit data of K is extracted, as key word cK to be checked.According to table 2, key word to be checked is: 00101011, then, according to the same way as of the parallel search key word of constructing subtree SS, according to following form, construct parallel key word P1 to be checked:
v-s-cK-s-cK-s-cK-s-cK-s-cK-s-cK-s-cK
The to be checked parallel key word P1 that obtains data to be checked is:
1000101011000101011000101011000101011000101011000101011000101011
Described parallel key word P1 to be checked is deducted to parallel search key word P0, obtain comparative result P2, that is:
P2=P1-P0=1000101011000101011000101011000101011000101011000101011000101011–
1011000100010000100010000011000110001000110000000101010000101001=
1101100110110100110110100111111111001111111011000000001000000010
Then, check the number that in comparative result P2, sign bit s changes.Specifically, by P2 and check key word Px phase with, extract the sign bit s in P2, Px=
0100000000100000000100000000100000000100000000100000000100000000。
Assay P3=P2& Px=
1101100110110100110110100111111111001111111011000000001000000010&
0100000000100000000100000000100000000100000000100000000100000000=
0100000000100000000100000000100000000100000000000000000000000000
In P3,1 number is 5, illustrates that sign bit s has 5 to change, and has 2 sign bit s not change, and this is because cK is greater than cA and cB, but is less than the reason of cC to cG.Can draw thus, search next time and enter subtree S2.That is to say, can determine and search the subtree Sn that will enter next time according to the number n of the sign bit s do not changed in P3.
If in P3,1 number is 4, the number of the sign bit s do not changed is 3, and cC<cK<cD is described, search next time and enter subtree S3, the like.
If find that in P2 certain sign bit s is 0, for example, find that the sign bit s before cD is 0, and 8 bit data thereafter are 0, cK=cD is described.In this case, can read the partial data of node D, by itself and K relatively, whether the checking node D of take the data as searching.
Here it is emphasized that in above example, the compression key word is chosen 8, and it is bright that this is only that a kind of example is stated, and the figure place of compression key word can be determined according to data-handling capacity, subtree exponent number, subtree nodes.For example, if having the data-handling capacity of 64 according to CPU, parallel key word selects 64 bit comparisons suitable, like this for the 3 rank complete subtree with 7 nodes, the length of compression key word is just | 64/7|=9,9 deduct 1 as sign bit s, obtain 8.If 3 rank subtrees only have 4 effective nodes, the length of compressing KEY can be | 64/5|=12, deduct 1 bit sign position s, and obtain 11, the compression key word can select 11.If the hardware logic of higher special use carrys out deal with data by figure place, for example adopt the application specific processor of 128, the length of parallel key word can be accomplished longlyer, also can to choose ground larger for the figure place of compression key word.Optimal situation is, the hardware logic figure place is enough high, the figure place of compression key word can be chosen as to remaining whole figure places except common key word, can once relatively in, the confirmation and the next search direction that complete lookup result are confirmed simultaneously.
If do not find the data that need in the SS subtree, when entering subtree S0-S7 and search, equally according to the method described above, first compare the common key word of subtree, then construct the parallel search key word, repeat above process, until find data K to be checked, perhaps find minimum one deck subtree of binary tree, return to the state notifying do not found.
It should be noted that, in search procedure, for subtree SS, S0-S7 and more the low layer subtree extract the common key word of subtree, structure parallel search key word, generally only carry out once, and the common key word of the subtree of having constructed, parallel search key word are preserved, in the situation that sub-tree structure and subtree node data do not change, do not need all to extract the common key word of subtree and structure parallel search key word, further to improve search efficiency at every turn.
The embodiment of the present invention also relates to a kind of equipment for the binary tree parallel search, as shown in Figure 2.With reference to Fig. 2, described equipment 300 comprises: compression module 310 is divided into a plurality of subtrees for the subtree exponent number to select by described binary tree, parallel search key word constructing module 320, be used to each subtree to construct common key word, comprise: from the most significant digit of each node data of each subtree, extract the identical high position data of whole node datas in described subtree, as the common key word of the subtree of this subtree, described parallel search key word constructing module 320 figure places for the common key word according to according to described subtree, from data configuration to be checked high-order key word to be checked, comprise: according to the figure place of described common key word, from most significant digit, extract the high position data of data to be checked, as high-order key word to be checked, comparison module 330, for more described high-order key word to be checked and the common key word of described subtree, control module 340, when unequal for the comparative result at described high-order key word to be checked and the common key word of described subtree, determine the subtree direction of next time searching according to comparative result.
According to the embodiment of the present invention, when described high-order key word to be checked equates with the comparative result of the common key word of described subtree, described parallel search key word constructing module 320 is used to each subtree structure parallel search key word, wherein from the described identical high position data of each node data, the data of figure place are selected in intercepting successively, as the compression key word, search the magnitude relationship order of node data in subtree according to each, to be spliced into from the described compression key word of each node data the parallel search key word of described subtree, between each compression key word, with sign bit, separate, and described parallel search key word constructing module 320 is for according to described data configuration to be checked parallel key word to be checked, wherein from the described high position data of described data to be checked, intercept successively the data of described selected figure place, as key word to be checked, and according to the interstitial content of described subtree, described key word to be checked is repeated to be spliced into parallel key word to be checked, between each key word to be checked, with sign bit, separate, described comparison module 330, for described parallel key word to be checked is deducted to the parallel search key word, obtains key word as a result, described control module 340, in described key word as a result, is determined the number of the sign bit change, and, according to the number of the sign bit changed in described key word as a result, determines the subtree direction of next time searching.
According to the embodiment of the present invention, described control module 340 is at described key word as a result, determine the position that described sign bit does not change, and the position that do not change at described sign bit of judgement, whether the key word to be checked that forms described parallel key word to be checked equates with the compression key word that forms described parallel search key word, when equal, described comparison module 330 is for obtaining the node data corresponding with described compression key word, and described data to be checked and described node data are compared.
According to the embodiment of the present invention, by the subtree of the low exponent number of binary tree boil down to, the common key word that extracts each subtree is also each subtree structure parallel search key word, can greatly reduce the read-write number of times of data memory area, improves search efficiency.
Those of ordinary skills can recognize, unit and the algorithm steps of each example of describing in conjunction with embodiment disclosed herein, can realize with electronic hardware, computer software or the combination of the two, for the interchangeability of hardware and software clearly is described, composition and the step of each example described according to function in the above description in general manner.These functions are carried out with hardware or software mode actually, depend on application-specific and the design constraint of technical scheme.The professional and technical personnel can specifically should be used for realizing described function with distinct methods to each, but this realization should not thought and exceeds scope of the present invention.
The software module that the method for describing in conjunction with embodiment disclosed herein or the step of algorithm can use hardware, processor to carry out, or the combination of the two is implemented.Software module can be placed in the storage medium of any other form known in random access memory (RAM), internal memory, ROM (read-only memory) (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technical field.
Although illustrated and described some embodiments of the present invention, it will be understood by those skilled in the art that without departing from the principles and spirit of the present invention, can carry out various modifications to these embodiment, such modification should fall within the scope of the present invention.
Claims (10)
1. an ordered binary tree parallel search method, is characterized in that,
With the subtree exponent number of selecting, described binary tree is divided into to a plurality of subtrees, described subtree exponent number is more than or equal to 3;
Construct common key word for each subtree, comprising: from the most significant digit of each node data of each subtree, extract in described subtree all identical high position datas of node datas, as the common key word of the subtree of this subtree;
Figure place according to the common key word of described subtree, from data configuration to be checked high-order key word to be checked, comprising: according to the figure place of described common key word, from most significant digit, extract the high position data of data to be checked, as high-order key word to be checked;
More described high-order key word to be checked and the common key word of described subtree, when the comparative result of described high-order key word to be checked and the common key word of described subtree is unequal, directly determine the subtree direction of next time searching according to comparative result.
2. the method for claim 1, is characterized in that, described method also comprises:
When described high-order key word to be checked equates with the comparative result of the common key word of described subtree,
For each subtree structure parallel search key word, wherein from the described identical high position data of each node data, the data of figure place are selected in intercepting successively, as the compression key word, search the magnitude relationship order of node data in subtree according to each, to be spliced into the parallel search key word of described subtree from the described compression key word of each node data, separate with sign bit between each compression key word
According to described data configuration to be checked parallel key word to be checked, wherein from the described high position data of described data to be checked, intercept successively the data of described selected figure place, as key word to be checked, and according to the interstitial content of described subtree, described key word to be checked is repeated to be spliced into parallel key word to be checked, between each key word to be checked, with sign bit, separate
Described parallel key word to be checked is deducted to the parallel search key word, obtain key word as a result;
In described key word as a result, determine the number of the sign bit do not changed, according to the number of the sign bit do not changed in described key word as a result, determine the subtree direction of next time searching.
3. method as claimed in claim 2, is characterized in that,
In described key word as a result, determine the position that described sign bit does not change, and the position that do not change at described sign bit of judgement, whether the key word to be checked that forms described parallel key word to be checked equates with the compression key word that forms described parallel search key word, when equal, obtain the node data corresponding with described compression key word, and described data to be checked and described node data are compared.
4. method as described as the claims 1 to 3 any one, is characterized in that, describedly with the subtree exponent number of selecting, described binary tree is divided into to a plurality of subtrees, comprising:
Described binary tree is divided into to a plurality of 3 rank subtrees.
5. method as claimed in claim 2 or claim 3, is characterized in that,
Described is each subtree structure parallel search key word, and wherein, from the described identical high position data of each node data, the data of figure place are selected in intercepting successively, as the compression key word, comprising:
Described for each subtree structure parallel search key word, wherein, from the described identical high position data of each node data, intercept successively 8 bit data, as the compression key word.
6. the equipment for the ordered binary tree parallel search, is characterized in that, described equipment comprises:
Compression module, be divided into a plurality of subtrees for the subtree exponent number to select by described binary tree, and described subtree exponent number is more than or equal to 3;
Parallel search key word constructing module, be used to each subtree to construct common key word, comprise: from the most significant digit of each node data of each subtree, extract in described subtree all identical high position datas of node datas, as the common key word of the subtree of this subtree
Described parallel search key word constructing module is for the figure place according to the common key word according to described subtree, from data configuration to be checked high-order key word to be checked, comprising: according to the figure place of described common key word, from most significant digit, extract the high position data of data to be checked, as high-order key word to be checked;
Comparison module, for more described high-order key word to be checked and the common key word of described subtree,
Control module, when unequal for the comparative result at described high-order key word to be checked and the common key word of described subtree, determine the subtree direction of next time searching according to comparative result.
7. equipment as claimed in claim 6, is characterized in that,
When described high-order key word to be checked equates with the comparative result of the common key word of described subtree,
Described parallel search key word constructing module is used to each subtree structure parallel search key word, wherein from the described identical high position data of each node data, the data of figure place are selected in intercepting successively, as the compression key word, search the magnitude relationship order of node data in subtree according to each, to be spliced into the parallel search key word of described subtree from the described compression key word of each node data, separate with sign bit between each compression key word
And described parallel search key word constructing module is used for according to described data configuration to be checked parallel key word to be checked, wherein from the described high position data of described data to be checked, intercept successively the data of described selected figure place, as key word to be checked, and according to the interstitial content of described subtree, described key word to be checked is repeated to be spliced into parallel key word to be checked, between each key word to be checked, with sign bit, separate;
Described comparison module, for described parallel key word to be checked is deducted to the parallel search key word, obtains key word as a result;
Described control module, in described key word as a result, is determined the number of the sign bit do not changed, and according to the number of the sign bit do not changed in described key word as a result, determines the subtree direction of next time searching.
8. equipment as claimed in claim 7, is characterized in that,
Described control module is used at described key word as a result, determine the position that described sign bit does not change, and the position that do not change at described sign bit of judgement, whether the key word to be checked that forms described parallel key word to be checked equates with the compression key word that forms described parallel search key word, when equal, described comparison module is used for obtaining the node data corresponding with described compression key word, and described data to be checked and described node data are compared.
9. equipment as described as claim 6 to 8 any one, is characterized in that, described compression module is divided into a plurality of 3 rank subtrees by described binary tree.
10. equipment as claimed in claim 7 or 8, is characterized in that, described parallel search key word constructing module, from the described identical high position data of each node data, intercepts 8 bit data successively, as described compression key word.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110136760 CN102156759B (en) | 2011-05-25 | 2011-05-25 | Binary tree parallel inquiry method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110136760 CN102156759B (en) | 2011-05-25 | 2011-05-25 | Binary tree parallel inquiry method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102156759A CN102156759A (en) | 2011-08-17 |
| CN102156759B true CN102156759B (en) | 2013-12-18 |
Family
ID=44438257
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110136760 Expired - Fee Related CN102156759B (en) | 2011-05-25 | 2011-05-25 | Binary tree parallel inquiry method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102156759B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9405782B2 (en) | 2011-08-29 | 2016-08-02 | Intel Corporation | Parallel operation in B+ trees |
| CN102739520B (en) * | 2012-05-31 | 2015-03-18 | 华为技术有限公司 | Checking method and checking device |
| CN105335411A (en) | 2014-07-31 | 2016-02-17 | 国际商业机器公司 | Method and system for data processing |
| CN107798073B (en) * | 2017-09-29 | 2020-07-24 | 华为技术有限公司 | Method and device for processing data set with tree structure |
| WO2021184325A1 (en) * | 2020-03-19 | 2021-09-23 | Wang Chau Tyler Kot | Ethereum state data storage optimization method, ethereum system and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1172971A2 (en) * | 2000-07-12 | 2002-01-16 | Nec Corporation | Route retrieving system, method therefor and a router device to be used in the same |
| CN101022407A (en) * | 2007-03-13 | 2007-08-22 | 中兴通讯股份有限公司 | Binary tree-based stream classification checking method |
| CN101425084A (en) * | 2008-11-20 | 2009-05-06 | 上海交通大学 | Mode matching method based on ordering binary tree |
-
2011
- 2011-05-25 CN CN 201110136760 patent/CN102156759B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1172971A2 (en) * | 2000-07-12 | 2002-01-16 | Nec Corporation | Route retrieving system, method therefor and a router device to be used in the same |
| CN101022407A (en) * | 2007-03-13 | 2007-08-22 | 中兴通讯股份有限公司 | Binary tree-based stream classification checking method |
| CN101425084A (en) * | 2008-11-20 | 2009-05-06 | 上海交通大学 | Mode matching method based on ordering binary tree |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102156759A (en) | 2011-08-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102156759B (en) | Binary tree parallel inquiry method and device | |
| JP6639420B2 (en) | Method for flash-optimized data layout, apparatus for flash-optimized storage, and computer program | |
| Wang et al. | Contextual weighting for vocabulary tree based image retrieval | |
| US10705734B2 (en) | Expanding variable sub-column widths as needed to store data in memory | |
| US11650990B2 (en) | Method, medium, and system for joining data tables | |
| CN105630803B (en) | The method and apparatus that Document image analysis establishes index | |
| CN104461390A (en) | Method and device for writing data into imbricate magnetic recording SMR hard disk | |
| CN104238962A (en) | Method and device for writing data into cache | |
| CN103955433A (en) | Shingled magnetic recording hard disk, and method and device for writing data in shingled magnetic recording hard disk | |
| CN102662855B (en) | Storage method and system of binary tree | |
| CN103345496A (en) | Multimedia information searching method and system | |
| CN106486167A (en) | Improve the method and system that flash memory is removed | |
| CN102622434A (en) | Data storage method, data searching method and device | |
| CN107291392A (en) | A kind of solid state hard disc and its reading/writing method | |
| US8352707B2 (en) | Implementing enhanced host to physical storage mapping using numerical compositions for persistent media | |
| CN103092992A (en) | Vector data preorder quadtree coding and indexing method based on Key / Value type NoSQL (Not only SQL) | |
| CN102799617A (en) | Construction and query optimization methods for multiple layers of Bloom Filters | |
| CN101158955A (en) | Construct method of Chinese word stock | |
| CN103645860A (en) | Memory space management method and memory management device | |
| CN107451271A (en) | A kind of Hash table processing method, device, equipment and storage medium | |
| CN104166736A (en) | Storage method and device of reverse index files | |
| US7484068B2 (en) | Storage space management methods and systems | |
| CN103823641A (en) | Online expanded virtual volume system and realizing method thereof | |
| CN103049561A (en) | Data compressing method, storage engine and storage system | |
| CN104866535A (en) | Compression method and device of number segment records |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131218 Termination date: 20190525 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |