CN102880724A - Method and system for processing Hash collision - Google Patents
Method and system for processing Hash collision Download PDFInfo
- Publication number
- CN102880724A CN102880724A CN2012104057226A CN201210405722A CN102880724A CN 102880724 A CN102880724 A CN 102880724A CN 2012104057226 A CN2012104057226 A CN 2012104057226A CN 201210405722 A CN201210405722 A CN 201210405722A CN 102880724 A CN102880724 A CN 102880724A
- Authority
- CN
- China
- Prior art keywords
- hash
- list item
- key word
- key
- hash function
- 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.)
- Pending
Links
Images
Abstract
The invention provides a method and a system for processing Hash collision. The method includes separating list items which include a first list item corresponding a first Hash function and a second list item corresponding to a second Hash function and store Hash data; receiving Hash key words and judging whether the Hash collision exists or not, if collision exists in the first list item, storing the Hash key words to the corresponding position of the second list item according to the second Hash function; if no collision exists, storing the Hash key words into the corresponding position of the first list item according to the first Hash function; searching clauses corresponding to the Hash key words sequentially in the first list item and the second list item according to the first Hash function and the second Hash function. On the basis of keeping hardware cost constant, incidence rate of the Hash collision is decrease effectively.
Description
Technical field
The present invention relates to the network communication field technology, relate in particular to a kind of method and system of processing hash-collision.
Background technology
Hash (Hash) table is the data structure that directly conducts interviews according to key value (key), and it is stored by key value being mapped in the list item position (index), to accelerate the speed of data search.Wherein, this mapping function is called hash function (f), and the array of put is Hash table, and the mathematic(al) representation of Hash table is: index=f(key).Take route querying as example, the effective range of hash function input value (key) is whole address space in network communication field, and hash function output valve (Index) effective range is the maximum specification that system supports this list item.Obviously, the effective range of output valve is far smaller than the effective range of input value, under this prerequisite, no matter how to remove to construct hash function (f), all unavoidably key1 ≠ key2 can appear, and f(key1)=f(key2) situation, this situation just is hash-collision.
In the prior art, except expanding list item space and constructing more suitably the hash function, the method of solution hash-collision commonly used is " setting up public overflow area ", the deposit data of hash-collision will occur in the ternary addressable register of TCAM(in the method) the inside, yet, although said method can be in the generation of to a certain degree avoiding hash-collision, but because TCAM limited space, and with high costs, if the hash-collision rate is high, and the TCAM insufficient space, the list item that can lead to a conflict is so deposited nowhere, additionally sets up the cost that TCAM also certainly will improve whole equipment.
Summary of the invention
The technical matters of solution required for the present invention is to provide a kind of method of processing hash-collision with low cost.
Correspondingly, the present invention also provides a kind of system that processes hash-collision.
For solving the problems of the technologies described above, the technical solution used in the present invention is:
A kind of method of processing hash-collision, it comprises the steps:
S1, will split for the list item of storage Hash data, described list item comprises the first list item corresponding to the first hash function, corresponding to the second list item of the second hash function;
S2, reception Hash key, and judge whether to occur hash-collision, if in the first list item, clash, then according to the second hash function described Hash key is stored in the relevant position of the second list item; If without conflict, then according to the first hash function described Hash key is stored in the relevant position of the first list item;
S3, according to described first, second hash function, in first, second list item, search successively clauses and subclauses corresponding to Hash key.
The present invention further, if hash-collision all occurs in key word to be deposited in first, second list item, wherein, afoul in the first list item is the first key word, afoul in the second list item is the second key word, then described step S2 also comprises: the first key word is removed from the first list item, and be stored in the relevant position of the second list item according to the second hash function; Key word to be deposited is stored in the relevant position of the first list item according to the first hash function.
The present invention further, described step S2 can carry out in another embodiment another kind and remove mode: the second key word is removed from the second list item, and be stored in the relevant position of the first list item according to the first hash function; Key word to be deposited is stored in the relevant position of the second list item according to the second hash function.
The present invention further, after described step S2, the method also comprises: public overflow area is set, if key word to be deposited at first, second list item hash-collision occurs still, then it is stored in described public overflow area.
The present invention further, described step S3 is specially: S31, according to the first hash function, Hash key to be checked is searched in the corresponding position in the first list item, if search successfully, then finishes to search; If do not search successfully jump procedure S32; S32, according to the second hash function, Hash key to be checked is searched in the corresponding position in the second list item, if search successfully, then finishes to search; If do not search successfully jump procedure S33; S33, search Hash key to be checked in described public overflow area.
In addition, the present invention also provides a kind of system that processes hash-collision, and it comprises such as lower unit:
List item split cells, the list item that is used for being used for storing the Hash data split, and described list item comprises the first list item corresponding to the first hash function, corresponding to the second list item of the second hash function;
The Hash storage unit, be used for to receive Hash key, and judge whether to occur hash-collision, if in the first list item, clash, then according to the second hash function described Hash key is stored in the relevant position of the second list item; If without conflict, then according to the first hash function described Hash key is stored in the relevant position of the first list item;
The Hash lookup unit, be used in first, second list item, searching successively clauses and subclauses corresponding to Hash key according to described first, second hash function.
The present invention further, if hash-collision all occurs in key word to be deposited in first, second list item, wherein, afoul in the first list item is the first key word, afoul in the second list item is the second key word, then described Hash storage unit also comprises a Hash migration units, and this Hash migration units is used for: the first key word is removed from the first list item, and be stored in the relevant position of the second list item according to the second hash function; Key word to be deposited is stored in the relevant position of the first list item according to the first hash function.
The present invention further, in another embodiment, above-mentioned Hash migration units also can be used for: the second key word is removed from the second list item, and be stored in the relevant position of the first list item according to the first hash function; Key word to be deposited is stored in the relevant position of the second list item according to the second hash function.
The present invention further, described Hash storage unit also comprises a common memory element, it is used for: if key word to be deposited at first, second list item hash-collision occurs still, then it is stored in described public overflow area.
The present invention further, described Hash lookup unit specifically is used for: according to the first hash function, Hash key to be checked is searched in the corresponding position in the first list item, if search successfully, then finishes to search; If do not search successfully, then according to the second hash function, Hash key to be checked is searched in the corresponding position in the second list item, if search successfully, then finishes to search; If do not search successfully, then search Hash key to be checked in described public overflow area.
Can find out according to above technical scheme, because the present invention is split as at least two corresponding to the list item of different hash functions by the list item that will possess certain storage space, carry out depositing of Hash data, when hash-collision occurs, can use, reach by the switching of a plurality of hash functions the mode of Hash Data Migration, solve hash-collision, this scheme has effectively reduced the hash-collision incidence on the basis that keeps original hardware cost.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the specific embodiment of the invention or prior art, the below will do to introduce simply to the accompanying drawing of required use in the specific embodiment of the invention or existing the description, apparently, following accompanying drawing only is a part of accompanying drawing of the present invention, for those of ordinary skills, under the prerequisite of not making creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the process flow diagram of processing the method for hash-collision in the specific embodiment of the invention;
Fig. 2 is the schematic diagram after hash table splits in the specific embodiment of the invention;
Fig. 3 shows the process of processing hash-collision in an embodiment of the present invention;
Fig. 4 shows the process of processing hash-collision in another embodiment of the present invention;
Fig. 5 is the cell schematics of processing the system of hash-collision in the specific embodiment of the invention.
Embodiment
Describe the present invention below with reference to embodiment shown in the drawings.But these embodiments do not limit the present invention, and based on various embodiments of the present invention, those of ordinary skill in the art all should be included in protection scope of the present invention not making the every other embodiment that obtains under the prerequisite of creative work.
Please refer to the drawing 1 is to shown in Figure 4, and it has described some specific embodiments of the disposal route of hash-collision of the present invention.Wherein, as shown in Figure 1, in an embodiment of the present invention, the method for processing hash-collision mainly comprises list item partiting step (S1 step), Hash key storing step (S2 step) and Hash entry finding step (S3 step).Particularly, above steps comprises:
S1, will split for the list item of storage Hash data, described list item comprises the first list item corresponding to the first hash function, corresponding to the second list item of the second hash function;
As shown in Figure 2, the present invention only take the embodiment that splits into two list items as example, sets forth the present invention, and certainly, in other embodiments, hash table also can be divided into three parts or other any many parts, and it is unrestricted.The maximum specification of supposing the list item support is N, list item is split into two (the first list item T1, the second list item T2), list item specification after splitting so is N1 and N2, wherein, N=N1+N2 according to new list item size N1 and N2, is that two list items are constructed respectively suitable this specification but not identical hash function (the first hash function f1 and the second hash function f2).For same input key, the first hash function is realized unique address mapping f1 (key) for it, and the second hash function is realized wherein, satisfying the condition of f1 (key) ≠ f2 (key) by unique address mapping f2 (key) for it.
S2, reception Hash key, and judge whether hash-collision (step S21) occurs in the first list item, (be not to be the room on the predetermined store items of current Hash key to be stored if clash in the first list item, occupied by other key words), at this moment, for fear of this hash-collision, the present invention attempts according to the second hash function described Hash key to be stored in the relevant position (step S24) of the second list item; If without conflict, then according to the first hash function described Hash key is stored in the relevant position (step S23) of the first list item.
Please in conjunction with Fig. 3, in the present embodiment, in the situation that not conflict, the first key word key1 can be stored the position of f1 (key1) in the first list item T1, now the second key word key2 appears in hypothesis, and learn f1 (key2)=f1 (key1), the position that namely shows f1 (key2) among the first list item T1 is not empty, hash-collision has namely occured, at this moment, Hash key key2 can not leave the position of the f1 (key2) of T1 in, and the present invention is left key2 in the position of the f2 (key2) among the second list item T2 for fear of conflict.
In the specific embodiment of the invention, if following situation occurs: existing at Hash key key3 to be stored, yet, f1 (key3)=f1 (key1), f2 (key3)=f2 (key2), in other words, key word key3 to be deposited has had the hash-collision of generation at the first list item T1 and the second list item T2.The present invention is in order to process hash-collision in the case, at first by judging whether the second list item hash-collision (step S22) occurs, if, showing that namely above-mentioned situation occurs, can attempt key1 or key2 are once moved this moment; If not, then can determine Hash keyword to be stored is deposited in (step S24) in the second list item.
In conjunction with Fig. 1 and shown in Figure 4, the present invention has set up Hash Data Migration step (step S26), and this step specific implementation process is:
At first, the first key word key1 being removed from the first list item T1, and is stored in the relevant position of the second list item T2 according to the second hash function f2, to guarantee the f1(key1 among the T1) position soars, and gives the key3 list item; After this, again will key word key3 be deposited according to the relevant position that the first hash function f1 is stored in the first list item T1, can finish the processing of hash-collision.
In other embodiments of the invention, also can attempt the second key word key2 is moved to the first list item T1, and leave f1(key2 in) position, soared in the position among the second list item T2 right in key word key3 to be deposited, its concrete transition process is similar in above-described embodiment.But generally speaking, if algorithm tends to attempt first storing the first list item T1 at the beginning, the second list item T2 is stored in rear trial, Hash key among the second list item T2 or be to search at the very start the first list item T1 to clash and directly leave the second list item T2's in so, vacate the position from the first list item T1 for other list item and move to the second list item T2, thereby moving back the probability of success of the first list item T1 from the second list item T2 can be smaller (unless have the Hash data of the first list item T1 deleted).
Before above-mentioned steps, the method also increases by one and judges whether successful step (S25) of migration, thereby in the situation that the unresolved conflict of migration step, enter step S27: public overflow area is set, if key word to be deposited at first, second list item hash-collision occurs still, then it is stored in described public overflow area and safeguards.This mode that public overflow area is set is technology well known to those of ordinary skill in the art, therefore the applicant is not giving unnecessary details.
In other embodiments of the invention, in the process that realizes, can consider to skip the step (from the second list item to the first list item) of the above-mentioned migration second time according to cost performance, but directly after described step S22, enter step S27.
Current, in other embodiments of the present invention, suppose to be provided with the 3rd list item, it is corresponding to the 3rd hash function f3 that is not quite similar with first, second hash function, when behind step S22, judging so first, second list item and all hash-collision occuring, can continue just to judge that whether the institute corresponding clauses and subclauses place of this Hash keyword in the 3rd list item be for empty, by that analogy, can also increase by the list item such as the 4th, the 5th, until till hash-collision avoids.
S3, according to described first, second hash function, in first, second list item, search successively clauses and subclauses corresponding to Hash key.In the present embodiment, for a Hash key key1, its concrete search procedure is:
S31, according to the first hash function f1, Hash key to be checked is searched in the corresponding position in the first list item, if search successfully, then finishes to search; If do not search successfully jump procedure S32;
S32, according to the second hash function f2, Hash key to be checked is searched in the corresponding position in the second list item, if search successfully, then finishes to search; If do not search successfully jump procedure S33;
S33, search key word to be checked in described public overflow area.
Next, shown in please refer to the drawing 5, in the specific embodiment of the invention, a kind of system that processes hash-collision comprises:
List item split cells 10, the list item that is used for being used for storing the Hash data split, and described list item comprises the first list item corresponding to the first hash function, corresponding to the second list item of the second hash function;
Wherein, in an embodiment of the present invention, if hash-collision all occurs in key word to be deposited in first, second list item, wherein, afoul in the first list item is the first key word, afoul in the second list item is the second key word, and then described Hash storage unit also comprises a Hash migration units 21, and this Hash migration units 21 is used for:
The first key word is removed from the first list item, and be stored in the relevant position of the second list item according to the second hash function; Key word to be deposited is stored in the relevant position of the first list item according to the first hash function.
In another embodiment of the present invention, this Hash migration units 21 also can be used for:
The second key word is removed from the second list item, and be stored in the relevant position of the first list item according to the first hash function; Key word to be deposited is stored in the relevant position of the second list item according to the second hash function.
In addition, the concrete function mode of the disposal system embodiment of relevant hash-collision provided by the invention, concrete technical characterictic etc., the disposal route embodiment of the relevant hash-collision that may refer to the above description is no longer given unnecessary details this inventor.
Based on technique scheme, complement one another and back up in list item T1, the T2 two parts space that the present invention makes up.Collision rate before supposing to split is c%, the collision rate of T1 is c1% after splitting, the collision rate of T2 is c2%, the probability that f1 (key2) and f2 (key2) clash after splitting so is c1%*c2%, in the situation that hash function f1 and f2 structure are suitable, c1%*c2% should be far smaller than c%.The present invention can use, reach by the switching of a plurality of hash functions the mode of Hash Data Migration when hash-collision occurs, solve hash-collision, and this scheme has effectively reduced the hash-collision incidence on the basis that keeps original hardware cost.
Be to be understood that, although this instructions is described according to embodiment, but be not that each embodiment only comprises an independently technical scheme, this narrating mode of instructions only is for clarity sake, those skilled in the art should make instructions as a whole, technical scheme in each embodiment also can through appropriate combination, form other embodiments that it will be appreciated by those skilled in the art that.
Above listed a series of detailed description only is specifying for feasibility embodiment of the present invention; they are not to limit protection scope of the present invention, allly do not break away from equivalent embodiment or the change that skill spirit of the present invention does and all should be included within protection scope of the present invention.
Claims (10)
1. a method of processing hash-collision is characterized in that, comprises the steps:
S1, will split for the list item of storage Hash data, described list item comprises the first list item corresponding to the first hash function, corresponding to the second list item of the second hash function;
S2, reception Hash key, and judge whether to occur hash-collision, if in the first list item, clash, then according to the second hash function described Hash key is stored in the relevant position of the second list item; If without conflict, then according to the first hash function described Hash key is stored in the relevant position of the first list item;
S3, according to described first, second hash function, in first, second list item, search successively clauses and subclauses corresponding to Hash key.
2. method according to claim 1 is characterized in that, if hash-collision all occurs in first, second list item key word to be deposited, wherein, afoul in the first list item is the first key word, and afoul in the second list item is the second key word, and then described step S2 also comprises:
The first key word is removed from the first list item, and be stored in the relevant position of the second list item according to the second hash function;
Key word to be deposited is stored in the relevant position of the first list item according to the first hash function.
3. method according to claim 1 is characterized in that, if hash-collision all occurs in first, second list item key word to be deposited, wherein, afoul in the first list item is the first key word, and afoul in the second list item is the second key word, and then described step S2 also comprises:
The second key word is removed from the second list item, and be stored in the relevant position of the first list item according to the first hash function;
Key word to be deposited is stored in the relevant position of the second list item according to the second hash function.
4. according to claim 2 or 3 described methods, it is characterized in that, after described step S2, the method also comprises: public overflow area is set, if key word to be deposited at first, second list item hash-collision occurs still, then it is stored in described public overflow area.
5. method according to claim 4 is characterized in that, described step S3 is specially:
S31, according to the first hash function, Hash key to be checked is searched in the corresponding position in the first list item, if search successfully, then finishes to search; If do not search successfully jump procedure S32;
S32, according to the second hash function, Hash key to be checked is searched in the corresponding position in the second list item, if search successfully, then finishes to search; If do not search successfully jump procedure S33;
S33, search key word to be checked in described public overflow area.
6. a system that processes hash-collision is characterized in that, comprises such as lower unit:
List item split cells, the list item that is used for being used for storing the Hash data split, and described list item comprises the first list item corresponding to the first hash function, corresponding to the second list item of the second hash function;
The Hash storage unit, be used for to receive Hash key, and judge whether to occur hash-collision, if in the first list item, clash, then according to the second hash function described Hash key is stored in the relevant position of the second list item; If without conflict, then according to the first hash function described Hash key is stored in the relevant position of the first list item;
The Hash lookup unit, be used in first, second list item, searching successively clauses and subclauses corresponding to Hash key according to described first, second hash function.
7. system according to claim 6, it is characterized in that, if hash-collision all occurs in key word to be deposited in first, second list item, wherein, afoul in the first list item is the first key word, afoul in the second list item is the second key word, and then described Hash storage unit also comprises a Hash migration units, and this Hash migration units is used for:
The first key word is removed from the first list item, and be stored in the relevant position of the second list item according to the second hash function;
Key word to be deposited is stored in the relevant position of the first list item according to the first hash function.
8. system according to claim 6, it is characterized in that, if hash-collision all occurs in key word to be deposited in first, second list item, wherein, afoul in the first list item is the first key word, afoul in the second list item is the second key word, and then described Hash storage unit also comprises a Hash migration units, and this Hash migration units is used for:
The second key word is removed from the second list item, and be stored in the relevant position of the first list item according to the first hash function;
Key word to be deposited is stored in the relevant position of the second list item according to the second hash function.
9. according to claim 7 or 8 described systems, it is characterized in that, described Hash storage unit also comprises a common memory element, and it is used for: if key word to be deposited at first, second list item hash-collision occurs still, then it is stored in described public overflow area.
10. system according to claim 9 is characterized in that, described Hash lookup unit specifically is used for:
According to the first hash function, Hash key to be checked is searched in the corresponding position in the first list item, if search successfully, then finishes to search; If do not search successfully, then according to the second hash function, Hash key to be checked is searched in the corresponding position in the second list item, if search successfully, then finishes to search; If do not search successfully, then search key word to be checked in described public overflow area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104057226A CN102880724A (en) | 2012-10-23 | 2012-10-23 | Method and system for processing Hash collision |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104057226A CN102880724A (en) | 2012-10-23 | 2012-10-23 | Method and system for processing Hash collision |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102880724A true CN102880724A (en) | 2013-01-16 |
Family
ID=47482050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012104057226A Pending CN102880724A (en) | 2012-10-23 | 2012-10-23 | Method and system for processing Hash collision |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102880724A (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103117931A (en) * | 2013-02-21 | 2013-05-22 | 烽火通信科技股份有限公司 | Media access control (MAC) address hardware learning method and system based on hash table and ternary content addressable memory (TCAM) table |
| CN103577564A (en) * | 2013-10-25 | 2014-02-12 | 盛科网络（苏州）有限公司 | Method and device for reducing HASH collision through software shift |
| CN105224620A (en) * | 2015-09-21 | 2016-01-06 | 盛科网络（苏州）有限公司 | The method and device that reduce HASH collision probability is moved by software |
| CN105630928A (en) * | 2015-12-22 | 2016-06-01 | 北京奇虎科技有限公司 | Text marking method and apparatus |
| CN106528670A (en) * | 2016-10-31 | 2017-03-22 | 盛科网络（苏州）有限公司 | Method for reducing Hash search conflicts |
| CN106708438A (en) * | 2016-12-16 | 2017-05-24 | 盛科网络（苏州）有限公司 | Method and device for lowering Hash conflict probability |
| CN108111421A (en) * | 2017-11-28 | 2018-06-01 | 郑州云海信息技术有限公司 | A kind of message diversion method and device based on multiple Hash |
| CN109656468A (en) * | 2017-10-11 | 2019-04-19 | 深圳市中兴微电子技术有限公司 | A kind of method and device for realizing data storage |
| CN109889544A (en) * | 2019-03-27 | 2019-06-14 | 苏州工业园区服务外包职业学院 | The collision detection method and device of a kind of number list item and affiliated directory |
| TWI667900B (en) * | 2014-11-10 | 2019-08-01 | 美商凱為有限責任公司 | Hybrid wildcard match table |
| CN111107068A (en) * | 2019-12-09 | 2020-05-05 | 江苏云涌电子科技股份有限公司 | Efficient rule matching method for FPGA and terminal |
| CN112148738A (en) * | 2020-09-24 | 2020-12-29 | 盛科网络（苏州）有限公司 | Hash collision processing method and system |
| CN112491725A (en) * | 2020-11-30 | 2021-03-12 | 锐捷网络股份有限公司 | MAC address processing method and device |
| US11218410B2 (en) | 2014-11-10 | 2022-01-04 | Marvell Asia Pte, Ltd. | Hybrid wildcard match table |
| CN114153391A (en) * | 2021-11-26 | 2022-03-08 | 山东云海国创云计算装备产业创新中心有限公司 | Data storage method, device and equipment based on register and storage medium |
| US11943142B2 (en) | 2014-11-10 | 2024-03-26 | Marvell Asia Pte, LTD | Hybrid wildcard match table |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5633858A (en) * | 1994-07-28 | 1997-05-27 | Accton Technology Corporation | Method and apparatus used in hashing algorithm for reducing conflict probability |
| CN101655820A (en) * | 2009-08-28 | 2010-02-24 | 深圳市茁壮网络股份有限公司 | Key word storing method and storing device |
| CN102194002A (en) * | 2011-05-25 | 2011-09-21 | 中兴通讯股份有限公司 | Table entry adding, deleting and searching method of hash table and hash table storage device |
-
2012
- 2012-10-23 CN CN2012104057226A patent/CN102880724A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5633858A (en) * | 1994-07-28 | 1997-05-27 | Accton Technology Corporation | Method and apparatus used in hashing algorithm for reducing conflict probability |
| CN101655820A (en) * | 2009-08-28 | 2010-02-24 | 深圳市茁壮网络股份有限公司 | Key word storing method and storing device |
| CN102194002A (en) * | 2011-05-25 | 2011-09-21 | 中兴通讯股份有限公司 | Table entry adding, deleting and searching method of hash table and hash table storage device |
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103117931B (en) * | 2013-02-21 | 2015-07-01 | 烽火通信科技股份有限公司 | Media access control (MAC) address hardware learning method and system based on hash table and ternary content addressable memory (TCAM) table |
| CN103117931A (en) * | 2013-02-21 | 2013-05-22 | 烽火通信科技股份有限公司 | Media access control (MAC) address hardware learning method and system based on hash table and ternary content addressable memory (TCAM) table |
| CN103577564A (en) * | 2013-10-25 | 2014-02-12 | 盛科网络（苏州）有限公司 | Method and device for reducing HASH collision through software shift |
| US11943142B2 (en) | 2014-11-10 | 2024-03-26 | Marvell Asia Pte, LTD | Hybrid wildcard match table |
| US11218410B2 (en) | 2014-11-10 | 2022-01-04 | Marvell Asia Pte, Ltd. | Hybrid wildcard match table |
| TWI667900B (en) * | 2014-11-10 | 2019-08-01 | 美商凱為有限責任公司 | Hybrid wildcard match table |
| CN105224620A (en) * | 2015-09-21 | 2016-01-06 | 盛科网络（苏州）有限公司 | The method and device that reduce HASH collision probability is moved by software |
| CN105630928B (en) * | 2015-12-22 | 2019-06-21 | 北京奇虎科技有限公司 | The identification method and device of text |
| CN105630928A (en) * | 2015-12-22 | 2016-06-01 | 北京奇虎科技有限公司 | Text marking method and apparatus |
| CN106528670A (en) * | 2016-10-31 | 2017-03-22 | 盛科网络（苏州）有限公司 | Method for reducing Hash search conflicts |
| CN106708438A (en) * | 2016-12-16 | 2017-05-24 | 盛科网络（苏州）有限公司 | Method and device for lowering Hash conflict probability |
| CN109656468A (en) * | 2017-10-11 | 2019-04-19 | 深圳市中兴微电子技术有限公司 | A kind of method and device for realizing data storage |
| CN108111421B (en) * | 2017-11-28 | 2021-02-09 | 苏州浪潮智能科技有限公司 | Message distribution method and device based on multiple Hash |
| CN108111421A (en) * | 2017-11-28 | 2018-06-01 | 郑州云海信息技术有限公司 | A kind of message diversion method and device based on multiple Hash |
| CN109889544A (en) * | 2019-03-27 | 2019-06-14 | 苏州工业园区服务外包职业学院 | The collision detection method and device of a kind of number list item and affiliated directory |
| CN109889544B (en) * | 2019-03-27 | 2021-04-06 | 苏州工业园区服务外包职业学院 | Method and device for detecting conflict between number table item and number table to which number table item belongs |
| CN111107068A (en) * | 2019-12-09 | 2020-05-05 | 江苏云涌电子科技股份有限公司 | Efficient rule matching method for FPGA and terminal |
| CN111107068B (en) * | 2019-12-09 | 2021-03-09 | 江苏云涌电子科技股份有限公司 | Efficient rule matching method for FPGA and terminal |
| CN112148738A (en) * | 2020-09-24 | 2020-12-29 | 盛科网络（苏州）有限公司 | Hash collision processing method and system |
| CN112491725A (en) * | 2020-11-30 | 2021-03-12 | 锐捷网络股份有限公司 | MAC address processing method and device |
| CN112491725B (en) * | 2020-11-30 | 2022-05-20 | 锐捷网络股份有限公司 | MAC address processing method and device |
| CN114153391B (en) * | 2021-11-26 | 2024-02-27 | 山东云海国创云计算装备产业创新中心有限公司 | Data storage method, device, equipment and storage medium based on register |
| CN114153391A (en) * | 2021-11-26 | 2022-03-08 | 山东云海国创云计算装备产业创新中心有限公司 | Data storage method, device and equipment based on register and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102880724A (en) | Method and system for processing Hash collision | |
| CN101604337B (en) | Apparatus and method for hash table storage, searching | |
| CN103238145B (en) | High-performance in network is equipped, the renewable and method and apparatus of Hash table that determines | |
| CN101834788B (en) | Storage operation method, device and equipment of media access control address table items | |
| CN100536435C (en) | Binary tree-based stream classification checking method | |
| CN101594319B (en) | Entry lookup method and entry lookup device | |
| EP2515487B1 (en) | Method and device for storing and searching keyword | |
| US20110270979A1 (en) | Reducing Propagation Of Message Floods In Computer Networks | |
| CN103918230B (en) | Synchronizing forwarding databases in a network device background | |
| CN102880628B (en) | Hash data storage method and device | |
| CN101159619B (en) | Fast adding method, device and switching arrangement of ARP table | |
| CN102999571B (en) | The implementation method of unit multinode in a kind of cluster | |
| CN102724460B (en) | A kind of channel switching method and terminal unit | |
| CN101515298A (en) | Inserting method based on tree-shaped data structure node and storing device | |
| US6725216B2 (en) | Partitioning search key thereby distributing table across multiple non-contiguous memory segments, memory banks or memory modules | |
| CN106302172A (en) | Support Hash lookup and the storage of route querying, lookup method and device simultaneously | |
| CN104468361A (en) | Storing and searching method and device for TCAM with priorities | |
| CN103001878A (en) | Determination method and device for media access control (MAC) address Hash collision | |
| CN101277252A (en) | Method for traversing multi-branch Trie tree | |
| US20230384959A1 (en) | Capacity expansion method and system for a storage cluster, and related device | |
| CN106599091A (en) | Storage and indexing method of RDF graph structures stored based on key values | |
| CN106789859B (en) | Message matching method and device | |
| CN112148738A (en) | Hash collision processing method and system | |
| CN103577564A (en) | Method and device for reducing HASH collision through software shift | |
| CN115695014A (en) | Access control list construction and data message processing method, device and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130116 |