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

An ip matching method based on dictionary tree

A matching method and dictionary technology, applied in the field of ip matching, can solve problems such as limited application and large dictionary tree space, and achieve the effect of reducing storage space and fast matching process

Inactive Publication Date: 2019-02-22
ANHUI ZHONGXIN SOFTWARE
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In ip matching, using a dictionary tree can achieve a constant level of query speed, but the cost is that the space used by the dictionary tree is too large, which limits its application

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
  • An ip matching method based on dictionary tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0014] In order to make the technical means, creative features, goals and effects achieved by the present invention easy to understand, the technical solutions in the embodiments of the present invention are clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments It is only some embodiments of the present invention, but not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0015] A kind of ip matching method based on dictionary tree, comprises the steps:

[0016] Step 1, conversion format: convert the parameter ip in the dictionary tree into a 0-filled format;

[0017] Step 2, establish Patricia tree: Patricia tree after establishment, each node has 10 edges at most, each described node contains 0-9 character, and each described node cont...

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 relates to the technical field of ip matching, in particular to an ip matching method based on a dictionary tree, comprising the following steps of: converting a parameter ip in the dictionary tree into a 0 filling format; establishing a Patricia tree, wherein each node of the established Patricia tree has at most 10 edges, and each node comprises 0-9 character, each node contains parameter prefix and mask fields, match ip: When the mask field in the step 2 is not null, the parameter prefix of the node is the ip section of the mask field, and the ip to be queried to be matched iscalculated with the mask field in the node. If the parameter prefix of the node is consistent, the query is successful, that is, the matching is successful and the mask field is returned. The invention converts the parameter IP in the dictionary tree into an Ip segment of 0 format, Then we add the mask variable to the patricaia tree node, and convert the ip segment into 0 format to match the maskvariable, which makes the matching process quicker and reduces the storage space of dictionary tree when querying ip.

Description

technical field [0001] The invention relates to the technical field of IP matching, in particular to an IP matching method based on a dictionary tree. Background technique [0002] Dictionary tree, also known as word lookup tree, Trie tree, is a tree structure, which is a variant of hash tree. Typical applications are for counting, sorting and saving a large number of strings (but not limited to strings), so they are often used by search engine systems for text word frequency statistics. Its advantages are: use the common prefix of the string to reduce the query time, minimize unnecessary string comparison, and the query efficiency is higher than the hash tree. [0003] The biggest disadvantage of Trie is the waste of space. Only the leaf nodes store the final data. In most cases, an integer Trie has many nodes with only one child. In order to improve space utilization, we can compress a series of "only children" into one node. Patricia is such a data structure, propose...

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): G06F16/901G06F16/9032
Inventor 朱静轩方立权卢志炜孟彦
Owner ANHUI ZHONGXIN SOFTWARE
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