Information retrieval methods, systems, devices, computer equipment, and storage media

Abstract

This application relates to an information query method, system, apparatus, computer equipment, storage medium, and computer program product, and pertains to the field of cloud computing technology. The method includes: receiving an account identifier query message sent by a terminal; querying a target account identifier in a preset data information table to obtain a query result, wherein the preset data information table is established based on the weights of account identifiers corresponding to each object; if the query result fails, determining the target feature value corresponding to the target account identifier, and determining the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list; querying the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and sending the target object information to the terminal. Using this method, target object information can be retrieved based on the target account identifier without requiring manual input from the user, thus improving the efficiency and accuracy of resource transfer.

Description

Technical Field

[0001] This application relates to the field of cloud computing technology, and in particular to an information retrieval method, system, device, computer equipment, storage medium, and computer program product. Background Technology

[0002] With the development of cloud computing technology, users can transfer resources through mobile banking clients. Users can complete the resource transfer by entering information such as the target account identifier and the corresponding bank name.

[0003] In traditional technology, after a user enters the target account identifier, the mobile banking client will automatically display the corresponding primary target bank. Then, the user selects the corresponding secondary target bank or a specific target bank branch under the primary target bank to complete the resource transfer.

[0004] However, the current resource transfer method requires users to manually select a secondary target bank or a specific target bank branch under the primary target bank. If the user makes an error in the selection, the resource transfer may fail, thus resulting in low efficiency. Summary of the Invention

[0005] Therefore, it is necessary to provide an information query method, system, device, computer equipment, computer-readable storage medium, and computer program product that can improve the efficiency of resource transfer in response to the above-mentioned technical problems.

[0006] Firstly, this application provides an information retrieval method. The method includes:

[0007] The receiving terminal sends an account identifier query message, which carries the target account identifier;

[0008] The target account identifier is queried in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0009] If the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list;

[0010] In the storage node corresponding to the target node identifier, query the target object information corresponding to the target account identifier, and send the target object information to the terminal.

[0011] In one embodiment, before the account identifier query message sent by the receiving terminal, the method further includes:

[0012] Based on the message interaction records between the objects, extract the account identifier of each object and the object information corresponding to the account identifier;

[0013] The weight of each account identifier is calculated based on each message interaction record, each account identifier, the object information corresponding to the account identifier, and a preset weight calculation strategy.

[0014] The account identifiers are sorted in descending order of their respective weights to obtain an account identifier sequence. Based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to the account identifiers, a preset data information table is constructed.

[0015] In one embodiment, calculating the weight of each account identifier based on each message interaction record, each account identifier, the object information corresponding to the account identifier, and a preset weight calculation strategy includes:

[0016] For each account identifier, the number of messages sent and the number of messages successfully sent are obtained based on each message interaction record.

[0017] The weight of each account identifier is calculated based on the number of times the message was sent, the number of times the message was successfully sent, and the initial weight of the object corresponding to the account identifier.

[0018] In one embodiment, the method further includes:

[0019] Obtain a first data information table, which contains each account identifier and the object information corresponding to the account identifier;

[0020] The first data information table is divided into a preset number of sub-tables, and the database corresponding to each sub-table is determined. Each sub-table is then stored in its corresponding database.

[0021] The number of storage nodes corresponding to each sub-table is determined based on the preset number of databases, and the node identifier of each storage node is determined based on the Internet protocol address corresponding to each preset database.

[0022] The target circular linked list is generated based on the number of each storage node, the node identifier, and the pre-constructed initial circular linked list.

[0023] In one embodiment, after querying the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, the method further includes:

[0024] If no target object information corresponding to the target account identifier is found in the storage node corresponding to the target node identifier, a second data information table is obtained, which includes multiple object information.

[0025] Based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier, fuzzy matching is performed in the second data information table to obtain the target object information.

[0026] In one embodiment, the step of performing fuzzy matching in the second data information table based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier to obtain the target object information includes:

[0027] Based on the preset correspondence between object names and object identifier codes, the target object name corresponding to the target object identifier code contained in the target account identifier is obtained;

[0028] Based on the target object name and the second data information in the second data information table, the target object name is verified by a preset fuzzy matching verification algorithm. The target object information is obtained based on the verification result, which is used to indicate whether the fuzzy matching is successful.

[0029] In one embodiment, the method further includes:

[0030] In the second data information table, if fuzzy matching fails, the target object information returned by the terminal is obtained, and the target account identifier and the node identifier corresponding to the target object information are determined according to the target account identifier and the target circular linked list.

[0031] Based on the node identifier, the target account identifier and target object information are stored in the sub-table corresponding to the node identifier.

[0032] Secondly, this application also provides an information query system. The system includes a terminal, a first server, and a second server, wherein:

[0033] The terminal is used to obtain the target account identifier to be identified and send a first account identifier query message carrying the target account identifier to the first server.

[0034] The first server is configured to respond to the first account identifier query message by querying the target account identifier in a preset data information table, generating a query result message, and sending the query result message to the terminal.

[0035] The terminal is also configured to send a second account identifier query message carrying the target account identifier to the second service when the query result is a query failure.

[0036] The second server is configured to receive the second account identifier query message, determine the target feature value corresponding to the target account identifier, determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list, query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal.

[0037] Thirdly, this application also provides an information query device. The device includes:

[0038] The receiving module is used to receive an account identifier query message sent by the terminal, wherein the account identifier query message carries a target account identifier;

[0039] The first query module is used to query the target account identifier in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0040] The first determining module is used to determine the target feature value corresponding to the target account identifier when the query result is a query failure, and to determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list;

[0041] The second query module is used to query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal.

[0042] In one embodiment, the device further includes:

[0043] The extraction module is used to extract the account identifier of each object and the object information corresponding to the account identifier based on the message interaction records between each object;

[0044] The calculation module is used to calculate the weight of each account identifier based on each message interaction record, each account identifier, the object information corresponding to the account identifier, and a preset weight calculation strategy.

[0045] The construction module is used to sort the account identifiers in descending order of their respective weights to obtain an account identifier sequence, and to construct a preset data information table based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to the account identifiers.

[0046] In one embodiment, the computing module is specifically used for:

[0047] For each account identifier, the number of messages sent and the number of messages successfully sent are obtained based on each message interaction record.

[0048] The weight of each account identifier is calculated based on the number of times the message was sent, the number of times the message was successfully sent, and the initial weight of the object corresponding to the account identifier.

[0049] In one embodiment, the device further includes:

[0050] The first acquisition module is used to acquire a first data information table, which contains each account identifier and the object information corresponding to the account identifier.

[0051] The first storage module is used to divide the first data information table into a preset number of sub-tables, determine the database corresponding to each sub-table, and store each sub-table into the corresponding database.

[0052] The second determining module is used to determine the number of storage nodes corresponding to each of the sub-tables based on the number of preset databases, and to determine the node identifier of each of the storage nodes based on the Internet protocol address corresponding to each of the preset databases.

[0053] The generation module is used to generate a target circular linked list based on the number of each storage node, the node identifier, and the pre-constructed initial circular linked list.

[0054] In one embodiment, the device further includes:

[0055] The second acquisition module is used to acquire a second data information table when no target object information corresponding to the target account identifier is found in the storage node corresponding to the target node identifier. The second data information table includes multiple object information.

[0056] The matching module is used to perform fuzzy matching in the second data information table based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier to obtain the target object information.

[0057] In one embodiment, the matching module is specifically used for:

[0058] Based on the preset correspondence between object names and object identifier codes, the target object name corresponding to the target object identifier code contained in the target account identifier is obtained;

[0059] Based on the target object name and the second data information in the second data information table, the target object name is verified by a preset fuzzy matching verification algorithm. The target object information is obtained based on the verification result, which is used to indicate whether the fuzzy matching is successful.

[0060] In one embodiment, the device further includes:

[0061] The third determining module is used to obtain the target object information returned by the terminal in the case of fuzzy matching failure in the second data information table, and determine the target account identifier and the node identifier corresponding to the target object information based on the target account identifier corresponding to the target object information and the target circular linked list.

[0062] The second storage module is used to store the target account identifier and target object information into the sub-table corresponding to the node identifier according to the node identifier.

[0063] Fourthly, this application also provides a computer device. The computer device includes a memory and a processor, the memory storing a computer program, and the processor executing the computer program to perform the following steps:

[0064] The receiving terminal sends an account identifier query message, which carries the target account identifier;

[0065] The target account identifier is queried in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0066] If the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list;

[0067] In the storage node corresponding to the target node identifier, query the target object information corresponding to the target account identifier, and send the target object information to the terminal.

[0068] Fifthly, this application also provides a computer-readable storage medium. The computer-readable storage medium stores a computer program thereon, which, when executed by a processor, performs the following steps:

[0069] The receiving terminal sends an account identifier query message, which carries the target account identifier;

[0070] The target account identifier is queried in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0071] If the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list;

[0072] In the storage node corresponding to the target node identifier, query the target object information corresponding to the target account identifier, and send the target object information to the terminal.

[0073] Sixthly, this application also provides a computer program product. The computer program product includes a computer program that, when executed by a processor, performs the following steps:

[0074] The receiving terminal sends an account identifier query message, which carries the target account identifier;

[0075] The target account identifier is queried in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0076] If the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list;

[0077] In the storage node corresponding to the target node identifier, query the target object information corresponding to the target account identifier, and send the target object information to the terminal.

[0078] The aforementioned information query method, system, device, computer equipment, storage medium, and computer program product receive an account identifier query message sent by a terminal, the account identifier query message carrying a target account identifier; query the target account identifier in a preset data information table to obtain a query result, the preset data information table being established based on the weight of the account identifiers corresponding to each object; if the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list; query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal. Using this method, target object information can be obtained by querying based on the target account identifier, and by returning the target object information to the terminal, manual input by the user is not required, thus improving the efficiency and accuracy of resource transfer. Attached Figure Description

[0079] Figure 1 This is a diagram illustrating the application environment of an information query method in one embodiment.

[0080] Figure 2 This is a flowchart illustrating an information query method in one embodiment;

[0081] Figure 3 This is a flowchart illustrating the process of constructing a preset information table in one embodiment;

[0082] Figure 4 This is a flowchart illustrating the process of calculating the weight of each account identifier in one embodiment;

[0083] Figure 5 This is a schematic diagram of the process for generating a target circular linked list in one embodiment;

[0084] Figure 6 This is a schematic diagram of a process for obtaining target object information through fuzzy matching in one embodiment;

[0085] Figure 7 This is a schematic diagram of the process for obtaining target object information in one embodiment;

[0086] Figure 8 This is a schematic diagram illustrating the process of storing target account identifiers and target object information in one embodiment;

[0087] Figure 9 This is a signaling diagram illustrating the process of a terminal sending an account identifier query message to a first server and a second server in one embodiment.

[0088] Figure 10 This is a structural block diagram of an information query device in one embodiment;

[0089] Figure 11 This is an internal structural diagram of a computer device in one embodiment. Detailed Implementation

[0090] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0091] The information query method provided in this application embodiment can be applied to, for example... Figure 1In the application environment shown, terminal 102 communicates with server 104 via a network. Server 104 can be implemented as a standalone server or as a server cluster consisting of multiple servers. In one implementation, server 104 includes a first server 1041 and a second server 1042. The data storage system can store the data that server 104 needs to process. Server 104 can be deployed in the cloud for cloud computing. The data storage system can be integrated into server 104 or placed on other network servers. Terminal 102 can be, but is not limited to, various personal computers, laptops, smartphones, tablets, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, smart in-vehicle devices, etc. Portable wearable devices can include smartwatches, smart bracelets, head-mounted devices, etc.

[0092] In one embodiment, such as Figure 2 As shown, an information retrieval method is provided, which can be applied to... Figure 1 Taking the server-side as an example, the explanation includes the following steps:

[0093] Step 202: Receive an account identifier query message sent by the terminal, which carries the target account identifier.

[0094] The account identifier query message carries the target account identifier.

[0095] In this embodiment of the application, the first server receives an account identifier query message sent by the terminal. Then, the first server parses the account identifier query message to obtain the target account identifier, wherein the target account identifier can be the card number of the target object, such as a bank card number.

[0096] In one example, a user can perform resource transfers using a pre-installed program on their terminal, based on their resource transfer needs. The user enters the target account identifier (i.e., the account identifier of the recipient) required for the resource transfer into the terminal program. Then, the terminal generates an account identifier query message containing the target account identifier and sends the account identifier query message to the server.

[0097] Step 204: Query the target account identifier in the preset data information table to obtain the query result.

[0098] The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0099] In this embodiment, the first server obtains a pre-stored preset data information table, which may be stored in the first server's database. Then, the first server queries the preset data information table for the target object information corresponding to the target account identifier, and obtains the query result, specifically, the query result is either query success or query failure.

[0100] Step 206: If the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list.

[0101] In this embodiment, if the query result is unsuccessful, the first server returns the query result to the terminal. Then, the terminal sends an account identifier query message to the second server. The second server receives the account identifier query message and, based on the target account identifier, calculates the target feature value corresponding to the target account identifier by calling a feature value calculation algorithm. Specifically, the target feature value can be the hash value of the target account identifier. The second server then performs a modulo operation on the target feature value corresponding to the target account identifier according to a preset modulo strategy to obtain the target position value of the target account identifier. The preset modulo strategy can be to divide the target feature value by 2... 32 Perform the remainder calculation.

[0102] The second server determines the position of the target feature value within the target circular linked list based on the target position value and the corresponding feature value range of the target circular linked list. Specifically, the target position value can be a preset range of feature values ​​within the target circular linked list, for example, the feature value range can be 0 to 2. 32 -1, the second server can determine the target feature value between 0 and 2. 32 The position of -1 determines the position of the target feature value in the target circular linked list. Then, based on the position of the target feature value in the target circular linked list, the second server determines the candidate feature value that is greater than the target feature value and has the smallest difference from the target feature value within the feature value range. The node identifier corresponding to the candidate feature value is used as the target node identifier corresponding to the target feature value. The candidate feature value is obtained by the second server performing a modulo operation on the Internet Protocol Address (IP address) corresponding to the storage node according to a preset modulo strategy. The feature value range can include all feature values ​​corresponding to node identifiers.

[0103] If the query result is successful, the first server will return the target object information corresponding to the query result to the terminal.

[0104] In this application, any algorithm with eigenvalue calculation function can be used for eigenvalue calculation, such as hash algorithm. This application does not limit the specific algorithm used for eigenvalue calculation.

[0105] Step 208: In the storage node corresponding to the target node identifier, query the target object information corresponding to the target account identifier, and send the target object information to the terminal.

[0106] In this embodiment, for a target node identifier, the second server queries the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier to obtain the query result. If the query result is successful, the target object information is obtained. The second server sends the target object information to the terminal. If the query result is unsuccessful, the second server sequentially retrieves node identifiers in the target circular linked list in ascending order of node identifiers. For each node identifier, the second server queries the target account identifier in the storage node corresponding to that node identifier to obtain the query result. If the query result is still unsuccessful, the second server continues to query the target account identifier in the next storage node until all storage nodes fail to query. The second server then ends the query process and sends the query result "Query Failure" to the terminal.

[0107] In the above information query method, the receiving terminal sends an account identifier query message, which carries the target account identifier; the target account identifier is queried in a preset data information table to obtain the query result, the preset data information table is established based on the weight of the account identifiers corresponding to each object; if the query result is a query failure, the target feature value corresponding to the target account identifier is determined, and the target node identifier corresponding to the target feature value is determined according to the position of the target feature value in the target circular linked list; in the storage node corresponding to the target node identifier, the target object information corresponding to the target account identifier is queried, and the target object information is sent to the terminal. The target object information can be obtained by querying the target account identifier. By returning the target object information to the terminal, no manual input by the user is required, which improves the efficiency and accuracy of resource transfer.

[0108] In one embodiment, such as Figure 3 As shown, before step 202, the following steps are also included:

[0109] Step 302: Based on the message interaction records between the objects, extract the account identifier of each object and the object information corresponding to the account identifier.

[0110] In this embodiment of the application, the second server collects the account identifier (i.e., the bank card number of the resource transfer recipient) and the object information of the other bank in the resource transfer request based on the message interaction records of resource transfer between the objects. For example, after the second server sends a resource transfer message to the other bank from its own bank, it collects the account identifier (i.e., the bank card number of the resource transfer recipient) and the object information of the other bank in the resource transfer request. Based on the resource transfer result, if the resource transfer is successful, the second server extracts and saves the collected account identifier and the object information of the other bank. The object information may include preset object information, such as object name, line type and line number.

[0111] Optionally, the second server extracts and saves the account identifier and the other party's object information from all resource transfer message records in multiple resource transfer message records.

[0112] Step 304: Calculate the weight of each account identifier based on each message interaction record, each account identifier, the object information corresponding to the account identifier, and the preset weight calculation strategy.

[0113] In this embodiment, the second server, based on the account identifiers and object information extracted from each message interaction record, calculates the weight of each account identifier using a preset weight calculation strategy. This weight reflects the frequency and importance of each account identifier. The specific calculation process for the weights will be explained in detail later.

[0114] Step 306: Sort the account identifiers in descending order of their weights to obtain an account identifier sequence. Based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to the account identifiers, construct a preset data information table.

[0115] In this embodiment, the second server sorts the account identifiers according to their weights from largest to smallest, obtaining an account identifier sequence. Then, the second server retrieves the first preset number of account identifiers and their corresponding object information from the account identifier sequence. The second server then constructs a preset data information table by mapping each account identifier to its corresponding object information. The second server sends the preset data information table to the first server via network communication messages, and the first server stores the preset data information table.

[0116] The preset number can be determined based on the performance of the first server or the research and development needs. For example, the preset number can be 100,000. This application embodiment does not limit this.

[0117] In this embodiment, the account identifier and corresponding object information of each object are extracted through message exchange records between the objects. Based on the weight of the account identifier, a preset data information table is constructed. Through the above process, a preset data information table with higher weights can be constructed, obtaining object information corresponding to account identifiers with higher importance. This facilitates subsequent queries by the terminal through the first server for the target account identifier, thereby improving query efficiency.

[0118] In one embodiment, such as Figure 4 As shown, step 304 includes:

[0119] Step 402: For each account identifier, obtain the number of messages sent and the number of messages successfully sent corresponding to the account identifier based on the message interaction records.

[0120] The number of message transmissions and the number of successful message transmissions are determined based on the resource transfer results.

[0121] In this embodiment of the application, for each account identifier, the second server queries the account identifier in each message interaction record to obtain the number of message transmissions and the number of message successful transmissions corresponding to the account identifier.

[0122] Step 404: Calculate the weight of each account identifier based on the number of message transmissions, the number of successful message transmissions, and the initial weight of the object corresponding to the account identifier.

[0123] In this embodiment of the application, the second server calculates the weight of each account identifier based on a preset weight calculation strategy, the number of message transmissions, the number of successful message transmissions, and the initial weight of the object corresponding to the account identifier. The preset weight calculation is as follows:

[0124] h = a * (nm) * n * log2 n

[0125] Where h represents the weight of the account identifier, a represents the initial weight of the object corresponding to the account identifier (i.e., the line type, the first-level object name), n represents the number of message transmissions, m represents the message transmission threshold, and nm represents the number of successfully transmitted messages. Specifically, the initial weight of the object can be a preset weight; for example, when the object's line type is a preset bank, the initial weight is 70.

[0126] In this embodiment, by pre-setting a weight calculation strategy, the number of message transmissions, the number of successful message transmissions, and the initial weight of the object corresponding to the account identifier, the weight related to the object row and the frequency of message interaction records can be calculated, which improves the traceability of the weight and facilitates the subsequent construction of a pre-set data information table based on the weight.

[0127] In one embodiment, such as Figure 5 As shown, the above method also includes:

[0128] Step 502: Obtain the first data information table.

[0129] The first data information table is obtained based on the message interaction records between the objects. The first data information table contains account identifiers and object information. The object information may include object name, row type and row number.

[0130] In this embodiment of the application, the second server saves the message interaction records of successful resource transfer based on the message interaction records between each object, and obtains the first data information table.

[0131] Step 504: Divide the first data information table into a preset number of sub-tables, determine the database corresponding to each sub-table, and store each sub-table in its corresponding database.

[0132] The second server can be a second server cluster, which contains multiple sub-servers. Each sub-server can deploy a database, and there is a one-to-one correspondence between each sub-server and each database. The second server cluster can be configured with a target sub-server, which can be any one of the multiple sub-servers or a preset management sub-server corresponding to the multiple sub-servers. This application embodiment does not limit this.

[0133] In this embodiment, the first data information table is divided into a preset number of sub-tables according to the target sub-server. The preset number is the same as the number of sub-servers corresponding to the second server; for example, both the number of sub-servers corresponding to the second server and the preset number are 10. Then, the target sub-server sends network communication messages to the other sub-servers, storing each sub-table in the database of the corresponding sub-server, and using the database storing the corresponding sub-tables as a storage node.

[0134] Step 506: Determine the number of storage nodes corresponding to each sub-table based on the preset number of databases, and determine the node identifier of each storage node based on the Internet protocol address corresponding to each preset database.

[0135] In this embodiment, the second server determines the number of storage nodes corresponding to each sub-table based on a preset number of databases. For example, when the preset number of databases is 10, the number of storage nodes corresponding to each sub-table is 10. Then, the target sub-server sends network communication messages to the other sub-servers to obtain its own and the other sub-servers' Internet Protocol (IP) addresses. The target sub-server calculates the target feature value corresponding to each IP address by calling a feature value calculation algorithm. Specifically, the target feature value can be the hash value of each IP address.

[0136] The target sub-server performs a modulo operation on each Internet Protocol address according to a preset modulo strategy. Specifically, the target sub-server can perform a modulo operation on each Internet Protocol address. 32 The modulo operation is performed to obtain a preset number of feature values. The target sub-server assigns node identifiers to each storage node in ascending order of feature values.

[0137] The node identifier can be a character node identifier, such as Node1 to Node10; or it can be a numeric node identifier, such as 1 to 10. This application embodiment does not limit this.

[0138] Step 508: Generate the target circular linked list based on the number of storage nodes, the identifier of each node, and the pre-constructed initial circular linked list.

[0139] The initial circular linked list is constructed based on the consistent hashing algorithm.

[0140] In this embodiment, the second server maps node identifiers onto a pre-constructed initial circular linked list based on the number of storage nodes and node identifiers, generating a target circular linked list. When the second server receives new first data information, it calculates the feature value of the account identifier in the first data information by calling a feature value calculation algorithm. Then, it performs a modulo operation on the feature value according to a preset modulo strategy to obtain the target position value corresponding to the account identifier in the first data information. Based on the target position value, the second server queries the node identifier corresponding to the target position value within the feature value range of the target circular linked list. Based on the node identifier, the second server stores the first data information into the storage node corresponding to that node identifier.

[0141] Optionally, before storing the first data information into the storage node corresponding to the node identifier, the second server can also sequentially retrieve node identifiers in the target circular linked list according to the node identifiers in ascending order, and query the account identifier in the storage node corresponding to each node identifier to obtain the query result. For each storage node, if the query result is successful, the second server ends the query process; if the query result is unsuccessful, the second server continues to query the target account identifier in the next storage node until all storage nodes have failed to query. The second server then stores the first data information in the storage node corresponding to any node identifier according to the position value corresponding to the account identifier.

[0142] In this embodiment, based on the number of storage nodes and the node identifiers, the second server maps the node identifiers onto a pre-constructed initial circular linked list to generate a target circular linked list, facilitating subsequent queries of target account information through the target circular linked list. Because the circular linked list is constructed using a consistent hashing algorithm, the addition or deletion of sub-servers in the future does not affect other sub-servers, thus improving the high availability of the second server.

[0143] In one embodiment, such as Figure 6 As shown, step 208 includes:

[0144] Step 602: If no target object information corresponding to the target account identifier is found in the storage node corresponding to the target node identifier, obtain the second data information table.

[0145] The second data information table includes information on multiple objects.

[0146] In this embodiment of the application, if the second server does not find the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, it obtains a pre-stored second data information table containing object information.

[0147] Step 604: Based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier, perform fuzzy matching in the second data information table to obtain the target object information.

[0148] In this embodiment, the second server obtains the target object identification code from the target account identifier, such as the bank identification code (bank card BIN number, Bank Identification Number), and obtains the target object name based on the target object identification code. The second server then performs a fuzzy match in the second data information table based on the target object name and a fuzzy matching verification algorithm to obtain the target object information.

[0149] In this embodiment, the second server performs fuzzy matching in the second data information table based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier to obtain the target object information, which can improve the accuracy and robustness of querying target account information.

[0150] In one embodiment, such as Figure 7 As shown, step 604 includes:

[0151] Step 702: Based on the preset correspondence between object names and object identifier codes, obtain the target object name corresponding to the target object identifier code contained in the target account identifier.

[0152] In this embodiment of the application, the second server obtains the target object name corresponding to the target object identifier code contained in the target account identifier based on the pre-stored correspondence between object names and object identifier codes.

[0153] Step 704: Based on the target object name and each piece of second data information in the second data information table, the target object name is verified using a preset fuzzy matching verification algorithm to obtain the verification result, and the target object information is obtained based on the verification result.

[0154] The verification result indicates whether the fuzzy matching was successful.

[0155] In this embodiment of the application, the second server verifies the target object name based on the target object name and the object names in each of the second data information in the second data information table using a preset fuzzy matching verification algorithm, and obtains the target object information based on the verification result.

[0156] The preset fuzzy matching verification algorithm can be implemented by constructing two pointers, i and j, pointing to the first character of the target object name and the first character of the object name in the second data information, respectively. The two pointers i and j are used to determine whether the two characters are equal, performing a fuzzy string matching verification to obtain the verification result. The verification result can be either successful or unsuccessful. If the verification is successful, the second server obtains the target object information; if the verification fails, the second server can receive the target object information returned by the terminal.

[0157] In one example, if the verification fails, the user can manually enter the target object information in the terminal, and then the terminal will send the target object information to a second server.

[0158] In this embodiment, when no target object information corresponding to the target account identifier is found in the storage node corresponding to the target node identifier, fuzzy matching is performed, which can improve the accuracy and fault tolerance of querying target account information.

[0159] In one embodiment, such as Figure 8 As shown, the above method also includes:

[0160] Step 802: In the second data information table, if fuzzy matching fails, obtain the target object information returned by the terminal, and determine the target account identifier and the node identifier corresponding to the target object information based on the target account identifier and the target circular linked list.

[0161] In this embodiment, when fuzzy matching fails in the second data information table, the second server receives the target object information returned by the terminal and calculates the target feature value of the target account identifier corresponding to the target object information by calling a feature value calculation algorithm. Then, the second server performs a modulo operation on the target feature value according to a preset modulo strategy to obtain the target position value corresponding to the target account identifier. Based on the target position value, the second server queries the node identifier corresponding to the target position value within the feature value range of the target circular linked list to determine the node identifier corresponding to the target account identifier and the target object information.

[0162] Step 804: Based on the node identifier, store the target account identifier and target object information into the sub-table corresponding to the node identifier.

[0163] In this embodiment of the application, the second server stores the target account identifier and the target object information into the sub-table corresponding to the node identifier based on the node identifier corresponding to the target account identifier and the target object information.

[0164] In this embodiment, if fuzzy matching fails, the second server can receive and store the target object information returned by the terminal, thereby improving the maintainability of the query information system.

[0165] In one embodiment, such as Figure 9 As shown, an example of the processing procedure in an information query method, in which a terminal sends an account identifier query message to a first server and a second server, is also provided. The specific content includes:

[0166] Step 901: The terminal sends an account identifier query message carrying the target account identifier to the first server.

[0167] Step 902: The first server receives the account identifier query message sent by the terminal, queries the target account identifier in the preset data information table, obtains the query result, and sends the query result to the terminal.

[0168] Step 903: The terminal receives the query result, judges the query result, and sends an account identifier query message carrying the target account identifier to the second server if the query result is a query failure.

[0169] Step 904: The second server receives the account identifier query message sent by the terminal, determines the target feature value corresponding to the target account identifier, and determines the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list.

[0170] In this embodiment, based on the target account identifier, a target feature value corresponding to the target account identifier is calculated by calling a feature value calculation algorithm. Specifically, the target feature value can be the hash value of the target account identifier. The second server performs a modulo operation on the target feature value corresponding to the target account identifier according to a preset modulo strategy to obtain the target position value of the target account identifier. The second server determines the position of the target feature value in the target circular linked list based on the target position value and the range of feature values ​​in the target circular linked list. The second server can determine the position of the target feature value in the target circular linked list based on its position. Then, based on the position of the target feature value in the target circular linked list, the second server sequentially obtains node identifiers in the target circular linked list in ascending order of node identifiers. Based on the node identifier, the second server queries the target account identifier in the storage node corresponding to each node identifier to obtain the query result. For each storage node, if the query result is successful, the second server ends the query process and obtains the target node identifier; if the query result is unsuccessful, the second server continues to query the target account identifier in the next storage node until all storage nodes have failed to query.

[0171] Step 905: The second server queries the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, obtains the query result, and sends the query result to the terminal.

[0172] Step 906: The terminal receives the query result and, if the query result is a query failure, sends a fuzzy matching message carrying the target account identifier to the second server.

[0173] Step 907: The second server receives the fuzzy matching message and, based on the pre-stored correspondence between object names and object identifier codes, obtains the target object name corresponding to the target object identifier code contained in the target account identifier.

[0174] Step 908: The second server verifies the target object name based on the target object name and the second data information in the second data information table using a preset fuzzy matching verification algorithm, and obtains the verification result.

[0175] In this embodiment of the application, the second server verifies the target object name based on the target object name and the object names in each of the second data information in the second data information table using a preset fuzzy matching verification algorithm, obtains the verification result, and sends the verification result to the terminal.

[0176] Step 909: The terminal receives the verification result. If the verification result is a verification failure, the terminal obtains the target object information input by the user and sends the target object information and the target account identifier to the second server.

[0177] Step 910: The second server receives the target object information and the target account identifier, and determines the node identifier corresponding to the target account identifier and the target circular linked list based on the target account identifier corresponding to the target object information.

[0178] In this embodiment, the second server calculates the target feature value of the target account identifier corresponding to the target object information by calling a feature value calculation algorithm. Then, it performs a modulo operation on the target feature value according to a preset modulo strategy to obtain the target position value corresponding to the target account identifier. Based on the target position value, the second server queries the node identifier corresponding to the target position value within the feature value range of the target circular linked list to determine the node identifier corresponding to the target account identifier and the target object information.

[0179] Step 911: The second server stores the target account identifier and target object information into the sub-table corresponding to the node identifier based on the node identifier corresponding to the target account identifier and the target object information.

[0180] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages of other steps.

[0181] In one embodiment, such as Figure 1 As shown, an information query system is provided, including a terminal, a first server, and a second server, wherein:

[0182] The terminal is used to obtain the target account identifier to be identified and send a first account identifier query message carrying the target account identifier to the first server.

[0183] The first server is configured to respond to the first account identifier query message by querying the target account identifier in a preset data information table, generating a query result message, and sending the query result message to the terminal.

[0184] The terminal is also configured to send a second account identifier query message carrying the target account identifier to the second service when the query result is a query failure.

[0185] The second server is configured to receive the second account identifier query message, determine the target feature value corresponding to the target account identifier, determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list, query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal.

[0186] The terminal is also used to receive the target object information.

[0187] Based on the same inventive concept, this application also provides an information query device for implementing the information query method described above. The solution provided by this device is similar to the solution described in the above method; therefore, the specific limitations in one or more information query device embodiments provided below can be found in the limitations of the information query method described above, and will not be repeated here.

[0188] In one embodiment, such as Figure 10 As shown, an information query device 1000 is provided, including: a receiving module 1002, a first query module 1004, a first determining module 1006, and a second query module 1008, wherein:

[0189] The receiving module 1002 is used to receive an account identifier query message sent by the terminal, wherein the account identifier query message carries the target account identifier.

[0190] The first query module 1004 is used to query the target account identifier in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object.

[0191] The first determining module 1006 is used to determine the target feature value corresponding to the target account identifier when the query result is a query failure, and to determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list.

[0192] The second query module 1008 is used to query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal.

[0193] In one embodiment, the apparatus further includes:

[0194] The extraction module is used to extract the account identifier of each object and the object information corresponding to the account identifier based on the message interaction records between each object;

[0195] The calculation module is used to calculate the weight of each account identifier based on each message interaction record, each account identifier, the object information corresponding to the account identifier, and a preset weight calculation strategy.

[0196] The construction module is used to sort the account identifiers in descending order of their respective weights to obtain an account identifier sequence, and to construct a preset data information table based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to the account identifiers.

[0197] In one embodiment, the computing module is specifically used for:

[0198] For each account identifier, the number of messages sent and the number of messages successfully sent are obtained based on each message interaction record.

[0199] The weight of each account identifier is calculated based on the number of times the message was sent, the number of times the message was successfully sent, and the initial weight of the object corresponding to the account identifier.

[0200] In one embodiment, the apparatus further includes:

[0201] The first acquisition module is used to acquire a first data information table, which is obtained based on the message interaction records between various objects.

[0202] The first storage module is used to divide the first data information table into a preset number of sub-tables, determine the database corresponding to each sub-table, and store each sub-table into the corresponding database.

[0203] The second determining module is used to determine the number of storage nodes corresponding to each of the sub-tables based on the number of preset databases, and to determine the node identifier of each of the storage nodes based on the Internet protocol address corresponding to each of the preset databases.

[0204] The generation module is used to generate a target circular linked list based on the number of each storage node, the node identifier, and the pre-constructed initial circular linked list.

[0205] In one embodiment, the apparatus further includes:

[0206] The second acquisition module is used to acquire a second data information table when no target object information corresponding to the target account identifier is found in the storage node corresponding to the target node identifier. The second data information table includes multiple object information.

[0207] The matching module is used to perform fuzzy matching in the second data information table based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier to obtain the target object information.

[0208] In one embodiment, the matching module is specifically used for:

[0209] Based on the preset correspondence between object names and object identifier codes, the target object name corresponding to the target object identifier code contained in the target account identifier is obtained;

[0210] Based on the target object name and the second data information in the second data information table, the target object name is verified by a preset fuzzy matching verification algorithm. The target object information is obtained based on the verification result, which is used to indicate whether the fuzzy matching is successful.

[0211] In one embodiment, the apparatus further includes:

[0212] The third determining module is used to obtain the target object information returned by the terminal in the case of fuzzy matching failure in the second data information table, and determine the target account identifier and the node identifier corresponding to the target object information based on the target account identifier corresponding to the target object information and the target circular linked list.

[0213] The second storage module is used to store the target account identifier and target object information into the sub-table corresponding to the node identifier according to the node identifier.

[0214] Each module in the aforementioned information query device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in the processor of a computer device in hardware form or independent of it, or stored in the memory of a computer device in software form, so that the processor can call and execute the operations corresponding to each module.

[0215] In one embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 11As shown, this computer device includes a processor, memory, input / output interfaces (I / O), and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operating system and computer programs stored in the non-volatile storage media. The database stores object information. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network connection. When executed by the processor, the computer program implements an information retrieval method.

[0216] Those skilled in the art will understand that Figure 11 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0217] In one embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0218] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps in the above method embodiments.

[0219] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0220] 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, data stored, data displayed, 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 the relevant data shall comply with the relevant laws, regulations and standards of the relevant countries and regions.

[0221] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile 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. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0222] The technical features of the above embodiments can be combined in any way. For the sake of brevity, 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 specification.

[0223] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. An information retrieval method, characterized in that, The method includes: Based on the message interaction records between the objects, extract the account identifier of each object and the object information corresponding to the account identifier; For each account identifier, the number of messages sent and the number of messages successfully sent are obtained based on each message interaction record. The weight of each account identifier is calculated based on the number of times the message was sent, the number of times the message was successfully sent, and the initial weight of the object corresponding to the account identifier. The account identifiers are sorted in descending order of their respective weights to obtain an account identifier sequence. Based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to the account identifiers, a preset data information table is constructed. The receiving terminal sends an account identifier query message, which carries the target account identifier; The target account identifier is queried in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object. If the query result is a query failure, determine the target feature value corresponding to the target account identifier, and determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list; In the storage node corresponding to the target node identifier, query the target object information corresponding to the target account identifier, and send the target object information to the terminal.

2. The method according to claim 1, characterized in that, The method further includes: Obtain a first data information table, which contains each account identifier and the object information corresponding to the account identifier; The first data information table is divided into a preset number of sub-tables, and the database corresponding to each sub-table is determined. Each sub-table is then stored in its corresponding database. The number of storage nodes corresponding to each sub-table is determined based on the preset number of databases, and the node identifier of each storage node is determined based on the Internet protocol address corresponding to each preset database. The target circular linked list is generated based on the number of each storage node, the node identifier, and the pre-constructed initial circular linked list.

3. The method according to claim 1, characterized in that, After querying the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, the process further includes: If no target object information corresponding to the target account identifier is found in the storage node corresponding to the target node identifier, a second data information table is obtained, which includes multiple object information. Based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier, fuzzy matching is performed in the second data information table to obtain the target object information.

4. The method according to claim 3, characterized in that, The step of performing fuzzy matching in the second data information table based on the fuzzy matching verification algorithm and the target object identification code contained in the target account identifier to obtain the target object information includes: Based on the preset correspondence between object names and object identifier codes, the target object name corresponding to the target object identifier code contained in the target account identifier is obtained; Based on the target object name and the second data information in the second data information table, the target object name is verified by a preset fuzzy matching verification algorithm. The target object information is obtained based on the verification result, which is used to indicate whether the fuzzy matching is successful.

5. The method according to claim 3, characterized in that, The method further includes: In the event that fuzzy matching fails, the target object information returned by the terminal is obtained, and the target account identifier and the node identifier corresponding to the target object information are determined based on the target account identifier corresponding to the target object information and the target circular linked list. Based on the node identifier, the target account identifier and target object information are stored in the sub-table corresponding to the node identifier.

6. An information query system, characterized in that, The system includes a terminal, a first server, and a second server, wherein: The terminal is used to obtain the target account identifier to be identified and send a first account identifier query message carrying the target account identifier to the first server. The first server is configured to respond to the first account identifier query message by querying the target account identifier in a preset data information table, generating a query result message, and sending the query result message to the terminal. The preset data information table is based on message interaction records between objects, extracting the account identifiers of each object and the object information corresponding to the account identifiers. For each account identifier, the number of message transmissions and the number of successful message transmissions are obtained according to the message interaction records. The weight of each account identifier is calculated based on the number of message transmissions, the number of successful message transmissions, and the initial weight of the object corresponding to the account identifier. The account identifiers are sorted in descending order of their weights to obtain an account identifier sequence, which is constructed based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to those account identifiers. The terminal is also configured to send a second account identifier query message carrying the target account identifier to the second service when the query result is a query failure. The second server is configured to respond to the second account identifier query message, determine the target feature value corresponding to the target account identifier, determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list, query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal.

7. An information query device, characterized in that, The device includes: The extraction module is used to extract the account identifier of each object and the object information corresponding to the account identifier based on the message interaction records between each object; The calculation module is used to obtain the number of message transmissions and the number of successful message transmissions corresponding to each account identifier based on each message interaction record; and to calculate the weight of each account identifier based on the number of message transmissions, the number of successful message transmissions, and the initial weight of the object corresponding to the account identifier. The construction module is used to sort the account identifiers in descending order of their respective weights to obtain an account identifier sequence, and to construct a preset data information table based on the first preset number of account identifiers in the account identifier sequence and the object information corresponding to the account identifiers. The receiving module is used to receive an account identifier query message sent by the terminal, wherein the account identifier query message carries a target account identifier; The first query module is used to query the target account identifier in a preset data information table to obtain the query result. The preset data information table is established based on the weight of the account identifier corresponding to each object. The first determining module is used to determine the target feature value corresponding to the target account identifier when the query result is a query failure, and to determine the target node identifier corresponding to the target feature value based on the position of the target feature value in the target circular linked list; The second query module is used to query the target object information corresponding to the target account identifier in the storage node corresponding to the target node identifier, and send the target object information to the terminal.

8. 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, it implements the steps of the method according to any one of claims 1 to 5.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 5.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 5.

Images