Network search method, network search system and computer device
By introducing a proxy query mechanism in the information retrieval system, generating a proxy query group for network search, the problem that network search engines may leak user privacy is solved, and higher network search security and efficiency are achieved.
Patent Information
- Application Number
- CN202411877180.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-19
- Publication Date
- 2025-03-25
- Estimated Expiration
- 2044-12-19
AI Technical Summary
Existing online search engines may disclose user privacy information in query log records, resulting in privacy issues and improper data tracking, analysis and utilization.
By introducing a proxy query mechanism in the information retrieval system, the client receives the real query set and generates the proxy query set. The information retrieval system automatically determines the real query statement and the proxy query statement, and combines the mask query statement to generate the proxy query group for searching, avoiding directly submitting real queries to the search engine.
Effectively protect user privacy, prevent search engines from accessing and utilizing users' real privacy queries, improve the security of network searches, and improve the efficiency of network queries.
Smart Images

Figure CN119322881B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of computer technology, and in particular to a network search method, a network search system and a computer device. Background Art
[0002] Currently, users can query and obtain data by using web search engines. However, in order to achieve personalized web search, search engines keep query logs in order to optimize the retrieved information. Since the query logs of individual users record sensitive or non-sensitive information, it may cause privacy issues and leak a large amount of private information about users. Summary of the invention
[0003] Based on this, it is necessary to provide a network search method, a network search system and a computer device to address the above technical problems, which can prevent users' real privacy queries from being accessed by search engines and improve the security of network searches.
[0004] In a first aspect, the present application provides a network search method, which is applied to an information retrieval system, the information retrieval system communicates with a client and a search engine respectively, and the method comprises:
[0005] Receive multiple proxy query sets from a client; wherein the multiple proxy query sets are received by the client from a real query set; determine a number of proxy query statements corresponding to the real query set; generate by confusing the real query statements and the proxy query statements included in the real query set according to the set sorting information; each proxy query set includes a real query statement and at least one proxy query statement;
[0006] For each proxy query set, the real query statement and the proxy query statement of the current proxy query set are determined according to the set sorting information; the set sorting information is generated by the information retrieval system and the client in advance through negotiation;
[0007] Generate corresponding cover query statements according to the proxy query statements of the current proxy query set;
[0008] Generate a proxy query group according to the current proxy query set and the cover query statement;
[0009] Based on multiple proxy query groups, corresponding data is searched from the search engine to obtain search results fed back by the search engine;
[0010] The search results are returned to the client to instruct the client to display the search results corresponding to the actual query statement.
[0011] In one embodiment, generating a corresponding cover query statement according to the proxy query statement of the current proxy query set includes:
[0012] Use the greedy hill climbing heuristic algorithm to search for the cover query statement corresponding to the proxy query statement of the current proxy query set in the preset search space.
[0013] In one embodiment, after searching for corresponding data from a search engine based on multiple proxy query groups and obtaining search results fed back by the search engine, the method further includes:
[0014] Filtering target search results corresponding to multiple proxy query sets from the search results;
[0015] The target search results are returned to the client to instruct the client to display the search results corresponding to the actual query statement.
[0016] In one embodiment, the method further comprises:
[0017] Receive negotiation information sent by the client;
[0018] The setting sorting information is updated according to the negotiation information.
[0019] In a second aspect, the present application further provides a network search method, which is applied to a client, and the client communicates with a search engine through an information retrieval system, and the method includes:
[0020] Receive a real query set; the real query set includes at least one real query statement;
[0021] Determine a number of proxy query statements corresponding to the real query set;
[0022] The real query statement and the proxy query statement are confused according to the set sorting information to generate multiple proxy query sets; each proxy query set includes a real query statement and at least one proxy query statement; the set sorting information is generated by the information retrieval system and the client in advance through negotiation;
[0023] Sending multiple proxy query sets to the information retrieval system to instruct the information retrieval system to determine the real query statement and the proxy query statement of the current proxy query set according to the set ranking information for each proxy query set; generating corresponding cover query statements according to the proxy query statements of the current proxy query set; generating a proxy query group according to the current proxy query set and the cover query statements; searching for corresponding data from the search engine based on the multiple proxy query groups to obtain search results fed back by the search engine; and returning the search results to the client;
[0024] Receiving search results returned by the information retrieval system;
[0025] Filter out search results corresponding to the actual query statement from the search results;
[0026] The search results corresponding to the actual query statement are displayed.
[0027] In one embodiment, determining a number of proxy query statements corresponding to the real query set includes:
[0028] Identify the target topics of the real query set;
[0029] Select several proxy query statements from the query set corresponding to the target subject.
[0030] In one embodiment, a number of proxy query statements are selected from a query set corresponding to the target topic, including:
[0031] From the query set corresponding to the target topic, select several proxy query statements with the highest scores; the scores are obtained by the algorithm model performing a quality assessment on each proxy query statement in the target topic.
[0032] In one embodiment, the method further comprises:
[0033] Randomly generate position offsets;
[0034] Update the local set sorting information according to the position offset;
[0035] The negotiation information including the position offset is sent to the information retrieval system to instruct the information retrieval system to update the stored set sorting information according to the position offset.
[0036] In a third aspect, the present application further provides a network search system, the network search system comprising a client, an information retrieval system and a search engine, the information retrieval system communicates with the client and the search engine respectively; wherein:
[0037] The information retrieval system is used to perform the steps of the method described in the first aspect above;
[0038] The client is used to execute the steps of the method described in the second aspect above.
[0039] In a fourth aspect, the present application further provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the steps of the method described in the first aspect or the second aspect are implemented.
[0040] In the network search method, network search system and computer device, the client receives a real query set; determines a number of proxy query statements corresponding to the real query set; confuses the real query statements and proxy query statements included in the real query set according to the set sorting information to generate multiple proxy query sets; each proxy query set includes a real query statement and at least one proxy query statement; the information retrieval system receives multiple proxy query sets from the client; for each proxy query set, determines the real query statement and proxy query statement of the current proxy query set according to the set sorting information; the set sorting information is generated by the information retrieval system and the client in advance through negotiation; generates a corresponding cover query statement according to the proxy query statement of the current proxy query set; generates a proxy query group according to the current proxy query set and the cover query statement; based on the multiple proxy query groups, searches for corresponding data from the search engine to obtain the search results fed back by the search engine; and returns the search results to the client to instruct the client to display the search results corresponding to the real query statement. In the above manner, the information retrieval system provides proxy queries to protect the privacy of users. When retrieving information, the client does not directly issue a real query. Instead, it issues a proxy query set, from which the information retrieval system automatically determines the proxy query statement and the real query statement, and generates a proxy query group in combination with the cover query statement for network search. This can prevent the user's real privacy query from being accessed by the search engine, and effectively prevent the search engine from using user data for improper tracking, analysis, and use. Since the client and the information retrieval system negotiate and set the sorting information in advance, even if the query request issued by the client is captured, it is impossible to simply analyze the user's real query intention, further improving the security of network search. It can process a series of queries issued by the user at the same time, improving the efficiency of network queries. BRIEF DESCRIPTION OF THE DRAWINGS
[0041] In order to more clearly illustrate the technical solutions in the embodiments of the present application or related technologies, the drawings required for use in the embodiments of the present application or related technical descriptions will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.
[0042] Figure 1 is a schematic diagram of a traditional privacy search query solution in one embodiment;
[0043] Figure 2 An application environment diagram of a network search method in an embodiment;
[0044] Figure 3 A schematic diagram of a flow chart of a network search method in one embodiment;
[0045] Figure 4A schematic diagram of a flow chart of a network search method in another embodiment;
[0046] Figure 5 FIG. 4 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION
[0047] 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.
[0048] It is understandable that the private web search solutions currently proposed are intended to protect the privacy of users when using web search engines. Figure 1 In the traditional privacy search query solution, users enter query words on the search page, and cover queries are generated based on front-end expansion and back-end processing. The latent semantic indexing method is used to generate masked queries to hide the user's original query. However, in this method, it is difficult to generate realistic cover queries, resulting in low efficiency in query generation and query sending.
[0049] Based on this, the present application provides a network search method, a network search system and a computer device, which provide proxy queries through the information retrieval system to protect the privacy of users. When retrieving information, the real query will not be directly issued. The client issues a proxy query set, and the information retrieval system automatically determines the proxy query statement and the real query statement from it, and generates a proxy query group in combination with the cover query statement for network search, which can prevent the user's real privacy query from being accessed by the search engine, and effectively prevent the search engine from using user data for improper tracking, analysis and utilization. Because the client and the information retrieval system negotiate and set the sorting information in advance, even if the query request issued by the client is captured, it is impossible to simply analyze the user's real query intention, further improving the security of network search. It can process a series of queries issued by the user at the same time, which improves the efficiency of network query.
[0050] The network search method provided in the embodiment of the present application can be applied to Figure 2In the application environment shown. The network search system includes a client 202, an information retrieval system 204 and a search engine 206, and the information retrieval system 204 communicates with the client 202 and the search engine 206 respectively; the client 202 converts the user's real query into a proxy query set and provides it to the information retrieval system 204; the information retrieval system 204 automatically generates a proxy query group including a cover query, a real query and a proxy query based on the proxy query set, and searches on the search engine 206, so that the search engine 206 cannot distinguish whether the user is trying to retrieve information about the cover query or the real query. The information retrieval system 204 provides an information retrieval function for the information retrieved from the search engine 206 based on the proxy query set, which can prevent the user's real privacy query from being accessed by the search engine. When the user issues a series of similar continuous queries, the method provided by the present application can still meet the privacy protection of the user's query.
[0051] In an exemplary embodiment, Figure 3 As shown, a network search method is provided, which is applied to Figure 2 The information retrieval system 204 in FIG. 1 is used as an example to illustrate the invention, including:
[0052] Step S302, receiving multiple proxy query sets from a client; wherein the multiple proxy query sets are received by the client from a real query set; determining a number of proxy query statements corresponding to the real query set; and generating by confusing the real query statements and the proxy query statements included in the real query set according to the set sorting information; each proxy query set includes a real query statement and at least one proxy query statement.
[0053] The client provides a window for user input information and receives a real query set input by the user, which includes a series of real query statements input by the user. The real query statement is a query statement directly input by the user to express the real query intention. The client converts the real query statement and the proxy query statement, and confuses the real query statement with the proxy query statement to generate multiple proxy query sets. The sorting information is set to indicate the position of the real query statement in the proxy query set. The real query statement and the proxy query statement in the proxy query set are arranged according to the set sorting information, so that the information retrieval system can determine the position of the real query statement.
[0054] In an optional implementation, a proxy dictionary is pre-set, and the client determines a number of proxy query statements corresponding to each real query statement based on the proxy dictionary to achieve conversion between real queries and proxy queries. Exemplarily, the sorting information is set to indicate that the real query statement is set at the end of the proxy query set.
[0055] The information retrieval system serves as an intermediate processing device between the client and the search engine, receiving multiple proxy query sets sent by the client.
[0056] Optionally, when a user accesses the Internet on a cloud desktop, a network search request will be sent to a proxy forwarding module on the client through the proxy forwarding module. The client will convert the proxy query statement and generate a proxy query set based on the real query set in the network search request, and search for information by accessing the Internet. The response data returned by the Internet will be returned to the application in the cloud desktop along the original path to complete the network search.
[0057] Step S304: for each proxy query set, determine the real query statement and the proxy query statement of the current proxy query set according to the set sorting information; the set sorting information is generated by the information retrieval system and the client in advance through negotiation.
[0058] The information retrieval system determines the location of the real query statement in each proxy query set according to the pre-negotiated set sorting information, and further identifies the real query statement and the proxy query statement of each proxy query set.
[0059] In an optional implementation, the information retrieval system is provided with a mapping relationship table, which stores a mapping relationship between a statement identifier and a statement type. The statement identifier is used to identify each statement in a plurality of proxy query sets, and the statement type is used to indicate the type of each statement in the plurality of proxy query sets (i.e., any one of a proxy query, a real query, and a cover query). By identifying the real query statement and the proxy query statement of each proxy query set, a relevant mapping relationship can be constructed in the mapping relationship table.
[0060] Step S306: Generate a corresponding cover query statement according to the proxy query statement of the current proxy query set.
[0061] The information retrieval system generates a cover query statement corresponding to the proxy query statement. Optionally, the cover query statement includes sensitive information, which is different from the sensitive information corresponding to the real query statement.
[0062] In an optional implementation, the information retrieval system stores a large number of sensitive information sentences, from which sentences with similarities to the proxy query sentences less than a set threshold are searched as corresponding cover query sentences.
[0063] Step S308: Generate a proxy query group according to the current proxy query set and the cover query statement.
[0064] The proxy query statement, the cover query statement and the real query statement form a proxy query group. For each proxy query set, steps S304 to S308 are performed to form multiple proxy query groups.
[0065] In an optional implementation, a relevant mapping relationship is constructed in a mapping relationship table according to the generated cover query statement, so that the information retrieval system can determine which of the proxy query statements, which are real query statements, and which are cover query statements in the proxy query group.
[0066] In an optional implementation, the proxy query group is constructed by selecting a proxy query statement and setting it at the head of the proxy query group, setting the real query statement at the end of the proxy query group, and setting different cover query statements at other positions.
[0067] Step S310: Based on the multiple proxy query groups, corresponding data is searched from a search engine to obtain search results fed back by the search engine.
[0068] Wherein, each proxy query group is processed, and each query statement in the proxy query group is searched based on a search engine to obtain a plurality of search results fed back by the search engine.
[0069] Step S312: Return the search results to the client to instruct the client to display the search results corresponding to the actual query statement.
[0070] Optionally, the search results are marked with corresponding query statements, and the client identifies and displays the search results corresponding to the real query statements in the search results, and ignores other search results.
[0071] In an optional implementation, the information retrieval system indexes and sorts each search result based on the mapping relationship table, and feeds back the sorted search results to the client. Optionally, the information retrieval system and the client negotiate in advance the sorting information of the real query statement in the search results, and when the information retrieval system returns the search results, the search results of the real query statement are sorted in the corresponding position, and the client determines the search results in the corresponding position as the search results corresponding to the real query statement and displays them.
[0072] In the above network search method, the information retrieval system provides a proxy query to protect the privacy of the user. When searching for information, the real query will not be directly issued. The client issues a proxy query set, and the information retrieval system automatically determines the proxy query statement and the real query statement from it, and generates a proxy query group in combination with the cover query statement for network search, which can prevent the user's real privacy query from being accessed by the search engine, and effectively prevent the search engine from using user data for improper tracking, analysis and use. Because the client and the information retrieval system negotiate and set the sorting information in advance, even if the query request issued by the client is captured, it is impossible to simply analyze the user's real query intention, which further improves the security of network search. It can process a series of queries issued by the user at the same time, which improves the efficiency of network query.
[0073] In an exemplary embodiment, step S306 includes: using a greedy hill climbing heuristic algorithm to search for a cover query statement corresponding to a proxy query statement of the current proxy query set in a preset search space.
[0074] Among them, a large amount of sensitive information is set in the preset search space. The greedy hill climbing algorithm is used to search for the optimal solution in the preset search space and determine it as a cover query statement. Set an initial strategy, which corresponds to a sensitive information in the preset exploration space; determine the initial solution based on the similarity between the initial strategy and the proxy query statement; explore possible improvement plans in the preset search space; determine the solution with the lowest similarity with the proxy query statement among all possible solutions searched in the field of the initial strategy as the next strategy; repeat the exploration steps until the optimal solution is obtained; use the sensitive information corresponding to the optimal solution as the cover query statement. Based on the greedy hill climbing algorithm, one or more local optimal solutions can be determined to obtain one or more cover query statements.
[0075] Through the above method, the greedy hill climbing heuristic algorithm is used to explore the search space, improve the efficiency of generating cover query statements, and thus improve the efficiency of network search.
[0076] In an exemplary embodiment, after step S310, the method further includes: filtering out target search results corresponding to multiple proxy query sets from the search results; and returning the target search results to the client to instruct the client to display the search results corresponding to the real query statement.
[0077] Among them, the information search engine provides an information retrieval function. After obtaining a large number of search results from the search engine, the information search engine will filter the search results returned by the search engine according to the multiple proxy query sets (including real query statements and proxy query statements) previously provided by the client, and only return the search results corresponding to the proxy query set to the client. On the one hand, by filtering the search results, the amount of transmitted data can be reduced, and the efficiency of information transmission between the information retrieval system and the client can be improved; on the other hand, the information search engine provides the search results of the proxy query statements and the real query statements to the client, preventing a third party from determining the client's real search intention by capturing the search results, thereby improving the security of network search.
[0078] In an optional implementation, the information retrieval system sorts the search results of each statement according to the set sorting information and returns them to the client; the client can determine the search results corresponding to the actual query statement based on the set sorting information.
[0079] In an exemplary embodiment, the method further includes: receiving negotiation information sent by the client; and updating the setting sorting information according to the negotiation information.
[0080] Among them, the client and the information retrieval system establish a communication connection during the first communication process; after the connection is established, the communication parameters are transmitted and key exchange and identity authentication are performed; after the identity authentication is passed, the encryption algorithm is used to encrypt, transmit and decrypt the setting sorting information, so that the client and the information retrieval system negotiate consistent setting sorting information. The client initiates the negotiation process regularly at a certain time interval, or when a specific event occurs (such as session timeout, certificate update, etc.); the client sends a negotiation request to the information retrieval system, and the two parties re-exchange keys and identity authentication; based on the renegotiated parameters and key exchange results, a new session key is generated; based on the session key, the client encrypts the negotiation information and sends it to the information retrieval system; the information retrieval system decrypts the negotiation information to obtain the negotiation information, and updates the setting sorting information based on the negotiation information.
[0081] In an optional implementation, the negotiation information includes a position offset, which is used to indicate the adjustment amount of the current position of the real query statement in the proxy query set, and the position offset can be positive or negative. Exemplarily, the information retrieval system sets the sorting information to indicate that the position of the real query statement in the proxy query set is the kth statement, and if the received position offset is b, the set sorting information is updated, and the updated set sorting information indicates that the position of the real query statement in the proxy query set is the k+bth statement.
[0082] In an optional implementation, the negotiation information includes a preset identifier, and each time the information retrieval system obtains the preset identifier, the set ranking information is updated once; compared with before the update, the position of the actual query statement in the proxy query set in the updated set ranking information is adjusted by one position in the agreed direction (positive or negative).
[0083] Through the above method, the client and the information retrieval system regularly update the set sorting information, which can prevent a third party from capturing the regularity of the proxy query set and improve the security between the client and the information retrieval system.
[0084] In an exemplary embodiment, Figure 4 As shown, a network search method is provided, which is applied to Figure 2 The client 202 in FIG. 1 is used as an example to illustrate the present invention, including:
[0085] Step S402: receiving a real query set; the real query set includes at least one real query statement.
[0086] Step S404: determine a number of proxy query statements corresponding to the real query set.
[0087] Step S406, the real query statement and the proxy query statement are confused according to the set sorting information to generate multiple proxy query sets; each proxy query set includes a real query statement and at least one proxy query statement; the set sorting information is generated by the information retrieval system and the client in advance through negotiation.
[0088] Step S408, sending multiple proxy query sets to the information retrieval system to instruct the information retrieval system to determine, for each proxy query set, the real query statement and the proxy query statement of the current proxy query set according to the set sorting information; generating corresponding cover query statements according to the proxy query statements of the current proxy query set; generating a proxy query group according to the current proxy query set and the cover query statements; searching for corresponding data from the search engine based on the multiple proxy query groups to obtain search results fed back by the search engine; and returning the search results to the client.
[0089] Step S410: receiving search results returned by the information retrieval system.
[0090] Step S412: Filter out search results corresponding to the actual query statement from the search results.
[0091] Step S414: display the search results corresponding to the actual query statement.
[0092] It can be understood that the description of steps S402 to S414 can refer to the explanation of the aforementioned steps S302 to S312, and will not be repeated here.
[0093] In this embodiment, the information retrieval system provides proxy queries to protect the privacy of users. When searching for information, real queries are not directly issued. The client issues a proxy query set, and the information retrieval system automatically determines the proxy query statement and the real query statement from it, and generates a proxy query group in combination with the cover query statement to perform network search, which can prevent the user's real privacy query from being accessed by the search engine, and effectively prevent the search engine from using user data for improper tracking, analysis and use. Because the client and the information retrieval system negotiate and set the sorting information in advance, even if the query request issued by the client is captured, it is impossible to simply analyze the user's real query intention, further improving the security of network search. It can process a series of queries issued by the user at the same time, which improves the efficiency of network query.
[0094] In an exemplary embodiment, step S404 includes: identifying a target subject of the real query set; and selecting a number of proxy query statements from the query set corresponding to the target subject.
[0095] The client is provided with a proxy dictionary, which includes multiple topics and a query set corresponding to each topic (including multiple proxy query statements). The client converts the real query and the proxy query based on the proxy dictionary. In an optional implementation, for each topic in the proxy dictionary, the client uses the term frequency-inverse document frequency (TF-IDF) algorithm to calculate the sum of the TF-IDF values of the real query set and the words related to the current topic as the score of the current topic, and selects the topic with the highest score as the target topic of the real query set based on the scores of each topic in the real query set and the proxy dictionary.
[0096] In an optional implementation, several proxy query statements are randomly selected from a query set corresponding to the target topic.
[0097] In an exemplary embodiment, a number of proxy query statements are selected from the query set corresponding to the target topic, including: selecting a number of proxy query statements with the highest scores from the query set corresponding to the target topic; the scores are obtained by performing a quality assessment on each proxy query statement in the target topic by an algorithm model.
[0098] The proxy dictionary includes multiple topics, query sets corresponding to each topic, and the score of each proxy query statement in each query set. When constructing the proxy dictionary, for each topic, the quality (relevance, accuracy, and completeness) of each proxy query statement under the current topic is evaluated based on the algorithm model, and the score of each proxy query statement under each topic is determined and stored in the proxy dictionary. Relevance refers to the degree of association between the proxy query statement and the topic, accuracy refers to the accuracy of the proxy query statement in expressing the user's intention, and completeness refers to the amount of information contained in the proxy query statement.
[0099] In an exemplary embodiment, the method further includes: randomly generating a position offset; updating local set sorting information according to the position offset; and sending negotiation information including the position offset to the information retrieval system to instruct the information retrieval system to update the stored set sorting information according to the position offset.
[0100] Among them, the client periodically initiates the negotiation process at a certain time interval, or initiates the negotiation process when a specific event (such as session timeout, certificate update, etc.) occurs. During the negotiation process, a position offset is randomly generated to indicate the adjustment amount of the current position of the real query statement in the proxy query set. The position offset can be positive or negative. Exemplarily, the position of the real query statement set in the client in the proxy query set is the kth statement, the randomly generated position offset is b, and the local update sets the sorting information. The updated set sorting information is used to indicate that the position of the real query statement in the proxy query set is the k+bth statement. The client generates negotiation information based on the position offset and sends it to the information retrieval system. The position of the real query statement originally set in the information retrieval system in the proxy query set is the kth statement. After receiving the negotiation information, the setting sorting information is updated based on the position offset b. The updated setting sorting information is used to indicate that the position of the real query statement in the proxy query set is the k+bth statement.
[0101] Through the above method, the client and the information retrieval system regularly update the set sorting information, which can prevent a third party from capturing the regularity of the proxy query set and improve the security between the client and the information retrieval system.
[0102] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.
[0103] Based on the same inventive concept, the embodiment of the present application also provides a network search system for implementing the network search method involved above. The implementation scheme for solving the problem provided by the system is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more network search system embodiments provided below can refer to the limitations on the network search method above, and will not be repeated here.
[0104] In an exemplary embodiment, Figure 2 As shown, a network search system is provided, including a client 202, an information retrieval system 204 and a search engine 206, wherein the information retrieval system 204 communicates with the client 202 and the search engine 206 respectively.
[0105] In an exemplary embodiment, the information retrieval system 204 is used to perform the following steps: receiving multiple proxy query sets from the client 202; wherein the multiple proxy query sets are received by the client 202 as real query sets; determining a number of proxy query statements corresponding to the real query sets; generating by confusing the real query statements and the proxy query statements included in the real query sets according to the set sorting information; each proxy query set includes a real query statement and at least one proxy query statement; for each proxy query set, determining the real query statement and the proxy query statement of the current proxy query set according to the set sorting information; the set sorting information is generated by the information retrieval system 204 and the client 202 in advance through negotiation; generating corresponding cover query statements according to the proxy query statements of the current proxy query set; generating a proxy query group according to the current proxy query set and the cover query statement; based on the multiple proxy query groups, searching for corresponding data from the search engine 206 to obtain search results fed back by the search engine 206; and returning the search results to the client 202 to instruct the client 202 to display the search results corresponding to the real query statements.
[0106] In an exemplary embodiment, the information retrieval system 204 is configured to perform the following steps: using a greedy hill climbing heuristic algorithm, in a preset search space, searching for a cover query statement corresponding to a proxy query statement of the current proxy query set.
[0107] In an exemplary embodiment, the information retrieval system 204 is used to perform the following steps: filter out target search results corresponding to multiple proxy query sets from the search results; return the target search results to the client 202 to instruct the client 202 to display the search results corresponding to the real query statement.
[0108] In an exemplary embodiment, the information retrieval system 204 is used to perform the following steps: receiving negotiation information sent by the client 202; and updating the set sorting information according to the negotiation information.
[0109] In an exemplary embodiment, the client 202 is used to perform the following steps: receiving a real query set; the real query set includes at least one real query statement; determining a number of proxy query statements corresponding to the real query set; confusing the real query statement and the proxy query statement according to the set sorting information to generate multiple proxy query sets; each proxy query set includes a real query statement and at least one proxy query statement; the set sorting information is generated by the information retrieval system 204 and the client 202 in advance through negotiation; sending multiple proxy query sets to the information retrieval system 204 to instruct the information retrieval system 204 to determine the real query statement and the proxy query statement of the current proxy query set according to the set sorting information for each proxy query set; generating a corresponding cover query statement according to the proxy query statement of the current proxy query set; generating a proxy query group according to the current proxy query set and the cover query statement; searching for corresponding data from the search engine 206 based on the multiple proxy query groups to obtain search results fed back by the search engine 206; returning the search results to the client 202; receiving the search results returned by the information retrieval system 204; filtering out the search results corresponding to the real query statement from the search results; and displaying the search results corresponding to the real query statement.
[0110] In an exemplary embodiment, the client 202 is used to perform the following steps: identifying a target subject of a real query set; and selecting a number of proxy query statements from the query set corresponding to the target subject.
[0111] In an exemplary embodiment, the client 202 is used to perform the following steps: selecting several proxy query statements with the highest scores from the query set corresponding to the target topic; the scores are obtained by performing a quality assessment on each proxy query statement in the target topic by an algorithm model.
[0112] In an exemplary embodiment, the client 202 is used to perform the following steps: randomly generate a location offset; update local set sorting information according to the location offset; send negotiation information containing the location offset to the information retrieval system 204 to instruct the information retrieval system 204 to update the stored set sorting information according to the location offset.
[0113] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 5As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication 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 network search method is implemented.
[0114] Those skilled in the art will understand that Figure 5 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.
[0115] In an exemplary embodiment, a computer device is provided, comprising a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the following steps when executing the computer program: receiving multiple proxy query sets from a client; wherein the multiple proxy query sets are received by the client from a real query set; determining a number of proxy query statements corresponding to the real query set; generating by confusing the real query statements and the proxy query statements included in the real query set according to set sorting information; each proxy query set includes a real query statement and at least one proxy query statement; for each proxy query set, determining the real query statement and the proxy query statement of the current proxy query set according to the set sorting information; the set sorting information is generated by negotiation in advance between an information retrieval system and a client; generating corresponding cover query statements according to the proxy query statements of the current proxy query set; generating a proxy query group according to the current proxy query set and the cover query statement; based on the multiple proxy query groups, searching for corresponding data from a search engine to obtain search results fed back by the search engine; and returning the search results to the client to instruct the client to display the search results corresponding to the real query statements.
[0116] In one embodiment, when the processor executes the computer program, the following steps are further implemented: using a greedy hill climbing heuristic algorithm to search for a cover query statement corresponding to the proxy query statement of the current proxy query set in a preset search space.
[0117] In one embodiment, when the processor executes the computer program, the following steps are also implemented: from the search results, target search results corresponding to multiple proxy query sets are screened out; and the target search results are returned to the client to instruct the client to display the search results corresponding to the real query statement.
[0118] In one embodiment, when the processor executes the computer program, the following steps are further implemented: receiving negotiation information sent by the client; and updating the set sorting information according to the negotiation information.
[0119] In one embodiment, when the processor executes the computer program, the following steps are further implemented: receiving a real query set; the real query set includes at least one real query statement; determining a number of proxy query statements corresponding to the real query set; confusing the real query statement and the proxy query statement according to the set sorting information to generate multiple proxy query sets; each proxy query set includes a real query statement and at least one proxy query statement; the set sorting information is generated by the information retrieval system and the client in advance through negotiation; sending the multiple proxy query sets to the information retrieval system to instruct the information retrieval system to determine the real query statement and the proxy query statement of the current proxy query set according to the set sorting information for each proxy query set; generating a corresponding cover query statement according to the proxy query statement of the current proxy query set; generating a proxy query group according to the current proxy query set and the cover query statement; searching for corresponding data from the search engine based on the multiple proxy query groups to obtain search results fed back by the search engine; returning the search results to the client; receiving the search results returned by the information retrieval system; filtering out the search results corresponding to the real query statement from the search results; and displaying the search results corresponding to the real query statement.
[0120] In one embodiment, when the processor executes the computer program, the following steps are further implemented: identifying a target subject of the real query set; and selecting a number of proxy query statements from the query set corresponding to the target subject.
[0121] In one embodiment, when the processor executes the computer program, the following steps are also implemented: selecting several proxy query statements with the highest scores from the query set corresponding to the target topic; the scores are obtained by performing a quality assessment on each proxy query statement in the target topic by an algorithm model.
[0122] In one embodiment, when the processor executes the computer program, it also implements the following steps: randomly generating a position offset; updating local set sorting information according to the position offset; and sending negotiation information containing the position offset to the information retrieval system to instruct the information retrieval system to update the stored set sorting information according to the position offset.
[0123] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.
[0124] A person of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment method can be completed by instructing the relevant 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 the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, an artificial intelligence (AI) processor, etc., but are not limited to this.
[0125] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above 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 application.
[0126] 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 present application. It should be noted that, for a person of ordinary skill in the art, several modifications 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 present application shall be subject to the attached claims.
Claims
1. A network search method, characterized in that: The method is applied to an information retrieval system, the information retrieval system communicates with a client and a search engine respectively, and the method comprises: Receive multiple proxy query sets from the client; wherein the multiple proxy query sets are received by the client as real query sets; determine a number of proxy query statements corresponding to the real query sets; generate the real query statements included in the real query sets and the proxy query statements by mixing them according to the set sorting information; each proxy query set includes a real query statement and at least one proxy query statement; For each proxy query set, determining the real query statement and the proxy query statement of the current proxy query set according to set sorting information; the set sorting information is generated by the information retrieval system and the client in advance through negotiation; Generate a corresponding cover query statement according to the proxy query statement of the current proxy query set; wherein the information retrieval system stores a large number of sensitive information statements, and searches for statements whose similarity with the proxy query statement is less than a set threshold value as the corresponding cover query statement; Generate a proxy query group according to the current proxy query set and the cover query statement; Based on the multiple proxy query groups, searching for corresponding data from the search engine to obtain search results fed back by the search engine; The search results are returned to the client to instruct the client to display the search results corresponding to the actual query statement.
2. The method according to claim 1, characterized in that The step of generating a corresponding cover query statement according to the proxy query statement of the current proxy query set includes: A greedy hill climbing heuristic algorithm is used to search for a cover query statement corresponding to the proxy query statement of the current proxy query set in a preset search space.
3. The method according to claim 1, characterized in that After searching the corresponding data from the search engine based on the multiple proxy query groups and obtaining the search results fed back by the search engine, the method further includes: Filtering target search results corresponding to the multiple proxy query sets from the search results; The target search result is returned to the client to instruct the client to display the search result corresponding to the real query statement.
4. The method according to any one of claims 1 to 3, characterized in that The method further comprises: receiving negotiation information sent by the client; The setting sorting information is updated according to the negotiation information.
5. A network search method, characterized in that: The method is applied to a client, the client communicates with a search engine through an information retrieval system, and the method includes: Receive a real query set; the real query set includes at least one real query statement; Determine a number of proxy query statements corresponding to the real query set; The real query statement and the proxy query statement are confused according to the set sorting information to generate multiple proxy query sets; each proxy query set includes a real query statement and at least one proxy query statement; the set sorting information is generated by the information retrieval system and the client in advance through negotiation; The multiple proxy query sets are sent to the information retrieval system to instruct the information retrieval system to determine the real query statement and the proxy query statement of the current proxy query set according to the set ranking information for each proxy query set; generate corresponding cover query statements according to the proxy query statements of the current proxy query set; generate a proxy query group according to the current proxy query set and the cover query statements; based on the multiple proxy query groups, search for corresponding data from the search engine to obtain search results fed back by the search engine; return the search results to the client; wherein the information retrieval system stores a large number of sensitive information statements, and searches for statements whose similarity with the proxy query statements is less than a set threshold as corresponding cover query statements; Receiving search results returned by the information retrieval system; Filtering the search results corresponding to the real query statement from the search results; The search results corresponding to the real query statement are displayed.
6. The method according to claim 5, characterized in that The determining of a plurality of proxy query statements corresponding to the real query set includes: Identifying a target topic of the real query set; A number of proxy query statements are selected from the query set corresponding to the target subject.
7. The method according to claim 6, characterized in that The step of selecting a plurality of proxy query statements from the query set corresponding to the target subject includes: A number of proxy query statements with the highest scores are selected from the query set corresponding to the target topic; the scores are obtained by performing a quality assessment on each proxy query statement in the target topic by an algorithm model.
8. The method according to any one of claims 5 to 7, characterized in that The method further comprises: Randomly generate position offsets; updating the local set sorting information according to the position offset; The negotiation information including the position offset is sent to the information retrieval system to instruct the information retrieval system to update the stored setting sorting information according to the position offset.
9. A network search system, characterized in that: The network search system includes a client, an information retrieval system and a search engine, wherein the information retrieval system communicates with the client and the search engine respectively; wherein: The information retrieval system is used to perform the steps of the method according to any one of claims 1 to 4; The client is used to execute the steps of the method according to any one of claims 5 to 8.
10. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 8 are implemented.
Citation Information
Patent Citations
Intelligent retrieval method and system based on exploration and development knowledge graph and storage medium
CN116401350A
Data query method and related equipment
CN117349316A