Data processing method and device and computer readable storage medium

Abstract

The invention discloses a data processing method and device and a computer readable storage medium, and the method comprises the steps: obtaining a first to-be-processed detailed list tree corresponding to a first internetwork settlement party and a second to-be-processed detailed list tree corresponding to a second internetwork settlement party in a block chain based on a to-be-processed bill identifier; acquiring a first day node corresponding to a first root node in the first to-be-processed detailed tree and a second day node corresponding to a second root node in the second to-be-processed detailed tree; if a sky node group in which the first sky node is different from the corresponding second sky node exists, determining a detailed list error list based on child nodes corresponding to the sky node group; and determining a detailed bill account checking report based on the detailed bill error list. According to the application, the detailed list trees of the two parties of the internetwork settlement are acquired in the block chain, and the detailed lists are compared through node comparison of the detailed list trees, so that detailed list-level efficient comparison of the internetwork settlement is realized, and meanwhile, data security and user privacy can be effectively guaranteed.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a data processing method, device and computer-readable storage medium. Background Art

[0002] Inter-network settlement is the settlement generated by the communication behavior between various operators, including voice, SMS, and MMS service settlement. Operators collect the bills on their respective intercommunication network elements, make settlement quotation according to the prescribed settlement rules, and issue a reconciliation exchange table. After that, the parties exchange the reconciliation table offline to confirm whether it is correct. If it is correct, a formal settlement report will be issued for financial settlement. If there is a difference, the parties agree to extract detailed bill data for comparison and verify the problem.

[0003] However, in the related technology, when both parties find that the bills are inconsistent, they need to conduct a lot of offline communication and detailed bill data interaction to complete the difference comparison, which is inefficient. At the same time, during the comparison process, it is impossible to guarantee that the sensitive data of both customers will not be known, and the whole process can not be guaranteed to be safe and reliable.

[0004] Therefore, how to improve the efficiency of detailed invoice comparison in inter-network settlement while ensuring data security and user privacy is a problem that needs to be solved urgently. Summary of the invention

[0005] The main purpose of this application is to provide a data processing method, device and computer-readable storage medium, aiming to solve the technical problem of how to improve the efficiency of detailed bill comparison in inter-network settlement while ensuring data security and user privacy.

[0006] To achieve the above objectives, the present application provides a data processing method, comprising:

[0007] Based on the pending bill identifier, obtain in the blockchain a first pending detailed bill tree corresponding to the first inter-network settlement party and a second pending detailed bill tree corresponding to the second inter-network settlement party;

[0008] Obtain the first day node corresponding to the first root node in the first to-be-processed detailed list tree, and the second day node corresponding to the second root node in the second to-be-processed detailed list tree;

[0009] If there is a day node group in which the first day node is different from the corresponding second day node, determining a detailed single error list based on the child nodes corresponding to the day node group;

[0010] A detailed bill reconciliation report is determined based on the detailed bill error list.

[0011] Furthermore, if there is a day node group in which the first day node is different from the corresponding second day node, the step of determining the detailed order error list based on the child nodes corresponding to the day node group includes:

[0012] If there is a day node group in which the first day node is different from the corresponding second day node, obtain the first time node corresponding to the first day node in the day node group and the second time node corresponding to the second day node in the day node group;

[0013] If there is a time node group in which the first time node is different from the corresponding second time node, obtaining the first sub-node corresponding to the first time node in the time node group and the second sub-node corresponding to the second time node in the time node group;

[0014] If there is a sub-node group in which the first sub-node and the corresponding second sub-node are different, the detailed error list is generated based on the sub-node group.

[0015] Further, the step of determining a detailed bill reconciliation report based on the detailed bill error list includes:

[0016] Based on the detailed order error list, obtaining a first detailed order list corresponding to the first inter-network settlement party and a second detailed order list corresponding to the second inter-network settlement party in the blockchain;

[0017] Determining detailed order difference information based on the first detailed order list and the second detailed order list;

[0018] When confirmation information corresponding to the detailed bill difference information is obtained in the blockchain, a detailed bill reconciliation report is determined based on the detailed bill difference information.

[0019] Furthermore, the step of obtaining, on the blockchain, a first detailed list corresponding to the first inter-network settlement party and a second detailed list corresponding to the second inter-network settlement party based on the detailed list error list includes:

[0020] Uploading the detailed order error list to the blockchain, wherein the first inter-network settlement party uploads the corresponding first detailed order list to the blockchain based on the detailed order error list, and the second inter-network settlement party uploads the corresponding second detailed order list to the blockchain based on the detailed order error list;

[0021] Obtain the first detailed order list and the second detailed order list in the blockchain.

[0022] Furthermore, before the step of obtaining the first to-be-processed detailed bill tree corresponding to the first inter-network settlement party and the second to-be-processed detailed bill tree corresponding to the second inter-network settlement party in the blockchain based on the to-be-processed bill identifier, it also includes:

[0023] Processing the detailed bill to be processed to obtain processing information corresponding to each data period, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence;

[0024] Generate a first detailed order tree based on the processing information, the root configuration information corresponding to the detailed order to be processed, and the tree node combination mode, wherein the first detailed order tree includes a root node, a day node, an hour node, and a branch node;

[0025] Based on the detailed order sequence corresponding to the time node in the first detailed order tree, the day nodes corresponding to the time node in the first detailed order tree are updated respectively to obtain a second detailed order tree;

[0026] Based on the detailed order sequence of each sub-node in each second detailed order tree, the time node corresponding to each sub-node in the second detailed order tree is updated respectively to obtain the target detailed order tree, and the target detailed order tree is uploaded to the blockchain.

[0027] Furthermore, the step of respectively updating the day nodes corresponding to the time nodes in the first detailed list tree based on the detailed list sequence corresponding to the time nodes in the first detailed list tree to obtain the second detailed list tree includes:

[0028] Based on the detailed order sequence corresponding to the time node in the first detailed order tree, generate a first character string corresponding to the first detailed order tree;

[0029] Obtain a first hash value corresponding to the first character string, and update the day node corresponding to the time node in the first detailed list tree based on each first hash value, to obtain a second detailed list tree;

[0030] The step of respectively updating the time nodes corresponding to the sub-nodes in each second detailed order tree based on the detailed order sequence of the sub-nodes in each second detailed order tree to obtain the target detailed order tree comprises:

[0031] Based on the detailed order sequences of the sub-nodes in each second detailed order tree, generate a second character string corresponding to each second detailed order tree;

[0032] The second Hash value corresponding to the second character string is obtained, and the time nodes corresponding to the sub-nodes in each second detailed list tree are updated respectively based on each second Hash value to obtain a target detailed list tree.

[0033] Furthermore, the step of generating a first detailed list tree based on the processing information, the root configuration information corresponding to the detailed list to be processed, and the tree node combination mode includes:

[0034] Based on the service code and the root configuration information, a root node corresponding to the first detailed bill tree is generated, wherein if the bill identifier contains a target bill identifier that is not matched to the corresponding detailed bill tree, a corresponding root node is generated based on the target bill identifier;

[0035] If, based on the time identifier and the day node configuration information in the tree node combination mode, it is determined that there is a first time identifier in the time identifier that is not matched to a day node, then based on the first time identifier and the detailed list sequence, a day node corresponding to the first time identifier is generated;

[0036] Determine, based on the time identifier and the time node configuration information in the tree node combination mode, that there is a second time identifier in the time identifier that is not matched to a time node, and then generate a time node corresponding to the second time identifier based on the second time identifier and the detailed sequence;

[0037] Based on the detailed list sequence, the sub-node corresponding to the first time node is updated, and based on the time identifier and the detailed list sequence, the sub-node corresponding to the second time node is generated to obtain the first detailed list tree, wherein the first time node is a time node for which a corresponding sub-node exists in each time node, and the second time node is a time node for which no corresponding sub-node exists in each time node.

[0038] Furthermore, the step of performing data processing on the detailed order to be processed and obtaining processing information corresponding to each data cycle includes:

[0039] Performing a data extraction operation on the to-be-processed detailed form based on the key field information to obtain first detailed form data;

[0040] Divide the first detailed list based on the data period to obtain second detailed list data corresponding to each data period;

[0041] Each second detailed bill data is encoded to obtain processing information corresponding to each second detailed bill data, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence.

[0042] In addition, to achieve the above-mentioned purpose, the present application also provides a data processing device, which includes: a memory, a processor, and a data processing program stored in the memory and executable on the processor, and the data processing program implements the steps of the aforementioned data processing method when executed by the processor.

[0043] In addition, to achieve the above-mentioned purpose, the present application also provides a computer-readable storage medium, on which a data processing program is stored, and when the data processing program is executed by a processor, the steps of the aforementioned data processing method are implemented.

[0044] The present application obtains, in the blockchain, a first detailed bill tree to be processed corresponding to a first inter-network settlement party and a second detailed bill tree to be processed corresponding to a second inter-network settlement party based on the identifier of the pending bill; then obtains the first day node corresponding to the first root node in the first detailed bill tree to be processed, and the second day node corresponding to the second root node in the second detailed bill tree to be processed; then, if there is a day node group in which the first day node is different from the corresponding second day node, a detailed bill error list is determined based on the child nodes corresponding to the day node group; then, a detailed bill reconciliation report is determined based on the detailed bill error list, and by obtaining the detailed bill trees of the two inter-network settlement parties in the blockchain, and comparing the detailed bills through node comparison of the detailed bill trees, efficient detailed bill level comparison of inter-network settlement is achieved, while effectively protecting data security and user privacy. BRIEF DESCRIPTION OF THE DRAWINGS

[0045] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0046] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0047] Figure 1 A flowchart of the first embodiment of the data processing method of the present application is provided;

[0048] Figure 2 This is a schematic diagram of the structure of the detailed tree in the data processing method of this application;

[0049] Figure 3 This is a schematic diagram of the module structure of the data processing device according to an embodiment of the present application.

[0050] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0051] 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.

[0052] In order to better understand the technical solution of the present application, a detailed description will be given below in conjunction with the accompanying drawings and specific implementation methods.

[0053] The main solution of the present application is: based on the identification of the pending bill, obtain in the blockchain the first pending detailed bill tree corresponding to the first inter-network settlement party and the second pending detailed bill tree corresponding to the second inter-network settlement party; obtain the first day node corresponding to the first root node in the first pending detailed bill tree, and the second day node corresponding to the second root node in the second pending detailed bill tree; if there is a day node group in which the first day node is different from the corresponding second day node, determine the detailed bill error list based on the child nodes corresponding to the day node group; determine the detailed bill reconciliation report based on the detailed bill error list.

[0054] At present, inter-network settlement is the settlement generated by the communication behavior between various operators, including voice, SMS, and MMS service settlement. Operators collect the bills on their respective intercommunication network elements, make settlement quotation according to the prescribed settlement rules, and issue a reconciliation exchange table. After that, the parties exchange the reconciliation table offline to confirm whether it is correct. If it is correct, a formal settlement report is issued for financial settlement. If there is a difference, the parties agree to extract detailed bill data for comparison and verify the problem.

[0055] However, in the related technologies, when both parties find that the bills are inconsistent, they need to communicate and exchange detailed bill data offline to complete the difference comparison, which is inefficient. At the same time, it is impossible to ensure that the sensitive data of both customers will not be known during the comparison process, and to ensure that the whole process is safe and reliable. Therefore, how to improve the efficiency of detailed bill comparison in inter-network settlement while ensuring data security and user privacy is a problem that needs to be solved urgently.

[0056] This application obtains the detailed bill tree of the two parties in the inter-network settlement in the blockchain, and compares the detailed bills by comparing the nodes of the detailed bill tree, thereby achieving efficient detailed bill-level comparison of inter-network settlement, while effectively protecting data security and user privacy.

[0057] It should be noted that the execution subject of this embodiment may be a data processing device, or a computing service device with data processing, network communication and program running functions, such as a tablet computer, a personal computer, a mobile phone, etc., or a data processing device capable of realizing the above functions, etc., and this embodiment does not specifically limit this. The following takes the data processing device as the execution subject as an example to illustrate this embodiment and the following embodiments.

[0058] Based on this, this application proposes a data processing method of the first embodiment, please refer to Figure 1 , the data processing method includes steps S101 to S104:

[0059] Step S101, based on the pending bill identifier, obtaining a first pending bill tree corresponding to the first inter-network settlement party and a second pending bill tree corresponding to the second inter-network settlement party in the blockchain;

[0060] It should be noted that the data processing method of this embodiment can be applied to the first inter-network settlement party or the second inter-network settlement party. The first inter-network settlement party is taken as an example below.

[0061] In this embodiment, before reconciliation, the first inter-network settlement party divides its own detailed bill data based on the detailed bill of key field information extracted from the data cycle, encodes the divided data, generates a detailed bill tree corresponding to each bill identifier in the detailed bill based on the hash coding technology, and uploads the generated detailed bill tree to the blockchain. The second inter-network settlement party also uploads the detailed bill tree corresponding to its detailed bill to the blockchain. After the detailed bill tree of the first inter-network settlement party and the detailed bill tree of the second inter-network settlement party are confirmed through the blockchain, the reconciliation operation can be performed. Among them, in the absence of errors, the detailed bill of the first inter-network settlement party is the same as the detailed bill of the second inter-network settlement party, and then the first to-be-processed detailed bill tree is the same as the second to-be-processed detailed bill tree.

[0062] In this embodiment, reconciliation operations are performed separately according to the bill identifiers. Specifically, the pending bill identifiers are obtained. Specifically, the bill identifiers that need to be reconciled are traversed to obtain the pending bill identifiers, and the first pending detailed bill tree corresponding to the first inter-network settlement party and the second pending detailed bill tree corresponding to the second inter-network settlement party are obtained in the blockchain according to the pending bill identifiers, that is, the bill identifiers corresponding to the first pending detailed bill tree and the second pending detailed bill tree are both the pending bill identifiers.

[0063] Step S102, obtaining the first day node corresponding to the first root node in the first to-be-processed detailed list tree, and the second day node corresponding to the second root node in the second to-be-processed detailed list tree;

[0064] In this embodiment, after obtaining the first detailed order tree to be processed and the second detailed order tree to be processed, the first day node corresponding to the first root node in the first detailed order tree to be processed and the second day node corresponding to the second root node in the second detailed order tree to be processed are obtained, and it is determined whether each first day node is the same as the corresponding second day node in the second detailed order tree to be processed. Specifically, the corresponding day nodes can be compared by day, wherein the KEY of the day node is day, and the Value is the HASH value corresponding to all detailed orders in a day. When comparing by day, it is determined whether the Value of the first day node of the current day is the same as the Value of the second day node. After completing the comparison by day, a day node group in which the first day node is different from the corresponding second day node can be obtained, that is, each day node group is a day node of the same day.

[0065] Step S103, if there is a day node group in which the first day node is different from the corresponding second day node, determining a detailed list error list based on the child nodes corresponding to the day node group;

[0066] In this embodiment, if the day node group of the first day node is different from the corresponding day node group of the second day node, a detailed error list is determined based on the child nodes corresponding to the day node group. Specifically, the child nodes may include time nodes and sub-nodes, wherein the time node is a child node of the day node, and the sub-node is a child node of the time node. Different time node groups are determined based on the day node group, and different sub-node groups are determined based on the time node group, and a detailed error list is generated based on the sub-node group, for example, a detailed error list is generated based on the KEY and Value of the sub-node in the sub-node group.

[0067] Step S104: determining a detailed bill reconciliation report based on the detailed bill error list.

[0068] In this embodiment, after obtaining the detailed order error list, the detailed order reconciliation report is determined based on the detailed order error list. Specifically, the detailed order error list is uploaded to the blockchain, the first inter-network settlement party and the second inter-network settlement party respectively upload the corresponding detailed order lists based on the detailed order error list, the detailed order lists uploaded by the first inter-network settlement party and the second inter-network settlement party are obtained on the blockchain, and the detailed order reconciliation report is determined based on the detailed order lists.

[0069] The data processing method proposed in this embodiment obtains the first to-be-processed detailed bill tree corresponding to the first inter-network settlement party and the second to-be-processed detailed bill tree corresponding to the second inter-network settlement party in the blockchain based on the to-be-processed bill identifier; then obtains the first day node corresponding to the first root node in the first to-be-processed detailed bill tree, and the second day node corresponding to the second root node in the second to-be-processed detailed bill tree; then, if there is a day node group in which the first day node is different from the corresponding second day node, a detailed bill error list is determined based on the child nodes corresponding to the day node group; then, a detailed bill reconciliation report is determined based on the detailed bill error list, and by obtaining the detailed bill trees of the two inter-network settlement parties in the blockchain, and comparing the detailed bills through node comparison of the detailed bill trees, efficient comparison of the detailed bill level of inter-network settlement is achieved, and data security and user privacy can be effectively protected at the same time.

[0070] In a feasible implementation, step S103 may include steps S1031 to S1033:

[0071] Step S1031, if there is a day node group in which the first day node and the corresponding second day node are different, obtain a first time node corresponding to the first day node in the day node group and a second time node corresponding to the second day node in the day node group;

[0072] Step S1032, if there is a time node group in which the first time node is different from the corresponding second time node, obtain the first sub-node corresponding to the first time node in the time node group and the second sub-node corresponding to the second time node in the time node group;

[0073] Step S1033: if there is a sub-node group in which the first sub-node and the corresponding second sub-node are different, the detailed order error list is generated based on the sub-node group.

[0074] In this embodiment, if the first day node is different from the corresponding second day node in the day node group, the first time node corresponding to the first day node in the day node group and the second time node corresponding to the second day node in the day node group are obtained, and it is determined whether each first time node is the same as the corresponding second time node. Specifically, the corresponding time nodes can be compared by time, wherein the KEY of the time node is time, and the Value is the HASH value corresponding to all detailed orders within an hour. When compared by hour, it is determined whether the Value of the first time node of the current hour is the same as the Value of the second time node. After completing the comparison by time, a time node group in which the first time node is different from the corresponding second time node can be obtained, that is, each time node group is a time node of the same hour.

[0075] If there is a time node group in which the first time node is different from the corresponding second time node, then obtain the first sub-node corresponding to the first time node in the time node group, and the second sub-node corresponding to the second time node in the time node group; and determine whether each first sub-node is the same as the corresponding second sub-node. The specific judgment method is the same as the judgment method of the time node, which will not be repeated here.

[0076] If there is a sub-node group in which the first sub-node is different from the corresponding second sub-node, the detailed bill error list is generated based on the sub-node group. Specifically, the KEY and Value of each sub-node in the sub-node group are obtained, and the detailed bill error list is generated based on the identifier of the bill to be processed and the KEY and Value of each sub-node.

[0077] In this embodiment, by comparing by day, hour, and minute, the first inter-network settlement party and the second inter-network settlement party can quickly filter out consistent detailed orders; when comparing nodes, only the HASH value (Value) is compared, and there is no need to worry about the business situation, so the comparison process is more general and more efficient; the maximum number of nodes in the tree is fixed, that is, 30 (days) * 24 (hours) * 60 (minutes) = 43200. Compared with the massive detailed order records (more than 100 million), the number of searches in the comparison process is greatly reduced, thereby improving the efficiency of the comparison.

[0078] The data processing method proposed in this embodiment is as follows: if there is a day node group in which the first day node is different from the corresponding second day node, the first time node corresponding to the first day node in the day node group and the second time node corresponding to the second day node in the day node group are obtained; then if there is a time node group in which the first time node is different from the corresponding second time node, the first sub-node corresponding to the first time node in the time node group and the second sub-node corresponding to the second time node in the time node group are obtained; and then if there is a sub-node group in which the first sub-node is different from the corresponding second sub-node, the detailed bill error list is generated based on the sub-node group, and the detailed bill error list is obtained by comparing the nodes of the detailed bill tree, thereby realizing efficient comparison of the detailed bill level for inter-network settlement.

[0079] In a feasible implementation, step S104 may include steps S1041 to S1043:

[0080] Step S1041, based on the detailed order error list, obtaining a first detailed order list corresponding to the first inter-network settlement party and a second detailed order list corresponding to the second inter-network settlement party in the blockchain;

[0081] Step S1042, determining detailed order difference information based on the first detailed order list and the second detailed order list;

[0082] Step S1043, when confirmation information corresponding to the detailed bill difference information is obtained in the blockchain, a detailed bill reconciliation report is determined based on the detailed bill difference information.

[0083] In this embodiment, after obtaining the detailed bill error list, a first detailed bill list corresponding to the first inter-network settlement party and a second detailed bill list corresponding to the second inter-network settlement party are obtained in the blockchain based on the detailed bill error list. Specifically, in a feasible implementation, step S1041 may include steps a1 to a2:

[0084] Step a1, uploading the detailed order error list to the blockchain, wherein the first inter-network settlement party uploads the corresponding first detailed order list to the blockchain based on the detailed order error list, and the second inter-network settlement party uploads the corresponding second detailed order list to the blockchain based on the detailed order error list;

[0085] Step a2, obtaining the first detailed order list and the second detailed order list in the blockchain.

[0086] In this embodiment, after obtaining the detailed order error list, the detailed order error list is uploaded to the blockchain, and the two parties of the inter-network settlement confirm the detailed order error list through the blockchain. Specifically, the first inter-network settlement party (Party A) and the second inter-network settlement party (Party B) agree on the on-chain (blockchain unit) data structure, including the storage KEY of the data; Party A calls the smart contract, and the smart contract writes data (detailed order error list) to the KEY; Party B calls the query smart contract through the KEY, and the query input parameter passes in the KEY; Party B obtains the data submitted by Party A from the chain for display. After Party B confirms, Party B calls the smart contract, and the smart contract writes data (confirmation mark of the detailed order error list) to the KEY; Party A calls the query smart contract through the KEY, and the query input parameter passes in the KEY; Party A obtains the data submitted by Party B from the chain for display and obtains confirmation. If Party A wants to confirm the detailed order error list uploaded by Party B, after Party A and Party B exchange, the upload and confirmation process is the same.

[0087] In this embodiment, after the detailed order error list is confirmed, the first inter-network settlement party uploads the corresponding first detailed order list to the blockchain based on the detailed order error list, and the second inter-network settlement party uploads the corresponding second detailed order list to the blockchain based on the detailed order error list; the detailed order list includes fields, which are defined by detailedKeyList, and only the detailed order data corresponding to the key field information needs to be uploaded to reduce the amount of uploaded data. Then, the first detailed order list and the second detailed order list are obtained in the blockchain.

[0088] After obtaining the first detailed order list and the second detailed order list, the detailed order difference information is determined based on the first detailed order list and the second detailed order list. Specifically, the key fields such as the detailed order data (number (agreed by both parties, encrypted according to the rules), amount) are compared. If the amount is different and exceeds the agreed threshold, it is marked; the detailed order difference information is obtained.

[0089] Then, when the confirmation information corresponding to the detailed bill difference information is obtained in the blockchain, the detailed bill reconciliation report is determined based on the detailed bill difference information. Specifically, the first inter-network settlement party uploads the detailed bill difference information to the blockchain, and the first inter-network settlement party (Party A) and the second inter-network settlement party (Party B) agree on the on-chain data structure, including the storage KEY of the data; Party A calls the developed smart contract, and the smart contract writes data (detailed bill difference information) to the KEY; Party B calls the query smart contract through the KEY, and the query input parameter passes in the KEY; Party B obtains the data submitted by Party A from the chain for display; then, the two inter-network settlement parties confirm the detailed bill difference information on the blockchain unit, and Party B confirms when displaying the data (detailed bill difference information) submitted by Party A. After Party B confirms, Party B calls the developed smart contract, and the smart contract writes data (confirmation mark) to the KEY; Party A calls the query smart contract through the KEY, and the query input parameter passes in the KEY; Party A obtains the data submitted by Party B from the chain for display and obtains confirmation.

[0090] Furthermore, when the first inter-network settlement party obtains the confirmation information corresponding to the detailed bill difference information in the blockchain, it generates a detailed bill reconciliation report based on the detailed bill difference information.

[0091] In this embodiment, only the detailed list with possible differences is uploaded to the chain according to the time list, which effectively improves the efficiency of uploading to the chain; uploading a small number of key fields to the chain can greatly reduce the number of original detailed list fields; the entire comparison operation is carried out on the blockchain, the data is secure, and the transaction is reliable and trustworthy.

[0092] The data processing method proposed in this embodiment obtains the first detailed order list corresponding to the first inter-network settlement party and the second detailed order list corresponding to the second inter-network settlement party in the blockchain based on the detailed order error list; then determines the detailed order difference information based on the first detailed order list and the second detailed order list; and then determines the detailed order reconciliation report based on the detailed order difference information when the confirmation information corresponding to the detailed order difference information is obtained in the blockchain, and determines the detailed order reconciliation report, and only uploads the detailed order lists with possible differences to the chain according to the time list, which effectively improves the efficiency of the chain; uploads a small number of key fields to the chain, which can greatly reduce the number of original detailed order fields; the entire comparison operation is performed on the blockchain, which improves data security.

[0093] In a feasible implementation manner, before step S101, the data processing method may include steps S201 to S204:

[0094] Step S201, data processing is performed on the detailed bill to be processed to obtain processing information corresponding to each data period, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence;

[0095] Step S202, generating a first detailed order tree based on the processing information, the root configuration information corresponding to the detailed order to be processed, and the tree node combination mode, wherein the first detailed order tree includes a root node, a day node, an hour node, and a branch node;

[0096] Step S203, based on the detailed order sequence corresponding to the time node in the first detailed order tree, respectively update the day node corresponding to the time node in the first detailed order tree to obtain a second detailed order tree;

[0097] Step S204: based on the detailed order sequence of each sub-node in each second detailed order tree, respectively update the time node corresponding to each sub-node in the second detailed order tree, obtain the target detailed order tree, and upload the target detailed order tree to the blockchain.

[0098] In this embodiment, before data processing, rule configuration is performed first. According to the settlement characteristics of inter-network settlement business, such as by province, business, and account period, the detailed bill combination rules are configured. The data pre-processing equipment and detailed bill tree generation use these configuration rules to complete data processing and detailed bill tree solidification. Including the following related configurations: 1) Root configuration information of the detailed bill tree, detailedRootConfig, used to define the root of the detailed bill tree, which can be in the form of business identifier (business type: voice, SMS, etc.) + YYYYMM (account period); 2) Tree node combination mode, nodeModelConfig, configure the second, third, and fourth tree node combination modes, which can be selected by day / hour / minute, configured as DD / HH / mm, or by day / hour / 10 minutes, configured as DD / HH / 10mm; 3) Data cycle setting, that is, through the network settlement detailed bill processing cycle configuration (settlePeriod parameter) to set the time for the data pre-processing equipment to summarize the call bill, the data cycle setting range is 1 minute to 60 minutes; 4) Key field information configuration, detailedKeyList, the configuration format is business ID|field name 1|field name 2|…|field name N|, limited to 10, the key field information can be "start time, end time, duration, amount", etc. Through rule configuration, data combination can be achieved by adjusting the configuration, which increases the flexibility of the model and can adapt to business changes; when the settlement party wants to change the detailed order field, the system only needs to adjust the configuration to achieve it, and it can also meet the requirements of multi-party settlement comparison field diversity; the combination time length configuration of the tree node may be based on different business characteristics to achieve data characteristics that are more in line with the business and achieve the best data compression effect.

[0099] In this embodiment, after the rule configuration, the detailed bill to be processed is obtained, and data processing is performed on the detailed bill to be processed to obtain processing information corresponding to each data cycle, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence. Further, in a feasible implementation, step S201 may include steps S2011 to S2013:

[0100] Step S2011, performing a data extraction operation on the to-be-processed detailed form based on the key field information to obtain first detailed form data;

[0101] Step S2012, dividing the first detailed list based on the data period to obtain second detailed list data corresponding to each data period;

[0102] Step S2013, encoding each second detailed bill data to obtain processing information corresponding to each second detailed bill data, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence.

[0103] In this embodiment, after obtaining the detailed list to be processed, a data extraction operation is performed on the detailed list to be processed based on the key field information to obtain the first detailed list data. Specifically, according to the detailedKeyList configuration, the fields of the detailed list to be processed are processed, the key fields corresponding to the key field information in the detailed list to be processed are intercepted, and other fields are filtered and processed.

[0104] After obtaining the first detailed bill data, the first detailed bill is divided based on the data cycle to obtain the second detailed bill data corresponding to each data cycle. Specifically, the first detailed bill data is judged according to the bill start time in the first detailed bill data, and the corresponding second detailed bill data belongs to which data cycle it falls. For example, if the data cycle is 60 minutes (i.e. 1 hour), all detailed bills of a day will be divided into 24 buckets. Then the corresponding detailed bill is placed in the corresponding processing cycle bucket to obtain the corresponding second detailed bill data.

[0105] After obtaining the second detailed order data, each second detailed order data is encoded and processed to obtain the processing information corresponding to each second detailed order data. Specifically, the natural time of the detailed order in each second detailed order data is sorted to obtain the sorted detailed order corresponding to each second detailed order data. The sorted detailed orders are respectively combined and assembled into a string character Sn to obtain the string character corresponding to each second detailed order data. The HASH algorithm is used to generate a detailed order sequence D1 from each string character Sn to obtain the single sequence D1 of each second detailed order data. After that, the processing information corresponding to each second detailed order data is generated, and the processing information includes the business code S1 (business type), time mark T1 (format YYYYHHMM), bill mark A1 (business type + province number + account period, etc. assembled into a string, plain text), and detailed order sequence D1 (cipher text).

[0106] In this embodiment, after the processing information is obtained, a first detailed list tree is generated based on the processing information, the root configuration information corresponding to the detailed list to be processed, and the tree node combination mode. Further, in a feasible implementation manner, step S202 may include steps S2021 to S2024:

[0107] Step S2021, based on the service code and the root configuration information, generating a root node corresponding to the first detailed bill tree, wherein if the bill identifier has a target bill identifier that is not matched to the corresponding detailed bill tree, generating a corresponding root node based on the target bill identifier;

[0108] Step S2022, if it is determined that there is a first time identifier that is not matched to a day node in the time identifier based on the time identifier and the day node configuration information in the tree node combination mode, then a day node corresponding to the first time identifier is generated based on the first time identifier and the detailed list sequence;

[0109] Step S2023, based on the time identifier and the time node configuration information in the tree node combination mode, determining that there is a second time identifier in the time identifier that is not matched to a time node, then generating a time node corresponding to the second time identifier based on the second time identifier and the detailed list sequence;

[0110] Step S2024, based on the detailed list sequence, the sub-node corresponding to the first time node is updated, and based on the time identifier and the detailed list sequence, the sub-node corresponding to the second time node is generated to obtain the first detailed list tree, wherein the first time node is a time node for which a corresponding sub-node exists in each time node, and the second time node is a time node for which no corresponding sub-node exists in each time node.

[0111] In this embodiment, the first inter-network settlement party generates the root node rootName corresponding to the first detailed bill tree, the bill identifier + YYYYMM, based on the service code S1 and the root configuration information detailedRootConfig. The bill identifier in the detailed bill to be processed is matched with the root node rootName. If there is a target bill identifier in the bill identifier that is not matched to the corresponding detailed bill tree, the corresponding root node is generated based on the target bill identifier.

[0112] After the root node is generated, the time identifier is matched with the day node in the detailed list tree based on the day node configuration information in the tree node combination mode. If there is a first time identifier that is not matched to the day node in the time identifier, a day node corresponding to the first time identifier is generated based on the time identifier corresponding to the first time identifier and the detailed list sequence, where the key of the day node is the time identifier YYYYMMDD (plain text), and the value is the detailed list sequence D1 (cipher text) of the time period corresponding to the day node.

[0113] After the day node is generated, the time identifier is matched with the time node in the detailed list tree based on the time node configuration information in the tree node combination mode. If there is a second time identifier in the time identifier that is not matched to the time node, a time node corresponding to the second time identifier is generated based on the second time identifier and the detailed list sequence; wherein the key of the time node is the time identifier YYYYMMDD (plain text), and the value is the detailed list sequence D1 (cipher text) of the time period corresponding to the time node.

[0114] After generating the time node, determine whether there is a sub-node at each time node, and obtain the first time node and the second time node. The first time node is the time node with a corresponding sub-node in each time node, and the second time node is the time node without a corresponding sub-node in each time node. The sub-node corresponding to the first time node is updated based on the detailed order sequence, and the sub-node corresponding to the second time node is generated based on the bill identifier and the detailed order sequence to obtain the first detailed order tree, where the key of the sub-node is the time identifier YYYYMMDD (plain text), and the value is the detailed order sequence D1 (cipher text) of the time period corresponding to the sub-node.

[0115] After obtaining the first detailed list tree, based on the detailed list sequence corresponding to the time node in the first detailed list tree, the day nodes corresponding to the time node in the first detailed list tree are updated respectively to obtain the second detailed list tree; in a feasible implementation manner, step S203 may include steps S2031 to S2032:

[0116] Step S2031, generating a first character string corresponding to the first detailed list tree based on the detailed list sequence corresponding to the time node in the first detailed list tree;

[0117] Step S2032, obtaining the first hash value corresponding to the first character string, and updating the day node corresponding to the time node in the first detailed list tree based on each first hash value, to obtain a second detailed list tree.

[0118] In this embodiment, based on the detailed order sequence corresponding to the time node in the first detailed order tree, a first string corresponding to the first detailed order tree is generated; specifically, the Values ​​of all the time nodes in the first detailed order tree are re-sorted by time and pieced together into a string to obtain the first string.

[0119] After obtaining the first string, obtain the first hash value corresponding to the first string, that is, generate the HASH value corresponding to the first string, and update the day node corresponding to the time node in the first detailed tree based on each first hash value to obtain the second detailed tree. Specifically, update the HASH value corresponding to the first string to the Value of the corresponding day node.

[0120] After the second detailed order tree is obtained, based on the detailed order sequence of each sub-node in the second detailed order tree, the time node corresponding to each sub-node in the second detailed order tree is updated respectively to obtain the target detailed order tree. In a feasible implementation, step S204 may include steps S2041 to S2042:

[0121] Step S2041, generating a second character string corresponding to each second detailed order tree based on the detailed order sequence of the branch node in each second detailed order tree;

[0122] Step S2042, obtaining a second Hash value corresponding to the second character string, and updating a time node corresponding to each branch node in the second detailed order tree based on each second Hash value, to obtain a target detailed order tree.

[0123] In this embodiment, based on the detailed order sequence corresponding to the sub-nodes in the second detailed order tree, a second string corresponding to the second detailed order tree is generated; specifically, the Values ​​of all the sub-nodes in the second detailed order tree are re-sorted by time and pieced together into a string to obtain the second string.

[0124] After obtaining the second string, obtain the second hash value corresponding to the second string, that is, generate the HASH value corresponding to the second string, and update the time nodes corresponding to the sub-nodes in the second detailed order tree based on each second hash value to obtain the target detailed order tree, such as Figure 2 As shown, specifically, the HASH value corresponding to the second string is updated to the Value of the corresponding time node.

[0125] After obtaining the target detailed order tree, the target detailed order tree is uploaded to the blockchain. Specifically, Party A (the first inter-network settlement party) and Party B (the second inter-network settlement party) agree on the on-chain data structure, including the data storage KEY; Party A calls the developed smart contract, and the smart contract writes data (target detailed order tree) to the KEY; Party B calls the query smart contract through the KEY, and the query input parameter passes in the KEY; Party B obtains the data submitted by Party A from the chain for display. After Party B confirms, Party B calls the developed smart contract, and the smart contract writes data (confirmation mark) to the KEY; Party A calls the query smart contract through the KEY, and the query input parameter passes in the KEY; Party A obtains the data submitted by Party B from the chain for display and obtains confirmation. If Party B uploads the detailed order tree, A and B will execute the same process after exchanging.

[0126] The data processing method proposed in this embodiment processes the data of the detailed order to be processed to obtain the processing information corresponding to each data period, and then generates a first detailed order tree based on the processing information, the root configuration information corresponding to the detailed order to be processed, and the tree node combination mode, and then updates the day node corresponding to the time node in the first detailed order tree based on the detailed order sequence corresponding to the time node in the first detailed order tree to obtain the second detailed order tree; then updates the time node corresponding to each sub-node in the second detailed order tree based on the detailed order sequence of each sub-node in the second detailed order tree to obtain the target detailed order tree, and uploads the target detailed order tree to the blockchain, and flexibly configures the data combination rules, data periods and key fields of the tree, buckets the detailed orders from which the key fields are extracted based on the configured processing period, and sorts and combines the detailed orders in the buckets according to time, and then combines with efficient hash coding technology to generate a detailed order sequence, thereby realizing effective compression of massive detailed order data, and then constructs the detailed order tree according to the data combination rules of the tree with the compressed detailed order sequence, thereby improving data access efficiency and greatly saving storage space; so that multi-party network settlement can perform efficient comparison of detailed order levels through the detailed order tree.

[0127] The data processing device provided in the embodiment of the present application adopts the data processing method in the above embodiment, which can solve the technical problem of how to improve the efficiency of detailed bill comparison in inter-network settlement while ensuring data security and user privacy. Compared with the prior art, the beneficial effects of the data processing device provided in the embodiment of the present application are the same as the beneficial effects of the data processing method provided in the above embodiment, and other technical features in the data processing device are the same as the features disclosed in the above embodiment method, which will not be repeated here.

[0128] The present application provides a data processing device, which includes: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the data processing method in the above-mentioned embodiment 1.

[0129] Reference below Figure 3 , which shows a schematic diagram of the structure of a data processing device suitable for implementing an embodiment of the present application. The data processing device in the embodiment of the present application may include, but is not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Application Descriptions), PMPs (Portable Media Players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 3 The data processing device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0130] like Figure 3 As shown, the data processing device may include a processing device 1001 (e.g., a central processing unit, a graphics processor, etc.), which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM: Read Only Memory) 1002 or a program loaded from a storage device 1003 to a random access memory (RAM: Random Access Memory) 1004. In RAM1004, various programs and data required for the operation of the data processing device are also stored. The processing device 1001, ROM1002, and RAM1004 are connected to each other through a bus 1005. An input / output (I / O) interface 1006 is also connected to the bus. Generally, the following systems can be connected to the I / O interface 1006: an input device 1007 including, for example, a touch screen, a touch pad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; an output device 1008 including, for example, a liquid crystal display (LCD: Liquid Crystal Display), a speaker, a vibrator, etc.; a storage device 1003 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 1009. The communication device 1009 can allow the data processing device to communicate with other devices wirelessly or by wire to exchange data. Although the data processing device with various systems is shown in the figure, it should be understood that it is not required to implement or have all the systems shown. More or fewer systems can be implemented or have alternatively.

[0131] In particular, according to the embodiments disclosed in the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, the embodiments disclosed in the present application include a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device, or installed from a storage device 1003, or installed from a ROM 1002. When the computer program is executed by the processing device 1001, the above-mentioned functions defined in the method of the embodiment disclosed in the present application are executed.

[0132] The data processing device provided by the present application adopts the data processing method in the above embodiment, which can solve the technical problem of how to improve the efficiency of detailed bill comparison in inter-network settlement while ensuring data security and user privacy. Compared with the prior art, the beneficial effects of the data processing device provided by the present application are the same as the beneficial effects of the data processing method provided by the above embodiment, and the other technical features in the data processing device are the same as the features disclosed in the method of the previous embodiment, which will not be repeated here.

[0133] It should be understood that the various parts disclosed in this application can be implemented by hardware, software, firmware or a combination thereof. In the description of the above embodiments, specific features, structures, materials or characteristics can be combined in any one or more embodiments or examples in a suitable manner.

[0134] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art who is familiar with the present technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

[0135] The present application provides a computer-readable storage medium having computer-readable program instructions (ie, computer programs) stored thereon, wherein the computer-readable program instructions are used to execute the data processing method in the above-mentioned embodiment.

[0136] The computer-readable storage medium provided in the present application may be, for example, a USB flash drive, but is not limited to electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, systems or devices, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this embodiment, the computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, system or device. The program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to: wires, optical cables, RF (Radio Frequency), etc., or any suitable combination of the above.

[0137] The computer-readable storage medium may be included in the data processing device; or may exist independently without being installed in the data processing device.

[0138] The above-mentioned computer-readable storage medium carries one or more programs. When the above-mentioned one or more programs are executed by the data processing device, the data processing device: based on the identifier of the bill to be processed, obtains the first detailed bill tree to be processed corresponding to the first inter-network settlement party and the second detailed bill tree to be processed corresponding to the second inter-network settlement party in the blockchain; obtains the first day node corresponding to the first root node in the first detailed bill tree to be processed, and the second day node corresponding to the second root node in the second detailed bill tree to be processed; if there is a day node group in which the first day node is different from the corresponding second day node, determine the detailed bill error list based on the child nodes corresponding to the day node group; determine the detailed bill reconciliation report based on the detailed bill error list.

[0139] Computer program code for performing the operations of the present application may be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0140] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present application. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0141] The modules involved in the embodiments described in this application may be implemented by software or hardware, wherein the name of the module does not constitute a limitation on the unit itself in some cases.

[0142] The readable storage medium provided by the present application is a computer-readable storage medium, which stores computer-readable program instructions (i.e., computer programs) for executing the above-mentioned data processing method, and can solve the technical problem of how to improve the efficiency of detailed bill comparison in inter-network settlement while ensuring data security and user privacy. Compared with the prior art, the beneficial effects of the computer-readable storage medium provided by the present application are the same as the beneficial effects of the data processing method provided by the above-mentioned embodiment, and will not be repeated here.

[0143] An embodiment of the present application provides a computer program product, including a computer program, which implements the steps of the above-mentioned data processing method when executed by a processor.

[0144] The computer program product provided by this application can solve the technical problem of how to improve the efficiency of detailed bill comparison in inter-network settlement while ensuring data security and user privacy. Compared with the prior art, the beneficial effects of the computer program product provided by the embodiment of this application are the same as the beneficial effects of the data processing method provided by the above embodiment, which will not be repeated here.

[0145] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A data processing method, characterized in that: include: Based on the pending bill identifier, obtain in the blockchain a first pending detailed bill tree corresponding to the first inter-network settlement party and a second pending detailed bill tree corresponding to the second inter-network settlement party; Obtain the first day node corresponding to the first root node in the first to-be-processed detailed list tree, and the second day node corresponding to the second root node in the second to-be-processed detailed list tree; If there is a day node group in which the first day node is different from the corresponding second day node, determining a detailed single error list based on the child nodes corresponding to the day node group; A detailed bill reconciliation report is determined based on the detailed bill error list.

2. The data processing method according to claim 1, characterized in that: If there is a day node group in which the first day node is different from the corresponding second day node, the step of determining the detailed list error list based on the child nodes corresponding to the day node group includes: If there is a day node group in which the first day node is different from the corresponding second day node, obtain the first time node corresponding to the first day node in the day node group and the second time node corresponding to the second day node in the day node group; If there is a time node group in which the first time node is different from the corresponding second time node, obtaining the first sub-node corresponding to the first time node in the time node group and the second sub-node corresponding to the second time node in the time node group; If there is a sub-node group in which the first sub-node and the corresponding second sub-node are different, the detailed error list is generated based on the sub-node group.

3. The data processing method according to claim 1, characterized in that: The step of determining a detailed bill reconciliation report based on the detailed bill error list comprises: Based on the detailed order error list, obtaining a first detailed order list corresponding to the first inter-network settlement party and a second detailed order list corresponding to the second inter-network settlement party in the blockchain; Determining detailed order difference information based on the first detailed order list and the second detailed order list; When confirmation information corresponding to the detailed bill difference information is obtained in the blockchain, a detailed bill reconciliation report is determined based on the detailed bill difference information.

4. The data processing method according to claim 3, characterized in that: The step of obtaining, on the blockchain, a first detailed list corresponding to the first inter-network settlement party and a second detailed list corresponding to the second inter-network settlement party based on the detailed list error list includes: Uploading the detailed order error list to the blockchain, wherein the first inter-network settlement party uploads the corresponding first detailed order list to the blockchain based on the detailed order error list, and the second inter-network settlement party uploads the corresponding second detailed order list to the blockchain based on the detailed order error list; Obtain the first detailed order list and the second detailed order list in the blockchain.

5. The data processing method according to any one of claims 1 to 4, characterized in that: Before the step of obtaining the first to-be-processed detailed bill tree corresponding to the first inter-network settlement party and the second to-be-processed detailed bill tree corresponding to the second inter-network settlement party in the blockchain based on the to-be-processed bill identifier, the method further includes: Processing the detailed bill to be processed to obtain processing information corresponding to each data period, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence; Generate a first detailed order tree based on the processing information, the root configuration information corresponding to the detailed order to be processed, and the tree node combination mode, wherein the first detailed order tree includes a root node, a day node, an hour node, and a branch node; Based on the detailed order sequence corresponding to the time node in the first detailed order tree, the day nodes corresponding to the time node in the first detailed order tree are updated respectively to obtain a second detailed order tree; Based on the detailed order sequence of each sub-node in each second detailed order tree, the time node corresponding to each sub-node in the second detailed order tree is updated respectively to obtain the target detailed order tree, and the target detailed order tree is uploaded to the blockchain.

6. The data processing method according to claim 5, characterized in that: The step of respectively updating the day nodes corresponding to the time nodes in the first detailed list tree based on the detailed list sequence corresponding to the time nodes in the first detailed list tree to obtain the second detailed list tree comprises: Based on the detailed order sequence corresponding to the time node in the first detailed order tree, generate a first character string corresponding to the first detailed order tree; Obtain a first hash value corresponding to the first character string, and update the day node corresponding to the time node in the first detailed list tree based on each first hash value, to obtain a second detailed list tree; The step of respectively updating the time nodes corresponding to the sub-nodes in each second detailed order tree based on the detailed order sequence of the sub-nodes in each second detailed order tree to obtain the target detailed order tree comprises: Based on the detailed order sequences of the sub-nodes in each second detailed order tree, generate a second character string corresponding to each second detailed order tree; The second Hash value corresponding to the second character string is obtained, and the time nodes corresponding to the sub-nodes in each second detailed list tree are updated respectively based on each second Hash value to obtain a target detailed list tree.

7. The data processing method according to claim 5, characterized in that: The step of generating a first detailed list tree based on the processing information, the root configuration information corresponding to the detailed list to be processed, and the tree node combination mode comprises: Based on the service code and the root configuration information, a root node corresponding to the first detailed bill tree is generated, wherein if the bill identifier contains a target bill identifier that is not matched to the corresponding detailed bill tree, a corresponding root node is generated based on the target bill identifier; If, based on the time identifier and the day node configuration information in the tree node combination mode, it is determined that there is a first time identifier in the time identifier that is not matched to a day node, then based on the first time identifier and the detailed list sequence, a day node corresponding to the first time identifier is generated; Determine, based on the time identifier and the time node configuration information in the tree node combination mode, that there is a second time identifier in the time identifier that is not matched to a time node, and then generate a time node corresponding to the second time identifier based on the second time identifier and the detailed sequence; Based on the detailed list sequence, the sub-node corresponding to the first time node is updated, and based on the time identifier and the detailed list sequence, the sub-node corresponding to the second time node is generated to obtain the first detailed list tree, wherein the first time node is a time node for which a corresponding sub-node exists in each time node, and the second time node is a time node for which no corresponding sub-node exists in each time node.

8. The data processing method according to claim 5, characterized in that: The step of processing the data of the detailed list to be processed and obtaining the processing information corresponding to each data cycle includes: Performing a data extraction operation on the to-be-processed detailed form based on the key field information to obtain first detailed form data; Divide the first detailed list based on the data period to obtain second detailed list data corresponding to each data period; Each second detailed bill data is encoded to obtain processing information corresponding to each second detailed bill data, wherein the processing information includes a business code, a time identifier, a bill identifier, and a detailed bill sequence.

9. A data processing device, characterized in that: The data processing device comprises: a memory, a processor, and a data processing program stored in the memory and executable on the processor, wherein the data processing program implements the steps of the data processing method according to any one of claims 1 to 8 when executed by the processor.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a data processing program, and when the data processing program is executed by a processor, the steps of the data processing method according to any one of claims 1 to 8 are implemented.

Images