CN113312549A - Domain name processing method and device - Google Patents
Domain name processing method and device Download PDFInfo
- Publication number
- CN113312549A CN113312549A CN202110572397.1A CN202110572397A CN113312549A CN 113312549 A CN113312549 A CN 113312549A CN 202110572397 A CN202110572397 A CN 202110572397A CN 113312549 A CN113312549 A CN 113312549A
- Authority
- CN
- China
- Prior art keywords
- domain name
- matching
- dictionary tree
- domain
- accessed
- 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.)
- Granted
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 27
- 238000012545 processing Methods 0.000 claims abstract description 42
- 238000000034 method Methods 0.000 claims abstract description 15
- 238000013507 mapping Methods 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 8
- 238000010276 construction Methods 0.000 claims description 7
- 238000006243 chemical reaction Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 18
- 230000008569 process Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 239000002184 metal Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000017105 transposition Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/955—Retrieval from the web using information identifiers, e.g. uniform resource locators [URL]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/45—Network directories; Name-to-address mapping
- H04L61/4505—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols
- H04L61/4511—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols using domain name system [DNS]
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a domain name processing method and device, and relates to the technical field of computers. One embodiment of the method comprises: receiving a domain name to be accessed; matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in a domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library; and determining a matching result, and processing the domain name to be accessed according to the matching result. The embodiment can effectively improve the domain name matching efficiency.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a domain name processing method and apparatus.
Background
In the context of network security, some enterprises define the usage of resources by users through access control, where domain name access control is one implementation of access control. In the domain name access control, a domain name input by a user through a client is matched with a domain name in a preset library, and according to a matching result, the input domain name is processed, for example, the domain name is matched with the domain name in the preset domain name library, and then the client is allowed to access the domain name and the like.
The existing domain name matching mode mainly matches the domain name input by a user with domain name rules stored in a domain name library one by one, and if the domain name library is very large, the matching process is inevitably slow by the existing matching mode, so that the matching efficiency is low.
Disclosure of Invention
In view of this, embodiments of the present invention provide a domain name processing method and apparatus, which can effectively improve domain name matching efficiency.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a domain name processing method including:
receiving a domain name to be accessed;
matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in a domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library;
otherwise, selecting an accurate matching dictionary tree for the domain name to be accessed, and matching the domain name to be accessed with nodes included in the accurate matching dictionary tree, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in the domain name library;
and determining a matching result, and processing the domain name to be accessed according to the matching result.
Preferably, the first and second electrodes are formed of a metal,
the matching of the domain name to be accessed with a preset accurate matching dictionary tree and a preset fuzzy matching dictionary tree respectively comprises the following steps:
matching the domain name to be accessed with the exact matching dictionary tree,
if the matching is successful, directly processing the domain name to be accessed;
and if the matching fails, matching the domain name to be accessed with the fuzzy matching dictionary tree.
Preferably, the first and second electrodes are formed of a metal,
the fuzzy matching dictionary tree comprises: the first dictionary tree belongs to a preposed wildcard domain name, the second dictionary tree belongs to a postposition wildcard domain name and the third dictionary tree belongs to the preposed and postposition wildcard domain names simultaneously;
the matching the domain name to be accessed and the fuzzy matching dictionary tree comprises:
matching the domain name to be accessed with the first dictionary tree, the second dictionary tree and the third dictionary tree according to a preset matching sequence;
if the domain name to be accessed is successfully matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, directly finishing matching and taking the successful matching as a matching result;
and if the domain name to be accessed is failed to be matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, and the dictionary tree is not the last dictionary tree in the matching sequence, continuing to use the domain name to be accessed.
Preferably, the matching the domain name to be accessed and the node included in the fuzzy matching dictionary tree includes:
for the case where the domain name to be accessed is associated with the first trie,
transposing the domain name to be accessed;
matching the transposed result with the first trie.
Preferably, the domain name processing method further includes:
classifying domain names included in the domain name library;
for a plurality of first domain names for leading wildcards in the result of the classification, performing:
transposing each of the first domain names;
mapping node bitmaps of various levels according to various characters included in the results after the first domain name is transferred and the positions of the characters in the results after the first domain name is transferred;
establishing a connection relation and a calling pointer for the node bitmaps of two adjacent levels according to the sequence of each character in the result of the first domain name after conversion;
and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
Preferably, the domain name processing method further includes:
for a plurality of second domain names for post wildcards or a plurality of third domain names for pre and post wildcards in the result of the classification, performing:
deleting wildcards included in the second domain name or the third domain name;
mapping node bitmaps of all levels according to all characters included in the second domain names or the third domain names after wildcard characters are deleted and the positions of all characters in the domain names;
establishing a connection relation and a calling pointer for the node bitmaps of two adjacent levels according to the sequence of each character in the second domain name or the third domain name;
and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
Preferably, the domain name processing method further includes:
for a plurality of fourth domain names without wildcards in the result of the classification, performing:
mapping node bitmaps of all levels according to all characters included in the fourth domain names and positions of the characters in the domain names;
establishing a connection relation and calling pointers for the node bitmaps of two adjacent levels according to the sequence of each character in the fourth domain name;
and constructing an accurate matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the hierarchies.
Preferably, the domain name processing method further includes: assigning a bitmap position for each character associated with a domain name, wherein the number of bits of the bitmap is no less than 38 bits;
the mapping out the node bitmaps of each hierarchy includes:
for each level, performing:
setting an initial node bitmap with each bit being 0;
determining a plurality of characters included by the hierarchy;
and setting the value of the bitmap position corresponding to each character in the initial node bitmap as 1.
In a second aspect, an embodiment of the present invention provides a domain name processing apparatus, including: a receiving unit, a domain name matching unit and a domain name processing unit, wherein,
the receiving unit is used for receiving the domain name to be accessed;
the domain name matching unit is used for matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in the domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library;
and the domain name processing unit is used for determining a matching result and processing the domain name according to the matching result.
Preferably, the domain name processing apparatus further comprises: a classification unit and a dictionary tree construction unit, wherein,
the classification unit is used for classifying the domain names included in the domain name library;
the dictionary tree construction unit is configured to execute, for a plurality of first domain names having only leading wildcards in the result of the classification: transposing each of the first domain names; mapping node bitmaps of various levels according to various characters included in the results after the first domain name is transferred and the positions of the characters in the results after the first domain name is transferred; establishing a connection relation and a calling pointer for the node bitmaps of two adjacent levels according to the sequence of each character in the result of the first domain name after conversion; and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
One embodiment of the above invention has the following advantages or benefits: because the domain names to be accessed are respectively matched with different dictionary trees, the fuzzy matching dictionary tree is formed by the domain names including wildcards in the domain name library, and the accurate matching dictionary tree is formed by the domain names including complete character strings in the domain name library, the structural complexity of the dictionary tree is effectively reduced, and meanwhile, the domain name matching efficiency can be effectively improved through the dictionary tree matching, the domain name matching efficiency is improved, and the domain name processing efficiency can be effectively improved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic diagram of a main flow of a domain name processing method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a main flow of selecting a fuzzy matching trie for a domain name to be accessed according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a main flow of constructing a first trie according to an embodiment of the present invention;
FIG. 4 is a diagram of a first trie structure, according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a main flow of constructing a second dictionary tree or a third dictionary tree according to an embodiment of the present invention;
FIG. 6 is a diagram of a second trie structure, according to an embodiment of the present invention;
FIG. 7 is a diagram of a third trie structure, according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of a main flow of constructing an exact match dictionary tree, according to an embodiment of the present invention;
FIG. 9 is a diagram of an exact match dictionary tree structure according to an embodiment of the present invention;
FIG. 10 is a schematic diagram of the main flow of mapping out node bitmaps for various levels according to an embodiment of the present invention;
fig. 11 is a schematic diagram of the main units of a domain name processing apparatus according to an embodiment of the present invention;
FIG. 12 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 13 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The Domain Name (english: Domain Name), also called network Domain, is the Name of a certain computer or computer group on the Internet composed of a string of names separated by points, and is used for locating and identifying (sometimes also referred to as geographical location) the computer during data transmission.
Currently, the limit for the length of the domain name at each level is 63 characters, and the total length of the domain name cannot exceed 253 characters. Domain names are also limited to a subset of ASCII characters, which prevents many other languages from properly representing their names and words.
In addition, there is no distinction between case and case in domain names. The domain name cannot generally exceed level 5, with the level going high from left to right domains, with high level domains containing low level domains. The domain name is unique throughout the Internet, and the lower level sub-domain names are not allowed to be duplicated when the higher level sub-domain names are the same. A server can only have one IP address but can have multiple domain names.
In the field of secure access, a domain name library is generally required to be constructed for accessing a white list and/or a black list, that is, a secure domain name (i.e., a domain name in the white list) and/or a domain name with a risk (i.e., a domain name in the black list) are stored in the domain name library, some of the domain names in the domain name library are set to be a complete domain name to access a corresponding website, and some of the domain names are configured to be wildcards and a part of fields of the domain names to represent the corresponding website. That is, some domain names in the domain name library have wildcards, and some domain names are complete domain names, and in order to accurately detect the domain name to be accessed and improve the efficiency of processing the domain name, the embodiment of the invention provides a domain name processing method.
Fig. 1 is a domain name processing method according to an embodiment of the present invention, and as shown in fig. 1, the domain name processing method may include the following steps:
step S101: receiving a domain name to be accessed;
the domain name to be accessed received in this step may be a domain name of a website which the user wants to access and is input by the user, or a domain name of a client which the user opens through a terminal. The domain name to be visited is generally a domain name having a complete field. For example, a website has a domain name of www.abcdefg.com.cn. For the domain name to be accessed, the domain name which can be configured to have a complete field in the domain name library is www.abcdefg.com.cn; it is also possible to configure a domain name having a wildcard character such as bcdefg.com.cn, www.abcdef, abcdefg, abcdefg.com.cn, www.abcde, www.abcdefg, bcdef, etc., where "is a wildcard character.
Step S102: matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in a domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library;
the domain names selected to form the fuzzy matching dictionary tree and the exact matching dictionary tree are different, and the domain name including wildcards to form the fuzzy matching dictionary tree means that the domain name including wildcards in the domain name library, for example, the aforementioned www.abcdefg.com.cn, as it can be set as a website having wildcards in the domain name library, for example, bcdefg.
In addition, in this step, a specific implementation manner of matching the domain name to be accessed with the preset exact matching dictionary tree and the fuzzy matching dictionary tree may be: matching the domain name to be accessed with an accurate matching dictionary tree or a fuzzy matching dictionary tree, if the matching is successful, ending the current process, if the matching is failed, further matching the domain name to be accessed with the unmatched fuzzy matching dictionary tree or the unmatched accurate matching dictionary tree, for example, matching the domain name to be accessed with the accurate matching dictionary tree, and if the matching is successful, directly processing the domain name to be accessed; and if the matching fails, matching the domain name to be accessed with the fuzzy matching dictionary tree. The other specific implementation mode for respectively matching the domain name to be accessed with the preset accurate matching dictionary tree and the fuzzy matching dictionary tree can match the domain name to be accessed with the accurate matching dictionary tree and the fuzzy matching dictionary tree in parallel through multiple threads.
The fuzzy matching dictionary tree and the accurate matching dictionary tree are respectively constructed for different types of domain names (domain names containing wildcards and complete domain names), so that the size of the dictionary tree can be reduced, and in addition, the domain name matching time can be effectively reduced by the dictionary tree matching mode, and the domain name matching efficiency is improved.
Step S103: and determining a matching result, and processing the domain name to be accessed according to the matching result.
The specific implementation manner of the step of processing the domain name to be accessed may include: if the matching result indicates that the matching is successful and the domain name to be accessed is in the white list, allowing the domain name to be accessed; if the matching result indicates that the matching is successful and the domain name to be accessed is in the blacklist, the domain name to be accessed is not allowed to be accessed; and if the matching result indicates that the matching fails, not allowing the domain name to be accessed or prompting the domain name to be accessed to input an error.
The embodiment shown in fig. 1, because the domain names to be accessed are respectively matched with different dictionary trees; because the fuzzy matching dictionary tree is composed of domain names including wildcards in the domain name library, and the precise matching dictionary tree is composed of domain names including complete character strings in the domain name library, the structural complexity of the dictionary tree is effectively reduced, and meanwhile, the domain name matching efficiency can be effectively improved through dictionary tree matching, the domain name matching efficiency is improved, and the domain name processing efficiency can be effectively improved.
In order to further improve the domain name matching efficiency and the domain name processing efficiency, the fuzzy matching dictionary tree of step S102 may include: the first dictionary tree belongs to a preposed wildcard domain name, the second dictionary tree belongs to a postposition wildcard domain name and the third dictionary tree belongs to the preposed and postposition wildcard domain names simultaneously; accordingly, as shown in fig. 2, the specific implementation of matching the domain name to be accessed and the fuzzy matching dictionary tree in step S102 may include the following steps:
step S201: matching the domain name to be accessed with the first dictionary tree, the second dictionary tree and the third dictionary tree according to a preset matching sequence; if the domain name to be accessed is successfully matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, executing the step S202; if the domain name to be accessed fails to be matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, executing the step S203;
the first dictionary tree is constructed from domain names containing leading wildcards (the domain name structure containing leading wildcards is x. com. cn or x. com). The second dictionary tree is composed of domain names containing post wildcards (the domain name structure www. The third trie is constructed from the domain name containing the post wildcard and the pre wildcard (the domain structure containing the post wildcard and the pre wildcard).
The matching order may be to match the first dictionary tree first, then the second dictionary tree, and finally the third dictionary tree. If the domain name to be accessed is successfully matched with the first dictionary tree, ending the matching process, and taking the successful matching with the first dictionary tree as a matching result; if the domain name to be accessed is not successfully matched with the first dictionary tree, matching the domain name to be accessed with the second dictionary tree, if the domain name to be accessed is successfully matched with the second dictionary tree, ending the matching process, and taking the successful matching with the second dictionary tree as a matching result; if the domain name to be accessed is not successfully matched with the second dictionary tree, matching the domain name to be accessed with a third dictionary tree, if the domain name to be accessed is successfully matched with the third dictionary tree, ending the matching process, and taking the successful matching with the third dictionary tree as a matching result; and if the domain name to be accessed is not successfully matched with the third dictionary tree, determining that the matching result is failure in matching with all dictionary trees.
Step S202: directly finishing the matching, taking the successful matching as a matching result, and finishing the current flow;
step S203: and continuing to match the domain name to be accessed with the next dictionary tree.
The fuzzy matching dictionary tree is divided into three dictionary trees, namely a first dictionary tree for the domain name of the preposed wildcard, a second dictionary tree for the domain name of the postposition wildcard and a third dictionary tree for the domain names of the preposed wildcard and the postposition wildcard, so that different dictionary trees can be selected for the wildcard at different positions in a more targeted manner, the matching range is further narrowed, and the domain name matching efficiency and the domain name processing efficiency are more effectively improved.
In the embodiment of the present invention, for the position difference of the wildcard, the above-mentioned implementation manner of performing the node included in the domain name to be accessed and the fuzzy matching dictionary tree is as follows: transposing the domain name to be accessed according to the condition of the domain name to be accessed and the first dictionary tree; the transposed result is matched with the first trie. For example, the domain name to be accessed is www.abcdefg.com.cn, and the position of the domain name to be accessed is the first dictionary tree of the front position. The domain name to be accessed may be obtained by transposing: and nc.moc.gfedcba.www, matching the transformed result nc.moc.gfedcba.www with the nodes included in the fuzzy matching dictionary tree (the fuzzy matching dictionary tree is the first dictionary tree) from the next node (the node at the highest level of the dictionary tree) connected by the root node, sequentially matching downwards, if the root node is taken as the first level, matching nc.moc.gfedcba.www from the second level, namely matching n with the second level, then matching c with the characters at the fourth level connected by n, and if the root node is taken as the first level, matching between c and m ". quadrature" with the characters at the fifth level connected by c, and so on. By transposing the domain name to be accessed, the domain name to be accessed can be matched more quickly and accurately.
In the embodiment of the present invention, for constructing the first dictionary tree for leading wildcards, as shown in fig. 3, the domain name processing method may further include the following steps:
step S301: classifying domain names included in a domain name library;
the classification is mainly to classify domain names in a domain name library into three classes. Wherein, the first domain name is the domain name containing the preposed wildcard; the second domain name is a domain name containing a post wildcard; the third class of domain names is domain names that contain a leading wildcard and a trailing wildcard. It is worth noting that there may be duplication of full domain names corresponding to the three types of domain names.
Step S302: transposing each first domain name for a plurality of first domain names for leading wildcards in the result of the classification;
the first domain name is the first domain name in the classification of step S301.
Step S303: mapping node bitmaps of various levels according to various characters included in the results after the first domain name is transferred and the positions of the characters in the results after the first domain name is transferred;
for example, the plurality of first domain names are: cc.cn, sabcd.com, sucbx.com.cn, askgm.com, etc., transposing each of them, transposing the result: moc.dcbas, nc.moc.xbcus, moc.mgksa, nc.moc.gfedcb. As shown in fig. 4, the second level below the root node is the first characters in the translated result, i.e., n and m, and the third level is the second characters in the translated result, i.e., c and o; the fourth level is the third character in the result after the transposition, namely, ", and c; the fifth level is the fourth character in the transposed result, i.e. m and "-"; the sixth level is the fifth character in the transposed result, i.e. o, d and m; and so on, namely the Nth character in each result after the conversion is arranged in the (N + 1) th layer in the dictionary tree, and each layer has no repeated character. The N is an integer not less than 1. It is worth noting that the dictionary tree is sequentially incremented from the upper level to the lower level. In fig. 4, the left side is the hierarchical relationship of each character, and the right side is the mapped node bitmap of a partial hierarchy and the corresponding hierarchical relationship, the bitmap mapping process mainly sets a preset number of character strings such as 64-bit character strings in advance, sets each character to 0, determines the position in the character string for each character, and when the character appears, the 0 of the corresponding position becomes 1. For example, setting the set bit for character c to the third bit in a 64-bit string, then the presence of c in a level changes the third bit in the 64-bit string to 1. The bitmap can effectively save storage space and computational resources.
Step S304: constructing a connection relation and calling pointers for the node bitmaps of two adjacent levels according to the sequence of each character in the result after each first domain name is transferred;
for example, if the result after the rotation is moc.dcbas, m is followed by o, o is followed by c, then the 15 th bit in the bitmap of the third level connected by the bitmap of the second level is 1, the 2 nd bit in the bitmap of the fourth level connected by the bitmap of the third level is 1, and the 13 th bit in the bitmap of the second level has a call pointer, the call pointer of the 13 th bit in the bitmap of the second level points to the 15 th bit in the bitmap of the third level, the 15 th bit in the bitmap of the third level also has a call pointer, and the 15 th bit in the bitmap of the third level also has a call pointer points to the 2 nd bit in the bitmap of the fourth level.
Step S304: and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
The fuzzy matching dictionary tree of this step is actually the first dictionary tree described above. The first trie may be identified by placing a wildcard ". sup." in front of the trie.
In the embodiment of the present invention, for constructing the second dictionary tree for the post wildcard or constructing the third dictionary tree for the pre wildcard and the post wildcard, as shown in fig. 5, the domain name processing method may further include the following steps:
step S501: for a plurality of second domain names for post wildcards or a plurality of third domain names for pre and post wildcards in the result of the classification, performing: deleting wildcards included in the second domain name or the third domain name;
the second domain name for the post wildcard refers to a domain name having the post wildcard in the domain name library and a domain name accessible through the post wildcard.
The third domain name for the leading wildcard and the trailing wildcard refers to a domain name having the leading wildcard and the trailing wildcard in the domain name repository and a domain name accessible by the leading wildcard and the trailing wildcard.
Step S502: mapping node bitmaps of all levels according to all characters included in the second domain names or the third domain names after the wildcard characters are deleted and the positions of all characters in the domain names;
for example, the domain name library includes a plurality of second domain names, such as ab, ac, ad, adc, bdc, and ade, and a second dictionary tree constructed by the plurality of second domain names is shown in fig. 6, where the left dictionary tree in fig. 6 is a dictionary tree formed by characters included in the domain name, and the right dictionary tree in fig. 6 is a node bitmap which maps each level in the left dictionary tree to a corresponding level. It can be seen from fig. 6 that the second level is the characters a, b, the third level is the characters b, c and d, and the fourth level is the characters c and e.
For another example, the domain name library includes a plurality of third domain names such as cab, ac, dad, eadc, fbdc, abc, ade, and the like, and a third dictionary tree constructed by the plurality of third domain names is as shown in fig. 7, in which the left dictionary tree in fig. 7 is a dictionary tree formed by the characters included in the domain name, and in the right side of fig. 7, the left dictionary tree is mapped to the corresponding node bitmap. It can be seen from fig. 7 that the second level is the characters a, f, d, e, c, the third level is the characters a, b, d, and the fourth level is the characters b, c, d, and e.
Step S503: according to the sequence of each character in the second domain name or the third domain name, a connection relation and a calling pointer are established for the node bitmaps of two adjacent levels;
for example, for bdc, b is followed by d, d is followed by c, then the 4 th bit in the bitmap of the third level connected by the bitmap of the second level is 1, the 3 rd bit in the bitmap of the fourth level connected by the bitmap of the third level is 1, and the 2 nd bit in the bitmap of the second level has a call pointer, the call pointer of the 2 nd bit in the second level points to the 4 th bit in the bitmap of the third level, the 4 th bit in the bitmap of the third level also has a call pointer, and the 4 th bit in the bitmap of the third level also has a call pointer to the 3 rd bit in the bitmap of the fourth level.
For example, for the character b in the third level, which connects c, b and d of the fourth level, the bits 2, 3 and 4 in the fourth level bitmap connected by the bitmap 0100 … of the third level are 1, and the corresponding bitmap 0100 … of the third level has a call pointer pointing to the bits 2, 3 and 4 in the bitmap of the fourth level.
It should be noted that the bitmap may be constructed in a manner that the characters of the next hierarchy connecting the same character may be placed in the same bitmap, or may be placed in different bitmaps. As shown in fig. 7, the character a in the second hierarchy connects the characters d and b in the third hierarchy at the same time, and the characters d and b can be placed in the same bitmap.
Step S504: and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
The fuzzy matching dictionary tree constructed by utilizing a plurality of second domain names is taken as a second dictionary tree; and constructing a fuzzy matching dictionary tree as a third dictionary tree by using a plurality of third domain names.
In the embodiment of the present invention, for constructing the exact matching dictionary tree, as shown in fig. 8, the domain name processing method may further include the following steps:
step S801: aiming at a plurality of fourth domain names without wildcards in the classification result, mapping node bitmaps of each hierarchy according to each character included in the plurality of fourth domain names and the position of each character in the domain name;
the fourth domain name is the complete domain name.
For example, the domain name library includes a plurality of fourth domain names, such as ab, ac, ad, adc, bdc, abc, and ade, and a second dictionary tree constructed by the plurality of fourth domain names is shown in fig. 9, where the left dictionary tree in fig. 9 is a dictionary tree formed by each character included in the domain name, and the right dictionary tree in fig. 9 is a node bitmap obtained by mapping each hierarchy in the left dictionary tree to correspond to each other. It can be seen from fig. 9 that the second level is the characters a, b, the third level is the characters b, c and d, and the fourth level is the characters c and e.
Step S802: according to the sequence of each character in the fourth domain name, constructing a connection relation and calling a pointer for the node bitmaps of two adjacent levels;
for example, for bdc, b is followed by d, d is followed by c, then bit 4 in the bitmap of the third level connected by the bitmap of the second level is 1, bit 3 in the bitmap of the fourth level connected by the bitmap of the third level is 1, and bit 2 in the second level has a call pointer, the call pointer of bit 2 in the second level points to bit 4 in the bitmap of the third level, bit 4 in the bitmap of the third level also has a call pointer, and bit 4 in the bitmap of the third level also has a call pointer points to bit 3 in the bitmap of the fourth level.
Step S803: and constructing an accurate matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the hierarchies.
Comparing fig. 9 and fig. 6, it can be found that although their dictionary tree structures are the same, fig. 6 contains a post wildcard, which is a second dictionary tree for matching a domain name containing a post wildcard, and fig. 9 is an exact matching dictionary tree, for example, for a part of fields of a domain name being all fields of other web page domain names, by constructing different types of dictionary trees, the distinction of different domain names can be realized, and by constructing different types of dictionary trees, domain names can be matched more accurately.
In the embodiment of the present invention, as shown in fig. 10, a specific implementation manner of mapping out the node bitmaps of each hierarchy may include the following steps:
step S1001: assigning a bitmap position for each character associated with the domain name, wherein the number of bits of the bitmap is no less than 38 bits;
for example, character a is assigned bit 1, character b is assigned bit 2, character c is assigned bit 3, character d is assigned bit 4, character "." is assigned bit 27, and so on. The requirement of different domain names can be met by setting the number of bits of the bitmap to be not less than 38.
Step S1002: setting an initial node bitmap each bit of which is 0 for each level;
step S1003: determining a plurality of characters included by a hierarchy;
step S1004: and setting the value of the bitmap position corresponding to each character in the initial node bitmap as 1.
E.g. the second level comprises the characters a, b, c, bits 1, 2 and 3 of the bitmap are set to 1. For another example, in the third hierarchical type, the characters b and c connected to the character a in the second hierarchical level construct a bitmap with bits 2 and 3 set to 1, and the bitmap is connected to the bitmap including the character a in the second hierarchical level. The specific bitmap structure can be as shown in fig. 4, 6, 7, 9.
As shown in fig. 11, an embodiment of the present invention provides a domain name processing apparatus 1100, where the domain name processing apparatus 1100 may include: a receiving unit 1101, a domain name matching unit 1102, and a domain name processing unit 1103, wherein,
a receiving unit 1101, configured to receive a domain name to be accessed;
a domain name matching unit 1102, configured to match a domain name to be accessed with a preset exact matching dictionary tree and a fuzzy matching dictionary tree, respectively, where the exact matching dictionary tree is formed by domain names in a domain name library that include complete character strings, and the fuzzy matching dictionary tree is formed by domain names in the domain name library that include wildcards;
a domain name processing unit 1103, configured to determine a matching result, and process the domain name according to the matching result.
In the embodiment of the present invention, the domain name processing unit 1103 is configured to match the domain name to be accessed with the exact matching dictionary tree, and if the matching is successful, directly process the domain name to be accessed; and if the matching fails, matching the domain name to be accessed with the fuzzy matching dictionary tree.
In an embodiment of the present invention, the fuzzy matching dictionary tree includes: the first dictionary tree belongs to a preposed wildcard domain name, the second dictionary tree belongs to a postposition wildcard domain name and the third dictionary tree belongs to the preposed and postposition wildcard domain names simultaneously; correspondingly, the domain name matching unit 1102 is further configured to match the domain name to be accessed with the first dictionary tree, the second dictionary tree, and the third dictionary tree according to a preset matching sequence; if the domain name to be accessed is successfully matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, directly finishing matching, and taking the matching success as a matching result; and if the domain name to be accessed fails to be matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, and the dictionary tree is not the last dictionary tree in the matching sequence, continuing to match the domain name to be accessed with the next dictionary tree.
In this embodiment of the present invention, the domain name matching unit 1102 is further configured to transpose the domain name to be accessed in response to the location being a front location; and matching the transposed result with nodes included in the first dictionary tree.
As shown in fig. 11, the domain name processing apparatus 1100 may further include: a classification unit 1104, and a dictionary tree construction unit 1105, wherein,
a classifying unit 1104, configured to classify domain names included in the domain name library;
a dictionary tree construction unit 1105, configured to perform, for a plurality of first domain names for leading wildcards in the result of the classification: transposing each first domain name; mapping node bitmaps of various levels according to various characters included in the results after the first domain name is transferred and the positions of the characters in the results after the first domain name is transferred; constructing a connection relation and calling pointers for the node bitmaps of two adjacent levels according to the sequence of each character in the result after each first domain name is transferred; and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
In this embodiment of the present invention, the dictionary tree building unit 1105 is further configured to perform, for a plurality of second domain names for post wildcards or a plurality of third domain names for pre wildcards and post wildcards in the classification result: deleting wildcards included in the second domain name or the third domain name; mapping node bitmaps of all levels according to all characters included in the second domain names or the third domain names after the wildcard characters are deleted and the positions of all characters in the domain names; according to the sequence of each character in the second domain name or the third domain name, a connection relation and a calling pointer are established for the node bitmaps of two adjacent levels; and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
In this embodiment of the present invention, the trie-dictionary constructing unit 1105 is further configured to, for a plurality of fourth domain names without wildcards in the classification result, map node bitmaps of each hierarchy according to each character included in the plurality of fourth domain names and a position of each character in the domain name; according to the sequence of each character in the fourth domain name, constructing a connection relation and calling a pointer for the node bitmaps of two adjacent levels; and constructing an accurate matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the hierarchies.
In this embodiment of the present invention, the trie constructing unit 1105 is further configured to assign a bitmap position to each character associated with the domain name, where the bitmap has no less than 38 bits; setting an initial node bitmap each bit of which is 0 for each level; determining a plurality of characters included by a hierarchy; and setting the value of the bitmap position corresponding to each character in the initial node bitmap as 1.
Fig. 12 shows an exemplary system architecture 1200 of a domain name processing method or a domain name processing apparatus to which an embodiment of the present invention can be applied.
As shown in fig. 12, the system architecture 1200 may include terminal devices 1201, 1202, 1203, a network 1204 and a server 1205. Network 1204 is the medium used to provide communication links between terminal devices 1201, 1202, 1203 and server 1205. Network 1204 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 1201, 1202, 1203 to interact with a server 1205 through a network 1204 to receive or send messages, etc. The terminal devices 1201, 1202, 1203 may have installed thereon various messenger client applications such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 1201, 1202, 1203 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 1205 may be a server that provides various services, such as a background management server (for example only) that provides matching and processing for domain names entered by the user into the terminal devices 1201, 1202, 1203 or accessed by the user with the terminal devices 1201, 1202, 1203. The backend management server may analyze and perform other processing on the received data such as the domain name, and feed back a processing result (for example, allowing access, denying access, just an example) to the terminal device.
It should be noted that the domain name processing method provided by the embodiment of the present invention is generally executed by the server 1205, and accordingly, the domain name processing apparatus is generally disposed in the server 1205.
It should be understood that the number of terminal devices, networks, and servers in fig. 12 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 13, shown is a block diagram of a computer system 1300 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 13 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 13, the computer system 1300 includes a Central Processing Unit (CPU)1301 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)1302 or a program loaded from a storage section 1308 into a Random Access Memory (RAM) 1303. In the RAM 1303, various programs and data necessary for the operation of the system 1300 are also stored. The CPU 1301, the ROM 1302, and the RAM 1303 are connected to each other via a bus 1304. An input/output (I/O) interface 1305 is also connected to bus 1304.
The following components are connected to the I/O interface 1305: an input portion 1306 including a keyboard, a mouse, and the like; an output section 1307 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1308 including a hard disk and the like; and a communication section 1309 including a network interface card such as a LAN card, a modem, or the like. The communication section 1309 performs communication processing via a network such as the internet. A drive 1310 is also connected to the I/O interface 1305 as needed. A removable medium 1311 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1310 as necessary, so that a computer program read out therefrom is mounted into the storage portion 1308 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communications component 1309 and/or installed from removable media 1311. The computer program executes the above-described functions defined in the system of the present invention when executed by a Central Processing Unit (CPU) 1301.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present invention may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a receiving unit, a domain name matching unit, and a domain name processing unit. Where the names of these units do not in some cases constitute a limitation on the unit itself, for example, a receiving unit may also be described as a "unit that receives a domain name to be accessed".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: receiving a domain name to be accessed; matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in a domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library; and determining a matching result, and processing the domain name to be accessed according to the matching result.
According to the technical scheme of the embodiment of the invention, the domain names to be accessed are respectively matched with different dictionary trees; because the fuzzy matching dictionary tree is composed of domain names including wildcards in the domain name library, and the precise matching dictionary tree is composed of domain names including complete character strings in the domain name library, the structural complexity of the dictionary tree is effectively reduced, and meanwhile, the domain name matching efficiency can be effectively improved through dictionary tree matching, the domain name matching efficiency is improved, and the domain name processing efficiency can be effectively improved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (12)
1. A domain name processing method, comprising:
receiving a domain name to be accessed;
matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in a domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library;
and determining a matching result, and processing the domain name to be accessed according to the matching result.
2. The domain name processing method according to claim 1, wherein the matching the domain name to be accessed with a preset exact matching dictionary tree and a preset fuzzy matching dictionary tree respectively comprises:
matching the domain name to be accessed with the exact matching dictionary tree,
if the matching is successful, directly processing the domain name to be accessed;
and if the matching fails, matching the domain name to be accessed with the fuzzy matching dictionary tree.
3. The domain name processing method according to claim 1,
the fuzzy matching dictionary tree comprises: the first dictionary tree belongs to a preposed wildcard domain name, the second dictionary tree belongs to a postposition wildcard domain name and the third dictionary tree belongs to the preposed and postposition wildcard domain names simultaneously;
the matching the domain name to be accessed and the fuzzy matching dictionary tree comprises:
matching the domain name to be accessed with the first dictionary tree, the second dictionary tree and the third dictionary tree according to a preset matching sequence;
if the domain name to be accessed is successfully matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, directly finishing matching and taking the successful matching as a matching result;
and if the domain name to be accessed is failed to be matched with any one of the first dictionary tree, the second dictionary tree and the third dictionary tree, and the dictionary tree is not the last dictionary tree in the matching sequence, continuing to match the domain name to be accessed with the next dictionary tree.
4. The domain name processing method according to claim 3, wherein the matching the domain name to be accessed with the nodes included in the fuzzy matching dictionary tree comprises:
for the case where the domain name to be accessed is associated with the first trie,
transposing the domain name to be accessed;
matching the transposed result with the first trie.
5. The domain name processing method according to claim 1, further comprising:
classifying domain names included in the domain name library;
for a plurality of first domain names for leading wildcards in the result of the classification, performing:
transposing each of the first domain names;
mapping node bitmaps of various levels according to various characters included in the results after the first domain name is transferred and the positions of the characters in the results after the first domain name is transferred;
establishing a connection relation and a calling pointer for the node bitmaps of two adjacent levels according to the sequence of each character in the result of the first domain name after conversion;
and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
6. The domain name processing method according to claim 5, further comprising:
for a plurality of second domain names for post wildcards or a plurality of third domain names for pre and post wildcards in the result of the classification, performing:
deleting wildcards included in the second domain name or the third domain name;
mapping node bitmaps of all levels according to all characters included in the second domain names or the third domain names after wildcard characters are deleted and the positions of all characters in the domain names;
establishing a connection relation and a calling pointer for the node bitmaps of two adjacent levels according to the sequence of each character in the second domain name or the third domain name;
and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
7. The domain name processing method according to claim 5, further comprising:
for a plurality of fourth domain names without wildcards in the result of the classification, performing:
mapping node bitmaps of all levels according to all characters included in the fourth domain names and positions of the characters in the domain names;
establishing a connection relation and calling pointers for the node bitmaps of two adjacent levels according to the sequence of each character in the fourth domain name;
and constructing an accurate matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the hierarchies.
8. The domain name processing method according to any one of claims 5 to 7,
further comprising: assigning a bitmap position for each character associated with a domain name, wherein the number of bits of the bitmap is no less than 38 bits;
the mapping out the node bitmaps of each hierarchy includes:
for each level, performing:
setting an initial node bitmap with each bit being 0;
determining a plurality of characters included by the hierarchy;
and setting the value of the bitmap position corresponding to each character in the initial node bitmap as 1.
9. A domain name processing apparatus, comprising: a receiving unit, a domain name matching unit and a domain name processing unit, wherein,
the receiving unit is used for receiving the domain name to be accessed;
the domain name matching unit is used for matching the domain name to be accessed with a preset accurate matching dictionary tree and a fuzzy matching dictionary tree respectively, wherein the accurate matching dictionary tree is formed by domain names including complete character strings in the domain name library, and the fuzzy matching dictionary tree is formed by domain names including wildcards in the domain name library;
and the domain name processing unit is used for determining a matching result and processing the domain name according to the matching result.
10. The domain name processing apparatus according to claim 9, characterized by further comprising: a classification unit and a dictionary tree construction unit, wherein,
the classification unit is used for classifying the domain names included in the domain name library;
the dictionary tree construction unit is configured to execute, for a plurality of first domain names having only leading wildcards in the result of the classification: transposing each of the first domain names; mapping node bitmaps of various levels according to various characters included in the results after the first domain name is transferred and the positions of the characters in the results after the first domain name is transferred; establishing a connection relation and a calling pointer for the node bitmaps of two adjacent levels according to the sequence of each character in the result of the first domain name after conversion; and constructing a fuzzy matching dictionary tree by using the node bitmaps, the connection relations and the calling pointers of all the levels.
11. A domain name processing electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.
12. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110572397.1A CN113312549B (en) | 2021-05-25 | 2021-05-25 | Domain name processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110572397.1A CN113312549B (en) | 2021-05-25 | 2021-05-25 | Domain name processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113312549A true CN113312549A (en) | 2021-08-27 |
| CN113312549B CN113312549B (en) | 2024-01-26 |
Family
ID=77374589
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110572397.1A Active CN113312549B (en) | 2021-05-25 | 2021-05-25 | Domain name processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113312549B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120130983A1 (en) * | 2010-11-24 | 2012-05-24 | Microsoft Corporation | Efficient string pattern matching for large pattern sets |
| CN103024092A (en) * | 2011-09-28 | 2013-04-03 | 中国移动通信集团公司 | Method, system and device for blocking domain |
| US20140089344A1 (en) * | 2012-09-25 | 2014-03-27 | Samsung Electronics Co., Ltd | Method and apparatus for url address search in url list |
| CN104537107A (en) * | 2015-01-15 | 2015-04-22 | 中国联合网络通信集团有限公司 | URL storage matching method and device |
| CN104794158A (en) * | 2015-02-09 | 2015-07-22 | 国家计算机网络与信息安全管理中心 | Domain name data repeated detection and fast index method in boundscript window |
| CN105095369A (en) * | 2015-06-29 | 2015-11-25 | 北京金山安全软件有限公司 | Website matching method and device |
| WO2016201819A1 (en) * | 2015-06-19 | 2016-12-22 | 安一恒通（北京）科技有限公司 | Method and apparatus for detecting malicious file |
| CN106776657A (en) * | 2015-11-25 | 2017-05-31 | 阿里巴巴集团控股有限公司 | A kind of domain name search method and equipment |
| CN107547671A (en) * | 2016-06-29 | 2018-01-05 | 中兴通讯股份有限公司 | A kind of URL matching process and device |
| US20180145993A1 (en) * | 2013-12-10 | 2018-05-24 | Nippon Telegraph And Telephone Corporation | Url matching apparatus, url matching method, and url matching program |
| CN112491873A (en) * | 2020-11-26 | 2021-03-12 | 杭州安恒信息技术股份有限公司 | Network threat detection method, device, equipment and storage medium based on dictionary tree |
| WO2021077585A1 (en) * | 2019-10-23 | 2021-04-29 | 深圳计算科学研究院 | Method and device for auto-completing query |
-
2021
- 2021-05-25 CN CN202110572397.1A patent/CN113312549B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120130983A1 (en) * | 2010-11-24 | 2012-05-24 | Microsoft Corporation | Efficient string pattern matching for large pattern sets |
| CN103024092A (en) * | 2011-09-28 | 2013-04-03 | 中国移动通信集团公司 | Method, system and device for blocking domain |
| US20140089344A1 (en) * | 2012-09-25 | 2014-03-27 | Samsung Electronics Co., Ltd | Method and apparatus for url address search in url list |
| US20180145993A1 (en) * | 2013-12-10 | 2018-05-24 | Nippon Telegraph And Telephone Corporation | Url matching apparatus, url matching method, and url matching program |
| CN104537107A (en) * | 2015-01-15 | 2015-04-22 | 中国联合网络通信集团有限公司 | URL storage matching method and device |
| CN104794158A (en) * | 2015-02-09 | 2015-07-22 | 国家计算机网络与信息安全管理中心 | Domain name data repeated detection and fast index method in boundscript window |
| WO2016201819A1 (en) * | 2015-06-19 | 2016-12-22 | 安一恒通（北京）科技有限公司 | Method and apparatus for detecting malicious file |
| CN105095369A (en) * | 2015-06-29 | 2015-11-25 | 北京金山安全软件有限公司 | Website matching method and device |
| CN106776657A (en) * | 2015-11-25 | 2017-05-31 | 阿里巴巴集团控股有限公司 | A kind of domain name search method and equipment |
| CN107547671A (en) * | 2016-06-29 | 2018-01-05 | 中兴通讯股份有限公司 | A kind of URL matching process and device |
| WO2021077585A1 (en) * | 2019-10-23 | 2021-04-29 | 深圳计算科学研究院 | Method and device for auto-completing query |
| CN112491873A (en) * | 2020-11-26 | 2021-03-12 | 杭州安恒信息技术股份有限公司 | Network threat detection method, device, equipment and storage medium based on dictionary tree |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113312549B (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10936669B2 (en) | Object clustering method and system | |
| CN108628811B (en) | Address text matching method and device | |
| CN110471848B (en) | Method and device for dynamically returning message | |
| CN111400504A (en) | Method and device for identifying enterprise key people | |
| JP7241122B2 (en) | Smart response method and device, electronic device, storage medium and computer program | |
| CN111858586A (en) | Data processing method and device | |
| CN113010405A (en) | Application program testing method and device | |
| CN111107181B (en) | NAT rule matching method and device, electronic equipment and storage medium | |
| CN114443076A (en) | Mirror image construction method, device, equipment and storage medium | |
| CN113904943A (en) | Account detection method and device, electronic equipment and storage medium | |
| CN113312560A (en) | Group detection method and device and electronic equipment | |
| US20210150289A1 (en) | Text classification for input method editor | |
| CN113761565A (en) | Data desensitization method and apparatus | |
| CN111951112A (en) | Intelligent contract execution method based on block chain, terminal equipment and storage medium | |
| US20240275848A1 (en) | Content initialization method, electronic device and storage medium | |
| CN116346777A (en) | Dictionary tree domain name matching method, device, equipment and storage medium | |
| CN113312549B (en) | Domain name processing method and device | |
| CN111026629A (en) | Method and device for automatically generating test script | |
| US11662927B2 (en) | Redirecting access requests between access engines of respective disk management devices | |
| CN113239687B (en) | Data processing method and device | |
| CN111784239B (en) | Method and device for determining dispatch network point, electronic equipment and storage medium | |
| CN113362097B (en) | User determination method and device | |
| CN113691403A (en) | Topological node configuration method, related device and computer program product | |
| CN113282489A (en) | Interface testing method and device | |
| CN113204613A (en) | Address generation method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |