101 results about "Hash list" patented technology

The invention discloses an implementation method for multi-field rule matching, and relates to the technical field of high-speed stream classification. The implementation method comprises the steps that firstly, a rule list is established for each tuple according to quintuple definition of IP message data streams, then a Hash rapid stream list is established, and all information matched with rules is added in the rule lists; secondly, IP message data stream matching is conducted, corresponding actions are executed if matched data streams are found, otherwise the rule lists are searched, and mask matching inquiries are conducted. According to the implementation method, the mode that a prefix extension Trie tree high in inquiring speed is improved, part of memory space is sacrificed, and data compression and the Hash list are combined is adopted, and thus under the premise that the inquiring speed is ensured, memory explosion caused by a large-capacity rule base can be avoided.

The invention discloses an SSD-based (Solid State Disk) cache management method and system. The SSD-based cache management method comprises the following steps: step 1, sending a read-write request, checking whether a cached DRAM (Dynamic Random Access Memory) hits data, searching a hash list, judging whether the data is existent, reading the data from the cached DRAM and returning the request if the data is existent, and reading data to the cached DRAM from a HDD (Hard Disk Drive) and carrying out step 2 if the data is nonexistent in the cached DRAM; step 2, carrying out data screening by using a two-level LRU (least recently used) linked list and a Ghost buffer, and identifying data heat; and step 3, carrying out self-adaptive change calculation on the length of the two-level LRU linked list, acquiring the granularity of a page cluster when the second-level LRU linked list of the cached DRAM is full, taking C pages behind the second-level LRU end as a whole body to replace the cached DRAM, and writing the C pages into an SSD in a large granularity, wherein the page cluster size is C pages, and C is an integral multiple of Block page number in the SSD.

A data storage system has disk drives, memory circuit boards to store a set of hash lists and a cache, and a front-end interface. The front-end interface is configured to receive a data element request including a disk address identifying a set of disk drive locations that stores the data element; perform a hash function on the disk address in order to generate a hash pointer; and provide a search command, the disk address and the generated hash pointer to the memory circuit boards. The memory circuit boards are configured to receive the search command, the disk address, and the hash pointer from the front-end interface; search the set of hash lists based on the hash pointer and the disk address; and provide an indication to the front-end interface indicating whether the set of hash lists includes an entry indicating that the data element resides in cache.

The invention provides a random number generation method, an anti-cheating block chain system, a device and a storage medium. The method comprises the following steps of receiving or generating a first random number and a first hash value of the first random number; receiving purchase information of purchasing one vote sent by the first user, freezing a plurality of rights and interests of the first user, and sending the first hash value to the first block chain, so that each node of the first block chain writes the first hash value into the first hash list through consensus, wherein the votesare mining vouchers of the first block chain and are used for mining after a preset first duration is passed; and judging whether the vote is mined successfully or not according to a first numericalvalue calculated by a pre-configured first formula and a system difficulty value after the first duration: if yes, sending a first random number and corresponding block information to each node of thefirst block chain for verification. According to the invention, the completely random number which cannot be controlled by a user is obtained, and the mode of generating the random number is optimized.

Security policy databases capable of being fast retrieved while securing sequentiality. An IPSec processing device of the present invention performs communications by encrypting IP packets exchanged between a first IP network and a second IP network. The IPSec processing device includes a security policy database that stores security policies. The security policy database includes first, second, and third security policy databases. The first and third security policy databases include a linear list structure, and the second security policy database includes a hash list structure. The IPSec processing device, when performing at least one of transmission and reception of the IP packet, retrieves a security policy in the order of the first, second, and third security policy databases.

The invention relates to a locality-sensitive-hashing-based high-dimensional indexing method for large-scale multimedia data. The method includes the following steps of extracting high-dimensional features of the multimedia data at the offline indexing stage; establishing an internal storage index, storing the multimedia high-dimensional features in a feature storage area, calculating the locality sensitive hashing vectors of the high-dimensional features, and storing feature numbers and the locality sensitive hashing vectors corresponding to the features in a hashing list storage area, wherein the internal storage index comprises the feature storage area and the hashing list storage area; establishing a first-stage disk index, wherein the first-stage disk index comprises a feature storage area, an index storage area and a plurality of hashing list storage areas; establishing a second-stage disk index, wherein the second-stage disk index comprises a hashing barrel storage area; repeatedly executing the steps mentioned above till all multimedia input is indexed. At the online query stage, features of the multimedia data used for queries are extracted, the queries are conducted on the basis of the established indexes, and similar query results are returned. By means of the method, the scheduling performance of internal storage and disks is improved, and the indexing speed and the retrieving speed of the multimedia data are increased.

This invention provides one method and device to solve Hash collision in network communication field, wherein the method comprises the following steps: processing Hash computation on memory data information; finding relative list items according to computation results; then storing the information computation results into list and setting index list in Hash list. This invention provides one device to solve Hash collision composed of Hash computation module, judgment module, address requirement module and information memory module and index set module.

This invention puts forward a method for accessing gate by large scale media including: A starting the gate linked with a control server in a network state test technology to enable the server to identify all gates capable of providing services timely to get current load of the gates and generate a 'usable gate list', B When a user logs on to system by the control server, if will automatically select gate with the least load at its 'acc gate' from the list and informs the gate to serve the user, C. the gate system sets up a 'connector' objects, all objects are registered in a Hash list with deliver addresses as the key, D The gate system finds out the 'connector' according to the information of each deliverer information for transferring message.

A security system and service, which improves the performance of SECaaS services, is described. A security server system tracks the content that has successfully passed through its security modules and distributes this information to the end user client devices as hashlist information. The remote client devices can then safely bypass the cloud for a significant fraction of Web object requests by using information on a locally stored hashlist to validate Web objects.

The invention discloses a method for quickly mapping by batch symbolization. The method based on a super map symbol library comprises the following steps of: (1) importing topographic map SHP data which are obtained by field measurement, and adding the data to a map; (2) configuring the symbol library; (3) setting an extensive makeup language (XML) configuration file to obtain a ground object-symbol configuration relationship; (4) storing the ground object-symbol configuration relationship into a hash list; (5) obtaining a data layer of the map, and according to ground class attributes of ground objects and the ground object-symbol configuration relationship, calling symbols from the symbol library to perform symbolization; and (6) checking whether the ground object without the symbol exists in the data layer, if so, reconfiguring the symbol library, if the required symbol is absent, adding the symbol into the library and resetting the XML file. The invention discloses the method for mapping by the batch symbolization; and due to the adoption of the method, the graphic drawing and editing speed of topographic maps are increased, the graphic quality is improved, and the batch calling and the quick and accurate drawing of topographic map symbols are realized.

For the massive data of physical memory on the computer system, data indexing can be created base on the two-dimensional hash indexing algorithm, using specific mapping relationship conversion between the index keyword and index sequence address under hash algorithm, which realize the fast addressing while introducing two-dimensional hash list to solve the ‘confliction’ problem of mapping relations in hash queue, which caused by the same keyword index or hash algorithm.

The invention relates to a method and a device for filtering monitoring data. The method comprises the following steps: receiving monitoring data of a monitored server; searching the initial position of a monitoring policy list corresponding to the monitored server from a monitoring policy manager according to the information of the monitored server, wherein the monitoring policy manger comprises a hash list, each unit in the hash list comprises a hash value which is calculated according to the information of each server and a link of a monitoring policy list initial position corresponding to a server with the hash value, and each monitoring policy list initial position has a link of each monitoring policy related to a corresponding server; acquiring a monitoring policy related to the monitored server according to the searched monitoring policy list initial position corresponding to the monitored server, and filtering the received monitoring data according to the monitoring policy. Therefore, the technical problem that a monitoring policy in the prior art cannot be searched and updated quickly can be solved.

The invention discloses an incremental data cleaning method based on memory mapping. Data of a data source to be cleaned are loaded into a memory, and a memory MDB (meta database)-tree is built by the aid of a HASH list; quick data inquiry is completed by the aid of a top-down strategy, and operations of data insertion, deletion and the like are completed on the basis; views in the memory mapping are standardized into AUSPJ (aggregation, union, selection, projection and join) sections and D (differential) sections, and incremental maintenance of nodes is realized by the aid of relational algebraic operation; and finally data cleaning operation is realized by the aid of a result collection merging algorithmic method. The incremental data cleaning method can be widely applied to industries and fields with high data quantities and data quality requirements, such as education, telecommunication, governments and the like.

The invention discloses a metadata verification method and system, a server and a computer readable storage medium. The method comprises the following steps: a server receives metadata of a file uploaded by a user side; wherein the metadata comprises a traceable node hash list in a Merkel tree constructed by a plurality of data blocks of the file; Then, the server calculates a root hash value of the Merkel tree according to the traceable node hash list, finally, the server judges whether the root hash value is the same as the hash value of the file, and if yes, it is determined that metadata verification is passed, and metadata is stored. Compared with the prior art, the method and the device have the advantage that the metadata writing safety is improved.

The invention provides a difference data generation method and a difference data generation device for an electronic navigation map. The method comprises the following steps: traversing all records of a standard-version map, utilizing a Hash algorithm to generate a permanent ID for each record, and storing the generated permanent ID and the corresponding record in a first Hash list; traversing all records of an updated-version map, utilizing the Hash algorithm to generate a permanent ID for each record, and storing the generated permanent ID and the corresponding record in a second Hash list; and comparing the first Hash list and the second Hash list to generate a difference data file including records needing to be deleted and records to be added. According to the difference data generation method and the difference data generation device, the difference data of the electronic navigation map can be extracted without adding the permanent IDs for the records during data production.

This invention relates to a data process method and provides a method for looking up Hash list including: a, picking up data key words to Hash an address of bit p, b, reading out different addresses of 2n list items in the Hash drum at the address place in the address pointer list, c, reading the key word list based on the addresses to judge if it hits the target. Advantages: providing more and deeper Hash drums so as to greatly increase the usability of Hash table and supporting parallel or serial lookup.

The invention relates to a method and a system for correlating flow and user information in a GRPS network. The method comprises the following steps of: firstly, receiving a data packet of a control type and analyzing the data packet; secondly, adding one or more of the analyzed tunnel number, state, mobile phone internet protocol (IP) address and user information into nodes of a state HASH list;thirdly, adding the mobile phone IP address and user information of the nodes in the state HASH list into the node of a user HASH list; fourthly, receiving a data packet of a data type and unpacking the data packet to obtain the mobile phone IP address of a user to which the data packet belongs; and finally, searching for the user HASH list by using the mobile phone IP address as a keyword to obtain the information of the user to which the data packet belongs so as to correlate the flow and the user information. The method and the system can be applied to the system which is required to acquire the correlation of the network flow and the user.

The embodiment of the invention provides a consensus method and device and a block chain system. A master node directly broadcasts a transaction hash list comprising a hash value of at least one unverified transaction in the system, so that the slave node and the master node synchronously verify the at least one unverified transaction, and the slave node stores a first verification result obtained by verification and a first hash value of the at least one unverified transaction. And the master node carries an obtained second verification result and a second hash value of at least one unverified transaction in a preparation message after verification is completed, and broadcasts the preparation message, so that the slave node searches the first verification result based on the second hash value, and broadcasts the preparation message when the second verification result is the same as the searched first verification result, to enter a subsequent consensus stage to complete consensus processing. Thus, the master node and the slave node can synchronously verify the transaction needing to be linked in the consensus of this round, the consensus process is accelerated, and the consensus efficiency is improved.