CN110069496A - A kind of Novel chain type Hash table construction method and device - Google Patents
A kind of Novel chain type Hash table construction method and device Download PDFInfo
- Publication number
- CN110069496A CN110069496A CN201910212550.2A CN201910212550A CN110069496A CN 110069496 A CN110069496 A CN 110069496A CN 201910212550 A CN201910212550 A CN 201910212550A CN 110069496 A CN110069496 A CN 110069496A
- Authority
- CN
- China
- Prior art keywords
- hash
- node
- bucket
- directed toward
- hash bucket
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
Abstract
The present invention relates to a kind of Novel chain type Hash table construction method and devices, by introducing a new head node, back end in the head node and Hash table is constituted into a single-track link table, to can be completed in all nodes of traversal Hash table according to the single-track link table, without traversing Hash bucket and judging whether open chain carrys out traverse node in each Hash bucket.Compared with the existing technology, present invention reduces the time complexity of traversal all nodal operations of Hash table, work efficiency of computer is improved.
Description
Technical field
The present invention relates to data processing fields, more particularly, to a kind of Novel chain type Hash table construction method and device.
Background technique
Hash table also known as hash table are directly to access the data structure in memory storage locations according to key.Such as Fig. 1 institute
Showing, the constructing plan of the prior art is able to satisfy the time complexity of the o (1) of operations such as node insertion, deletion, inquiry substantially, but
It is under the scene of special operation demand is not optimal solution.Such as:
(1) first node of Hash table is obtained；
(2) all nodes of Hash table are traversed；
When realizing that scene (1) obtains the demand of first node of chained list, traversal Hash bucket is generally required, from index 0
Start, judges that bucket indexes corresponding node open chain and whether there is, return to existing first node.Therefore, this operation when
Between complexity be in the worst case o (k), wherein k be Hash bucket bucket length.
Similarly, realize scene (2) traversal all nodes of chained list demand when, also need since bucket index 0 time
It goes through, judges the corresponding node of each barrel of index with the presence or absence of chained list.Therefore the time complexity of the operation of scene 2 is 0 (k+m), k
For the bucket length of Hash bucket, m is the number of nodes in entire Hash table.
The time complexity that the prior art states operation in realization is higher, and computer amount of calculation is big, working efficiency compared with
It is low.
Summary of the invention
The purpose of the present invention is to overcome the shortcomings of the existing technology with it is insufficient, provide it is a kind of can quick obtaining first node, with
And the Novel chain type Hash table construction method and device of all nodes of traversal.
A kind of Novel chain type Hash table construction method, comprising the following steps:
Several Hash buckets are set in Hash table, each Hash bucket is made to respectively correspond a Hash Round Robin data partition；Data are deposited
Storage forms chained list to corresponding Hash bucket and in Hash bucket, is equipped with the index point for being directed toward chained list in the Hash bucket；
A new head node is introduced in the Hash table, the head node is directed toward the on Hash table logical meaning always
One node；
The last one node of chained list in each above-mentioned Hash bucket is directed toward in next Hash bucket in logical order
First node of chained list.
Compared with the existing technology, the present invention is by introducing a new head node, by the number in the head node and Hash table
A single-track link table is constituted according to node, to can be completed in all nodes of traversal Hash table according to the single-track link table, is not necessarily to
It traverses Hash bucket and judges whether open chain carrys out traverse node in each Hash bucket, reduce traversal all nodal operations of Hash table
Time complexity improves work efficiency of computer.
Further, in the next Kazakhstan being directed toward the last one node of chained list in each Hash bucket in logical order
Before the step of wishing first node of chained list in bucket, the index point of each Hash bucket is directed toward upper one in logical order
The last one node of chained list in Hash bucket, realize do not change original Hash table to the insertion of data of bucket index, inquiry,
Quickly traversal Hash table node is carried out in the case where the operation such as deletion.
Further, data are stored to corresponding Hash bucket and includes: the step of forming chained list in Hash bucket
It will be stored in data to be stored in several nodes；
Above-mentioned key assignments is obtained corresponding Hash Round Robin data partition through Hash operation, by the Hash by the key assignments for obtaining the data
Index of the location as Hash bucket；Tail pointer is set in Hash table, and the tail pointer is directed toward the last one logical node of chained list；
The Hash bucket is judged with the presence or absence of open chain, if open chain is not present in the Hash bucket, bucket is indexed to the node for being directed toward tail pointer and being directed toward, together
Shi Xiugai tail pointer is directed toward the node being newly inserted into；If there are open chains for the Hash bucket, new node is inserted by bucket using chain address method
Between the next node that the node and the node that index point is directed toward are directed toward, by the above-mentioned means, convenient fast in the present invention
Speed obtains first node in Hash bucket.
The present invention also provides a kind of Novel chain type Hash table construction device, the Novel chain type Hash table construction device packet
It includes:
Data memory module makes each Hash bucket respectively correspond one for several Hash buckets to be arranged in Hash table
Hash Round Robin data partition；Data storage is stored to corresponding Hash bucket to and formed in Hash bucket chained list, is equipped with and refers in the Hash bucket
To the index point of chained list；
Head node setup module, for introducing a new head node in the Hash table, the head node is directed toward always
First node on Hash table logical meaning；
Node is directed toward module, for the last one node of chained list in each above-mentioned Hash bucket to be directed toward logical order
Next Hash bucket in chained list first node.
Compared with the existing technology, the present invention is directed toward mould by setting data memory module, head node setup module and node
Block introduces a new head node, and the back end in the head node and Hash table is constituted a single-track link table, thus
It can be completed in all nodes of traversal Hash table according to the single-track link table, without traversing Hash bucket and judging in each Hash bucket
Whether open chain carrys out traverse node, reduces the time complexity of computer traversal all nodal operations of Hash table, improves calculating
Machine working efficiency.
Further, the Novel chain type Hash table construction device further includes that index point is directed toward module, the Hash bucket
Index module is used to for the index point of each Hash bucket being directed toward last of chained list in the upper Hash bucket in logical order
A node, realize do not change original Hash table to the operation such as insertion, inquiry, the deletion of data of bucket index in the case where into
Row quickly traverses Hash table node.
Further, the data memory module specifically includes: node storage unit, for will store in data to be stored
In several nodes；
Node is inserted into unit and above-mentioned key assignments is obtained corresponding Hash through Hash operation for obtaining the key assignments of the data
Address, using the Hash Round Robin data partition as the index of Hash bucket；Tail pointer is set in Hash table, and the tail pointer is directed toward chained list
The last one logical node；Judge that the Hash bucket with the presence or absence of open chain, if open chain is not present in the Hash bucket, bucket is indexed and is directed toward tail
The node that pointer is directed toward, while modifying tail pointer and being directed toward the node being newly inserted into；If there are open chains for the Hash bucket, using chain address method
New node is inserted between the next node that the node that barrel index point is directed toward and the node are directed toward, by the above-mentioned means,
First node in convenient quick obtaining Hash bucket in the present invention.
In order to better understand and implement, the invention will now be described in detail with reference to the accompanying drawings.
Detailed description of the invention
Fig. 1 is Hash bucket and storage of linked list structural schematic diagram in existing Hash table；
Fig. 2 is Hash table storage organization schematic diagram in a kind of Novel chain type Hash table construction method in the embodiment of the present invention 1；
Fig. 3 is that there is no the structures that new node is inserted into the case of open chain to show for Hash bucket in S12 step in the embodiment of the present invention 1
It is intended to；
Fig. 4 is that there are the structural representations that new node is inserted into the case of open chain for Hash bucket in S12 step in the embodiment of the present invention 1
Figure；
Fig. 5 is a kind of flow chart of Novel chain type Hash table construction method in the embodiment of the present invention 1；
Fig. 6 is a kind of structural block diagram of Novel chain type Hash table construction device in the embodiment of the present invention 2.
Specific embodiment
Embodiment 1
Fig. 1-5 is please referred to, is the structural representation of one of embodiment of the present invention Novel chain type Hash table construction method
Figure.
A kind of Novel chain type Hash table construction method, comprising the following steps:
S1: being arranged several Hash buckets in Hash table, and each Hash bucket is made to respectively correspond a Hash Round Robin data partition；By data
Chained list is stored to corresponding Hash bucket and is formed in Hash bucket, the index that direction chained list is equipped in the Hash bucket refers to
Needle；
S2: a new head node is introduced in the Hash table, the head node is directed toward always on Hash table logical meaning
First node, i.e., first insertion Hash table node；
S3: the last one node of chained list in each above-mentioned Hash bucket is directed toward next Hash bucket in logical order
First node of middle chained list.Wherein, the node of the chained list includes two parts: data field and pointer field, and data field stores number
According to pointer field is directed toward the address of next storage node.In the present embodiment, the last one node of the Hash table is directed toward one
A sky node.
In computer science, the time complexity of algorithm is a function, when the operation of the algorithm of its qualitative description
Between.Time complexity is lower, then executes that amount of calculation required for algorithm is lower, and the performance of algorithm is more excellent.
In one embodiment, in the case where the last one node of chained list in each Hash bucket to be directed toward in logical order
In one Hash bucket the step of first node of chained list before, will each Hash bucket index point be directed toward logical order on
The last one node of chained list in a upper Hash bucket, the last one node in upper Hash barrel chain table is directed toward again at this time patrols
First node in sequentially next Hash barrel chain table is collected, that is, ensure that each Hash bucket at least chain is connected to a node,
So that computer is being inserted into Hash table, is inquiring and when delete operation, without dropping to judging under Hash bucket whether to be empty barrel
The time complexity of low operation, the calculated performance of optimizing computer.In this case can by program bucket [idx] -> next- >
Next, wherein bucket [idx] is the index point of each Hash bucket, can quickly find the corresponding section of each Hash bucket
Point is realized in the time complexity to operations such as insertion, inquiry, the deletions of data of bucket index for not influencing original Hash table
In the case of quickly traverse Hash table node.In another embodiment, the index point is also directed to the chained list under Hash bucket
First node.
In the present embodiment, the step of data storage being stored to corresponding Hash bucket and forming chained list in Hash bucket tool
Body includes:
S11: it will be stored in data to be stored in several nodes；
S12: obtaining the key assignments of the data, and above-mentioned key assignments is obtained corresponding Hash Round Robin data partition, the Hash through Hash operation
Address is that bucket indexes subscript；Tail pointer is set in Hash table, and the tail pointer is directed toward the last one logical node of chained list；Sentence
The Hash bucket break with the presence or absence of open chain；If open chain is not present in the Hash bucket, bucket is indexed to the node for being directed toward tail pointer and being directed toward, simultaneously
Modification tail pointer is directed toward the node being newly inserted into；If there are open chains for the Hash bucket, new node is inserted by a barrel rope using chain address method
Between the next node that the node and the node for drawing pointer direction are directed toward.
As shown in figure 3, it is the structural schematic diagram that new node process is inserted at the 7 Hash bucket of index there is no open chain,
It is directed toward by the way that bucket index point to be first directed toward to the node of tail pointer tail direction, then by the pointer of the tail pointer tail node being directed toward
New insertion node；The tail pointer tail mode for being directed toward new insertion node is finally completed to the insertion of new node.
As shown in figure 4, its structural schematic diagram for the process of insertion new node at the 7 Hash bucket of index there are open chain；
New node is inserted between the next node that the node that barrel index point is directed toward and the node are directed toward by chain address method.On
The mode of stating ensure that in the present invention always can be by program bucket [idx] -> next- > next with quick obtaining Hash bucket
In first node.In this step, obtain key value mode can using in the prior art obtain key assignments by the way of into
The acquisition of line unit value.Specific hash calculation process is also not specifically limited.
A kind of Novel chain type Hash table construction method of the present invention, for obtain Hash table first node and time
When going through all nodes of Hash table, without judge the node in each Hash bucket whether open chain, reduce traversal all sections of Hash table
The time complexity of point operation, computer have more preferably performance when executing following operation:
(1) return to first node of Hash table: the node that head node direction is directly returned in this case is Hash table
First node, the time complexity of this operation are O (1).
(2) all nodes of Hash table are traversed: due in new design scheme, all Hash table node and head node structure
At a single-track link table, therefore the time complexity of the operation becomes O (m), and wherein m is the number of nodes of Hash table.
Compared with the existing technology, the present invention is by introducing a new head node, by the number in the head node and Hash table
A single-track link table is constituted according to node, to can be completed in all nodes of traversal Hash table according to the single-track link table, is not necessarily to
Traversal Hash bucket simultaneously judges whether open chain carrys out traverse node in each Hash bucket, reduces traversal all nodal operations of Hash table
Time complexity improves work efficiency of computer.
Embodiment 2
As shown in fig. 6, a kind of Novel chain type Hash table construction device, comprising:
Data memory module 1, for several Hash buckets to be arranged in Hash table, each Hash bucket respectively corresponds a Kazakhstan
Uncommon address；Data storage is stored to corresponding Hash bucket to and formed in Hash bucket chained list, is equipped with and is directed toward in the Hash bucket
The index point of chained list；
Head node setup module 2, for introducing a new head node in the Hash table, the head node is directed toward always
First node on Hash table logical meaning；
Node is directed toward module 3, for the last one node of chained list in each above-mentioned Hash bucket to be directed toward logical order
On next Hash bucket in chained list first node, so that all nodes in Hash table is formed a single-track link table.
In one embodiment, the Novel chain type Hash table construction device further includes that index point is directed toward module 4, described
Hash bucket index module 4 is used to for the index point of each Hash bucket to be directed toward chained list in the upper Hash bucket in logical order
The last one node, so that computer is being inserted into Hash table, is inquiring and when delete operation, without to judging under Hash bucket
Whether it is empty barrel, reduces the time complexity of operation, the calculated performance of optimizing computer.For example, program can be passed through in this case
Bucket [idx] -> next- > next, wherein bucket [idx] is the index point of each Hash bucket, can quickly be found
The corresponding node of each Hash bucket is realized in insertion, inquiry, the deletion of data etc. to bucket index for not influencing original Hash table
Hash table node is quickly traversed in the case where the time complexity of operation.In another embodiment, the pointer is directed toward module 3
Index point can also be directed toward to first node of the chained list under Hash bucket.
In the present embodiment, the data memory module 1 specifically includes: node storage unit 11, for will number be stored
It is stored in in several nodes；
Node insertion unit 12 is breathed out above-mentioned key assignments through Hash operation for obtaining the key assignments of the data accordingly
Uncommon address, using the Hash Round Robin data partition as the index of Hash bucket；Tail pointer is set in Hash table, and the tail pointer is directed toward chained list
The last one logical node；Judge that bucket with the presence or absence of open chain, if it is empty, is indexed the section for being directed toward tail pointer and being directed toward by the Hash bucket
Point, while modifying tail pointer and being directed toward the node being newly inserted into；If not empty, new node bucket index is inserted into using chain address method to refer to
Between the next node that the node and the node that needle is directed toward are directed toward, Hash Round Robin data partition conflict is avoided the occurrence of.
Compared with the existing technology, the present invention is directed toward mould by setting data memory module, head node setup module and node
Block introduces a new head node, and the back end in the head node and Hash table is constituted a single-track link table, thus
It can be completed in all nodes of traversal Hash table according to the single-track link table, without traversing Hash bucket and judging in each Hash bucket
Whether open chain carrys out traverse node, reduces the time complexity of computer traversal all nodal operations of Hash table, improves calculating
Machine working efficiency.
The invention is not limited to above embodiment, if not departing from the present invention to various changes or deformation of the invention
Spirit and scope, if these changes and deformation belong within the scope of claim and equivalent technologies of the invention, then this hair
It is bright to be also intended to encompass these changes and deformation.
Claims (6)
1. a kind of Novel chain type Hash table construction method, which comprises the following steps:
Several Hash buckets are set in Hash table, each Hash bucket is made to respectively correspond a Hash Round Robin data partition；By data store to
Corresponding Hash bucket simultaneously forms chained list in Hash bucket, and the index point for being directed toward chained list is equipped in the Hash bucket；
A new head node is introduced in the Hash table, makes first that the head node is directed toward always on Hash table logical meaning
A node；
The last one node of chained list in each above-mentioned Hash bucket is directed toward chained list in next Hash bucket in logical order
First node.
2. Novel chain type Hash table construction method according to claim 1, it is characterised in that: will be in each Hash bucket
The last one node of chained list was directed toward before the step of first node of chained list in next Hash bucket in logical order, will
The index point of each Hash bucket is directed toward the last one node of chained list in the upper Hash bucket in logical order.
3. according to claim 1 or 2 described in any item Novel chain type Hash table construction methods, it is characterised in that: deposit data
Storage stores up to corresponding Hash bucket and includes: the step of forming chained list in Hash bucket
It will be stored in data to be stored in several nodes；
Above-mentioned key assignments is obtained corresponding Hash Round Robin data partition through Hash operation, the Hash Round Robin data partition is made by the key assignments for obtaining the data
For the index of Hash bucket；Tail pointer is set in Hash table, and the tail pointer is directed toward the last one logical node of chained list；Judgement
The Hash bucket whether there is open chain, if open chain is not present in the Hash bucket, bucket is indexed to the node for being directed toward tail pointer and being directed toward, is repaired simultaneously
Change tail pointer and is directed toward the node being newly inserted into；If there are open chains for the Hash bucket, new node is inserted by bucket index using chain address method
Between the next node that the node and the node that pointer is directed toward are directed toward.
4. a kind of Novel chain type Hash table construction device, it is characterised in that: include:
Data memory module makes each Hash bucket respectively correspond a Hash for several Hash buckets to be arranged in Hash table
Address；Data storage is stored to corresponding Hash bucket to and formed in Hash bucket chained list, is equipped in the Hash bucket and is directed toward chain
The index point of table；
Head node setup module, for introducing a new head node in the Hash table, the head node is directed toward Hash always
First node on table logical meaning；
Node is directed toward module, under the last one node of chained list in each above-mentioned Hash bucket is directed toward in logical order
First node of chained list in one Hash bucket.
5. Novel chain type Hash table construction device according to claim 4, it is characterised in that: the Novel chain type Hash table
Construction device further includes that index point is directed toward module, and the Hash bucket index module is for referring to the index point of each Hash bucket
The last one node of chained list in a upper Hash bucket in logical order.
6. according to the described in any item Novel chain type Hash table construction devices of claim 4-5, it is characterised in that: the data are deposited
Storage module specifically includes: node storage unit, for being stored in several nodes in data to be stored；
Node is inserted into unit and above-mentioned key assignments is obtained corresponding Hash Round Robin data partition through Hash operation for obtaining the key assignments of the data,
Using the Hash Round Robin data partition as the index of Hash bucket；Tail pointer is set in Hash table, and the tail pointer is directed toward the last of chained list
One logical node；Judge that the Hash bucket with the presence or absence of open chain, if open chain is not present in the Hash bucket, bucket is indexed and is directed toward tail pointer
The node of direction, while modifying tail pointer and being directed toward the node being newly inserted into；If there are open chains for the Hash bucket, will be new using chain address method
Node is inserted between the next node that the node that barrel index point is directed toward and the node are directed toward.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910212550.2A CN110069496A (en) | 2019-03-20 | 2019-03-20 | A kind of Novel chain type Hash table construction method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910212550.2A CN110069496A (en) | 2019-03-20 | 2019-03-20 | A kind of Novel chain type Hash table construction method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110069496A true CN110069496A (en) | 2019-07-30 |
Family
ID=67366420
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910212550.2A Pending CN110069496A (en) | 2019-03-20 | 2019-03-20 | A kind of Novel chain type Hash table construction method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110069496A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110457535A (en) * | 2019-08-14 | 2019-11-15 | 广州虎牙科技有限公司 | Hash bucket lookup method, Hash table storage, Hash table lookup method and device |
| CN111190930A (en) * | 2019-12-29 | 2020-05-22 | 杭州拓深科技有限公司 | Fire fighting equipment historical data positioning system and positioning method integrating Hash and blocking |
| CN112395213A (en) * | 2020-11-18 | 2021-02-23 | 之江实验室 | Memory hot-spot data oriented ACEH index structure and method |
| CN112685612A (en) * | 2020-12-31 | 2021-04-20 | 武汉思普崚技术有限公司 | Feature code searching and matching method, device and storage medium |
| CN112800057A (en) * | 2021-01-22 | 2021-05-14 | 新华三大数据技术有限公司 | Fingerprint table management method and device |
| CN114064984A (en) * | 2022-01-14 | 2022-02-18 | 浙商银行股份有限公司 | Sparse array linked list-based world state increment updating method and device |
| CN114896177A (en) * | 2022-05-05 | 2022-08-12 | 北京骏德时空科技有限公司 | Data storage management method, apparatus, device, medium and product |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080109395A1 (en) * | 2006-11-03 | 2008-05-08 | Loeb Mitchell L | Method and system for reinserting a chain in a hash table |
| CN102541968A (en) * | 2010-12-31 | 2012-07-04 | 百度在线网络技术（北京）有限公司 | Indexing method |
| CN102682116A (en) * | 2012-05-14 | 2012-09-19 | 中兴通讯股份有限公司 | Method and device for processing table items based on Hash table |
| CN106095850A (en) * | 2016-06-02 | 2016-11-09 | 中国联合网络通信集团有限公司 | A kind of data processing method and equipment |
| CN107766445A (en) * | 2017-09-23 | 2018-03-06 | 湖南胜云光电科技有限公司 | A kind of efficient rapid data search method for supporting various dimensions to retrieve |
-
2019
- 2019-03-20 CN CN201910212550.2A patent/CN110069496A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080109395A1 (en) * | 2006-11-03 | 2008-05-08 | Loeb Mitchell L | Method and system for reinserting a chain in a hash table |
| CN102541968A (en) * | 2010-12-31 | 2012-07-04 | 百度在线网络技术（北京）有限公司 | Indexing method |
| CN102682116A (en) * | 2012-05-14 | 2012-09-19 | 中兴通讯股份有限公司 | Method and device for processing table items based on Hash table |
| CN106095850A (en) * | 2016-06-02 | 2016-11-09 | 中国联合网络通信集团有限公司 | A kind of data processing method and equipment |
| CN107766445A (en) * | 2017-09-23 | 2018-03-06 | 湖南胜云光电科技有限公司 | A kind of efficient rapid data search method for supporting various dimensions to retrieve |
Non-Patent Citations (2)
| Title |
|---|
| CODERLEE0607: "HashMap的实现原理及hash冲突解决方法", 《HTTPS://BLOG.CSDN.NET/PTSX0607/ARTICLE/DETAILS/68945883》 * |
| 书呆子RICO: "Map综述（二）：彻头彻尾理解LinkedHashMap", 《HTTPS://BLOG.CSDN.NET/JUSTLOVEYOU_/ARTICLE/DETAILS/71713781》 * |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110457535A (en) * | 2019-08-14 | 2019-11-15 | 广州虎牙科技有限公司 | Hash bucket lookup method, Hash table storage, Hash table lookup method and device |
| CN111190930A (en) * | 2019-12-29 | 2020-05-22 | 杭州拓深科技有限公司 | Fire fighting equipment historical data positioning system and positioning method integrating Hash and blocking |
| CN111190930B (en) * | 2019-12-29 | 2023-11-28 | 杭州拓深科技有限公司 | Fire-fighting equipment historical data positioning system and positioning method integrating hash and block |
| CN112395213A (en) * | 2020-11-18 | 2021-02-23 | 之江实验室 | Memory hot-spot data oriented ACEH index structure and method |
| CN112395213B (en) * | 2020-11-18 | 2023-05-30 | 之江实验室 | ACEH index structure and method based on memory hot spot data |
| CN112685612A (en) * | 2020-12-31 | 2021-04-20 | 武汉思普崚技术有限公司 | Feature code searching and matching method, device and storage medium |
| CN112800057A (en) * | 2021-01-22 | 2021-05-14 | 新华三大数据技术有限公司 | Fingerprint table management method and device |
| CN112800057B (en) * | 2021-01-22 | 2023-06-09 | 新华三大数据技术有限公司 | Fingerprint table management method and device |
| CN114064984A (en) * | 2022-01-14 | 2022-02-18 | 浙商银行股份有限公司 | Sparse array linked list-based world state increment updating method and device |
| CN114896177A (en) * | 2022-05-05 | 2022-08-12 | 北京骏德时空科技有限公司 | Data storage management method, apparatus, device, medium and product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110069496A (en) | A kind of Novel chain type Hash table construction method and device | |
| CN105320775B (en) | The access method and device of data | |
| CN101447940B (en) | Method and device for updating access control list rules | |
| CN104462549B (en) | A kind of data processing method and device | |
| CN111754349B (en) | Method and device for grouping transactions in blockchain | |
| CN105095425B (en) | A kind of inter-library method and device of carrying down of database | |
| CN105224532B (en) | Data processing method and device | |
| CN107545021A (en) | A kind of date storage method and device | |
| CN110808883B (en) | Searching method of optical fiber communication transmission path | |
| CN106713273B (en) | A kind of protocol keyword recognition methods based on dictionary tree pruning search | |
| CN111309976B (en) | GraphX data caching method for convergence graph application | |
| CN104915717A (en) | Data processing method, knowledge base reasoning method and related device | |
| CN104424222B (en) | Database index method and device | |
| CN105184385A (en) | Distributed control method of automatic manufacturing system | |
| CN108509505A (en) | A kind of character string retrieving method and device based on subregion even numbers group Trie | |
| CN111324577A (en) | Method and device for reading and writing Yml file | |
| CN106095850A (en) | A kind of data processing method and equipment | |
| CN107632789A (en) | Method, system and Data duplication detection method are deleted based on distributed storage again | |
| CN102420771A (en) | Method for increasing concurrent transmission control protocol (TCP) connection speed in high-speed network environment | |
| CN101277252A (en) | Method for traversing multi-branch Trie tree | |
| CN113535732A (en) | Credibility-behavior association double-block chain oriented verifiable query optimization method | |
| CN105930178A (en) | Configurable parameter dynamic loading method and system | |
| CN105025013B (en) | The method for building up of dynamic IP Matching Model based on priority Trie trees | |
| CN109254962A (en) | A kind of optimiged index method and device based on T- tree | |
| CN102725754B (en) | Method and device for processing index data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190730 |