Method and device for searching data

A data search and search tree technology, applied in the field of data search, can solve problems affecting network capacity, waste of memory resources, limiting search speed, etc., to achieve the effect of increasing network capacity, improving utilization rate, and reducing the number of series

Inactive Publication Date: 2009-11-04
HUAWEI TECH CO LTD
View PDF0 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] 1. The step size of the search is limited by the system hardware, which limits the speed of the search
[0007] 2. Each node must apply for a fixed size, even if the node contains only one matching item or does not contain a matching item, so when performing routing table lookup, it is necessary to search for each item of each node, which reduces the search speed and affects The speed of the network; at the same time, each node applies for a fixed size, which wastes memory resources and affects network capacity

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for searching data
  • Method and device for searching data
  • Method and device for searching data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 2

[0087] Embodiment 2 is a specific application of the data search method in Embodiment 1. To facilitate the description of the technical solution, this embodiment follows the convention in the first embodiment.

[0088] Child Node and Prefix Node both have Segment and Compact representations. Because there are these two representation methods, it is necessary to inform the next node which representation method is used during the search process, and then set the relevant representation fields in the corresponding data structure.

[0089] image 3 Shown is a schematic structural diagram of the Child Node in Embodiment 2 of the present invention.

[0090] In the representation of Segment, image 3 Shown in is only a structural schematic diagram of a data structure with a length of L, and the structures of other data structures with a length of L are the same. Among them, the prefix type (Prefix Type) indicates whether the prefix of the node is Segment or Compact representation...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a method for searching data, which comprises the steps: searching whether a sub-node is matched with a search data string or not according to a second entry of a node matched with the search data string; continuously searching by taking the sub-node as the next node matched with the search data string when the sub-node is matched with the search data; and searching a corresponding first entry according to the second entry when the sub-node is not matched with the search data string so as to obtain a longest match prefix of the search data string. A device for searching the data uses one or more data structures with the lengths of L to express each node according to different numbers of terms in each node. By adopting the flexible expression way, the invention improves the utilization rate of a memory and further improves the network capacity.

Description

technical field [0001] The invention relates to the field of communications, in particular to a data search method and device. Background technique [0002] With the development of communication technology and the growth of user demands, the requirements for network speed and capacity are getting higher and higher. In order to improve the speed and capacity of the network, the common method is to use packet switching technology. Packet switching technology mainly processes packets. Lookup speed directly affects the speed and capacity of the network. The longest prefix match (The Longest Prefix Match) is performed by routing table lookup, that is, when the router forwards Internet Protocol (IP) packets, after finding the longest matching prefix according to the IP address, the next Hop information to forward IP packets. [0003] Routing tables are usually stored in a hierarchical data structure, and searches proceed down the hierarchy. The commonly used layered data struc...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/56G06F17/30H04L12/54
CPCH04L45/7457H04L12/56H04L45/74591
Inventor 龚钧詹翀沈士军赵鸿翔
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap