45results about How to "Reduce the number of lookups" patented technology

The invention discloses a routing method based on routing list decomposition storage for an extensible router system. The method comprises the following steps: A: calculating the number of unit prefixes according to the number (n) of system line cards; B: creating a maping relation between the unit prefixes and the line cards; C: storing real routing lists in a decomposition manner according to the maping relation; D: creating and storing a virtual router of the unit prefixes; and E: forwarding and processing message according to the virtual router and the decomposed real routing lists. Through the method provided by the invention, the total storage and forwarding items of the system and the storage and forwarding items of each line card are greatly reduced, the seeking frequency is reduced, and accordingly, the storage expense and energy consumption of the extensible router are reduced, and the hardware resource is saved.

The invention discloses a method of carrying out fusion processing on SSR navigation management and IFF multi-mode cooperation track. A clear and reliable air monitoring graph can be supported to generate and civil air and an out target monitoring and identification capability can be increased. A technical scheme is characterized by in a secondary monitoring radar SSR navigation management and identification friend or foe recognizer integration system, firstly, carrying out trace point merging and track starting on data of A, C and S general calling mode targets of an SSR navigation management mode; secondly, carrying out prediction and roll-call inquiry on an S general calling mode track so that the SSR navigation management acquires a roll-call track of the S mode; according to a target point track angle, calculating a belonging area number, carrying out relation determination on SSR navigation management target tracks in the same area and an adjacent area and generating a target track after the SSR navigation management and the IFF are fused; and then associating and fusing attributes and positions of target data under different IFF guiding modes and the target tracks of the AC and S modes of the SSR navigation management and forming an SSR navigation management and IFF fusion target track so that continuous monitoring and identification to an air target are realized.

A system for finding a transducer resonant frequency, comprising: an initialization unit (11), a phase determination unit (12), an interval hopping control unit (13), a hopping interval generation unit (15), a frequency output control unit (17), a phase collection unit (16), and a resonant frequency point acquisition unit (14). Each hop allows a search range to be reduced by at least half of that of the previous interval, thus allowing for reduced amount of searches.

The invention relates to a pattern matching method and a pattern matching device for data streams. In the method, a pattern set comprising a plurality of patterns is divided into a plurality of mutually exclusive pattern subsets with a given detection window length, so pattern matching checks are performed on the mutually exclusive subsets in a plurality of pattern matching engines respectively, the searching times of the pattern matching engines are greatly decreased, and the working efficiency of a system is improved correspondingly.

The invention discloses a method used in the I/O of iSCSI target device block equipment. The method comprises the steps that page high speed cache is used and a Radix-Tree-based searching algorithm is adopted between interfaces of the iSCSI target device and the storage equipment. The method aims at enhancing the I/O performance of a storage system, exchanging time by using space, as well as using high-efficient searching algorithm to enhance executing efficiency. The invention adopts the method for improving a software system, basically has nothing to do with the characteristics of hardware equipment and has good universal external interfaces.

The invention discloses a Dalvik virtual machine just-in-time compilation (JIT) acceleration method based on a software Cache. The technical scheme includes that firstly, the software Cache is built in a Dalvik virtual machine, the software Cache adopts two-group connection structure and is added before a local code hash table; secondly, when a local code is found through a bytecode address, the local code is firstly found in the software Cache, when the local code is found out, the local code is directly accessed, when the local code is not found out, the local code is found in the local code hash table, when the local code is found out in the local code hash table, contents in lines of the software Cache are selected and written, when the local code is not found out, a compiling thread is waken up to compile the bytecode into the local code, and the local code hash table and the corresponding lines in the software Cache are simultaneously updated. Due to the fact that times of finding the local code hash table with a complex Hash algorithm in the Dalvik virtual machine are reduced, the Dalvik virtual machine JIT acceleration method based on the software Cache has the advantages of reducing system overhead of finding the local code hash table, thereby improving performance of a whole Android system.

When mobile node registers to home agent, corresponding item of routing list is added to routing list of home agent. The item of routing list records binding buffer information of the mobile node. Thus, when communication node sends message to mobile node, the said message is to be sent to mobile node can be determined directly from procedure of searching route; and using binding buffer information corresponding to the said home address carries out packaging and forwarding process for the message. Thus, no matter whether the received message is sent to mobile node or not, the method can distinguish the message in procedure for searching route of usual forwarding message, without need of carrying out additional search for binding buffer to determine that the message is to be sent to mobile node. The method reduces number of searching binding buffer of message to be sent to mobile node through tunnel effectively so as to raise performance of home agent for forwarding message.

The embodiment of the invention discloses a keyword determination method and a keyword determination device. The keyword determination method comprises the steps of acquiring an entry to be searched; segmenting the to-be-searched entry of a user according to the preset sequential character segmentation rule to obtain a to-be-searched sub-entry set, wherein the to-be-searched sub-entry set comprises at least one to-be-searched sub-entry, the to-be-searched sub-entry is the partial content or the whole content of the to-be-searched entry; searching a target sub-entry which is the same as the to-be-searched sub-entry in the acquired to-be-searched sub-entry set in a target word bag stored in advance and at least comprising one target sub-entry; and determining the searched same target sub-entry as a keyword corresponding to the to-be-searched entry after searching the same target sub-entry. The method in the embodiment of the invention can improve the data processing speed, and the accuracy of the determined keyword is high.

The invention discloses a memory device, a data processing system and method, and a storage medium. A controller in a memory system is programmed to execute the following operations: an L2P management table is maintained; the L2P management table is configured to comprise a first-level management sub-table and a second-level management sub-table; the first-level management sub-table comprises a plurality of first elements; each first element corresponds to one second-level management sub-table; each first element is configured to contain first identification information; each second element contained in the secondary management sub-table is configured to contain second identification information; a physical area indicated by the second elements with second identification information of a second mark is obtained from a plurality of physical areas indicated by the first elements with first identification information of a first mark by using the L2P management table after responding to a request for an L2P pointer sent from a host device; and information associated with the first L2P pointer is stored using the physical area indicated by a certain second element of the second mark.

The invention relates to the field of massive data network protocol address-regional information matching technology, and particularly relates to a network protocol address-regional information matching method and system. The method comprises the following steps: (1) acquiring a user network protocol address that needs to match regional information; (2) matching the user network protocol address through a high-frequently used regional coding schedule according to a sequential lookup method; and (3) dividing the user network protocol address into a field 1, a field 2, a field 3 and a field 4 from left to right, and separately matching the four fields with a low-frequently used regional coding schedule through a binary lookup algorithm. According to the network protocol address-regional information matching method and system disclosed by the invention, the network protocol addresses in the high-frequently used regional coding schedule are sorted according to the frequency of usage and also adopt a sequential lookup matching algorithm; the network protocol addresses in the low-frequently used regional coding schedule are divided into the four fields, and perform matching for the network protocol address-regional information by adopting the binary lookup algorithm; and thus the number of lookups can be decreased in multiples, and the matching efficiency can be improved.

The invention provides a write optimization extensible Hash index structure based on a nonvolatile memory and insertion, refreshing and deletion methods. The extensible Hash index structure comprises a pointer array, a segment, a data bucket and a slot. The insertion method comprises the steps that the Hash key finds a corresponding segment through a Virtual-Vicinity insertion algorithm by using a prefix index, then finds a data bucket of inserted data in the segment and a virtual neighborhood data bucket of the data bucket through a suffix index, and finds an idle slot to insert the data; if the insertion fails, splitting operation is performed; According to the insertion method provided by the invention, the number of insertable positions of each data can be increased, so that the space utilization rate is increased; the in-situ refreshing operation can reduce the occupation of repeated key value pairs on the memory space; in addition, the deletion operation of the HyDH can provide convenience for searching, refreshing and other operations.

The invention discloses a data name searching method and system and a storage medium, an additional step is added on the basis of an existing data name searching algorithm, when data name prefixes arestored in a hash table according to the number of components, the first n bits of each component in the data name prefixes are taken out to serve as feature prefixes of the data name prefixes, and the feature prefixes of the data name prefixes are stored in the hash table. And the feature prefixes of the same component sequence are counted together, and the feature prefixes are stored by using aBloom filter. When the target data name needs to be searched, the feature data name of the target data name is obtained according to the corresponding method, then the feature data name is put into the feature prefix Bloom filter of the corresponding component number to be matched, and if matching fails, the feature data name does not need to enter the hash table of the corresponding component number to be searched. According to the invention, data name search is completed quickly, and network delay is reduced.