CN101140592A - Keywords storing and researching method and apparatus - Google Patents
Keywords storing and researching method and apparatus Download PDFInfo
- Publication number
- CN101140592A CN101140592A CNA2007101755441A CN200710175544A CN101140592A CN 101140592 A CN101140592 A CN 101140592A CN A2007101755441 A CNA2007101755441 A CN A2007101755441A CN 200710175544 A CN200710175544 A CN 200710175544A CN 101140592 A CN101140592 A CN 101140592A
- Authority
- CN
- China
- Prior art keywords
- field
- cryptographic hash
- random number
- carried out
- prestores
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9014—Indexing; Data structures therefor; Storage structures hash tables
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a storage and search method for key words and a relevant device, and belongs to the field of communication. The method comprises: Divide a key word into a plurality of fields; take a random number corresponding with the first field; perform shifting operation for constants, and then, perform XOR operation with the shift results and a random number, in order to gain a hash value corresponding with the first field; begin with the second field, take a random number corresponding with the current field; perform shifting operation for the hash value corresponding with a previous field of the current field, and then, perform XOR operation with the shift results and a random number for the current field, so as to gain a hash value corresponding with the current field; store the key word into a storage area at an address with a hash value corresponding with the final field address; and search key words with the method in a corresponding storage region. The device comprises: A division module, the first hash value acquisition module, a multi-stage hash value acquisition module and a storage module. In the invention, distribution of the final hash value is quite approximate to a theoretical random distribution, in order to increase searching accuracy.
Description
Technical field
The present invention relates to the communications field, particularly key word storage, lookup method and equipment.
Background technology
In data communication field, exact-match lookup is the mode that a kind of list item of using always is searched, MAC (Media AccessControl for example, the medium Access Control) table, ARP (Address Resolution Protocol, address resolution protocol) table, multicast table, Netstream table (network flow table) etc. all need exact-match lookup.What exact-match lookup was the most frequently used is that Hash (Hash) is searched algorithm, referring to Fig. 1, network processing unit will be searched KEY (key word) and send to hash algorithm equipment, calculate by well-designed hash function by hash algorithm equipment and to search the pairing cryptographic hash of KEY, this cryptographic hash is the address of a Hash bucket, find corresponding Hash bucket, the list item that from this Hash bucket, takes out all storages with search KEY and compare one by one, find out the list item of coupling fully, lookup result is returned to network processing unit.
Hash operation refers to that but the key word of the limited more possibility of number (as the key word of 72 bit lengths, is just had 2
72Plant possibility) be mapped to less Hash bucket (as 2
18Individual memory address) in.Can accelerate the seek rate of key word like this, and save the space.As seen, Hash is the mapping relations of a kind of " many-one ", and a plurality of different key words can be mapped to same Hash bucket (memory address of key word), i.e. " conflict ".The degree of depth of Hash bucket (or space size of each memory address) has determined the key word number that can deposit in the middle of the Hash bucket.Theoretically, it all is possible that 100 even 1000 different key words are mapped to same Hash bucket, just the problem of probability.But because the restriction of storage space, the degree of depth of Hash bucket is limited, and the key word number that deposits in memory address is limited in other words.
Hash function is the core of Hash lookup algorithm, and its implementation can be divided into following two classes:
The first kind: introduce random factor, make the distribution of cryptographic hash can approach stochastic distribution to greatest extent, such as PKP Hash, BUZ Hash etc.;
Second class: do not introduce random factor, input search KEY be divided into directly be shifted after several sections, mathematical operation such as XOR mutually; For example Shu Ru search key is " ABCD ", and wherein A, B, C and D are the binary sequences of equal length, and this type of Hash operation is as follows so: respectively with A, B, C and D displacement, and A XOR B XOR C XOR D then, the value that obtains at last is exactly a cryptographic hash.With the cryptographic hash visit Hash bucket that obtains, the cryptographic hash that promptly obtains is the address of storage key.
In realizing process of the present invention, the inventor finds:
First kind hash function is applied in the word processing field of computing machine, be to be that unit carries out Hash operation with " characters of 8 bit lengths ", the scope of cryptographic hash can only be 0-255, also just can only visit 256 memory addresss, so can not directly apply to the exact-match lookup of data communication field;
The second class hash function is not owing to introduce random factor, and the distribution of cryptographic hash and theoretic stochastic distribution have gap, needs darker bucket the hash-collision probability can be dropped to 100,000/(being that a conflict can appear in the 100K list item).And darker bucket need take bigger storage space, and when searching the coupling list item, needs the list item of visit (reading) many, causes seek rate slow.
Summary of the invention
In order to make key word be evenly distributed in each memory block, the embodiment of the invention provides a kind of key word storing method and equipment.Described technical scheme is as follows:
A kind of key word storing method, described method comprises:
Key word is divided into a plurality of fields;
From the random factor array that prestores, get the first field random number corresponding;
The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Since second field, from the random factor array that prestores, get current field random number corresponding;
Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
When to the end during the cryptographic hash of field correspondence, store described key word into memory block that the address is the cryptographic hash of described last field correspondence.
The embodiment of the invention also provides a kind of key word memory device, and described equipment comprises:
Cut apart module, be used for key word is divided into a plurality of fields;
The first cryptographic hash acquisition module is used for getting the described first field random number corresponding that module segmentation goes out of cutting apart from the random factor array that prestores; The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Multistage cryptographic hash acquisition module is used for since second field, gets current field random number corresponding from the random factor array that prestores; Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
Memory module is used for obtaining from described multistage cryptographic hash acquisition module the cryptographic hash of last field correspondence, stores described key word into memory block that the address is the cryptographic hash of described last field correspondence.
The beneficial effect of above-mentioned key word storing method and equipment is:
By key word being divided into a plurality of fields, back one field is carried out Hash operation according to the cryptographic hash of the field of front, makes that the distribution of final hash value and theoretic stochastic distribution are very approaching, the hash-collision probability is dropped to theoretic minimum.
In order to improve the accuracy of coupling, the embodiment of the invention provides the keyword search method and apparatus.Described technical scheme is as follows:
A kind of keyword search method, described method comprises:
Receive search request, the key word in the described search request is divided into a plurality of fields;
From the random factor array that prestores, get the first field random number corresponding;
The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Since second field, from the random factor array that prestores, get current field random number corresponding;
Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
When to the end during the cryptographic hash of field correspondence, be that described key word is searched in the memory block of the cryptographic hash of described last field correspondence in the address.
The embodiment of the invention also provides a kind of keyword search equipment, and described equipment comprises:
Cut apart module, be used to receive search request, the key word in the described search request is divided into a plurality of fields;
The first cryptographic hash acquisition module is used for getting the described first field random number corresponding that module segmentation goes out of cutting apart from the random factor array that prestores; The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Multistage cryptographic hash acquisition module is used for since second field, gets current field random number corresponding from the random factor array that prestores; Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
Searching module, be used for when described multistage cryptographic hash acquisition module obtains the cryptographic hash of last field correspondence, is that described key word is searched in the memory block of the cryptographic hash of described last field correspondence in the address.
The beneficial effect of above-mentioned keyword search method and apparatus is:
Technique scheme, by key word being divided into a plurality of fields, back one field is carried out Hash operation according to the cryptographic hash of the field of front, makes the distribution and the theoretic stochastic distribution that finally obtain cryptographic hash very approaching, the accuracy that has improved matched and searched.
Description of drawings
Fig. 1 is the application synoptic diagram of the Hash lookup algorithm that provides in the prior art;
Fig. 2 is the key word storing method process flow diagram that the embodiment of the invention 1 provides;
Fig. 3 is the key word memory device synoptic diagram that the embodiment of the invention 2 provides;
Fig. 4 is the keyword search method flow diagram that the embodiment of the invention 3 provides;
Fig. 5 is the keyword search method synoptic diagram that the embodiment of the invention 3 provides;
Fig. 6 is the keyword search equipment synoptic diagram that the embodiment of the invention 4 provides.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
The Hash operation of the present invention by the multi-stage pipeline formula makes that the distribution of final hash value and theoretic stochastic distribution are very approaching, and then the hash-collision probability dropped to theoretic minimum, improved the accuracy of matched and searched in the data communication field.
Embodiment 1
Referring to Fig. 2, present embodiment provides a kind of key word storing method, may further comprise the steps:
Step 101: key word is divided into a plurality of fields;
Wherein, the length of each field can be 8 bits, when the length of key word is not the integral multiple of 8 bits, and curtailment 8 bits of the last field that can occur being divided, at this moment, and the afterbody zero padding of field in the end, it is supplied is 8 bits.
Step 102: from the random factor array that prestores, get the first field random number corresponding;
This random factor array is a special array, each at random number average a sequence number is arranged.The length of each random number is unfixing in the array, can be 8 bits, can be 16 bits or 24 bits yet, present embodiment is 8 bits, 256 random binary number are arranged in this array, after they are vertically arranged, 128 " 0 " and 128 " 1 " are arranged all on arbitrary vertical bit position.Present embodiment is that 24 bits are example with the length of random number, and this random factor array representation is as follows:
Random number 0 → 1111....1011....0110....
Random number 1 → 0000....0100....1001....
……
Random number 253 → 1000....0110....0101....
Random number 254 → 0101....1100....1110....
Random number 255 → 1010....0011....1011....
Scale-of-two to first field is asked the decimal system, and metric result is the sequence number of above-mentioned random factor array, and which random number what this sequence number was represented the first field correspondence is, according to this sequence number, takes out random number corresponding.
Step 103: the constant that prestores is carried out shift operation, and the result of displacement and the first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Wherein, the constant that prestores can be the arbitrary constant of the equal in length of the random number in length and the above-mentioned random factor array.
Step 104:, from the random factor array that prestores, get current field random number corresponding since second field;
Step 105: the cryptographic hash to the last field correspondence of current field is carried out shift operation, and the result of displacement and current field random number corresponding are carried out XOR, obtain the cryptographic hash of current field correspondence;
Step 106: when to the end during the cryptographic hash of field correspondence, store above-mentioned key word into memory block that the address is the cryptographic hash of last field correspondence, i.e. Dui Ying Hash bucket.
When key word is divided into a plurality of field in the said method, the length of field can suitably be regulated as required, the number of random number in the length decision random factor array of field, it is the size of random factor array, the length of each field is big more, corresponding random factor array is just big more, and needed storage space is just big more.If the length of divided field is more little, then the middle cryptographic hash of required calculating is just many more, and operand is just big more; Therefore the length of present embodiment preferred field is 8 bits, certainly, also can be the field of other length.
By the said method storage key, can guarantee to the maximum limit that key word is evenly distributed in each memory block (Hash bucket), the condition that facilitates for the keyword search in later stage.
Embodiment 2
Referring to Fig. 3, present embodiment provides a kind of key word memory device, comprising:
Cut apart module 201, be used for key word is divided into a plurality of fields;
The first cryptographic hash acquisition module 202 is used for getting from the random factor array that prestores and cuts apart the first field random number corresponding that module 201 is partitioned into; The constant that prestores is carried out shift operation, and the result of displacement and the first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Multistage cryptographic hash acquisition module 203 is used for since second field, gets current field random number corresponding from the random factor array that prestores; Cryptographic hash to the last field correspondence of current field is carried out shift operation, and the result of displacement and current field random number corresponding are carried out XOR, obtain the cryptographic hash of current field correspondence;
Memory module 204 is used for obtaining from multistage cryptographic hash acquisition module 203 cryptographic hash of last field correspondence, stores key word into memory block that the address is the cryptographic hash of last field correspondence.
The module 201 of cutting apart in the present embodiment is divided into field of per 8 bits with key word, and during last field less than 8 bits, the end zero padding is filled.Random factor array that prestores and constant no longer describe in detail here with embodiment 1.
Embodiment 3
Referring to Fig. 4, present embodiment provides a kind of keyword search method, may further comprise the steps:
Step 301: key word is divided into a plurality of fields;
Wherein, the length of each field can be 8 bits, when the length of key word is not the integral multiple of 8 bits, and curtailment 8 bits of the last field that can occur being divided, at this moment, and the afterbody zero padding of field in the end, it is supplied is 8 bits.
Step 302: from the random factor array that prestores, get the first field random number corresponding;
This random factor array no longer describes in detail here with embodiment 1.
Step 303: the constant that prestores is carried out shift operation, and the result of displacement and the first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Wherein, the constant that prestores can be arbitrary constant, the equal in length of the random number in its length and the above-mentioned random factor array.
Step 304:, from the random factor array that prestores, get current field random number corresponding since second field;
Step 305: the cryptographic hash to the last field correspondence of current field is carried out shift operation, and the result of displacement and current field random number corresponding are carried out XOR, obtain the cryptographic hash of current field correspondence;
Step 306: when to the end during the cryptographic hash of field correspondence, be that above-mentioned key word is searched in the memory block (Hash bucket) of the cryptographic hash of last field correspondence in the address.
Referring to Fig. 5, the KEY dispenser receives after the search request, with searching the KEY field that to be divided into L length be 8 bits, gives L level Hash streamline respectively and handles.Processing procedure is as follows:
1) first order Hash streamline receive search KEY the highest 8 bits (first field) afterwards, as index (index range is 0-255), from the random factor array that prestores, fetch a random number with this 8 bit; Then, certain constant that prestores is carried out shift operation, its result carries out XOR with the random number of fetching just now; The result who obtains at last is exactly the middle cryptographic hash of first order Hash streamline output, gives second level Hash streamline with this result and handles.
2) second level Hash streamline at first with second 8 bit searching KEY received as index, from the random factor array that prestores, fetch a random number, this random number may be same with the random number of fetching in the first order Hash streamline, may not be same also; To carry out shift operation from the middle cryptographic hash that first order Hash streamline obtains then, its result carries out XOR with the random number of fetching just now; The result who obtains at last is exactly the middle cryptographic hash of second level Hash streamline output, gives third level Hash streamline with this result and handles.
3) Sheng Xia Hash pipeline processes and second level Hash streamline are similar, and the output valve of afterbody (i.e. L level) Hash streamline is exactly final cryptographic hash.Final cryptographic hash finds corresponding Hash bucket by the mapping of memory interface module.From the Hash bucket, take out all list items, carry out final comparison with the original KEY that searches,, then return matching result if one of them list item coupling (promptly accurate the coupling) is fully with it arranged by the matched and searched module.
Further, when the list item number is N, the number of Hash bucket is M, preferred M 〉=N, and M=2
m, wherein m is the length of random number in the random factor array (binary number).Because the random number in the random factor array that prestores is a regular length, such as being 24 bits, so for realize different list item numbers (N '≤M '=2
m') search, each grade Hash streamline carries out XOR after obtaining the position that needs to move to right (24-m ') after the random number that prestores again.
Present embodiment is by being divided into key word a plurality of fields, and back one field is carried out Hash operation according to the cryptographic hash of the field of front, has improved the accuracy of matched and searched.
Embodiment 4
Referring to Fig. 6, present embodiment provides a kind of keyword search equipment, comprising:
Cut apart module 401, be used to receive search request, the key word in the search request is divided into a plurality of fields;
The first cryptographic hash acquisition module 402 is used for getting from the random factor array that prestores and cuts apart the first field random number corresponding that module 401 is partitioned into; The constant that prestores is carried out shift operation, and the result of displacement and the first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Multistage cryptographic hash acquisition module 403 is used for since second field, gets current field random number corresponding from the random factor array that prestores; Cryptographic hash to the last field correspondence of current field is carried out shift operation, and the result of displacement and current field random number corresponding are carried out XOR, obtain the cryptographic hash of current field correspondence;
Searching module 404, be used for when multistage cryptographic hash acquisition module 403 obtains the cryptographic hash of last field correspondence, is the memory block search key of the cryptographic hash of last field correspondence in the address.
The module 401 of cutting apart in the present embodiment is divided into field of per 8 bits with key word, and during last field less than 8 bits, the end zero padding is filled.Random factor array that prestores and constant no longer describe in detail here with embodiment 1.
The technical scheme that above embodiment provides can realize that corresponding software is stored in the physical mediums such as hard disk, floppy disk or CD of computing machine by software.
Technique scheme, by key word being divided into a plurality of fields, back one field is carried out Hash operation according to the cryptographic hash of the field of front, make that the distribution and the theoretic stochastic distribution of final hash value are very approaching, the hash-collision probability is dropped to theoretic minimum, improved the accuracy of matched and searched in the data communication field;
Simultaneously, the length of each field adopts 8 bits, and the corresponding random factor array length that prestores is 256, and is both economical, because the random factor array is big more, needed storage space is just big more.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. a key word storing method is characterized in that, described method comprises:
Key word is divided into a plurality of fields;
From the random factor array that prestores, get the first field random number corresponding;
The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Since second field, from the random factor array that prestores, get current field random number corresponding;
Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
When to the end during the cryptographic hash of field correspondence, store described key word into memory block that the address is the cryptographic hash of described last field correspondence.
2. key word storing method as claimed in claim 1 is characterized in that, the length of each field is 8 bits in described a plurality of fields.
3. key word storing method as claimed in claim 2 is characterized in that, when last field less than 8 bits, described method also comprises:
By in the afterbody zero padding of described last field described last field being supplied is 8 bits.
4. key word storing method as claimed in claim 1 is characterized in that, the length of the random number in the described random factor array is unfixing, and correspondingly, the length of the described constant that prestores equals the length of the random number in the described random factor array.
5. a key word memory device is characterized in that, described equipment comprises:
Cut apart module, be used for key word is divided into a plurality of fields:
The first cryptographic hash acquisition module is used for getting the described first field random number corresponding that module segmentation goes out of cutting apart from the random factor array that prestores; The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Multistage cryptographic hash acquisition module is used for since second field, gets current field random number corresponding from the random factor array that prestores; Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
Memory module is used for obtaining from described multistage cryptographic hash acquisition module the cryptographic hash of last field correspondence, stores described key word into memory block that the address is the cryptographic hash of described last field correspondence.
6. a keyword search method is characterized in that, described method comprises:
Receive search request, the key word in the described search request is divided into a plurality of fields;
From the random factor array that prestores, get the first field random number corresponding;
The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Since second field, from the random factor array that prestores, get current field random number corresponding;
Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
When to the end during the cryptographic hash of field correspondence, be that described key word is searched in the memory block of the cryptographic hash of described last field correspondence in the address.
7. critical lookup method as claimed in claim 6 is characterized in that, the length of each field is 8 bits in described a plurality of fields.
8. keyword search method as claimed in claim 7 is characterized in that, when last field less than 8 bits, described method also comprises:
By in the afterbody zero padding of described last field described last field being supplied is 8 bits.
9. keyword search method as claimed in claim 6 is characterized in that, the length of the random number in the described random factor array is unfixing, and correspondingly, the length of the described constant that prestores equals the length of the random number in the described random factor array.
10. a keyword search equipment is characterized in that, described equipment comprises:
Cut apart module, be used to receive search request, the key word in the described search request is divided into a plurality of fields;
The first cryptographic hash acquisition module is used for getting the described first field random number corresponding that module segmentation goes out of cutting apart from the random factor array that prestores; The constant that prestores is carried out shift operation, and the result of displacement and the described first field random number corresponding are carried out XOR, obtain the cryptographic hash of the first field correspondence;
Multistage cryptographic hash acquisition module is used for since second field, gets current field random number corresponding from the random factor array that prestores; Cryptographic hash to the last field correspondence of described current field is carried out shift operation, and the result of displacement and described current field random number corresponding are carried out XOR, obtain the cryptographic hash of described current field correspondence;
Searching module, be used for when described multistage cryptographic hash acquisition module obtains the cryptographic hash of last field correspondence, is that described key word is searched in the memory block of the cryptographic hash of described last field correspondence in the address.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101755441A CN101140592A (en) | 2007-09-30 | 2007-09-30 | Keywords storing and researching method and apparatus |
| PCT/CN2008/072552 WO2009046669A1 (en) | 2007-09-30 | 2008-09-26 | Method and device for storing and searching keyword |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101755441A CN101140592A (en) | 2007-09-30 | 2007-09-30 | Keywords storing and researching method and apparatus |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101140592A true CN101140592A (en) | 2008-03-12 |
Family
ID=39192544
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101755441A Pending CN101140592A (en) | 2007-09-30 | 2007-09-30 | Keywords storing and researching method and apparatus |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101140592A (en) |
| WO (1) | WO2009046669A1 (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009046669A1 (en) * | 2007-09-30 | 2009-04-16 | Huawei Technologies Co., Ltd. | Method and device for storing and searching keyword |
| CN101620523B (en) * | 2009-07-29 | 2011-04-13 | 深圳国微技术有限公司 | Random number generator circuit |
| WO2012034470A1 (en) * | 2010-09-13 | 2012-03-22 | 腾讯科技（深圳）有限公司 | Hash algorithm-based method and apparatus for data storage |
| CN101860431B (en) * | 2009-04-10 | 2012-04-25 | 雷凌科技股份有限公司 | Hash key generation method and device |
| CN103001878A (en) * | 2012-11-26 | 2013-03-27 | 中兴通讯股份有限公司 | Determination method and device for media access control (MAC) address Hash collision |
| CN101692651B (en) * | 2009-09-27 | 2014-12-31 | 中兴通讯股份有限公司 | Method and device for Hash lookup table |
| CN107248939A (en) * | 2017-05-26 | 2017-10-13 | 中国人民解放军理工大学 | Network flow high-speed associative method based on hash memories |
| CN107330047A (en) * | 2017-06-28 | 2017-11-07 | 华信塞姆（成都）科技有限公司 | A kind of FPGA training and enquiry circuit implementation method based on perfect hash algorithm |
| CN104104604B (en) * | 2013-04-04 | 2018-10-02 | 马维尔以色列(M.I.S.L.)有限公司 | The method and device of accurate match Hash lookup database in network switch device |
| CN110188242A (en) * | 2019-05-30 | 2019-08-30 | 北京三快在线科技有限公司 | Unmanned equipment localization method, device, unmanned equipment and storage medium |
| CN111198882A (en) * | 2019-12-26 | 2020-05-26 | 东软集团股份有限公司 | Data processing method and device, storage medium and electronic equipment |
| WO2020224091A1 (en) * | 2019-05-06 | 2020-11-12 | 平安科技（深圳）有限公司 | Sequence generation method and apparatus, computer device, and storage medium |
| CN112181974A (en) * | 2019-07-01 | 2021-01-05 | 上海宏路数据技术股份有限公司 | Identification information distribution method, system and storage equipment |
| CN114422389A (en) * | 2022-02-24 | 2022-04-29 | 成都北中网芯科技有限公司 | High-speed real-time network data monitoring method based on Hash and hardware acceleration |
| CN115714644A (en) * | 2022-10-31 | 2023-02-24 | 北京海泰方圆科技股份有限公司 | Random number generation method and device |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109656468B (en) * | 2017-10-11 | 2022-05-27 | 深圳市中兴微电子技术有限公司 | Method and device for realizing data storage |
| CN110532284B (en) * | 2019-09-06 | 2023-05-23 | 深圳前海环融联易信息科技服务有限公司 | Mass data storage and retrieval method and device, computer equipment and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4922417A (en) * | 1986-10-24 | 1990-05-01 | American Telephone And Telegraph Company | Method and apparatus for data hashing using selection from a table of random numbers in combination with folding and bit manipulation of the selected random numbers |
| CN100470550C (en) * | 2007-04-02 | 2009-03-18 | 华为技术有限公司 | Information storing method, information search method and engine device |
| CN101140592A (en) * | 2007-09-30 | 2008-03-12 | 华为技术有限公司 | Keywords storing and researching method and apparatus |
-
2007
- 2007-09-30 CN CNA2007101755441A patent/CN101140592A/en active Pending
-
2008
- 2008-09-26 WO PCT/CN2008/072552 patent/WO2009046669A1/en active Application Filing
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009046669A1 (en) * | 2007-09-30 | 2009-04-16 | Huawei Technologies Co., Ltd. | Method and device for storing and searching keyword |
| CN101860431B (en) * | 2009-04-10 | 2012-04-25 | 雷凌科技股份有限公司 | Hash key generation method and device |
| CN101620523B (en) * | 2009-07-29 | 2011-04-13 | 深圳国微技术有限公司 | Random number generator circuit |
| CN101692651B (en) * | 2009-09-27 | 2014-12-31 | 中兴通讯股份有限公司 | Method and device for Hash lookup table |
| WO2012034470A1 (en) * | 2010-09-13 | 2012-03-22 | 腾讯科技（深圳）有限公司 | Hash algorithm-based method and apparatus for data storage |
| US9104676B2 (en) | 2010-09-13 | 2015-08-11 | Tencent Technology (Shenzhen) Company Limited | Hash algorithm-based data storage method and system |
| CN103001878B (en) * | 2012-11-26 | 2018-02-16 | 中兴通讯股份有限公司 | The determination method and device of MAC Address hash-collision |
| CN103001878A (en) * | 2012-11-26 | 2013-03-27 | 中兴通讯股份有限公司 | Determination method and device for media access control (MAC) address Hash collision |
| CN104104604B (en) * | 2013-04-04 | 2018-10-02 | 马维尔以色列(M.I.S.L.)有限公司 | The method and device of accurate match Hash lookup database in network switch device |
| CN107248939A (en) * | 2017-05-26 | 2017-10-13 | 中国人民解放军理工大学 | Network flow high-speed associative method based on hash memories |
| CN107248939B (en) * | 2017-05-26 | 2020-07-31 | 中国人民解放军理工大学 | Network flow high-speed correlation method based on hash memory |
| CN107330047A (en) * | 2017-06-28 | 2017-11-07 | 华信塞姆（成都）科技有限公司 | A kind of FPGA training and enquiry circuit implementation method based on perfect hash algorithm |
| CN107330047B (en) * | 2017-06-28 | 2020-06-30 | 华信塞姆（成都）科技有限公司 | FPGA training and inquiring circuit implementation method based on perfect Hash algorithm |
| WO2020224091A1 (en) * | 2019-05-06 | 2020-11-12 | 平安科技（深圳）有限公司 | Sequence generation method and apparatus, computer device, and storage medium |
| CN110188242A (en) * | 2019-05-30 | 2019-08-30 | 北京三快在线科技有限公司 | Unmanned equipment localization method, device, unmanned equipment and storage medium |
| CN112181974B (en) * | 2019-07-01 | 2023-06-02 | 上海嗨普智能信息科技股份有限公司 | Identification information distribution method, system and storage device |
| CN112181974A (en) * | 2019-07-01 | 2021-01-05 | 上海宏路数据技术股份有限公司 | Identification information distribution method, system and storage equipment |
| CN111198882A (en) * | 2019-12-26 | 2020-05-26 | 东软集团股份有限公司 | Data processing method and device, storage medium and electronic equipment |
| CN114422389A (en) * | 2022-02-24 | 2022-04-29 | 成都北中网芯科技有限公司 | High-speed real-time network data monitoring method based on Hash and hardware acceleration |
| CN114422389B (en) * | 2022-02-24 | 2023-09-12 | 成都北中网芯科技有限公司 | High-speed real-time network data monitoring method based on hash and hardware acceleration |
| CN115714644A (en) * | 2022-10-31 | 2023-02-24 | 北京海泰方圆科技股份有限公司 | Random number generation method and device |
| CN115714644B (en) * | 2022-10-31 | 2023-08-15 | 北京海泰方圆科技股份有限公司 | Random number generation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2009046669A1 (en) | 2009-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101140592A (en) | Keywords storing and researching method and apparatus | |
| CN106815350B (en) | Dynamic ciphertext multi-keyword fuzzy search method in cloud environment | |
| US9438412B2 (en) | Computer-implemented system and method for multi-party data function computing using discriminative dimensionality-reducing mappings | |
| CN101692651B (en) | Method and device for Hash lookup table | |
| EP2146292B1 (en) | Method and apparatus for extracting information from a database | |
| CN101404032B (en) | Video retrieval method and system based on contents | |
| CN100445999C (en) | Data storaging and searching method | |
| CN101621502A (en) | Method and device for storing and searching routing table | |
| CN108304409B (en) | Carry-based data frequency estimation method of Sketch data structure | |
| CN105488050A (en) | Database multi-index method, apparatus and system | |
| Moataz et al. | Resizable tree-based oblivious RAM | |
| CN106326475A (en) | High-efficiency static hash table implement method and system | |
| CN113254955A (en) | Forward security connection keyword symmetric searchable encryption method, system and application | |
| CN108460030B (en) | Set element judgment method based on improved bloom filter | |
| CN105446897A (en) | High-speed cache Hashing | |
| EP1990745B1 (en) | Data object identifiers | |
| CN104253754A (en) | ACL (access control list) fast matching method and equipment | |
| CN101635001B (en) | Method and apparatus for extracting information from a database | |
| CN112380004B (en) | Memory management method, memory management device, computer readable storage medium and electronic equipment | |
| CN106844529A (en) | Data cached update method, device and system | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route | |
| CN105930104B (en) | Date storage method and device | |
| CN107294855B (en) | A kind of TCP under high-performance calculation network searches optimization method | |
| CN111465929A (en) | Method and system for content-agnostic file indexing | |
| CN111190545B (en) | Method for carrying out LPM rule compression storage on trie structure based on software implementation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |