Patricia tree rapid lookup method

Abstract

The present invention provides a method of Patricia tree rapid inquiry, including following steps: (a) dividing 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; (c) accessing high bandwidth of the EMS memory via the processor, acquiring all information of a subtree by reading once memory, the method of Patricia tree rapid inquiry can reduce times of smart memory access of Patricia inquiry tree computing and improve finding efficiency.

Description

technical field [0001] The invention relates to the field of embedded systems, in particular to a Patricia tree fast search method. 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 running time of the binary search tree algorithm...

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%.

Images