40 results about "Cuckoo hashing" patented technology

Addition, search, and performance of other allied activities relating to keys are performed in a hardware hash table. Further, high performance and efficient design may be provided for a hash table applicable to CPU caches and cache coherence directories. Set-associative tables and cuckoo hashing are combined for construction of a directory table of a directory based cache coherence controller. A method may allow configuration of C cuckoo ways, where C is an integer greater than or equal to 2, wherein each cuckoo way Ci is a set-associative table with N sets, where each set has an associativity of A, where A is an integer greater than or equal to 2.

In a network element a decision apparatus has a plurality of multi-way hash tables of single size and double size associative entries. A logic pipeline extracts a search key from each of a sequence of received data items. A hash circuit applies first and second hash functions to the search key to generate first and second indices. A lookup circuit reads associative entries in the hash tables that are indicated respectively by the first and second indices, matches the search key against the associative entries in all the ways. Upon finding a match between the search key and an entry key in an indicated associative entry. A processor uses the value of the indicated associative entry to insert associative entries from a stash of associative entries into the hash tables in accordance with a single size and a double size cuckoo insertion procedure.

An embodiment of the invention discloses a composite index method and a device. The method is implemented by the following steps of obtaining to-be-detected keys and carrying out Hash computation on the to-be-detected keys to obtain combined Hash codes; moving the combined Hash codes a set bit to the right to obtain labels of the to-be-detected keys; carrying out copy and vectorization processing on the labels of the to-be-detected keys with a bit wide of single-instruction multiple-data stream as reference so as to obtain label vectors of the to-be-detected keys; comparing index key vectors with the label vectors of the to-be-detected keys by group through a comparison order of the single-instruction multiple-data stream; and determining whether detection is successful according to the comparison result, and returning tuple objects in index addresses of the to-be-detected keys if detection is successful. A plurality of data items can be compared at each time through parallel detection based on SIMD (Single Instruction Multiple Data), so that the performance cost brought by searching loop is reduced and multiple computations of a Hash function are avoided; the labels of the to-be-detected keys belong to Cuckoo Hashing of partial keys and can be used for reducing the space cost of a Hash table.

This application discloses a data processing method in multi-party privacy seeking, which is applied to a receiver device. The m keywords of the receiver device are mapped to a hash table of size L by using cuckoo hash, including : Receive the L group of calculation data sent by the sending device for m keywords; use the m groups of calculation data in the L group of calculation data to correspond to each keyword in the hash table, and calculate the OPRF result corresponding to this keyword ; For each OPRF result in the m OPPRF results, the sequence number of the keyword corresponding to the OPPRF result is used as a header, and the OPPRF result is merged into a processed result; the obtained m processed results are sorted according to the header, and stored in the result file in order; each processed result is sequentially obtained from the result file, and the OPRF result contained in the processed result is used to perform data fusion with the corresponding local pseudo-random number. Adopting this scheme improves the efficiency of multi-party privacy seeking.

The invention belongs to the technical field of computer data storage and discloses a repeated video detection method and system based on correlation properties in a mass storage system. The method uses position-sensitive hash functions to map repeated videos or similar videos to the same set of an index table, and accordingly the corresponding set can be directly located to perform finding when querying, traversing is not needed, the querying range is greatly shortened, and the querying speed of the repeated video detection method is improved. In the set, a Cuckoo Hashing mechanism is used for performing flat addressing in the whole index table, Hash collision in the set is reasonably solved, the index table maintains the correlation properties on the whole, the querying speed is not influenced, and accordingly the load balance is realized, and the use ratio of the index table is effectively improved.

The invention belongs to the field of information security and provides a confidential statistical data sharing method and system based on set operation. Among them, the confidential statistical data sharing method based on the set operation includes that the communication party of the confidential statistical data sharing uses cuckoo hash to map its input set X to the hash table, and the other communication party of the confidential statistical data sharing uses ordinary hash to input it Each element in the set Y is placed in all possible positions in the hash table; use the shared membership test method to judge whether the elements in the input set of the communication party belong to the input set of the other party in the communication, and obtain the shared calculation result; based on the shared calculation result , calculate statistical information about the set X and Y operations, and use the dazed random function to transmit the corresponding set statistical information between the communication parties sharing the confidential statistical data.

The present invention provides an OpenFlow flow table energy-saving storage architecture that supports QoS and its application. The architecture of the present invention includes three layers: a priority flow / elephant flow layer, a mouse flow layer and an active connection cache layer, and a priority flow / elephant flow layer TCAM and DRAM are used as storage media, the mouse flow layer uses SRAM and DRAM as storage media, the active connection cache layer uses SRAM as storage media, and the Cuckoo hash structure is used to cache the mapping relationship between active connections and flow entries in TCAM. This architecture uses the TCAM to store the identification field of the priority flow table entry first, and realizes the fast flow table lookup of the priority data packet, thus ensuring the network service quality. At the same time, the Cuckoo cache is designed to dynamically store the current active connection in the elephant flow and the corresponding TCAM flow entry index value, so that most data packets hit the cache, and then find the corresponding flow entry according to the address of the hit cache entry, thereby bypassing the The TCAM flow table lookup process greatly reduces the energy consumption of flow table lookup.

The invention relates to a Hash table building method based on cuckoo hash and Bloom filter. The present invention divides the storage space into m groups, each group includes a storage table and n filter tables, each filter table corresponds to a Hash function, and there are m*n different Hash functions; in addition, m*n different Hash functions are selected The Hash function is reserved; define a max_insert value, if the number of operations on a certain input data exceeds the max_insert value, it means that the form filling fails. The table building method provided by the invention effectively improves the space utilization rate and is beneficial to design and development in limited hardware storage space. And there is no limit to the value of m. m can take any value that the designer thinks is appropriate. Compared with many traditional Hash table building methods, it has higher flexibility. Simultaneously, the present invention eliminates the restriction on Hash function selection, and is easier to use.

The invention discloses a Cuckoo hash calculation-based data storage optimization method and system. The method comprises the following steps of: considering each barrel in an index table as a subgraph node, considering each element stored in the table as an edge, and pointing from practical storage positions to candidate positions of the elements so as to form the whole index table into a diagraph comprising a plurality of connected subgraphs; recognizing one or two subgraphs of each element through hash calculation before the element is practically inserted; predicting an insertion result according to states of the subgraphs; and finally executing an insertion operation according to the prediction result or directly storing the prediction result into a temporary space. According to the method and system, mass data is flat hashed to the whole index table by utilizing a Cuckoo hash mechanism, so that the hash conflict of data in sets is reasonably solved, the load is balanced under the condition of ensuring the query efficiency, the utilization rate of the index table is effectively improved and the data insertion result is predicted in advance; and through predicting the result before data storage, the ineffective kicking overhead is avoided and the data storage efficiency is improved.

The invention discloses a QoS-aware OpenFlow flow table hierarchical storage architecture and its application. The architecture of the invention stores high-priority flows in TCAM, which ensures the packet search performance of high-priority flows; adopts Cuckoo hash structure to design accurate flows The cache mechanism stores low-priority and no-priority active precise flows, so that the data packets in these precise flows directly hit the cache, and then quickly find the corresponding SRAM flow table entries, significantly reducing the average flow table lookup time and improving the performance of OpenFlow switches. The method of the present invention provides corresponding flow table search speeds for network flows of different priorities: network packets in high priority flows directly hit the TCAM flow table, and quickly find corresponding flow entries; network packets in low priority flows search and hit The Cuckoo cache directly locates the corresponding SRAM flow entry; most packets in the non-priority flow can directly hit the Cuckoo cache, and a small number of packets need to further use the tuple space search method to search the SRAM flow table, and the overall search efficiency is high.