269 results about "Hash table" patented technology

The invention discloses an android container rendering optimization method based on cross-domain hard real-time Fen synchronization, which comprises the following steps: by taking a swan-mong system as a host and an android system as a container, creating a hash table, a synchronous thread and a shared memory corresponding to a GPU core when the host is started, acquiring VSync cycle registration callback, transmitting shared memory FD to the container, and finishing shared memory mapping and alignment by the container. Registering a GPU queue to complete callback; when the Android application is started, a container obtains a queue and a physical address of a rendering buffer area, creates a Fen and binds the Fen to the queue, after the queue is submitted, metadata is written into a shared memory to inform a host, after the host receives the metadata, nodes are created and stored in a hash table, and an overtime timer is registered; after the GPU completes the command queue, the container calls back an update state and a verification value to notify the host, and after the host is verified to be valid, the corresponding hash table is updated, the timer is reset, and asynchronous screen loading is triggered; and the host executes buffer area synthesis and submission of the display equipment to finish on-screen, so that the stability of the rendering frame rate is improved, and the reliability of cross-domain synchronization is ensured.

Provided in the present invention are a method and system for real-time update of a medical knowledge base, and a medium and a device. The method comprises: acquiring medical literature data in real time; analyzing the medical literature data, so as to obtain first structured data; performing correlation analysis on the first structured data and second structured data in a medical knowledge base, so as to obtain an analysis result; on the basis of the analysis result, determining whether to update the medical knowledge base; identifying the differences of the medical knowledge base before and after the update, so as to obtain a difference identification result; assigning a unique version number to each difference in the difference identification result, so as to obtain version update records; and on the basis of the version update records, using incremental hash table technology to perform data storage for each difference. The present application has a higher update efficiency without the risk of omission; and by means of difference analysis and by using incremental hash table technology to store difference data, the present application significantly reduces data storage space requirements, and also improves data access speed.

The invention relates to the technical field of storage control, in particular to a memory control method, a storage device, a medium and computer equipment, a three-level index structure is arranged, only a first-level root table resides in a cache, an index is rapidly extracted through bit operation so as to reduce cache occupation and invalid IO overhead, the search range is narrowed through a hash bucket of a three-level page table, and the search efficiency is improved. Conflicts are solved through a linked list, and the mapping efficiency and the system stability can be improved through a fixed structure; and the second-level block table and the third-level page table are loaded in a non-blocking manner without occupying a CPU, so that the bandwidth is saved, and the concurrency performance and the cache hit rate are improved. Through the overall scheme of three-level index, chained hash table, loading on demand and bit operation, the delay of the whole process from logic address input to physical address output is remarkably reduced, and the low delay requirement of a high-performance storage system is met; the three-level index structure supports flexible adjustment of the sizes of a root table, a block table and a page table, adapts to storage devices with different capacities, and has good expandability.

The invention discloses a TBR implementation method of a desktop GPU for mobile 3D application optimization, which comprises the following steps: defining block metadata of screen blocks in a Mesa driver, establishing a block manager, when a mobile application context is detected, acquiring GPU core parameters by the block manager, calculating the size of a basic block, dividing a screen into areas corresponding to shader arrays in number, and storing the areas in a memory; establishing a mapping table of a basic block, a computing unit and an L2 cache slice, generating a resource hash table, analyzing block metadata and the mapping table after whole frame rendering is started, determining a hardware channel according to the mapping table, scheduling rendering tasks according to priorities, and configuring a GPU rendering state. Then executing a vertex shader, rasterization, a fragment shader, depth testing and color mixing to complete block rendering, updating block metadata, merging intermediate data into a final frame buffer according to geometric information after rendering of all basic blocks is completed, and submitting the final frame buffer to a window system to complete single-frame display. And the operation efficiency of the mobile operation system and the mobile terminal 3D application on the desktop platform is optimized.

The application relates to a point cloud three-dimensional target detection method and system based on a local attention Mamba model, which comprises the following steps: obtaining a key point cloud subset from a point cloud; inputting the key point cloud subset into a local attention Mamba model composed of N hierarchical stacks, and sequentially performing the following steps on each level: for each point, obtaining a neighborhood point set through a hash table index, generating local attention weights based on element-by-element multiplication interaction, and weighting and aggregating neighborhood features to obtain local geometric features; then modeling global long-range dependencies of the local geometric features by using a bidirectional Mamba module, and outputting global features as the input of the next layer; and inputting the global features output by the last level into a bird's eye view backbone network to obtain a three-dimensional target detection result. The application forms a progressive feature learning mechanism of local perception and global enhancement, and significantly improves the expression ability and reasoning efficiency of a point cloud backbone network.

The invention discloses a cloud rendering method and device based on a shared cache, equipment and a medium. Receiving a target scene identifier and a target scene view angle pose sent by the target terminal; loading a target scene model file according to the target scene identifier, and converting the target scene model file into a data structure object; loading a target radiance hash table corresponding to the target scene identifier from a public storage server; based on the target scene view angle pose and the target detection light, determining a patch intersection point set having a collision intersection point with patch data in the data structure object; and based on the target radiance hash table, determining a target radiance corresponding to each patch intersection point in the patch intersection point set, calculating a pixel color value of the corresponding patch intersection point in the patch intersection point set according to each target radiance, obtaining a target scene view angle image, and sending the target scene view angle image to a target terminal for display. Therefore, the data calculation amount of cloud rendering is reduced, and the cloud rendering efficiency in a multi-user scene is improved.

The application provides a software configuration management method and device and related equipment. Configuration keys of configuration items in a software configuration system are split into a path segment array according to a separator contained in the configuration keys. A hierarchical index structure based on path segmentation of the path segment array is constructed. Different path segments in the array correspond to nodes at different levels in the hierarchical index structure. Configuration values corresponding to the configuration keys are stored in node structures of leaf nodes corresponding to the path segment array. The leaf nodes corresponding to the path segment array are nodes corresponding to the last path segment in the path segment array. The hierarchical index structure is introduced as a storage structure of effective software configuration. The hierarchical configuration keys are mapped to paths in the hierarchical index structure, so that the complexity of single-key query is only related to the key length, the complexity of prefix query is related to the number of matching results, and the performance bottleneck of traditional hash table query traversal is completely eliminated.

The application discloses a privacy set intersection method based on homomorphic encryption and an optimized filter, a readable medium and an electronic device; wherein the method comprises: in the initialization stage: the sender side and the receiver side jointly negotiate a hash function and generate a semi-homomorphic encryption key pair, and simultaneously create a filter system and a hash function group; in the data interaction stage: based on the hash function and the filter system, data filtering of a private set of the sender and a private set of the receiver is realized, a set Y' is generated at the receiver side, and a set X' is generated at the sender side; in the hash replacement sorting stage, a comparable hash table is generated based on the sets Y' and X', and a replacement data set is generated at the receiver side; in the set segmentation and polynomial generation stage: the problem is converted into a mathematical polynomial solution; in the polynomial calculation and intersection solution stage, the intersection is calculated through homomorphic encryption security. Through the method, the intersection of two private sets can be efficiently and securely calculated.

The application is specifically a DPI shunt device rule management system and method, the system comprising: a service configuration table, wherein each service configuration item has a unique service ID; a rule configuration table, wherein each rule configuration item has a unique rule ID; a rule hash table, which quickly retrieves the rule ID by hashing the rule matching content; a policy control server, which issues service configurations to the DPI shunt device through a remote procedure call (RPC) interface, and the DPI shunt device splits the service configurations into one or more rule configurations according to a splitting algorithm; and a Redis database, which is used to persistently store the contents of the service configuration table, the rule configuration table and the rule hash table. The application has the advantages that: the table items of each management module are designed to be loosely coupled, allowing them to be independently developed and debugged; and the dual-ID management mode has good scalability and can be compatible with traditional single-ID rule management systems.

The invention discloses a time series data analysis method and device, a storage medium and electronic equipment, and relates to the technical field of the Internet of Things. By establishing a composite index structure combining a time index and an equipment index, under the composite index structure, corresponding index entries are dynamically created for a target data flow, the framework of the composite index structure is not changed, and the time series data analysis efficiency is improved. The content is dynamically filled along with the data, and finally a complete composite index result capable of being efficiently retrieved is formed. And the time index adopts a B-Tree structure, so that data in a specific time range can be quickly positioned. Equipment indexing is realized based on a hash table, data generated by specific equipment can be efficiently retrieved, the throughput bottleneck of mass data storage is broken through, and second-level writing and aggregation query of ten millions of data are realized. And in combination with artificial intelligence AI, distributed time series data management and an Internet of Things multi-source data fusion technology, in the face of massive time series data, the analysis processing capability of the time series data is improved to meet the demand of time series data analysis.

The application relates to a method and device for message forwarding, which are applied to the field of sending messages by using DSCP technology. The method comprises the following steps: a router receives a first message from a terminal device; a hash table is managed according to the message type of the first message; in the case that n quintuple information is added in the hash table, it is determined whether a data stream corresponding to the kth quintuple information enters hard acceleration; in the case that the data stream corresponding to the kth quintuple information has entered hard acceleration, a hard acceleration table entry corresponding to the kth quintuple information is cleared; a DSCP marking process is performed on a detected downlink message, and the downlink message at least comprises a data message corresponding to the kth quintuple information. Therefore, for the kth quintuple information whose data stream has entered hard acceleration, the data stream corresponding to the kth quintuple information can be reloaded on a protocol stack by clearing the hard acceleration table entry of the kth quintuple information, so that the problem that the data stream which has entered hard acceleration cannot be marked by DSCP is solved.

The invention provides a binary program vulnerability mining method, device and system based on symbolic execution and taint analysis and a medium, and the method comprises the steps: disassembling a target program, extracting a control flow graph (CFG) and a data flow graph (DFG), recording a node state through a hash table, and generating a feature representation through nonlinear transformation; performing simulation execution based on CFG, DFG and feature representation, recording variable symbol values to obtain path conditions, and recursively solving constraints to generate path mapping; marking input as taint data, recursively calculating a propagation path to generate a taint flow diagram, and determining a taint state after sensitive operation; checking whether the stains are subjected to sensitive operation or not, and if the influence of integral formula calculation exceeds a threshold value, judging that potential vulnerabilities generate a candidate set; and calculating grades through a risk assessment formula, and generating a report containing positions, types, grades and repair suggestions. The method combines symbolic execution and taint analysis, can comprehensively and accurately detect vulnerabilities, has remarkable precision and efficiency advantages, and is suitable for complex program security analysis.

The application discloses a kind of high concurrency time series data processing method and device for anti-UAV system.The application uses lock-free hash table to cache time series data in cache space, lock-free cache design and CAS atomic operation reduce lock overhead, batch write throughput is high, conflict probability is low, support multi-thread high concurrency read-write, completely eliminate thread competition and blocking caused by traditional cache mechanism, improve concurrent processing capability;At the same time, batch write reduces the overhead of dynamic memory allocation, improves memory utilization;Through composite key fast positioning, hot data index structure priority query and lock-free reading mechanism, the query delay of hot data is extremely low, data preloading mechanism further reduces the delay of future related query, improves real-time response capability;Based on the dynamic elimination mechanism of elimination score, hot data / recent data can be preferentially retained, ensure resource utilization, significantly improve cache hit rate, greatly reduce access frequency to TSDB.

The invention provides an IP list matching method, system and device, belongs to the technical field of data processing, and aims at improving the IP list matching efficiency. Converting all entries in the IP list into an IP range section defined by a starting IP address and an ending IP address, and constructing a hash table by taking the IP range section as a key for storage; identifying subnet masks used in the conversion process to form a subnet mask set; and when an access request of a user IP is received, performing matching query on the user IP based on the hash table and the subnet mask set to determine whether the user IP is in the IP list.

The present application belongs to the field of substation communication configuration, and particularly relates to a kind of SCL file comparison method and system.The present application establishes the node model corresponding to each node in SCL file, avoids traversing when comparing, saves traversal time, and when establishing node model, only the attribute information and the subnode information needed for node comparison are modeled, so the comparison of these nodes and attributes can be saved;when comparing nodes or their subnodes, the node content is first texturized, only the text content is compared to see if it is the same, and the text comparison method is optimized, which can quickly determine whether the node content is different, and if not, the comparison of the specific content of the node can be directly saved;and when comparing multiple node subnodes, the unique key attribute is matched, and the key attributes of each subnode in the two files are stored as a linked list and a hash table respectively, ensuring the order and retrieval speed of the results of multiple node subnodes.

The invention relates to a multi-stage gene data accurate matching method and system, and the method comprises the steps: selecting K continuous basic groups from a to-be-processed read sequence as retrieval character strings according to a preset initial length K, and determining a matching interval of the retrieval character strings in a reference genome from a hash table constructed according to the length K in advance through a Kmer-Index algorithm; in the matching interval, carrying out base-by-base expansion and matching on the retrieval character string based on a pre-constructed FM index through an FM-Index algorithm until the number of matching positions of the retrieval character string and a reference genome is reduced to a preset matching frequency threshold value; and for each retrieval character string obtained after base-by-base expansion and matching, expanding according to a single base comparison mode until mismatching occurs, and taking the retrieval character string with the maximum number of matched bases as a finally determined seed sequence. According to the gene data accurate matching scheme, the seed search performance and the memory use efficiency can be improved, and the accurate matching position of the seed can be quickly searched under the condition of limited hardware resources.

The invention discloses a structural circuit integrated manufacturing-oriented H-AMF multi-material model digital expression method, a storage medium and equipment, and the method comprises the steps: constructing a file header based on an XML architecture, defining a metadata region and a resource region of a structural circuit integrated model in the file header, and building a material library definition in the resource region; a compact ASCII data block is constructed in the XML architecture to serve as a unified geometric object area, and is used for storing vertexes and triangular patches of the structural circuit integrated model; introducing a vertex deduplication algorithm based on a hash table, and performing deduplication on vertexes of the unified geometric object area to obtain an index database; when the triangular patches are generated, reading a file header based on the XML architecture, obtaining material IDs corresponding to the triangular patches, and binding each triangular patch in the index database with the corresponding material ID; and writing the metadata area, the resource area and the index database of the structural circuit integrated model and the index database bound with the material ID into a disk, generating an H-AMF file, and realizing digital expression of the structural circuit integrated model.

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for processing encrypted and hashed versions of raw data. One of the methods includes receiving, by a system, a message that comprises an encrypted version of raw data and a hash of the raw data; determining, using the hash of the raw data, a first location in a hash map; inserting the encrypted version of the raw data to the first location in the hash map; determining to transmit, to another system, data for a second location in the hash map; selecting, using the second location, at least a subset of the data for the second location in the hash map; and transmitting, to the other system, the subset of the data for the second location in the hash map.

The method comprises: in a running process of a desktop environment, receiving a first starting instruction for starting a target application; in response to the first starting instruction, obtaining a first hash table and target package name information of the target application; wherein a key of the first hash table is package name information of any application installed in a head-mounted display device and a terminal device, and a hash value corresponding to the key is used to represent an installed device of the any application; obtaining a target hash value corresponding to the target package name information according to the first hash table and the target package name information; and determining to start the target application in the head-mounted display device or the terminal device according to the target hash value.

The invention provides a positioning method based on a laser speedometer system and the laser speedometer system. The positioning method comprises the following steps: generating a hash table of a current frame image and a hash table of a current voxel map; determining voxels of the current voxel map matched with the voxels of the current frame image according to the voxel information of each voxel of the current frame image and the voxel information of each voxel of the current voxel map; determining the voxel type of the voxel of the current frame image according to the voxel information of the voxel of the current frame image, screening out a target voxel from the voxels of the current frame image, and determining the residual error of the target voxel according to the voxel type of the target voxel and the voxel of the matched current voxel map; and updating the coordinates of the feature points in the voxel of the current voxel map matched with the target voxel by using the residual error of the target voxel, and returning to execute the generation of the hash table of the current frame image and the hash table of the current voxel map so as to improve the positioning efficiency, response speed, accuracy, supported incremental updating and real-time processing suitable for a dynamic environment.

The disclosure reduces a memory footprint of a hash table that employs chaining as a collision avoidance solution. The methods and systems disclosed herein enable the use of chaining collision handling while reducing a memory footprint by storing parts of a tag and a link list pointer associated with a linked list that contain useful information, without storing parts of the tag and pointer that do not contain useful information. The linked list pointer and a hash key are packed together without reducing either size, and without using additional memory overhead.

The invention discloses a global mobile robot point cloud storage and updating method. A laser radar collects scene point cloud data; the camera collects a scene picture; the global mobile robot executes the following steps of: identifying, segmenting and extracting a scene picture by adopting a scene image segmentation model to obtain scene features; based on the pixel coordinates of the scene features in the scene picture and the relative coordinates of the laser radar and the camera, the scene features are mapped to scene point cloud data, and scene point cloud is obtained; points of the scene point cloud are stored in grids corresponding to the hash table, and corresponding semantic tags are identified according to scene feature types of the scene point cloud; updating the grids in the hash table according to a preset frequency and semantic tags; according to the technical scheme, the semantic label of the laser point cloud data is set, meanwhile, on the basis of point cloud updating, on the premise that the real-time performance and integrity of scene information are guaranteed, irrelevant scene point clouds and points of the scene point clouds are removed, and the computing power and efficiency requirements for multi-point cloud data processing are lowered.

This invention discloses an intelligent dynamic integration method and system for mobile office applications, addressing issues such as fragmented mobile office applications, inefficient information integration, and low recommendation matching accuracy. The method includes collecting user attributes and application usage data; establishing a user attribute mapping layer with a hash table structure and assigning initial weights to applications; constructing a neural network recommendation model with a multilayer perceptron structure; obtaining real-time application weights after supervised learning training and inputting updated data; sorting and grouping applications according to their weights; and then accurately pushing applications to users through the mapping layer. The system includes corresponding acquisition, mapping, modeling, classification, and push units, and also provides electronic devices and storage media for implementing the method. This invention achieves personalized and accurate matching between applications and user needs, improves the real-time performance and stability of recommendations, adapts to dynamic changes in enterprise organizational structure and user needs, and significantly improves mobile office efficiency.

The invention discloses a storage optimization method and system for crowdsourcing query of knowledge maps in the field of traditional Chinese medicine. The storage optimization method comprises the steps that traditional Chinese medicine RDF triple data is stored in an adjacency list form; according to different modes of known predicate unknown subjects / objects and known subject-called / called-object combinations in crowdsourcing query, an uncertain edge index based on a hash table and a certain edge index based on a B + tree are correspondingly constructed, and index entries point to an inverted linked list of a storage entity ID sequence; dynamic maintenance of an adjacency list and an index during data increment updating is supported; and for unknown nodes in the query graph, retrieving each edge candidate entity ID set by using a mixed index, and based on a preset crowdsourcing cost, calculating and returning the first K candidate nodes with the minimum comprehensive cost by using a Top-K matching algorithm based on a maximum heap. According to the method, the problems of low storage efficiency, index mismatching and poor updating expansibility of the traditional Chinese medicine knowledge graph in a crowdsourcing query scene are effectively solved, and efficient storage, quick query and low-cost crowdsourcing are realized.

The disclosure reduces a memory footprint of a hash table that employs chaining as a collision avoidance solution. The methods and systems disclosed herein enable the use of chaining collision handling while reducing a memory footprint by storing parts of a tag and a link list pointer associated with a linked list that contain useful information, without storing parts of the tag and pointer that do not contain useful information. The linked list pointer and a hash key are packed together without reducing either size, and without using additional memory overhead.

The application discloses a kind of real-time database monitoring methods based on ordered queue, including according to system design throughput and machine configuration, set initial parameter respectively set working thread and distribution thread number and memory capacity alarm threshold, according to the number of working thread adjustment shunt storage queue number ensure that thread queue number match, management node starts, start receiving heartbeat request, and according to preset hash algorithm is shunted storage, new received heartbeat request is stored in ordered double linked list queue head, then according to host IP information to hash table inquires whether heartbeat record exists, if the new received heartbeat record does not exist, for new online client, client information is stored to hash table then triggers new online event and persists to client database table write-in process ends.The application solves the problem that a large amount of data heartbeat information detection detection complexity rises exponentially with data volume rising by hash and double linked list structure.

Aspects of the present disclosure relate to weak references of allocated logical clusters. In examples, a deduplication hash table stores associations between block hashes and block addresses, such that a block can be identified and used in place of another block storing the same data. A weak reference may be generated on a block, such that an intact weak reference indicates that the block is unchanged. When a block is identified that has a hash matching that of an existing block in the hash table, it may be determined whether a weak reference on the existing block is intact. If there is not an intact weak reference on the existing block, the existing block may have changed, such that it is not used for deduplication. By contrast, if the weak reference is intact, the existing block has not changed, such that it may be used for deduplication accordingly.

The application provides a method for optimizing virtual NVMe read-write performance through an LRU algorithm and a virtual NVMe system, and the method comprises the following steps: constructing a cache management architecture in cooperation with a hash table and a double-linked list, quickly positioning a cache node corresponding to an internal address of an SSD through the hash table, and managing the access order of the SSD address through the double-linked list; when the NVMe performs an SSD read-write operation, the LRU algorithm is first called, and if there is no address in the hash table to execute the read-write file; a linked list order adjustment thread is created when the LRU algorithm is initialized, the node data of the longest non-accessed node exceeding the length of the linked list is flushed to the SSD mirror file, and then the node is deleted; when the read-write data is greater than the size of the linked list node data, the hash mapping is refreshed. The application combines the LRU algorithm, maps the commonly used internal address of the SSD and the corresponding data block, directly operates the memory to read and write the commonly used data, optimizes the read-write mode of the existing virtual simulation NVMe, and further improves the performance of the virtual simulation NVMe in the virtual hardware system.

Provided in the embodiments of the present disclosure are a hash join processing method, system and device, and a storage medium and a program product. The method comprises: scanning a plurality of rows of data in a first data table within a target scanning range corresponding to a target worker thread, and on the basis of a first hash join mode, writing the plurality of rows of data into a first hash table in a memory; if it is determined that an available memory capacity corresponding to a hash join task is lower than a set threshold, sending the scanned plurality of rows of data to a data partitioning management thread, and switching to use a second hash join mode; and receiving first target row data distributed by the data partitioning management thread, and on the basis of the second hash join mode, writing the first target row data into a second hash table corresponding to the target worker thread in the memory, so as to perform persistence processing of the data in the second hash table. The present disclosure can flexibly switch between different hash join modes on the basis of the memory occupancy of a data table for hash table creation.

The application provides a method for DNA sequencing by pigeon hash growth tree splicing and a computer readable medium. The application acquires a reads library, determines the length of a pigeon hash table to construct the pigeon hash table, and numbers the reads in the reads library; the head of each read and the tail of each read are obtained through row division fragment processing; each read of the reads library is stored in the pigeon hash table through iterative replacement storage; splicing growth is determined in combination with the pigeon hash table, information of the reads in the splicing growth process is stored in a dynamic pigeon hash table in combination with the position of the successfully matched read head, and DNA sequencing is realized through iterative execution of growth of the growth tree. The application expands when the size of the hash table is insufficient, thereby saving space resources. The application is suitable for DNA splicing sequencing engineering.