CN100511229C - Domain name information storage and inquiring method and system - Google Patents
Domain name information storage and inquiring method and system Download PDFInfo
- Publication number
- CN100511229C CN100511229C CNB2006100603451A CN200610060345A CN100511229C CN 100511229 C CN100511229 C CN 100511229C CN B2006100603451 A CNB2006100603451 A CN B2006100603451A CN 200610060345 A CN200610060345 A CN 200610060345A CN 100511229 C CN100511229 C CN 100511229C
- Authority
- CN
- China
- Prior art keywords
- node
- character string
- present node
- string
- stored
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
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
The present invention relates to communication technical field, relate in particular to a kind of storage and method for quickly querying and domain name kind information stores inquiry system of domain name kind information.
Background technology
Along with fast development of computer technology, the quantity of information increases by geometric progression.So big quantity of information has all been brought many difficulties for searching and deposit information.We just need effectively find the method for data, and the purpose of searching is to seek a specific value from some data, and consequent various lookup methods all are in order to pursue higher efficient and operation more easily.So same for searching of domain name, for example know if desired in certain concrete network application whether certain domain name is saved, if be saved, just need do once and be redirected the packet of sending.In this case, just need very fast certain domain name of knowing whether to be stored, in inquiry, the performance of network is had a greatly reduced quality if spend the plenty of time, and a lot of network problems may occur.
Existing coordinate indexing technology mainly contains prefix trees, two kinds in BSD radix tree.
BSD radix tree is a kind of for searching the data structure that the IP address is designed.The storage organization of the node of BSD radix tree as shown in Figure 1, what its internal node and leaf node used all is the radix_node structure, just the definition of minority field is different.At first check each field in the radix_node structure by internal node.This structure has mainly been preserved pointer that points to child node and the pointer that points to father node, also has the bit bit position information that need detect.The search procedure of BSDradix tree was divided into for three steps and finishes: the first step, as shown in Figure 2, seek leaf node, and suppose need in this radix sets, search certain bar route now.From the top of tree, test according to the bit of internal node appointment on the way.At first test the test position of root node, if be 1 to enter left subtree so, if test result is 0 just to enter right subtree according to the test bit test result of root node.Continue to judge according to the method described above below, the node that will to run into a field to be tested be negative value, i.e. leaf node will be so search operation will stop at herein.In second step, distinguish heavy:, then need to travel through the repeat key chained list of this leaf node in the first step if leaf node that finds and key for searching do not satisfy the condition of coupling.Because the key assignments (IP address just) of the leaf node that finds in the leaf node in the repeat key chained list and the first step is identical, just mask is the trend that shortens gradually, therefore may have the possibility of network coupling in the repeat key chained list.The process that repeat key is handled as shown in Figure 3.In the 3rd step, recall: up to the present, only be to use as the IP address of key for searching and in the radix tree, found certain leaf node, and carried out the repeat key processing, still do not find the leaf node of coupling according to the bit test position of internal node indication.This can not get rid of in radix tree and also has the leaf node that other may satisfy the network matching condition, therefore just need recall to the treetop in the internal node path when coming, and seeks the possibility that network mates.Trace-back process as shown in Figure 4.What recall passage in transit is a series of internal node, and for each internal node, that will judge whether it hang has a mask chained list, and the mask chained list is represented with heavy line in Fig. 4.Do not have the internal node of mask chained list not consider, directly pass through.If certain internal node is hung have mask chained list, that explanation in its subtree, may exist the network coupling may, need stop to do one and judge again whether decision continues to recall.
BSD radix tree is a kind of based on the search tree with the key assignments of binary representation, is particularly suitable for handling key assignments that is very long, variable-length.Character string can certainly be regarded a binary key assignments as, but the possible value of each character in the character string has only tens kinds of (a-z, A-Z, or the like), it is little a lot of to get 256 kinds situation compared with each byte of pure scale-of-two key assignments, therefore but this method also is used as character string as binary stream and is done inquiry, and inquiry string can not finely embody the advantage of speed in this way.
Prefix trees is many to be used in data mining, and its storage mode as shown in Figure 5.If prefix trees is limited to the character set of its node within 26 English alphabets, can be regarded as the tree that has only 26 forks at most.Prefix trees also can provide a kind of querying method relatively fast.But the structure of prefix trees has been preserved a lot of unnecessary character string informations, and this has caused can causing unnecessary recalling when searching domain name.For example: to search " Chinese " in the prefix trees as shown in Figure 4, at first look for from root node, " in " the word coupling, enter " China " subtree.Whether the comparison " China " that starts anew then mates, and causes and recalls.And enter " Chinese " node, and beginning coupling again, a large amount of time wastes is unnecessary on recalling.This method is used for domain name kind string when storage, has both wasted storage space, and again because the tree construction degree of depth is dark, seek rate is just slow, and, the memory space that this technology equally can not packed data.
Summary of the invention
Technical matters to be solved by this invention is: a kind of storage mode of searching domain name kind string fast that adapts to is provided;
Another problem that the present invention will solve is: provide a kind of and above-mentioned storage means corresponding domain name kind string querying method, this querying method can judge fast and effeciently whether certain domain name kind string is stored.
The present invention also provides a kind of domain name kind information stores inquiry system.
The present invention solves the problems of the technologies described above the technical scheme that is adopted to be:
A kind of storage means of domain name kind string, described method comprises: will compare between the domain name kind string to be stored, described domain name kind string same prefix to be stored is partly deposited with a node, as common node; Domain name kind string different piece to be stored is deposited as the child node insertion of this common node; For complete unmatched two domain name kind string, then insert and deposit as the brotgher of node.
Described method, wherein: insert an empty node in the node back of depositing a complete character string.
Described method, wherein: described method comprises following concrete steps:
A, character string to be stored and intranodal character string are compared judgement, when character string was mated fully in character string to be stored and the present node, return results was true; When character string does not match fully in character string to be stored and the present node, enter step B; When character string is partly mated in character string to be stored and the present node, enter step C;
B, judge whether present node has the brotgher of node, if present node has the brotgher of node, then the described brotgher of node as new present node, return steps A; If present node does not have the brotgher of node, then will be inserted into node and insert as the brotgher of node of present node;
Character string is divided into same prefix and the part that do not match in C, the character string to be stored that will not exclusively mate and/or the present node, keeps same prefix as present node, and the part that do not match is inserted as the child node of present node.
Described method, wherein: work as character string to be stored among the described step C and mate fully, and when character string is partly mated in the present node, comprise following concrete processing: character string in the present node is divided into the different portions with first of first identical portions, keep first identical portions as present node, the first different portions are deposited as the child node insertion of present node, and inserted node in the first different portions node back.
Described method, wherein: mate fully when the intranodal character string among the described step C, and character string to be stored is when partly mating, it comprises following concrete steps:
C1, character string to be stored is divided into the different portions with second of second identical portions;
C2, judge whether present node has child node;
C3, if child node is arranged, as new character string to be stored, child node compares as character string in the new present node, repeating step A with the described second different portions; Otherwise keep the intranodal character string, the described second different portions are inserted as the child node of present node deposit, and inserted node in the second different portions node back.
Described method, wherein: partly mate when the intranodal character string among the described step C, and character string to be stored comprises following processing: character string to be stored is divided into the different portions with second of identical portions when partly mating; The intranodal character string is divided into the different portions with first of identical portions; Keep identical portions as present node, the first different portions are deposited as the child node insertion of present node, the second different portions are deposited as its brotgher of node insertion, or the second different portions are deposited as the child node insertion of present node, the first different portions are inserted as its brotgher of node deposit.
A kind of querying method of domain name kind string, described method comprises the steps:
A, intranodal character string and character string to be checked are compared, whether character string mates fully with character string to be checked in the decision node;
B, if the intranodal character string is mated fully, get character string to be checked and intranodal character string and do not match part as new character string to be checked, the child node of getting the interior character string of present node is returned steps A as new present node;
C, if intranodal character string and character string to be checked are not exclusively mated, the brotgher of node of then getting present node is returned steps A as character string in the new present node.
Described querying method, wherein: described steps A comprises following concrete steps:
A1, judge whether present node is effective, true if present node directly returns when invalid, enter steps A 2 in the time of effectively;
A2, character string to be checked and intranodal character string are compared, whether character string mates fully with character string to be checked in the decision node.
Described querying method, wherein: described step C comprises following concrete steps:
C1, if when intranodal character string and character string to be checked are not exclusively mated, the brotgher of node of getting present node is as character string in the new present node;
C2, judge whether new present node is effective,, return steps A 2 in the time of effectively if new present node directly returns vacation when invalid.
A kind of domain name kind information stores inquiry system, comprise an insert module, one DNS-Tree memory module, and the memory management module that is connected with the DNS-Tree memory module with described insert module respectively, described memory management module is used for the comparison domain name kind string, and the node memory of DNS-Tree memory module is distributed and manages;
Also comprise a query processing module that is connected with described DNS-Tree memory module, whether described query processing module is used for character string with character string to be checked and DNS-Tree memory module and compares and judge, draw character string to be checked result in the DNS-Tree memory module.
Beneficial effect of the present invention is: the present invention is after the characteristics that taken into full account and utilized domain name kind string, adopted domain name kind string storage means as above, this method has not only reduced the demand of internal memory effectively, and because domain name service tree (DNSTree) tree construction that this location mode is set up is not dark, and tree construction balance, time complexity when having reduced query and search and space complexity, therefore adopt querying method of the present invention can judge fast and effeciently whether certain domain name kind string is stored, accelerate inquiry velocity, improved recall precision.
Description of drawings
Fig. 1 is the node structure storage synoptic diagram of BSD radix tree;
Fig. 2 is the process synoptic diagram of BSD radix tree test root node;
Fig. 3 is BSD radix tree repeat key processing procedure figure;
Fig. 4 is BSD radix tree trace-back process synoptic diagram;
Fig. 5 is a prefix trees storage mode synoptic diagram;
Fig. 6 is the tree construction synoptic diagram of DNSTree of the present invention;
Fig. 7 is a DNSTree storage means process flow diagram of the present invention;
Fig. 8 is search algorithm's DNSTree process flow diagram of the present invention;
Fig. 9 is a domain name kind storing queries system schematic of the present invention.
Embodiment
With embodiment the present invention is described in further detail with reference to the accompanying drawings below:
Because the domain name character string has its singularity, be that domain name can be not oversize, and domain name is the character string of significant convenient memory mostly, so usually can find many identical prefixes as www, ftp or the like, we will have These characteristics and the similar character string of domain name character string is called domain name kind string.The present invention improves for domain name kind storage and querying method according to these two characteristics, so that accelerate searching of domain name kind string.Be that example is illustrated with the domain name character string below, for example provide following 6 domain name character strings:
www.baidu.com
www.google.com，
www.goobersite.com
www.google.com.cn
www.yahoo.com.cn
www.yahoo.com
Storage means of the present invention is: will compare between the domain name character string to be stored, each domain name character string identical prefix part deposit with a node, part inequality is inserted as child node and is deposited, and character string inequality is fully inserted as the brotgher of node and deposited.For example to have only www. with www.google.com be identical prefix to www.baidu.com, and www. just can be used as common node so, and baidu.com and google.com just insert as two child nodes of common node www..When www.yahoo.com as character string to be stored and www.baidu.com relatively, also having only www. is identical prefix, same www. is as common node, different piece yahoo.com inserts as the brotgher of node of baidu.com.The rest may be inferred, obtains DNSTree tree as shown in Figure 6.Such location mode can be saved a large amount of internal memories when having deposited a large amount of same prefix character string.Be the simple representation of Fig. 6 below:
www.
+baidu.com
+goo
+bersite.com
+gle.com
+.cn
+“”
+yahoo.com
+.cn
+“”
“”
" " among the figure represented empty node, and empty node is to be used for representing that the character string of front has been a complete character string, and the back does not need to have added any character again.For example these two character strings of www.google.com and www.google.com.cn are inserted in the tree and are had once such shape www.google.com
+.cn
+“”
The www.google.com back adds an empty node " ", just expression
Www.google.comBe a complete character string, do not have " " just to be difficult to distinguish the existence whether this character string of www.google.com is arranged else if.
Following according to DNSTree storage means process flow diagram specific descriptions domain name character string storage means of the present invention shown in Figure 7.At first abbreviation in the process flow diagram and definition are made an explanation:
INN_STR: the inter-node character string, represent the character string of being preserved in the node.
PPI_STR: intranodal string matching part, represent the compare same prefix part of intranodal character string of two character strings, for example abcde (inter-node character string) and abckef compare, and its PPI_STR is abc;
BPI_STR: the part that do not match of intranodal character string, represent the compare part inequality of intranodal character string of two character strings.For example abcde (inter-node character string) and abckef compare, and its BPI_STR is de;
WTI_STR: be inserted into character string, represent that certain will be inserted into the character string of DNSTree;
PPW_STR: be inserted into the compatible portion of character string, represent two same prefix parts that character string is compared and is inserted into character string.For example abcde and abckef (being inserted into character string) compare, and its PPW_STR is abc;
BPW_STR: be inserted into the part that do not match of character string, represent that two character strings are compared to be inserted into the part inequality of word string.For example: abcde and abckef (being inserted into character string) compare, and its BPW_STR is kef.
The above-mentioned meaning of coupling fully represents that certain character string can be the prefix of another character string.As: INN_STR mates fully, and expression INN_STR compares with WTI_STR, and INN_STR can be used as the prefix of WTI_STR, for example: abcd (INN_STR) and abcdefg (WTI_STR).For another example: WTI_STR mates fully, and expression INN_STR compares with WTI_STR, and WTI_STR can be used as the prefix of INN_STR, for example: abcd (WTI_STR) and abcdefg (INN_STR).
The meaning of part coupling represent two some identical prefixes of character string but whether is mated fully, for example: abcke and abkei.Wherein: INN_STR partly mates, expression INN_STR compares with WTI_STR, INN_STR has identical prefix with WTI_STR, and for example: abcde (INN_STR) has identical prefix ab with abeiek (WTI_STR), but also must there be different parts the INN_STR back; WTI_STR partly mates, and expression INN_STR compares with WTI_STR, and INN_STR has identical prefix with WTI_STR.For example: abcde (WTI_STR) has identical prefix ab with abeiek (INN_STR), but also must there be different parts the WTI_STR back.
Do not match fully, represent that two character strings do not have identical prefix fully.
According to above-mentioned definition, the present invention for the step of domain name kind string storage means is:
1, WTI_STR compares with INN_STR, WTI_STR and INN_STR all fully coupling enter step 2, not matching fully enters step 3, part coupling enters step 4;
2, return results is true;
3, judge that whether present node has sibling, if the handlebar sibling is used as present node, enters 1.If not then insert as the brotgher of node.
4. the part match condition divides following three subcases to handle:
1) .WTI_STR mates fully, and INN_STR partly mates:
A. INN_STR is divided into PPI_STR and BPI_STR,
B. PPI_STR is kept, BPI_STR is inserted in the DNSTree tree as the child node of present node, inserts an empty node again in BPI_STR node back.
2) .INN_STR mates fully, and WTI_STR partly mates
A. judge whether the INN_STR node has child node
If b. child node is arranged, BPW_STR is as new WTI_STR so, and the child node of INN_STR is new present node, changes 1 then over to.
If c. there is not child node, the PPI_STR node keeps, and BPW_STR inserts as the child node of present node, and then an empty node is being inserted in the child node back of inserting.
3) .INN_STR partly mates, and WTI_STR partly mates.
A. WTI_STR is divided into PPW_STR and BPW_STR;
B. PPI_STR is kept as present node, BPI_STR inserts as the child node of present node, and BPW_STR inserts as the brotgher of node of BPI_STR node.
This shows, because prefix part identical in the domain name is deposited with a common node, therefore not dark according to the DNSTree tree construction of the method foundation, and tree construction balance, time complexity and space complexity in the time of can reducing query and search undoubtedly in searching the domain name process have improved inquiry velocity; This storage means has reduced the demand of internal memory effectively simultaneously.
At this DNSTree tree construction, its corresponding search procedure is described below as shown in Figure 8:
Related notion:
INN_STR: intranodal character string, the character string of being stored in the expression node.
WTI_STR: band compare string string, represent that certain need inquire about the character string that whether has existed.
1. judge whether present node is effective, invalid directly returning very effectively enters step 2;
2. judge whether INN_STR mates fully with WTC_STR,, do not enter step 4 if match if coupling enters step 3;
3. the part that do not match of getting WTC_STR is as new WTC_STR, and the child node of getting present node is returned step 1 as new present node;
4. the brotgher of node of getting present node is as new present node;
5. judge whether new present node is effective,,, judge whether fully coupling of new present node and WTC_STR, enter next circulation if effectively return step 2 if invalidly return vacation.
The system that the present invention is used for the storing queries domain name kind string as shown in Figure 9.Comprise four main modules: insert module: the main function of insert module is exactly according to the DNS-Tree tree construction character string to be inserted on the specific node of DNS-Tree tree.This module is mainly used when DNS-Tree is initialized, with the initialization of this partially-completed tree.Memory management module: comprise comparer and control section, what kind of distribution of node memory and management among the main managing domain name system-Tree of memory management module.Because the domain name character string is not long, required internal memory belongs to the fritter internal memory, so memory management module adopts the method for prior art memory pool to manage the fritter internal memory.Query processing module: the function of enquiry module is to check whether character string to be checked has preserved in DNS-Tree.Character string to be checked is handled, and compared and judge, draw the whether result in DNS-Tree of character string to be checked with character string among the DNS-Tree.DNS-Tree is a memory module, i.e. a memory field.
Be understandable that, for those of ordinary skills, can be equal to replacement or change according to technical scheme of the present invention and inventive concept thereof, and all these changes or replacement all should belong to the protection domain of the appended claim of the present invention.
Claims (10)
1, a kind of storage means of domain name kind string, described method comprises: will compare between the domain name kind string to be stored, described domain name kind string same prefix to be stored is partly deposited with a node, as common node; Domain name kind string different piece to be stored is deposited as the child node insertion of this common node; For complete unmatched two domain name kind string, then insert and deposit as the brotgher of node.
2, method according to claim 1 is characterized in that: insert an empty node in the node back of depositing a complete character string.
3, method according to claim 2 is characterized in that: described method comprises following concrete steps:
A, character string to be stored and intranodal character string are compared judgement, when character string was mated fully in character string to be stored and the present node, return results was true; When character string does not match fully in character string to be stored and the present node, enter step B; When character string is partly mated in character string to be stored and the present node, enter step C;
B, judge whether present node has the brotgher of node, if present node has the brotgher of node, then the described brotgher of node as new present node, return steps A; If present node does not have the brotgher of node, then will be inserted into node and insert as the brotgher of node of present node;
Character string is divided into same prefix and the part that do not match in C, the character string to be stored that will not exclusively mate and/or the present node, keeps same prefix as present node, and the part that do not match is inserted as the child node of present node.
4, method according to claim 3, it is characterized in that: work as character string to be stored among the described step C and mate fully, and when character string is partly mated in the present node, comprise following concrete processing: character string in the present node is divided into the different portions with first of first identical portions, keep first identical portions as present node, the first different portions are deposited as the child node insertion of present node, and inserted node in the first different portions node back.
5, method according to claim 3 is characterized in that: mate fully when the intranodal character string among the described step C, and character string to be stored is when partly mating, it comprises following concrete steps:
C1, character string to be stored is divided into the different portions with second of second identical portions;
C2, judge whether present node has child node;
C3, if child node is arranged, as new character string to be stored, child node compares as character string in the new present node, repeating step A with the described second different portions; Otherwise keep the intranodal character string, the described second different portions are inserted as the child node of present node deposit, and inserted node in the second different portions node back.
6, method according to claim 3 is characterized in that: partly mate when the intranodal character string among the described step C, and character string to be stored comprises following processing: character string to be stored is divided into the different portions with second of identical portions when partly mating; The intranodal character string is divided into the different portions with first of identical portions; Keep identical portions as present node, the first different portions are deposited as the child node insertion of present node, the second different portions are deposited as its brotgher of node insertion, or the second different portions are deposited as the child node insertion of present node, the first different portions are inserted as its brotgher of node deposit.
7, a kind of querying method of domain name kind string, described method comprises the steps:
A, intranodal character string and character string to be checked are compared, whether character string mates fully with character string to be checked in the decision node;
B, if the intranodal character string is mated fully, get character string to be checked and intranodal character string and do not match part as new character string to be checked, the child node of getting the interior character string of present node is returned steps A as new present node;
C, if intranodal character string and character string to be checked are not exclusively mated, the brotgher of node of then getting present node is returned steps A as character string in the new present node.
8, querying method according to claim 7 is characterized in that: described steps A comprises following concrete steps:
A1, judge whether present node is effective, true if present node directly returns when invalid, enter steps A 2 in the time of effectively;
A2, character string to be checked and intranodal character string are compared, whether character string mates fully with character string to be checked in the decision node.
9, querying method according to claim 8 is characterized in that: described step C comprises following concrete steps:
C1, if when intranodal character string and character string to be checked are not exclusively mated, the brotgher of node of getting present node is as character string in the new present node;
C2, judge whether new present node is effective,, return steps A 2 in the time of effectively if new present node directly returns vacation when invalid.
10, a kind of domain name kind information stores inquiry system, it is characterized in that: comprise an insert module, one DNS-Tree memory module, and the memory management module that is connected with the DNS-Tree memory module with described insert module respectively, described memory management module is used for the comparison domain name kind string, and the node memory of DNS-Tree memory module is distributed and manages;
Also comprise a query processing module that is connected with described DNS-Tree memory module, whether described query processing module is used for character string with character string to be checked and DNS-Tree memory module and compares and judge, draw character string to be checked result in the DNS-Tree memory module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100603451A CN100511229C (en) | 2006-04-13 | 2006-04-13 | Domain name information storage and inquiring method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100603451A CN100511229C (en) | 2006-04-13 | 2006-04-13 | Domain name information storage and inquiring method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101055574A CN101055574A (en) | 2007-10-17 |
| CN100511229C true CN100511229C (en) | 2009-07-08 |
Family
ID=38795413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100603451A Expired - Fee Related CN100511229C (en) | 2006-04-13 | 2006-04-13 | Domain name information storage and inquiring method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100511229C (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102306161A (en) * | 2011-07-22 | 2012-01-04 | 浙江百世技术有限公司 | Method for multi-region repeated detection and equipment |
| CN106776657B (en) * | 2015-11-25 | 2021-05-04 | 阿里巴巴集团控股有限公司 | Domain name retrieval method and device |
| CN107153647B (en) * | 2016-03-02 | 2021-12-07 | 北京字节跳动网络技术有限公司 | Method, apparatus, system and computer program product for data compression |
| CN105871726A (en) * | 2016-03-21 | 2016-08-17 | 哈尔滨工程大学 | Mode matching method for dynamically adding tree node and unit based on common prefix |
| CN107870925B (en) * | 2016-09-26 | 2021-08-20 | 华为技术有限公司 | Character string filtering method and related device |
| CN108984780B (en) * | 2018-07-25 | 2021-10-22 | 郑州云海信息技术有限公司 | Method and device for managing disk data based on data structure supporting repeated key value tree |
| CN110120942B (en) * | 2019-04-17 | 2022-01-25 | 新华三信息安全技术有限公司 | Security policy rule matching method and device, firewall equipment and medium |
| CN111523783A (en) * | 2020-04-14 | 2020-08-11 | 西云图科技(北京)有限公司 | Data storage method of water affair system |
| CN112380324B (en) * | 2020-12-02 | 2022-02-01 | 北京微步在线科技有限公司 | Method, system and medium for determining domain name and its father domain name |
-
2006
- 2006-04-13 CN CNB2006100603451A patent/CN100511229C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN101055574A (en) | 2007-10-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100511229C (en) | Domain name information storage and inquiring method and system | |
| US5930805A (en) | Storage and retrieval of ordered sets of keys in a compact 0-complete tree | |
| CN1316390C (en) | Performance and memory bandwidth utilization for tree searches using tree fragmentation | |
| US6434144B1 (en) | Multi-level table lookup | |
| US5202986A (en) | Prefix search tree partial key branching | |
| AU631276B2 (en) | Name resolution in a directory database | |
| CN102521334B (en) | Data storage and query method based on classification characteristics and balanced binary tree | |
| US8208408B2 (en) | Tree-based node insertion method and memory device | |
| CN100550847C (en) | A kind of method and device that solves the Hash conflict | |
| US20070198566A1 (en) | Method and apparatus for efficient storage of hierarchical signal names | |
| US7590625B1 (en) | Method and system for network load balancing with a compound data structure | |
| CN101345707B (en) | Method and apparatus for implementing IPv6 packet classification | |
| EP1335538B1 (en) | Method and system for address lookup in data communication | |
| CN101458694A (en) | Chinese participle method based on tree thesaurus | |
| US8086641B1 (en) | Integrated search engine devices that utilize SPM-linked bit maps to reduce handle memory duplication and methods of operating same | |
| CN103020054A (en) | Fuzzy query method and system | |
| CN114884877B (en) | IPv6 route searching method combining hash table and HOT | |
| CN102521375A (en) | Directory service data retrieval method and directory service data retrieval system | |
| Su-Cheng et al. | Node labeling schemes in XML query optimization: a survey and trends | |
| CN100452732C (en) | Route searching method and system | |
| CN106484815A (en) | A kind of automatic identification optimization method for retrieving scene based on mass data class SQL | |
| CN110995876B (en) | Method and device for storing and searching IP | |
| CN102984071B (en) | Method for organizing routing table of segment address route and method for checking route | |
| US20070282816A1 (en) | Method and structure for string partial search | |
| CN101783761A (en) | Method for storing and searching routing list and device therefor |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090708 Termination date: 20180413 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |