Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Patricia tree rapid lookup method in high memory access wide

A memory access and search tree technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as waste, and achieve the effect of improving effective utilization, improving search efficiency, and improving memory space utilization

Active Publication Date: 2011-09-21
ZTE CORP
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0017] It can be seen that 256-51=205 bits are wasted in a memory access, and the effective utilization rate of the corresponding memory access content is 20%.

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
  • Patricia tree rapid lookup method in high memory access wide
  • Patricia tree rapid lookup method in high memory access wide
  • Patricia tree rapid lookup method in high memory access wide

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] The present invention realizes the method for Patricia search tree under high memory access bit width as figure 2 As shown, the method is implemented in a data device, and the data device performs the following steps:

[0039] Step 201: Generate a Patricia tree according to business needs, and divide the Patricia tree into one or more subtrees according to the depth of the tree;

[0040] If the subtree is divided with a depth of 3, when the depth of the Patricia tree is 3, there is only one subtree according to the method of the present invention, and when the depth of the Patricia tree is greater than 3, multiple subtrees can be divided.

[0041] Step 202: Compress all node information of each subtree into a compressed tree structure, and each compressed tree structure is stored in a continuous memory block;

[0042] In order to obtain node information faster, the above compressed tree structure is stored in a continuous memory block; the specific compressed tree struc...

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 present invention provides a method for implementing Patricia search tree in a high memory access bit width. The method is implemented in a data device, and the data device executes the following steps: (a) generating the Patricia tree according to the service requirement, and dividing the Patricia tree into one or more subtrees according to depth of tree; (b) compressing all node information of each subtree to a compressing tree structure, and each compressing tree structure being stored in a continuous memory block; (c) through the high bit width access of a processor and the memory, acquiring all node information of a certain subtree by reading once memory. The inventive method can reduce times of memory access and improve finding efficiency.

Description

technical field [0001] The invention relates to the field of embedded systems, in particular to a method for realizing a Patricia search tree under high memory access bit width. Background technique [0002] In the method of tree search, binary search tree is a frequently used data structure and algorithm. With the appropriate data structure, the binary search tree can provide fast operation performance on average for various symbol table operations such as search, insertion, selection and sorting. Binary search trees are also suitable for masked entries, variable-length entries, and longest matches, especially for literal entries or entries containing literals. From the search process of the binary search tree, it can be seen that the search performance of the binary search tree depends on its depth. However, since the binary search tree is formed by inserting one by one during the search process, its depth depends on the order in which the keywords are inserted. , the ru...

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 Patents(China)
IPC IPC(8): G06F17/30
Inventor 尹旺中
Owner ZTE CORP
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com