41 results about "N-Hash" patented technology

The invention discloses an apparatus and a method for hash table item storage, searching, which aim to solve the problem of hardness in balancing between time needed for table searching and table capacity in hash table storage structure in the prior art. According to the invention a large hash table storage space is divided into a plurality of hash sub-table storage spaces, each of which corresponds to N hash functions. When an item is stored, a hash value is computed using hash function corresponding to each hash sub-table sequentially, an empty position is found in the hash sub-table for storage of the item; when an item is searched, a search among all hash sub-tables is executed for enhancing speed of searching. The invention effectively solves the problem of hardness in balancing between time needed for table searching and table capacity in hash table storage structure in the prior art, implements storage of all items using ultimately low searching time and ultimately high table utilization without residual items.

A method and apparatus are provided for simply and securely limiting a number of times that contents can be accessed using a hash chain. The apparatus limiting a number of times contents are accessed by a user terminal includes a hash chain generator receiving information indicating selected contents by the user terminal and information indicating how many times (n) the user terminal has authority to access the selected contents and generating a hash chain including n hash values derived from a seed value, and a contents access manager deleting the hash values one by one from the hash chain whenever the user terminal accesses the selected contents such that the number of times the contents can be accessed by the user terminal is decreased by the number of deleted hash values.

Described embodiments provide a hash processor for a system having multiple processing modules and a shared memory. The hash processor includes a descriptor table with N entries, each entry corresponding to a hash table of the hash processor. A direct mapped table in the shared memory includes at least one memory block including N hash buckets. The direct mapped table includes a predetermined number of hash buckets for each hash table. Each hash bucket includes one or more hash key and value pairs, and a link value. Memory blocks in the shared memory include dynamic hash buckets available for allocation to a hash table. A dynamic hash bucket is allocated to a hash table when the hash buckets in the direct mapped table are filled beyond a threshold. The link value in the hash bucket is set to the address of the dynamic hash bucket allocated to the hash table.

A blockchain mining method, device, and a node apparatus are used to solve the technical problem of unequal distribution of mining opportunities for node apparatuses in a blockchain network. The method comprises: acquiring a current block number of the blockchain; judging whether a hash slot corresponding to the block number is consistent with a hash slot corresponding to the node apparatus, wherein the node apparatuses in the blockchain network are distributed in N hash slots by means of a hash algorithm, and N is a positive integer greater than or equal to 2; and determining whether the node apparatus performs mining this time according to a judgment result.

The present invention provides a fast forwarding method and a corresponding device. The method includes: calculating a Hash value according to the session characteristics of the message, and determining the corresponding Hash bucket in the index table according to the Hash value; wherein the index table includes N Hash buckets ; Wherein each index entry holds a forwarding pointer pointing to a forwarding entry in the forwarding table; traverse the Hash bucket, and perform fast forwarding when the forwarding entry corresponding to the session feature is found, but the corresponding one is not found during the traversal process Submit the upper-layer forwarding module for processing when forwarding the table item; save the processing result information of the upper-layer forwarding module in the forwarding table item, calculate the Hash value according to the session characteristics and determine the corresponding Hash bucket, and save the forwarding pointer pointing to the forwarding table item in In the hash bucket. The invention adopts a new table item structure and a query design method, can calmly deal with the problem of Hash conflicts, and provides an expansion mechanism to deal with severe Hash conflicts.

The present invention provides a PE traffic scheduling method and device, which are applied to PE equipment in a VCF system. The method includes the following steps: creating Trunk a and Trunk b for the first switching chip, wherein Trunk a includes N Hash positions, and the N Hash positions are assigned to the ports of G1 and G2 respectively; Trunk b includes N Hash positions, and the N Hash positions are respectively assigned to the ports of G2; Identified as b; perform the same processing on the second switch chip; send the local forwarding entry of the PE uplink traffic to the first switch chip and the second switch chip, wherein the egress of the local forwarding entry is the uplink port of the switch chip ; Correspondingly reallocate at least one Hash position in the corresponding Trunk according to the change of the uplink state of the uplink port. Compared with the prior art, the present invention can more evenly share the uplink traffic to the uplinks of the two switching chips.

The invention discloses an apparatus and a method for hash table item storage, searching, which aim to solve the problem of hardness in balancing between time needed for table searching and table capacity in hash table storage structure in the prior art. According to the invention a large hash table storage space is divided into a plurality of hash sub-table storage spaces, each of which corresponds to N hash functions. When an item is stored, a hash value is computed using hash function corresponding to each hash sub-table sequentially, an empty position is found in the hash sub-table for storage of the item; when an item is searched, a search among all hash sub-tables is executed for enhancing speed of searching. The invention effectively solves the problem of hardness in balancing between time needed for table searching and table capacity in hash table storage structure in the prior art, implements storage of all items using ultimately low searching time and ultimately high table utilization without residual items.

The invention provides a message filtering method and device in a Bluetooth wireless grid network, and the method comprises the steps: receiving a first message through Bluetooth wireless grid connection by Bluetooth intelligent equipment, inputting the first message into N hash functions of different types for operation, obtaining N hash values corresponding to the N hash functions, and then comparing the N hash values with values of N elements of a stored hash array to judge whether the first message is a repeated message, if the first message is judged to be a repeated message, filtering the first message, and otherwise, processing the first message. According to the method, the memory and processing resource consumption of the equipment can be reduced in a resource limited scene, and the message processing efficiency is improved.

The invention relates to a method for realizing data fusion and data privacy protection based on a Hash algorithm and the session control. The method comprises the following steps that a demand module sends a query request after Hash calculation to a mapping data providing module; the mapping data providing module inquires whether the data exists or not; a demand module queries the provider data from the portrait data providing module; a portrait data providing module inquires the previous n hash value lists; the mapping data providing module returns the hit information to the portrait data providing module; and the portrait data providing module queries the data. By the adoption of the method for realizing data fusion and data privacy protection based on the Hash algorithm and the session control, the leakage of the high-sensitivity information caused by query of low-sensitivity information is avoided, and the data derogatory caused by the data diffusion is also avoided. According to the implementation scheme, the user privacy information of three parties cannot be leaked except the user portrait information, so that the data privacy and the data security of the individual users and the enterprise users are guaranteed.

The invention relates to a data block construction and comparison method and device, a medium and equipment. The method comprises the steps of determining N sub-data blocks according to a comparison task, and filling the data blocks with the N sub-data blocks; generating N hash fingerprints in one-to-one correspondence with the contents of the N sub-data blocks; and adding the N hash fingerprints into the data blocks. When data block similarity comparison is carried out, hash fingerprints or hash fingerprint lists in a plurality of to-be-compared data blocks are directly extracted, and similarity coefficients of the plurality of data blocks are determined based on the hash fingerprints or hash fingerprint lists, so that the process of segmenting big data and calculating the hash fingerprints is avoided, the calculation time is saved, and the efficiency is improved.

The invention discloses a block chain-based digital signature time stamp generation method, which mainly includes three stages: a system parameter establishment stage, a signature stage, and a verification stage. Among them, in the signing phase, the signer obtains the hash values ​​of the n latest confirmed blocks in the blockchain, and binds these n hash values ​​with the message M to be signed as M', and for M 'Sign to get the signature T, the signer calculates the hash value h of M'||T, and uploads h to the blockchain through the transaction Tx. After the verifier completes the verification of the signature T, the time range after the generation time of the block where the nth hash value is located and before the generation time of the block where the transaction Tx is located is taken as the timestamp of the signature T, which is a decentralized An accurate method for timestamping digital signatures.

The invention discloses a data storage method for mass unstructured data. The method comprises the steps that firstly, a time interval T is set, a data storage cluster is divided into a plurality of zones, records obtained at the same time interval T are stored in the same zone, and meanwhile each zone is divided into n hash zones; secondly, for each unstructured record, the generated time t of the unstructured record and one or more key information key solely expressing the unstructured record are extracted; thirdly, according to the time t of each record, the zone where the records are stored is determined, and the corresponding hash zone values of the records in the zones are calculated according to the key information of the record; fourthly, the records which are in the same time interval and are the same in hash zone value are written in the same file F according to the calculation result in the step three, the number of the records in the file F is counted, and if the number of the records is larger than the set threshold value K, another file is established in a current hash zone for storage. According to the storage method, the data retrieval efficiency can be greatly improved.

The invention provides a method and equipment for creating a hash table. The method comprises following steps: determining subspace of at least two hash sub-tables according to space of the nth hash sub-table in N hash sub-tables of the hash table, wherein the size of the nth hash sub-table is non-positive integral power of 2 and sizes of subspace of at least two hash sub-tables are positive integral power of 2; mapping the current key value to one of sub-space of at least two hash sub-tables based on the nth pre-processed hash function used for mapping multiple key values to at least two sub-space of at least two hash sub-tables; generating an address of a hash bucket for the nth hash sub-table according to a hash function corresponding to one of subspace of the at least two hash sub-tables and the current key value; and storing the current key value into a hash sub-table of N hash sub-tables according to the number of free wafers corresponding to addresses of hash buckets for the N hash sub-tables generated by the N hash sub-tables. The method and equipment for creating the hash table have the capacities of reducing waste of space and decreasing cost of realization.