Request domain name correction method and system based on cosine similarity

Abstract

The invention discloses a request domain name correction method and system based on cosine similarity. The problem of spelling errors possibly occurring when a user inputs a domain name is solved. According to the method, a domain name text library is established at a DNS server side, requested domain names are subjected to low-case processing, and the domain names are organized into different linked lists according to the length of the domain names. And when the domain name requested by the client does not exist, the server searches a similar domain name in the text library through a cosine similarity algorithm, and fills the record of the similar domain name into the additional segment of the DNS response to return. The client can adjust the caching strategy according to the returned similar record, so that when a user submits a correct domain name again, the locally cached record is directly used, and additional network requests are avoided. According to the method, the domain name query efficiency is improved, particularly when spelling errors are processed, resource utilization is optimized, and the user experience is improved.

Description

Technical Field

[0001] The present invention relates to the field of information technology, and in particular to a method and system for correcting a requested domain name based on cosine similarity. Background Art

[0002] In practical applications, DNS service plays an important role in addressing on the Internet. It uses domain names in character format that are more readable, and then uses resource records such as A or AAAA to complete the mapping of domain names to IP addresses, thereby replacing IP addresses that are difficult to remember.

[0003] However, as domain names are constantly added and used, short domain name resources are quickly exhausted, and a large number of domain names used are relatively long domain names within a certain acceptable range. This leads to spelling errors that may occur during the process of entering domain names, resulting in the domain name requested when the application initiates a DNS query not being the domain name the initiator expects. When this happens, since the domain name actually sent may not exist, the corresponding result will appear as NXDOMAIN, which confuses the initiator. In addition, after the request initiator discovers this spelling error and corrects it, it is necessary to initiate an additional request for the correct domain name, which may result in a certain amount of additional delay and consume a certain amount of additional DNS server bandwidth resources. Summary of the invention

[0004] Based on this, an embodiment of the present application provides a method and system for correcting a requested domain name based on cosine similarity. This method associates similar domain names to discover possible potential spelling errors on the server side, and returns the possible original request results in one response result, thereby reducing the negative impact that may occur in such situations.

[0005] In a first aspect, a method for correcting a requested domain name based on cosine similarity is provided, the method comprising:

[0006] A domain name text library is established on the server side. The domain name text library is used to store texts that have been requested and for which the corresponding domain names exist;

[0007] When the client sends a DNS query request, the server first checks whether the requested domain name exists. If the requested domain name does not exist, it returns the NXDOMAIN result, and the server enters the similar domain name matching process;

[0008] For each domain name in the selected linked list, perform cosine similarity matching;

[0009] Once domain names with similarity reaching the preset threshold are found, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client;

[0010] After receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client uses the similar records to intervene in the cache strategy, cache the records in the additional segment, and provide feedback to the user through the application about possible spelling errors.

[0011] Optionally, a domain name text library is established on the server side, including:

[0012] The text needs to be uniformly converted to lowercase before storage and organized in the form of a linked list. The length of the linked list can be set with an upper limit. When this upper limit is reached, the domain name data with lower request popularity is replaced according to the popularity of the request.

[0013] Optionally, establishing a domain name text library on the server side also includes:

[0014] Domain name texts of different lengths are stored in different linked lists. Different linked lists are organized through an array. The index value of the array corresponds to the length of the domain name text in the linked list minus 1.

[0015] Optionally, for each domain name in the selected linked list, a cosine similarity match is performed, including:

[0016] First, you need to segment the domain name, specifically according to each character;

[0017] Remove duplicate characters from the two domain names and put them into a dictionary data structure, and assign a unique value to each character;

[0018] According to the value in the dictionary, the domain name text is converted into an integer array, and the one-hot encoding of the two texts is calculated as the word frequency vector;

[0019] The cosine value of the angle between the two vectors is calculated based on the word frequency vector to obtain the similarity.

[0020] Optionally, once domain names with similarity reaching a preset threshold are found, the server fills the records of these similar domain names into the additional section of the DNS response and returns it to the client, which also includes:

[0021] The server defines a pseudo-resource record type for protocol extensions, named similar.

[0022] Optionally, the client uses similar records to intervene in the cache strategy. After caching the records in the additional segment, it also includes

[0023] When the user resubmits the correctly spelled domain name, the client directly uses the locally cached record, avoiding additional network requests and delays.

[0024] In a second aspect, a system for correcting a requested domain name based on cosine similarity is provided, the system comprising:

[0025] Establishing a module for establishing a domain name text library on the server side, the domain name text library is used to store texts that have been requested and the corresponding domain names exist;

[0026] The check module is used when the client sends a DNS query request. The server first checks whether the requested domain name exists. If the requested domain name does not exist, the NXDOMAIN result is returned, and the server enters the similar domain name matching process;

[0027] A matching module, for performing cosine similarity matching for each domain name in the selected linked list;

[0028] A return module is used for once finding domain names whose similarity reaches a preset threshold, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client;

[0029] Client module: After receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client uses similar records to intervene in the cache strategy, cache the records in the additional segment, and provide feedback to the user through the application about possible spelling errors.

[0030] In a third aspect, an electronic device is provided, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the method for requesting domain name correction described in any one of the first aspects is implemented.

[0031] In a fourth aspect, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the method for requesting domain name correction described in any one of the first aspects is implemented.

[0032] In a fifth aspect, a computer program product is provided, including a computer program / instruction, which, when executed by a processor, implements the method for requesting domain name correction described in any one of the first aspects.

[0033] The beneficial effects brought by the technical solution provided by the embodiment of the present application include at least:

[0034] (1) By implementing automatic correction of spelling errors in DNS queries, the problems users encounter due to domain name spelling errors are reduced, thereby improving the user experience when using Internet services.

[0035] (2) By returning similar domain names that may be correct in one DNS query, additional DNS queries caused by spelling errors are reduced, thereby saving bandwidth resources of the DNS server, reducing network latency, and improving network efficiency.

[0036] (3) Allows the client to intelligently adjust the cache strategy based on similar domain name records returned by the server, so that even in the case of spelling errors, users can quickly access the correct domain name, thereby improving access speed and system responsiveness. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the implementation methods of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for the implementation methods or the description of the prior art. Obviously, the drawings in the following description are only exemplary, and for ordinary technicians in this field, other implementation drawings can be derived from the provided drawings without creative work.

[0038] Figure 1 A flowchart of a method for correcting a requested domain name based on cosine similarity provided in an embodiment of the present application;

[0039] Figure 2 A block diagram of a request domain name correction system based on cosine similarity provided in an embodiment of the present application;

[0040] Figure 3 A schematic diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0041] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0042] In the description of the present invention, the terms "comprises", "has" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus comprising a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may also include other steps or units that are not explicitly listed but are inherent to these processes, methods, products or apparatuses, or steps or units added based on further optimization schemes conceived by the present invention.

[0043] In practical applications, DNS service plays an important role in addressing on the Internet. It uses domain names in character format that are more readable, and then uses resource records such as A or AAAA to complete the mapping of domain names to IP addresses, thereby replacing IP addresses that are difficult to remember.

[0044] However, as domain names are constantly added and used, short domain name resources are quickly exhausted, and a large number of domain names used are relatively long domain names within a certain acceptable range. This leads to spelling errors that may occur during the process of entering domain names, resulting in the domain name requested when the application initiates a DNS query not being the domain name the initiator expects. When this happens, since the domain name actually sent may not exist, the corresponding result will appear as NXDOMAIN, which confuses the initiator. In addition, after the request initiator discovers this spelling error and corrects it, it is necessary to initiate an additional request for the correct domain name, which may result in a certain amount of additional delay and consume a certain amount of additional DNS server bandwidth resources.

[0045] This application associates similar domain names to discover possible potential spelling errors on the server side, and returns the possible original request results in one response result, thereby reducing the negative impact that may occur in such situations.

[0046] Please refer to Figure 1 , which shows a flow chart of a method for correcting a requested domain name based on cosine similarity provided by an embodiment of the present application, the purpose of which is to alleviate the impact of such errors when input errors related to domain name spelling occur. The following steps may be included:

[0047] S1, establish a domain name text library on the server side, the domain name text library is used to store texts that have been requested and the corresponding domain names exist.

[0048] The server needs to establish a domain name text library to store texts that have been requested and for which the corresponding domain names exist. These texts need to be uniformly converted to lowercase before storage and organized in the form of linked lists. In order to optimize storage and search efficiency, an upper limit can be set for the length of the linked list. When this upper limit is reached, the domain name data with lower request popularity is replaced according to the popularity of the request. In addition, in order to narrow the search scope, domain name texts of different lengths can be stored in different linked lists, and these linked lists can be organized through an array, and the index value of the array corresponds to the length of the domain name text in the linked list minus 1.

[0049] S2, when the client sends a DNS query request, the server first checks whether the requested domain name exists. If the requested domain name does not exist, it returns the NXDOMAIN result, and the server enters the similar domain name matching process.

[0050] When the client sends a DNS query request, the server first checks whether the requested domain name exists. If the requested domain name does not exist, the server returns the NXDOMAIN result and enters the similar domain name matching process. In this process, the requested domain name is first converted to lowercase text form, and based on its length, a linked list with a length within a specified error range (e.g., length ±d) is selected for search.

[0051] S3, for each domain name in the selected linked list, perform cosine similarity matching.

[0052] For each domain name in the selected linked list, perform cosine similarity matching. The cosine similarity algorithm first needs to segment the domain name, which can be divided according to each character. Then, all the characters of the two domain names are removed and put into the dictionary data structure, and a unique value is assigned to each character. Next, according to the value in the dictionary, the domain name text is converted into an integer array, and the one-hot encoding (One-Hot) of the two texts is calculated as the word frequency vector. Finally, the cosine value of the angle between the two vectors is calculated based on the word frequency vector to obtain the similarity.

[0053] S4, once domain names with similarity reaching a preset threshold are found, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client.

[0054] Once a domain name with a similarity that reaches a preset threshold is found, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client. In order to inform the client that these records are based on similarity matching results, the server also needs to define a pseudo resource record (opt) type for protocol extension, named similar.

[0055] S5, after receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client uses the similar records to intervene in the cache strategy, cache the records in the additional segment, and provide feedback to the user through the application about possible spelling errors.

[0056] After receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client can use these records to intervene in the cache strategy, cache the records in the additional segment, and provide the user with possible spelling errors through the application. In this way, when the user resubmits the correctly spelled domain name, the client can directly use the locally cached records to avoid additional network requests and delays.

[0057] In an optional embodiment of the present application, the method can also be expanded into the following specific implementation process:

[0058] This solution involves a custom pseudo-resource record type (opt) agreed upon between the authority and the recursion. The opt record is named census type, and the domain name of the query request is examined through the data brought by this record. The key points of the solution include:

[0059] This solution uses the cosine similarity algorithm. When a request is received and the result is NXDOMAIN (no domain name), the DNS server searches for domain names with similar text to the requested domain name and fills the corresponding type of records into the DNS additional segment and returns them. Solution highlights:

[0060] (1) The server sets up a domain name text library that has been requested and has corresponding domain names. The textualized domain names will all be uniformly lowercase and organized in the form of a linked list. The linked list can be set with a length limit. When the maximum length is reached, the data corresponding to the domain name with lower popularity will be replaced according to the request popularity.

[0061] (2) When organizing the text corresponding to the domain name, in order to significantly narrow the search scope, texts of different lengths are placed in different linked lists according to the text length. The data structure used to organize these linked lists is an array, and the index value of each linked list in the array is the value corresponding to its length minus 1.

[0062] (3) If the request sent by the client receives a result other than NXDOMAIN, it can be returned according to normal logic, otherwise it will enter the similar domain name matching process.

[0063] (4) After starting the similar domain name matching process, it is first necessary to generate lowercase text data of the requested domain name for subsequent matching.

[0064] (5) According to the length of the text corresponding to the requested domain name, select the linked list whose length error is within the specified number d (according to the strategy). Set the length of the requested domain name to n, and the range of the selected linked list index is [nd,n+d].

[0065] (6) Traverse each linked list, perform cosine similarity matching, and select the highest one or several text entries whose similarity reaches a threshold (specified by the strategy; the threshold can also be set to a minimum value, indicating that there is no minimum similarity limit) (specified by the strategy).

[0066] (7) Cosine similarity algorithm steps:

[0067] A) First, perform word segmentation. For domain name text, just divide it according to each character.

[0068] B) Remove duplicates from all characters in the two domain names to be compared and put them into a dictionary data structure. If all characters contain a, b, ., c, o, and m, you can set the dictionary as follows:

[0069] D={'a':0,'b':1,'.':2,'c':3,'o':4,'m':5}

[0070] The keys in the dictionary correspond to each character, and the values ​​correspond to the position of the character in the dictionary, so the value corresponding to each character is unique.

[0071] C) Taking the two groups of text a.com and b.com as examples, their corresponding values ​​in the dictionary of step B are encoded respectively to obtain the following two integer arrays:

[0072] A=[0,2,3,4,5]

[0073] B=[1,2,3,4,5]

[0074] D) Use the dictionary data structure in step B and the two arrays in step C to calculate the one-hot encoding of the two sets of text as the word frequency vector (an array of the number of times each key in the dictionary appears in the two arrays):

[0075] VA=[1,0,1,1,1,1]

[0076] VB=[0,1,1,1,1,1]

[0077] E) Calculate the cosine value of the angle between the two vectors based on the word frequency vector, and the resulting value is the similarity (the larger the value, the more similar it is). The calculation formula is: S = (VA[0]*VB[0]+...+VA[n]*VB[n]) / (√(VA[0]2+...+VA[n]2)+√(VA[0]2+...+VA[n]2)).

[0078] For the two vectors VA and VB in the example, the corresponding n value is 5, and the similarity is calculated:

[0079] S=4 / (√5+√5)=0.894427191

[0080] (8) After selecting similar text that meets the conditions, it is necessary to re-search the data based on the domain name converted from the text, and fill the found request type record into the DNS additional segment of the response.

[0081] (9) In addition to filling in records of similar domain names, this scheme also defines a pseudo resource record (opt) type for protocol extension, named similar, which is used to inform the client that similar domain name records that may be useful have been returned.

[0082] (10) After the client receives the response, if it finds that the result is NXDOMAIN, it can confirm whether there are similar records available on the server side based on whether similar records are included. If so, it can be used to intervene in the cache strategy. In the case where the additional segment data would not be cached originally, the records in the additional segment are also cached, and by feeding back to the application, the application that can cooperate with this protocol extension will issue a prompt about possible spelling errors.

[0083] (11) When the request initiator resubmits the correctly spelled domain name, the required cache record can be found directly locally, avoiding additional delay effects.

[0084] Please refer to Figure 2 , which shows a block diagram of a request domain name correction system based on cosine similarity provided by an embodiment of the present application. Figure 2 As shown, the system may include:

[0085] Establishing a module for establishing a domain name text library on the server side, the domain name text library is used to store texts that have been requested and the corresponding domain names exist;

[0086] The check module is used when the client sends a DNS query request. The server first checks whether the requested domain name exists. If the requested domain name does not exist, the NXDOMAIN result is returned, and the server enters the similar domain name matching process;

[0087] A matching module, for performing cosine similarity matching for each domain name in the selected linked list;

[0088] A return module is used for once finding domain names whose similarity reaches a preset threshold, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client;

[0089] Client module: After receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client uses similar records to intervene in the cache strategy, cache the records in the additional segment, and provide feedback to the user through the application about possible spelling errors.

[0090] For the specific definition of the request domain name correction system based on cosine similarity, please refer to the definition of the request domain name correction method based on cosine similarity in the above text, which will not be repeated here. Each module in the above-mentioned request domain name correction system based on cosine similarity can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory in the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

[0091] In one embodiment, an electronic device is provided. The electronic device may be a computer, and its internal structure diagram may be as follows: Figure 3 As shown. The electronic device includes a processor, a memory and a network interface connected through a system bus. Among them, the processor of the device is used to provide computing and control capabilities. The memory of the device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to request domain name correction data based on cosine similarity. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a request domain name correction method based on cosine similarity is implemented.

[0092] Those skilled in the art will understand that Figure 3 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0093] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, which involves all or part of the processes in the above-mentioned embodiment method.

[0094] In one embodiment, a computer program product is also provided, including a computer program / instruction, which involves all or part of the process in the above embodiment method.

[0095] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing related hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in M ​​forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (SyMchliMk) DRAM (SLDRAM), memory bus (RaMbus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0096] The technical features of the above-described embodiments may be arbitrarily combined. To make the description concise, not all possible combinations of the technical features in the above-described embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0097] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be construed as limiting the scope of the patent application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent application shall be subject to the attached claims.

Claims

1. A method for correcting a requested domain name based on cosine similarity, characterized in that: The method comprises: A domain name text library is established on the server side. The domain name text library is used to store texts that have been requested and for which the corresponding domain names exist; When the client sends a DNS query request, the server first checks whether the requested domain name exists. If the requested domain name does not exist, it returns the NXDOMAIN result and the server enters the similar domain name matching process. For each domain name in the selected linked list, perform cosine similarity matching; Once domain names with similarity reaching the preset threshold are found, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client; After receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client uses the similar records to intervene in the cache strategy, cache the records in the additional segment, and provide feedback to the user through the application about possible spelling errors.

2. The method for requesting domain name correction according to claim 1, characterized in that: Establish a domain name text library on the server side, including: The text needs to be uniformly converted to lowercase before storage and organized in the form of a linked list. The length of the linked list can be set with an upper limit. When this upper limit is reached, the domain name data with lower request popularity is replaced according to the popularity of the request.

3. The domain name correction request method according to claim 1, characterized in that: Establishing a domain name text library on the server side also includes: Domain name texts of different lengths are stored in different linked lists. Different linked lists are organized through an array. The index value of the array corresponds to the length of the domain name text in the linked list minus 1.

4. The method for requesting domain name correction according to claim 1, characterized in that: For each domain name in the selected linked list, perform cosine similarity matching, including: First, you need to segment the domain name, specifically according to each character; Remove duplicate characters from the two domain names and put them into a dictionary data structure, and assign a unique value to each character; According to the value in the dictionary, the domain name text is converted into an integer array, and the one-hot encoding of the two texts is calculated as the word frequency vector; The cosine value of the angle between the two vectors is calculated based on the word frequency vector to obtain the similarity.

5. The method for requesting domain name correction according to claim 1, characterized in that: Once domain names with similarity reaching a preset threshold are found, the server fills the records of these similar domain names into the additional section of the DNS response and returns it to the client, including: The server defines a pseudo-resource record type for protocol extensions, named similar.

6. The method for requesting domain name correction according to claim 1, characterized in that: The client uses similar records to intervene in the cache strategy. After caching the records in the additional segment, it also includes When the user resubmits the correctly spelled domain name, the client directly uses the locally cached record, avoiding additional network requests and delays.

7. A request domain name correction system based on cosine similarity, characterized in that: The system comprises: Establishing a module for establishing a domain name text library on the server side, the domain name text library is used to store texts that have been requested and the corresponding domain names exist; The check module is used when the client sends a DNS query request. The server first checks whether the requested domain name exists. If the requested domain name does not exist, the NXDOMAIN result is returned, and the server enters the similar domain name matching process. A matching module, for performing cosine similarity matching for each domain name in the selected linked list; A return module is used for once finding domain names whose similarity reaches a preset threshold, the server fills the records of these similar domain names into the additional segment of the DNS response and returns it to the client; Client module: After receiving the DNS response, if the client finds that it is an NXDOMAIN result, it will check whether the response contains similar records. If so, the client uses similar records to intervene in the cache strategy, cache the records in the additional segment, and provide feedback to the user through the application about possible spelling errors.

8. An electronic device, characterized in that: The method comprises a memory and a processor, wherein the memory stores a computer program, and when the computer program is executed by the processor, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images