Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

34results about How to "Improve lookup performance" patented technology

Method and system for positioning interference source based on single stationary orbit satellite

The embodiment of the invention provides a method and system for positioning an interference source based on a single stationary orbit satellite. The system comprises a signal collecting device, a reference source signal emission device, a signal processing device and an interference source positioning device, wherein the signal collecting device is used for collecting an interference signal of the stationary orbit satellite, the reference source signal emission device is used for sending a reference source signal to the stationary orbit satellite, and receiving a reference source return signal sent by the stationary orbit satellite according to the reference source signal, the signal processing device is used for conducting error removal on actual Doppler frequency shift of the interference signal and the reference source return signal, and the interference source positioning device is used for determining the position of the interference source according to the interference signal and the reference source return signal. Accurate positioning on the interference source of the satellite can be achieved through the only one stationary orbit satellite, the finding capability of the satellite on the interference is greatly improved, and a plurality of restraint conditions of interference finding are reduced.
Owner:国家无线电监测中心

Operation method of hash table

The invention relates to a method for operating a Hash table, in particular to a method for operating the hash table under a master-slave mode parallel polynuclear processor system. The invention aims at providing a method for operating the Hash table, which can efficiently carry out operations such as establishment, inserting and the like to the Hash table and enables the operations of the Hash table not to affect the Hash table search performance. The method comprises the following steps: carrying out table establishment and memory allocation operations in Hash table management on a main nucleus, and carrying out the search, inserting, deletion and updating operations of the Hash table on each nucleus which establishes the Hash table, wherein the operations can be finished in one thread or task, the table establishment operation comprises: operating on the main nucleus, and establishing a sheet of Hash table for each nucleus which needs establishing the table, and the memory allocation comprises: allocating demanded internal memory for nodes which are corresponding to each Hash table total table entry number by the main nucleus and linking the internal memory nodes through a linked list. The method is suitable for the master-slave mode parallel polynuclear processor system.
Owner:MAIPU COMM TECH CO LTD

Index structure based on dictionary tree, data query optimization method and main memory manager

The invention discloses an index structure based on a dictionary tree, a data query optimization method and a main memory manager, and belongs to the field of data storage. The index structure is composed of containers, wherein the containers store T nodes and S nodes; complete keys are divided into partial keys; the T nodes store the front m / 2 bits of the partial keys, and the S nodes store the rear m / 2 bits of the partial keys; and the partial keys passing through a certain node path from the root node of the dictionary tree are connected to form the complete keys. And the index structure ismore compact, so that the main memory space utilization rate is improved. The T node is directly skipped to a subsequent brother node by using a skipping relay, so that the comparison frequency is reduced, and the search performance is improved; a T node skip list is used for skipping a T node to an S node, a container skip list is used for skipping the S node to the T node, and the S node directly skips to the nearest target, so that a large number of unnecessary entries are skipped, and the searching performance is improved; and the index structure and the main memory address are completelydecoupled by a pointer P which is analyzed by the main memory manager and contains each hierarchical structure ID.
Owner:HUAZHONG UNIV OF SCI & TECH

Buffering method and buffering device

An embodiment of the invention provides a buffering method and a buffering device. The buffering method comprises the steps of determining whether a buffering tree comprises characteristic information of anticipated accessing data of a client; if not, acquiring the anticipated accessing data from a data source for buffering; interpolating the characteristic information of the acquired anticipated accessing data into a root node of the buffering tree; detecting whether a data volume sum which corresponds with all characteristic information in the root node after interpolation of the characteristic information of the anticipated accessing data exceeds a threshold; and if yes, transferring the corresponding piece of characteristic information to a lower-grade node from the root node according to a sequence of eliminating the earlier data accessing time to the later data accessing time in a one-by-one manner until the data volume summation which corresponds the all residual characteristic information in the root node is in a threshold range. According to the method and the device, the relatively hot data can be located at the positions which can be easily found out through a technical solution above, thereby improving data searching performance and improving accessing efficiency.
Owner:LETV HLDG BEIJING CO LTD +1

Room choosing method and device

The embodiment of the invention provides a room choosing method and device. The method comprises the steps that a server divides a map into lattices, and the coordinate of the center point of each lattice is calculated and stored; the server calculates and stores the time spent from the coordinate of each prestored house to the coordinate of each center point in different trip ways; the server receives query information; according to the position coordinate of the query point, the lattice where the position coordinate of the query point is located is figured out, and the coordinate of the center point of the lattice is queried; the server queries the target house with the time spent from the coordinate of the center point to the coordinate of each prestored house within the time range, and the target house is returned. By means of the method, query performance is improved, use time is saved, and user experience is improved.
Owner:成都正合地产顾问股份有限公司

GraphDB-based space-time knowledge graph construction method and device, medium and equipment

ActiveCN112732939AAddress deficiencies in reasoning skillsSolve the problem of severe island phenomenonKnowledge representationGeographical information databasesTime informationEngineering
The invention relates to a GraphDB-based space-time knowledge graph construction method and device, a medium and equipment. The method comprises the following steps: fusing an OGC standard to construct an architecture of a geographic entity; extracting data related to the geographic entity in the spatio-temporal data to generate an individual knowledge set of the target object; and storing the individual knowledge set into a GraphDB database to form a space-time knowledge graph. Accurate ground object information contained in multi-temporal and large-range remote sensing images is organized and fused, space-time information is described comprehensively and meticulously, and inference rules are introduced to overcome the defects of OWL in inference ability, so that the knowledge graph has stronger inference ability.
Owner:AEROSPACE INFORMATION RES INST CAS

Rule matching method and device, electronic equipment and storage medium

The invention discloses a rule matching method and device, electronic equipment and a storage medium, and relates to the technical field of rule engines. According to the specific implementation scheme, the method comprises the steps of obtaining an identity identification code from service data; performing layer-by-layer search in a pre-stored balanced search tree based on the identity identification code, the balanced search tree being generated according to a specified identity identification code and being used for searching a service rule corresponding to the specified identity identification code; and determining the service rule corresponding to the searched identity identification code as the service rule corresponding to the service data. The embodiment of the invention can improve the timeliness of rule search and improve the system operation efficiency.
Owner:BEIJING BAIDU NETCOM SCI & TECH CO LTD

Compiled data for software applications

Various embodiments of the present invention provide systems and methods of converting data used for shipment rate calculations into executable code. More specifically, certain embodiments if the present invention provide systems and methods of converting data used for shipment calculations into executable code by scanning the data from at least one source file, parsing the data in accordance with a template, and generating the executable code by utilizing the parsed data. As a result, the code may be executed to provide the data used for shipment rate calculations without having to access the original source file. In addition, compiling such data into executable code may improve look-up performance, may provide encapsulation of logic related to the specific nature of the data, and may provide a mechanism by which the raw data is not overtly exposed to end users of the software and third-parties.
Owner:UNITED PARCEL SERVICE OF AMERICAN INC

One-touch navigation method

The invention discloses a navigation method with one-button operation, which comprises the following steps: dividing the service range of the navigation center into several areas, and establishing a central database; the navigation terminal obtains GPS information and base station information, and uploads them to the navigation center; the navigation center judges If the GPS information is valid, the location of the vehicle is located; if it is invalid, the location of the vehicle is estimated according to the base station information; the central database is searched according to the location of the vehicle, and the customer service number of the center in the user's area is obtained, and sent to the navigation terminal; the navigation terminal dials the customer service number of the center, The agent finds out the relevant destination information for the user and confirms it; after the call ends, the navigation terminal connects to the navigation center through the mobile network and requests to download the destination list information. This kind of navigation method can ensure that the navigation center can locate the vehicle to the greatest extent and meet the needs of users as much as possible; and can effectively improve the communication effect between the user and the seat personnel, and improve the search efficiency.
Owner:XIAMEN YAXON NETWORKS CO LTD

A method and system for the temporary storage and treatment of charging bill

The invention provides a method and a system which temporarily store and process charging tickets and comprises the following steps that the first step is that whether key fields of parts of the charging tickets exist in a memory is judged after receiving the part of the charging tickets from a charging gateway, and the second step is that if no key fields exist, a position of an available disk file is obtained from the memory and the part of the charging tickets is stored in the available disk file which is corresponding to the position of the available disk file, otherwise, the existing charging tickets and the part of the charging tickets which are corresponding to the key fields are combined to generate a new charging ticket. Therefore, by adopting the method and system of the invention, main key data is stored in the memory, ordinary data is stored in the disk, the search of the part of the charging tickets can be realized in the memory, so the property of searching performance ration databases is greatly improved, thus reducing the cost of the system and also improving the property of the system.
Owner:ZTE CORP

Method and device for adding, searching for and deleting key in hash table

The present invention discloses a method and device for adding, searching for and deleting a key in a hash table, wherein, the method for adding a key in a hash table includes: calculating both the bucket address corresponding to the key to be added and the address extension of the key to be added in each hash sub-table according to a hash function; generating the fingerprints of the key to be added corresponding to each hash sub-table, wherein the fingerprint of the key to be added corresponding to one hash sub-table includes: the address extension of the key to be added in the hash sub-table, and the bucket address corresponding to the key to be added and the address extension of the key to be added in other hash sub-tables; and when determining that there is no conflict, storing the fingerprint of the key to be added corresponding to the selected hash sub-table into the selected hash sub-table. The solution of the present invention enables that the fingerprint of each key can only match one fingerprint in one hash sub-table, thus when searching for a key, at most once is required to visit an original key table, thereby improving the search performance, and simplifying the search process.
Owner:HUAWEI TECH CO LTD

Method and system for determining failure features in black feature library

The embodiment of the invention provides a method and system for determining failure features in a black feature library. Features in the black feature library can be compared with sample files, when the features in the black feature library hit the sample files according with the abnormal deformation rule as source sample files of the features, it is determined that the features hit error sample files, and the features belong to failure features. The failure features are determined through the abnormal deformation rule, the used sample files can be randomly selected, and thus the failure features do not need to be searched for through a common software library any more, the failure feature search effect is improved, and safety of equipment is protected.
Owner:ZHUHAI BAOQU TECH CO LTD

Construction method of underwater blocking net

The invention discloses a construction method of an underwater blocking net, and relates to the technical field of underwater salvage equipment. The construction method of the underwater blocking net comprises the following steps that S1, the two ends of the bottom of the blocking net are connected with anchor chains; S2, the blocking net and the two anchor chains are put into water through a workboat; and S3, bases are arranged at the two ends of a river bank. According to the construction method of the underwater blocking net, stormy waves drive water flow to impact an inclined plate, so that the inclined plate is stressed to deflect, meanwhile, the inclined plate drives an elastic plate to extrude each other during deflection, the elastic plate can drive the inclined plate to continuously vibrate, and an elastic film is pulled through a second pull rope while the inclined plate deflects or vibrates, so that a device can be prevented from being damaged due to excessive deflection of the inclined plate, it can also be guaranteed that the inclined plate deflects to pull the elastic film, the elastic film and the water waves are continuously slapped to make a sound, and the buoy finding and seeking effect is good during underwater rescue.
Owner:高晨

UWB data packet processing method and system, electronic equipment and storage medium thereof

The invention relates to the technical field of the Internet, in particular to a UWB data packet processing method and system, electronic equipment and a storage medium thereof. The UWB data packet processing method comprises the following steps: initializing a lock-free stack; creating a semaphore; registering a real-time signal callback module with the highest priority and a low-priority processing thread; receiving a UWB data packet; controlling the real-time signal callback module to read the UWB data packet into a memory buffer area, pushing address information of the UWB data packet into the lock-free stack in sequence, and controlling the real-time signal callback module to release the semaphore; when the address information of the UWB data packet is pushed into the lock-free stack, controlling the processing thread to receive the semaphore, pushing the address information of the UWB data packet out of the lock-free stack according to a backward-in first-out principle, and taking out the corresponding UWB data packet according to the address information of the UWB received data packet; and processing the UWB data packet. According to the invention, the purposes of quickly processing data packets and reducing the packet loss rate are achieved.
Owner:COMBA TELECOM SYST CHINA LTD

Extendible packaging box type store class managing and indexing method

A classification management and index method for the extensive package box type warehouse is characterized by that a three-layer structure is used to manage the box-type warehouse and the database technique is used for classification management and index and increasing the additional description information about package boxes. Its advantage is high management and index efficiency.
Owner:BEIJING FOUNDER ELECTRONICS CO LTD +1

IPv6 routing lookup method

The present invention relates to the technical field of routing lookup, and discloses an IPv6 routing lookup method. The method comprises the following steps of: 1, constructing a data structure: S1,constructing a binary tree by taking 2001 as a root node and formed by previous 16 bits with route prefix; S2, constructing a segment table and a routing barrel, obtaining a corresponding threshold value in a condition of balance between the algorithm lookup efficiency and the memory occupied by the algorithm, employing a routing barrel organization when the number of the routing items is smallerthan the threshold value, and employing a segment table organization when the number of the routing items is larger than the threshold value; and S3, linking the routing barrel on the segment table. The IPv6 routing lookup method can achieve IPv6 rapid lookup and can meet the IPv6 lookup demand.
Owner:NANTONG SCI & TECH VOCATIONAL COLLEGE

Method and system for locating interference source based on single geostationary orbit satellite

The embodiment of the invention provides a method and system for positioning an interference source based on a single stationary orbit satellite. The system comprises a signal collecting device, a reference source signal emission device, a signal processing device and an interference source positioning device, wherein the signal collecting device is used for collecting an interference signal of the stationary orbit satellite, the reference source signal emission device is used for sending a reference source signal to the stationary orbit satellite, and receiving a reference source return signal sent by the stationary orbit satellite according to the reference source signal, the signal processing device is used for conducting error removal on actual Doppler frequency shift of the interference signal and the reference source return signal, and the interference source positioning device is used for determining the position of the interference source according to the interference signal and the reference source return signal. Accurate positioning on the interference source of the satellite can be achieved through the only one stationary orbit satellite, the finding capability of the satellite on the interference is greatly improved, and a plurality of restraint conditions of interference finding are reduced.
Owner:国家无线电监测中心

A method and system for the temporary storage and treatment of charging bill

The invention provides a method and a system which temporarily store and process charging tickets and comprises the following steps that the first step is that whether key fields of parts of the charging tickets exist in a memory is judged after receiving the part of the charging tickets from a charging gateway, and the second step is that if no key fields exist, a position of an available disk file is obtained from the memory and the part of the charging tickets is stored in the available disk file which is corresponding to the position of the available disk file, otherwise, the existing charging tickets and the part of the charging tickets which are corresponding to the key fields are combined to generate a new charging ticket. Therefore, by adopting the method and system of the invention, main key data is stored in the memory, ordinary data is stored in the disk, the search of the part of the charging tickets can be realized in the memory, so the property of searching performance ration databases is greatly improved, thus reducing the cost of the system and also improving the property of the system.
Owner:ZTE CORP

Index structure based on dictionary tree, data query optimization method, main memory manager

The invention discloses an index structure based on a dictionary tree, a data query optimization method and a main memory manager, belonging to the field of data storage. The index structure is composed of containers. The container stores T nodes and S nodes. The complete key is divided into partial keys. The T node stores the first m / 2 bits of the partial key, and the S node stores the last m / 2 bits of the partial key. From the dictionary tree The partial keys passed on the path from the root node to a certain node are connected to form a complete key. The index structure is more compact, thereby improving the utilization rate of main memory space. Use jump successor to directly jump T node to subsequent brother node, thereby reducing the number of comparisons and improving search performance; use T node jump table to jump T node to S node, use container jump table to jump S node to T node, Jump directly to the nearest target, thereby skipping a large number of unnecessary entries and improving the search performance. The pointer P containing the IDs of each hierarchical structure parsed by the main memory manager fully decouples the index structure from the main memory address.
Owner:HUAZHONG UNIV OF SCI & TECH

A kind of NDN data name searching method and system

The invention discloses a method and system for searching NDN data names. The method includes: designing and implementing a data structure candidate alignment migration array for GPU-based data name searching; running a CATA construction algorithm and an update algorithm on a CPU; converting CATA from The CPU end is transmitted to the GPU end; the CATA-based data name search algorithm is run on the GPU; the operating parameters of the GPU are continuously adjusted to optimize the search performance; the search results are transferred from the GPU end to the CPU end. The present invention provides a data name search method based on the GPU data structure CATA, so that the data name search problem can be well solved, not only can realize the data name search at the line speed, but also greatly reduce the storage cost, and has important practical application value.
Owner:HUNAN UNIV

Junk file search method and system

The embodiment of the invention provides a method and system for searching for a useless file. An older-version application program installation directory meeting an installation directory feature corresponding to the application program in a preset feature library besides the installation directory in the parent directory of the application program installation directory obtained according to a registry, and the useless file is searched for in the searched older-version application program installation directory. Due to the fact that the new-version and older-version application program installation directories generally have a certain installation directory feature, the older-version application program installation directory can be found through the installation directory feature, and therefore the useless file is searched for in the older-version application program installation directory. Therefore, according to the method and system for searching for the useless file, the useless file search effect is improved, the situation that the useless file in the older-version installation directory exists in terminal equipment for a long time and occupies the disk space is avoided, and efficient operating of the terminal equipment is effectively guaranteed.
Owner:ZHUHAI BAOQU TECH CO LTD

A kind of ipv6 routing lookup method

The present invention relates to the technical field of route search, and discloses a method for IPv6 route search, comprising the following steps: 1. Component data structure: S1. Build a binary tree with 2001 as the root node and composed of the first 16 bits of the route prefix; S2. Build segment tables and routing buckets, and obtain the corresponding threshold under the balance between the search efficiency of the algorithm and the memory occupied by the algorithm. When the number of routing entries is less than the threshold, the routing bucket organization is used, and when the number of routing entries is greater than the threshold, the segment is used. Table organization; S3. Routing buckets linked on the segment table. The IPv6 route lookup method has the advantage of being able to realize IPv6 fast lookup, and can better meet the need for IPv6 lookup.
Owner:NANTONG SCI & TECH VOCATIONAL COLLEGE

Cache coloring memory allocation method and device for search tree

The embodiment of the invention provides a cache-coloring memory allocation method and device for search trees. The method includes: constructing the first search tree; determining that the first search tree has N layers of nodes; acquiring the number of the nodes which each layer in the N layers of nodes has; allocating corresponding colors in coloring colors of a memory for each layer of nodes according to the number of the nodes which each layer in the N layers of nodes has, wherein the corresponding colors allocated for all the layers of nodes are mutually different; and generating the second search tree after cache coloring according to the colors corresponding to each layer of nodes and the memory corresponding to the colors. Only the memory which can be mapped to the corresponding coloring colors is allocated when the memory is allocated for each layer of nodes according to the colors corresponding to each layer of nodes in the second search tree, mapping relationships exist between the memory and a Cache, thus an effect that the different layers of nodes cannot mutually compete for the Cache can be guaranteed, and thus search performance is improved.
Owner:HUAWEI TECH CO LTD +1

On-board fast route lookup system combined with longest prefix match and exact match

The on-board fast route lookup system combined with the longest prefix match and exact match, including the exact match lookup module and the longest prefix match lookup module, the exact match lookup module includes a hash lookup circuit, a hash hash table and an aging update management circuit; The long prefix matching search module includes a compressed Trie tree search circuit, a Trie tree node storage area and a routing table item storage area. Compared with the traditional longest prefix matching search structure, the method of the present invention adds an exact match search as a high-speed cache of active routing table entries by establishing a route search structure combining the longest prefix match and exact match, greatly improving the IP packet rate. The routing lookup speed of the text stream effectively reduces the average lookup time. In addition, by building an aging update management circuit that accurately matches and looks up, the automatic learning and adding operations of active routing table items are realized, and the aging check and processing of routing table items are completed. Delete operation to ensure efficient management and lookup performance of active routing table entries.
Owner:XIAN INSTITUE OF SPACE RADIO TECH

NDN data name searching method and system

The present invention discloses an NDN data name searching method and system. The method comprises: designing and realizing a data structure candidate-aligned transition array (CATA) of data name searching based on a GPU; operating the construction algorithm and the updating algorithm of the CATA on the CPU; transmitting the CATA from the CPU end to the GPU end; operating the data name searching algorithm based on the CATA on the GPU; continuously regulating the operation parameters of the GPU to allow the searching performance to reach the optimum; and transmitting a searching result from the GPU end to the CPU end. The present invention provides the data name searching method of the data structure CATA based on the GPU to allow the data name searching problem to be solved so as to realize data name searching at a linear velocity, greatly reduce the storage expenditure and have important practical application values.
Owner:HUNAN UNIV

Method for storing and searching character strings in hash table

The invention discloses a method for realizing character string storage and search by a hash table, which relates to the technical field of hash tables and comprises the following steps of: S1, determining a collision order of character strings; s2, carrying out collision order statistics; s3, storing the character string into the hash table according to the collision order; and S4, searching the position of the character string in the hash table. Compared with a general method in a standard library, the method for storing and searching the character strings by the hash table has the advantages that the character string query efficiency is greatly improved, the delay and jitter in a transaction process are greatly reduced, a transaction system realized by software achieves the performance of a transaction system realized by hardware, and the transaction efficiency is improved. And the character string searching performance in the high-frequency transaction counter realized by software can be improved.
Owner:南京火牙科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products