Domain name information storage and inquiring method and system

Abstract

A storage and inquiry method as well as system of domain name kind string comprise that: the same prefixal portions in the domain name kind strings to be stored are stored using a note as a common node by comparing with the domain name kind strings to be stored; the different portions in the domain name kind strings to be stored are stored as a minor node of common node; two disparate domain name kind strings are inserted and stored as a brother node. When inquiring, A. the string in the node is compared with the string to be looked up and judged; B. If complete matching both, the nonmatched portion of the string to be looked up and the string in the node is taken out as new string to be looked up, the minor node of string in the current node is taken out as new current node, and returning to A; C. If both matches incompletely, the brother node of current node is taken up as new current node, the next compare and judgement is carried out between the new node and the string to be looked up, returning to B. The method improves the inquiry speed of domain name kind string.

Description

technical field [0001] The invention relates to the field of communication technology, in particular to a storage and fast query method for domain name information and a storage and query system for domain name information. Background technique [0002] With the rapid development of computer technology, the amount of information is increasing exponentially. Such a large amount of information has brought many difficulties to finding and storing information. We need an effective way to find data. The purpose of searching is to find a specific value from some data. The resulting various search methods are all for the pursuit of higher efficiency and more convenient operation. The same is true for the domain name search. For example, in a specific network application, if you need to know whether a certain domain name has been saved, if it has been saved, you need to redirect the sent data packets. In this case, it is necessary to quickly know whether a domain name is stored. I...

AI Technical Summary

Problems solved by technology

The third step, backtracking: so far, only using the IP address as the lookup key to find a certain leaf node in the radix tree according to the bit test position indicated by the internal node, and performing duplicate key processing, but still no matching leaf is found node

Then enter the "Chinese" node and start matching again, a lot of time wasted on unnecessary backtracking

When this method is used to store domain name strings, it wastes storage space, and because of the deep tree structure, the search speed is slow, and this technology also cannot compress the storage capacity of data

Images