Data processing method and device, equipment and storage medium
Through multi-forktree and blockchain technology, the problem of low transaction record storage and comparison efficiency is solved, and efficient and secure transaction data management is achieved.
Patent Information
- Application Number
- CN202411282546.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-13
- Publication Date
- 2025-01-07
AI Technical Summary
In the era of big data, centralized storage of transaction records results in large storage space, low security, low data comparison efficiency, and long time.
Using multi-forktree and blockchain technology, multi-forktree is built by obtaining the characteristic values of transaction records and updating it to the blockchain. It uses the anti-tampering characteristics of blockchain to improve security and comparison efficiency, and directly compare multiple Parent node of the fork tree to reduce the number of comparisons.
It improves the security of transaction records and data comparison efficiency, shortens comparison time, enhances real-time, and reduces storage space requirements.
Smart Images
Figure CN119273349A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of data processing technology, and in particular to a data processing method, device, equipment and storage medium. Background Art
[0002] With the development of the big data era and economy, a large number of transactions occur every day and a large number of transaction records are generated accordingly. If these large number of transaction records are stored centrally, the required storage space is large and the transaction records are prone to illegal access and malicious tampering. Moreover, these large number of transaction records are generally compared at the end of the day or at a certain node. For example, for a simple transfer transaction, the payer needs to process the payment business and the payee needs to process the collection business. Both parties need to check the account flow at the end of the day. However, due to the large amount of transaction records generated every day, if the transaction records are compared one by one, it will take a long time and the processing efficiency will be low. Summary of the invention
[0003] The present application provides a data processing method, apparatus, device and storage medium, which can effectively process data to improve the efficiency of data comparison.
[0004] In the first aspect, an embodiment of the present application provides a data processing method, which can be executed by a data processing device, which can be a terminal device or a module for a terminal device, or a server or a module for a server. The present application does not limit the execution subject of the method. The method includes: obtaining each transaction record processed by the transaction component in the same first time dimension; determining the characteristic value of each transaction record in each transaction record, and using the characteristic value of each transaction record as a leaf node under the same upper node in the multi-branch tree of the transaction component; updating the multi-branch tree of the transaction component according to the characteristic value of each transaction record; wherein each layer of the multi-branch tree of the transaction component from the leaf node to the root node is determined according to the child nodes under different time dimensions, the first time dimension is the minimum time dimension under different time dimensions and the time dimension corresponding to each layer is gradually increasing; updating the multi-branch tree of the transaction component to the blockchain; the blockchain stores the multi-branch tree of each transaction component in the transaction group.
[0005] In the above scheme, the leaf nodes of the multi-branch tree correspond to the characteristic values of each transaction record, rather than each transaction record, which improves the security of each transaction record; the characteristic values corresponding to the parent nodes of the multi-branch tree are obtained by encrypting the leaf nodes, which further improves the security of each transaction record; the multi-branch tree is written into the blockchain, and the anti-tampering characteristics of the blockchain are used to further improve the security of each transaction record. At the same time, the characteristic values of each transaction record and the characteristic values of the parent node are written into the blockchain, and there is no specific transaction record in the blockchain, which reduces the storage space and ensures the security of the transaction record. When comparing data, the parent node of the multi-branch tree can be directly compared. If the parent nodes are the same, there is no need to compare the child nodes corresponding to the parent nodes. Therefore, this application does not need to compare the transaction records one by one, shortening the data comparison time and improving the data comparison efficiency. The multi-branch tree in the blockchain is updated periodically, that is, the multi-branch tree in the blockchain corresponds to the latest transaction record. When there is an urgent need for data comparison, it can quickly determine whether the data is the same, which improves the real-time performance of data comparison.
[0006] In a possible implementation method, key information of each transaction record in each transaction record is determined; the key information of each transaction record is subjected to a hash operation to determine a characteristic value of each transaction record.
[0007] In the above scheme, the hash values obtained by performing hash operations on the same data are the same, and the hash values obtained by performing hash operations on different data are different. Therefore, the hash value obtained by performing hash operations on the key information of the transaction record is used as the characteristic value. The characteristic value can accurately represent the transaction record. Therefore, when the characteristic values are different, it can be accurately determined that the corresponding transaction records are different; and the characteristic value is obtained through hash operations, which reduces the possibility of transaction records being tampered with and improves the security of transaction records.
[0008] In a possible implementation method, a multi-branch tree of each transaction component in a transaction group is obtained from the blockchain; it is determined whether the root nodes of the multi-branch tree of each transaction component are the same, and if they are the same, it is determined that the transaction records processed by each transaction component are consistent.
[0009] In the above scheme, if the root nodes corresponding to the multi-branch trees of each transaction component are the same, there is no need to compare other nodes, thereby improving the efficiency of data comparison.
[0010] In a possible implementation method, if the root nodes are different, different lower-level nodes in the lower-level nodes of the root node under the multi-branch tree of each transaction component are determined; and the abnormal transaction records processed by each transaction component are determined through the leaf nodes corresponding to the different lower-level nodes.
[0011] In the above scheme, if the root nodes corresponding to the multi-branch trees of each transaction component are different, the child nodes under the root nodes are compared until the different leaf nodes of the multi-branch trees of each transaction component are determined. Compared with comparing each transaction record to determine the abnormal transaction record, the number of data comparisons is reduced and the efficiency of data comparison is improved.
[0012] In a possible implementation method, transaction components in a transaction group may be added or deleted.
[0013] The above solution, due to the expansion of business scenarios, may have new transaction components connected, providing a simpler access solution for multi-party data comparison, reflecting the flexibility of transaction components, especially when there are many transaction components in the transaction group, it can greatly reduce the number of data comparisons and improve the efficiency of data comparison.
[0014] In a possible implementation method, the key information of each transaction record includes one or more of transaction time, transaction serial number, transaction type, transaction amount or payment account number.
[0015] The above solution can process transaction records with different contents, thereby improving the diversity and applicability of data processing.
[0016] In the second aspect, the embodiment of the present application provides a data processing device, including: an acquisition unit, a determination unit and an update unit. The acquisition unit is used to acquire each transaction record processed by the transaction component within the same first time dimension; the determination unit is used to determine the characteristic value of each transaction record in each transaction record, and use the characteristic value of each transaction record as a leaf node under the same upper node in the multi-branch tree of the transaction component; the update unit is used to update the multi-branch tree of the transaction component according to the characteristic value of each transaction record; wherein each layer of the multi-branch tree of the transaction component from the leaf node to the root node is determined according to the child nodes under different time dimensions, the first time dimension is the minimum time dimension under different time dimensions and the time dimensions corresponding to each layer are gradually increasing; the multi-branch tree of the transaction component is updated to the blockchain; the blockchain stores the multi-branch tree of each transaction component in the transaction group.
[0017] In a possible implementation method, the determination unit is specifically used to determine the key information of each transaction record in each transaction record; the key information of each transaction record is subjected to a hash operation to determine a characteristic value of each transaction record.
[0018] In a possible implementation method, the acquisition unit is also used to obtain the multi-branch tree of each transaction component in the transaction group from the blockchain; the determination unit is also used to determine whether the root nodes of the multi-branch tree of each transaction component are the same. If they are the same, it is determined that the transaction records processed by each transaction component are consistent.
[0019] In a possible implementation method, the determination unit is also used to determine different lower-level nodes in the lower-level nodes of the root node under the multi-branch tree of each transaction component if the root nodes are different; and determine the abnormal transaction records processed by each transaction component through the leaf nodes corresponding to the different lower-level nodes.
[0020] In a possible implementation method, transaction components in a transaction group may be added or deleted.
[0021] In a possible implementation method, the key information of each transaction record includes one or more of transaction time, transaction serial number, transaction type, transaction amount or payment account number.
[0022] In a third aspect, an embodiment of the present application further provides a computing device, including:
[0023] A memory for storing program instructions;
[0024] The processor is used to call the program instructions stored in the memory, and execute any method of implementing the above-mentioned first aspect according to the obtained program instructions.
[0025] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, in which computer-readable instructions are stored. When a computer reads and executes the computer-readable instructions, any method of the above-mentioned first aspect is implemented.
[0026] In a fifth aspect, an embodiment of the present application provides a computer program product, comprising a computer program executable by a computer device, wherein when the program runs on the computer device, the computer device executes any method for implementing the above-mentioned first aspect. BRIEF DESCRIPTION OF THE DRAWINGS
[0027] Figure 1 A flowchart of a data processing method provided in an embodiment of the present application;
[0028] Figure 2 A schematic diagram of a multi-branch tree construction process provided in an embodiment of the present application;
[0029] Figure 3 A flowchart of a data updating method provided in an embodiment of the present application;
[0030] Figure 4 A flow chart of a data comparison method provided in an embodiment of the present application;
[0031] Figure 5 A schematic diagram of the structure of a multi-branch tree provided in an embodiment of the present application;
[0032] Figure 6 A result schematic diagram of a multi-branch tree provided in an embodiment of the present application;
[0033] Figure 7 A schematic diagram of the structure of a data processing device provided in an embodiment of the present application;
[0034] Figure 8 A schematic diagram of the structure of a data processing device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0035] The acquisition, storage, use, and processing of data in the technical solution of this application comply with the relevant provisions of national laws and regulations.
[0036] Figure 1 A flow chart of a data processing method provided in an embodiment of the present application, the method can be executed by a data processing device, the data processing device can be a terminal device or a module for a terminal device, or a server or a module for a server. The present application does not limit the execution subject of the method.
[0037] The method comprises the following steps:
[0038] Step 101, obtaining each transaction record processed by the transaction component within the same first time dimension.
[0039] In a possible implementation method, the business processing of an account often involves the collaborative processing of multiple components. Different components can provide different services, and multiple components together constitute a complete processing link for a business. Usually, in order to ensure the consistency of the account information registered by multiple components for this business, it is necessary to reconcile the corresponding account data of each component for this business. At present, the main popular reconciliation method is the two-to-two reconciliation / multi-party reconciliation method. Generally, each component checks the account transaction data occurring within a period of time with the account flow information of each associated component. The reconciliation method is mainly that each component batch transmits the account data occurring within the time period to the component that needs to be reconciled according to the agreed time and frequency. Each component checks the account transaction flow on demand and performs corresponding exception processing according to the reconciliation difference. For example, for a simple transfer transaction, the payer needs to process the payment business, and the payee needs to process the collection business. Both parties need to check the account flow to discover and handle the problem of inconsistent transaction status between the payee and the payee, and perform corresponding exception processing to avoid causing a bad user experience for customers.
[0040] In one possible implementation method, transaction components in a transaction group can be added or deleted. Due to the expansion of business scenarios, new transaction components may be connected. This solution provides a simpler access solution for multi-party data comparison and reflects the flexibility of transaction components. Especially when there are many transaction components in a transaction group, it can greatly reduce the number of data comparisons and improve the efficiency of data comparison.
[0041] In one possible implementation method, the same first time dimension means that each transaction record has the same time dimension, that is, each transaction record may be a transaction record of the same minute, a transaction record of the same hour, or a transaction record of the same day. This application does not limit the specific value of the first time dimension.
[0042] Step 102, determining a characteristic value of each transaction record in each transaction record, and using the characteristic value of each transaction record as a leaf node under the same upper node in the multi-branch tree of the transaction component.
[0043] In a possible implementation method, key information of each transaction record in each transaction record is determined; the key information of each transaction record is subjected to a hash operation to determine a characteristic value of each transaction record.
[0044] In one possible implementation method, the key information of each transaction record includes one or more of the transaction time, transaction serial number, transaction type, transaction amount, or payment account. Of course, the transaction record may also include other content, and this application does not limit the specific content of the transaction record. Among them, the transaction type can be any one of transfer, repayment, collection, or consumption, and the transaction type can also be other types, and this application does not limit the transaction type. This solution can realize the processing of key information of transaction records with different contents, thereby improving the diversity and applicability of data processing.
[0045] In a possible implementation method, the key information of each transaction record is subjected to a hash operation to determine the characteristic value of each transaction record. Specifically, the transaction time, transaction serial number, transaction type, transaction amount and payment account number in the transaction record are determined as key information. After the key information is arranged in a pre-set order to form a new string, the hash value obtained after the new string is hashed is the characteristic value. The characteristic value can also be obtained according to other algorithms, and the present application does not limit the method for determining the characteristic value. In this scheme, the hash value obtained by hashing the same data is the same, and the hash value obtained by hashing different data is different. Therefore, the hash value obtained by hashing the key information of the transaction record is used as the characteristic value. The characteristic value can accurately represent the transaction record. Therefore, when the characteristic value is different, it can be accurately determined that the corresponding transaction records are different; and the characteristic value is obtained by hashing, which reduces the possibility of transaction records being tampered with and improves the security of transaction records.
[0046] Step 103, updating the multi-branch tree of transaction components according to the characteristic value of each transaction record.
[0047] Among them, each layer of the multi-branch tree of the transaction component from the leaf node to the root node is determined according to the child nodes under different time dimensions, the first time dimension is the minimum time dimension under different time dimensions and the time dimensions corresponding to each layer are gradually increasing.
[0048] In one possible implementation method, the feature value of the parent node is determined based on the feature value of the child node and a hash operation.
[0049] In one possible implementation method, the first time dimension is the minimum time dimension under different time dimensions and the time dimensions corresponding to each layer gradually increase. Specifically, if the first time dimension is the same minute, the time dimension above the first time dimension is the same hour, and the time dimension above the time dimension of the same hour is the same day, etc.; this application does not limit the time dimension of each layer, it only requires that the time dimension corresponding to each layer gradually increase.
[0050] Step 104, update the multi-branch tree of transaction components to the blockchain.
[0051] In a possible implementation method, a specific example is used to illustrate how a multi-branch tree is constructed. Among them, multiple transaction records are obtained as shown in Table 1. Among them, the first time dimension is the same minute, transaction record 1, transaction record 2 and transaction record 3 are transaction records of the same first time dimension; transaction record 4, transaction record 5 and transaction record 6 are transaction records of the same first time dimension; transaction record 7, transaction record 8 and transaction record 9 are transaction records of the same first time dimension; transaction record 10, transaction record 11 and transaction record 12 are transaction records of the same first time dimension.
[0052] Table 1
[0053]
[0054] In a possible implementation method, a hash operation is performed on each transaction record in Table 1 to determine the characteristic value corresponding to each transaction record, as shown in Table 2. The characteristic value is used as the leaf node of the multi-branch tree, such as Figure 2 (a) shown.
[0055] Table 2
[0056]
[0057]
[0058] In a possible implementation method, multiple first node groups are determined according to the transaction time and characteristic values corresponding to the multiple transaction records in Tables 1 and 2 above, each of which contains multiple hash values, and the transaction time corresponding to the multiple hash values is the same minute. Multiple first node groups are shown in Table 3. It can be seen from Table 3 that the transaction time corresponding to transaction record 1, transaction record 2, and transaction record 3 is the same minute, and the transaction time corresponding to transaction record 1, transaction record 2, and transaction record 3 has the same year, month, day, hour, and minute. Therefore, the hash values corresponding to transaction record 1, transaction record 2, and transaction record 3 are recorded in the first node group A, that is, the content contained in the first node group A is: [hash value A1, hash value A2, hash value A3]. Similar to the construction process of the first node group A, the content contained in the first node group B is: [hash value A4, hash value A5, hash value A6], the content contained in the first node group C is: [hash value A7, hash value A8, hash value A9], and the content contained in the first node group D is: [hash value A10, hash value A11, hash value A12].
[0059] Table 3
[0060]
[0061]
[0062] In a possible implementation method, a hash operation is performed on the characteristic values in the first node group to determine the second parent node corresponding to the leaf node. The time dimension of the third parent node is the same minute, and the second parent node is shown in Table 4. For example, a hash operation is performed on [hash value A1, hash value A2, hash value A3] in the first node group A to obtain a hash value B1, and the hash value B1 is the second parent node. Similarly, a hash operation is performed on [hash value A4, hash value A5, hash value A6] in the first node group B to obtain a hash value B2, and the hash value B2 is the second parent node. A hash operation is performed on [hash value A7, hash value A8, hash value A9] in the first node group C to obtain a hash value B3, and the hash value B3 is the second parent node. A hash operation is performed on [hash value A10, hash value A11, hash value A12] in the first node group D to obtain a hash value B4, and the hash value B4 is the second parent node. The result after writing the second parent node into the multi-branch tree is as follows: Figure 2 (b) as shown.
[0063] Table 4
[0064]
[0065] In a possible implementation method, the second node group is determined according to the transaction time and the second parent node, and the second node group is shown in Table 5. As can be seen from Table 5, the transaction time corresponding to transaction record 1, transaction record 2, transaction record 3, transaction record 4, transaction record 5 and transaction record 6 is the same hour, and the transaction time corresponding to transaction record 1, transaction record 2, transaction record 3, transaction record 4, transaction record 5 and transaction record 6 has the same year, month, day and time. Therefore, the second parent nodes corresponding to the first node group A and the first node group B are respectively written into the second node group A, that is, the content contained in the second node group A is: [hash value B1, hash value B2]. Similar to the construction process of the second node group A, the content contained in the second node group B is: [hash value B3, hash value B4].
[0066] Table 5
[0067]
[0068] In one possible implementation method, a hash operation is performed on the second parent node in the second node group to determine the third parent node. The time dimension of the third parent node is the same hour. The third parent node is shown in Table 6. The child node under the third parent node is the second parent node. For example, a hash operation is performed on [hash value B1, hash value B2] in the second node group A to obtain a hash value C1, and the hash value C1 is the third parent node. Similarly, a hash operation is performed on [hash value B3, hash value B4] in the second node group B to obtain a hash value C2, and the hash value C2 is the third parent node. The result after writing the third parent node into the multi-branch tree is as follows: Figure 2 (c) as shown.
[0069] Table 6
[0070]
[0071]
[0072] In a possible implementation method, the third node group is determined according to the transaction time and the third parent node, and the third node group is shown in Table 7. As can be seen from Table 7, the transaction time corresponding to transaction record 1, transaction record 2, transaction record 3, transaction record 4, transaction record 5, transaction record 6, transaction record 7, transaction record 8, transaction record 9, transaction record 10, transaction record 11 and transaction record 12 is the same day, and the transaction time corresponding to transaction record 1, transaction record 2, transaction record 3, transaction record 4, transaction record 5, transaction record 6, transaction record 7, transaction record 8, transaction record 9, transaction record 10, transaction record 11 and transaction record 12 has the same year, month and day, therefore, the third parent nodes corresponding to the second node group A and the second node group B are respectively written into the third node group A, that is, the content contained in the third node group A is: [hash value C1, hash value C2].
[0073] Table 7
[0074]
[0075]
[0076] In a possible implementation method, a hash operation is performed on the third parent node in the third node group to determine the fourth parent node. The time dimension of the fourth parent node is the same day. The fourth parent node is shown in Table 8. The child node of the fourth parent node is the third parent node. For example, a hash operation is performed on [hash value C1, hash value C2] in the third node group A to obtain a hash value D1, and the hash value D1 is the fourth parent node. The result after writing the second parent node into the multi-branch tree is as follows Figure 2 (d) as shown.
[0077] Table 8
[0078]
[0079] In the above scheme, the leaf nodes of the multi-branch tree correspond to the characteristic values of each transaction record, rather than each transaction record, which improves the security of each transaction record; the characteristic values corresponding to the parent nodes of the multi-branch tree are obtained by encrypting the leaf nodes, which further improves the security of each transaction record; the multi-branch tree is written into the blockchain, and the anti-tampering characteristics of the blockchain are used to further improve the security of each transaction record. At the same time, the characteristic values of each transaction record and the characteristic values of the parent node are written into the blockchain, and there is no specific transaction record in the blockchain, which reduces the storage space and ensures the security of the transaction record. When comparing data, the parent node of the multi-branch tree can be directly compared. If the parent nodes are the same, there is no need to compare the child nodes corresponding to the parent nodes. Therefore, this application does not need to compare the transaction records one by one, shortening the data comparison time and improving the data comparison efficiency. The multi-branch tree in the blockchain is updated periodically, that is, the multi-branch tree in the blockchain corresponds to the latest transaction record. When there is an urgent need for data comparison, it can quickly determine whether the data is the same, which improves the real-time performance of data comparison.
[0080] In a possible implementation method, the steps of updating the multi-branch tree constructed according to the transaction data in Table 1 are as follows: Figure 3 As shown, the method comprises the following steps:
[0081] Step 301: Update the second parent node.
[0082] In one possible implementation method, each transaction record processed within the same first time dimension is periodically obtained, and the multi-branch tree is updated according to each transaction record processed within the same first time dimension, wherein periodicity refers to obtaining each transaction record processed within the same first time dimension every minute, or obtaining each transaction record processed within the same first time dimension every hour. Of course, each transaction record processed within the same first time dimension may also be obtained at other time intervals, and this application does not limit this.
[0083] In one possible implementation method, if the second parent node corresponding to each transaction record processed within the same first time dimension already exists, after determining the characteristic value of each transaction record in each transaction record, the characteristic value is added to the corresponding first node group, and the second parent node is updated according to the updated first node group.
[0084] In a possible implementation method, if the second parent node corresponding to each transaction record processed within the same first time dimension does not exist, after determining the characteristic value of each transaction record in each transaction record, a new first node group is created, and a new second parent node is created based on the newly created first node group.
[0085] Step 302: Update the third parent node.
[0086] In one possible implementation method, whether a new second node grouping needs to be created is determined based on the newly created second parent node or the updated second parent node. If a new second node grouping does not need to be created, the corresponding second node grouping is updated, and the third parent node is updated based on the updated second node grouping. If a new second node grouping needs to be created, a new second node grouping is created, and a new third parent node is created based on the newly created second node grouping.
[0087] Step 303: Update the fourth parent node.
[0088] In one possible implementation method, whether a new third node grouping is needed is determined based on the newly created third parent node or the updated third parent node. If a new third node grouping is not needed, the corresponding third node grouping is updated, and the fourth parent node is updated based on the updated third node grouping. If a new third node grouping is needed, a new third node grouping is created, and the fourth parent node is updated based on the newly created third node grouping.
[0089] In one possible implementation method, the method for comparing the multi-trees of each transaction component is as follows: Figure 4 As shown, the method comprises the following steps:
[0090] Step 401, obtaining a multi-branch tree of each transaction component in the transaction group from the blockchain.
[0091] In one possible implementation method, the transaction components are Bank A and Bank B. There are multiple transaction records between Bank A and Bank B. The multiple transaction records will be recorded separately, and the multiple transaction records will be reconciled at the end of the day or at a certain node. Then, Bank A will generate a multi-branch tree A corresponding to Bank A based on the multiple transaction records. Similarly, Bank B will generate a multi-branch tree B corresponding to Bank B based on the multiple transaction records. Bank A writes the multi-branch tree A into the blockchain, and Bank B writes the multi-branch tree B into the blockchain.
[0092] In a possible implementation method, when a transaction component receives a reconciliation request, it obtains the multitree of each transaction component from the blockchain and compares the multitrees of each transaction component. For example, after bank A and / or bank B receives a reconciliation request, they obtain multitree A and multitree B from the blockchain and compare multitree A and multitree B.
[0093] Step 402, comparing the root nodes corresponding to the multi-branch trees of each transaction component.
[0094] In a possible implementation method, first determine whether the root nodes corresponding to the multi-branch trees of each transaction component are the same. If the root nodes corresponding to the multi-branch trees of each transaction component are the same, then any node in the multi-branch trees of each transaction component is the same, that is, it is determined that the transaction records processed by each transaction component are consistent. Therefore, there is no need to compare other nodes of the multi-branch trees of each transaction component. If the root nodes corresponding to the multi-branch trees of each transaction component are different, then compare the child nodes of the root nodes of the multi-branch trees of each transaction component.
[0095] Step 403, comparing the child nodes under the root node.
[0096] In a possible implementation method, if the root nodes are different, different lower-level nodes in the lower-level nodes of the root node under the multi-branch tree of each transaction component are determined; and the abnormal transaction records processed by each transaction component are determined through the leaf nodes corresponding to the different lower-level nodes.
[0097] In a possible implementation method, the child nodes of the root node of the multi-branch tree of each transaction component are compared to determine whether there is at least one different child node, and the child nodes of the at least one different child node are judged until different leaf nodes of the multi-branch tree of each transaction component are determined. Figure 5 As shown, it contains a multi-branch tree 1, such as Figure 6 The multitree 2 shown in the figure includes a multitree 2, in which the obstructed nodes are different nodes of the two binary trees, that is, the D1 node is different from the H1 node, the C1 node is different from the G1 node, the B1 node is different from the F1 node, and the A1 node is different from the E1 node. Then, the multitree 1 and the multitree 2 are compared, including the following steps: judging the root nodes of the multitree 1 and the multitree 2, that is, the D1 node and the H1 node, and finding that the eigenvalues corresponding to the D1 node and the H1 node are different, and then comparing the eigenvalues of the C1 node and the G1 node, and the eigenvalues of the C2 node and the G2 node. Since the eigenvalues of the C2 node and the G2 node are the same, there is no need to compare the C2 node with the G2 node. 2, and the eigenvalues of C1 and G1 are different, then the eigenvalues of B1 and F1, B2 and F2, and B3 and F3 are compared. Since the eigenvalues of B2 and F2 are the same, and the eigenvalues of B3 and F3 are the same, there is no need to compare the child nodes of B2 and F2, and the child nodes of B3 and F3. If the eigenvalues of B1 and F1 are different, then the eigenvalues of A1, A2 and E2, and A3 and E3 are compared. If it is found that the eigenvalues of A1 and E1 are different, the eigenvalues of A2 and E2 are the same, and the eigenvalues of A3 and E3 are the same, then it is determined that the different leaf nodes of multitree 1 and multitree 2 are A1 and E1.
[0098] In the above scheme, if the root nodes corresponding to the multi-branch trees of each transaction component are the same, there is no need to compare other nodes, thereby improving the efficiency of data comparison; if the root nodes corresponding to the multi-branch trees of each transaction component are different, the child nodes under the root nodes are compared until the different leaf nodes of the multi-branch trees of each transaction component are determined. Compared with comparing each transaction record, the number of data comparisons is reduced, thereby improving the efficiency of data comparison.
[0099] Based on the same technical concept, Figure 7 A data processing device 700 provided in an embodiment of the present application is exemplarily shown. Figure 7 As shown, it includes: an acquisition unit 701, a determination unit 702 and an update unit 703. The acquisition unit 701 is used to acquire each transaction record processed by the transaction component in the same first time dimension; the determination unit 702 is used to determine the characteristic value of each transaction record in each transaction record, and use the characteristic value of each transaction record as a leaf node under the same upper node in the multi-branch tree of the transaction component; the update unit 703 is used to update the multi-branch tree of the transaction component according to the characteristic value of each transaction record; wherein, each layer of the multi-branch tree of the transaction component from the leaf node to the root node is determined according to the child nodes under different time dimensions, the first time dimension is the minimum time dimension under different time dimensions and the time dimension corresponding to each layer is gradually increasing; the multi-branch tree of the transaction component is updated to the blockchain; the blockchain stores the multi-branch tree of each transaction component in the transaction group.
[0100] In a possible implementation method, the determination unit 702 is specifically used to determine the key information of each transaction record in each transaction record; the key information of each transaction record is subjected to a hash operation to determine the characteristic value of each transaction record.
[0101] In a possible implementation method, the acquisition unit 701 is also used to obtain the multi-branch tree of each transaction component in the transaction group from the blockchain; the determination unit 702 is also used to determine whether the root nodes of the multi-branch tree of each transaction component are the same. If they are the same, it is determined that the transaction records processed by each transaction component are consistent.
[0102] In a possible implementation method, the determination unit 702 is also used to determine different lower-level nodes in the lower-level nodes of the root node under the multi-branch tree of each transaction component if the root nodes are different; and determine the abnormal transaction records processed by each transaction component through the leaf nodes corresponding to the different lower-level nodes.
[0103] In a possible implementation method, transaction components in a transaction group may be added or deleted.
[0104] In a possible implementation method, the key information of each transaction record includes one or more of the transaction time, transaction serial number, transaction type, transaction amount, or payment account. Based on the same technical concept, the embodiment of the present application provides a data processing device 800, which can be a computing device, for example. Figure 8 As shown, a data processing device 800 includes at least one processor 801 and a memory 802 connected to the at least one processor. The specific connection medium between the processor 801 and the memory 802 is not limited in the embodiment of the present application. Figure 8 For example, the processor 801 and the memory 802 are connected via a bus. The bus can be divided into an address bus, a data bus, a control bus, etc.
[0105] In the embodiment of the present application, the memory 802 stores instructions that can be executed by at least one processor 801, and the at least one processor 801 can execute the above-mentioned data processing method by executing the instructions stored in the memory 802.
[0106] Among them, the processor 801 is a control center of a data processing device 800, which can use various interfaces and lines to connect various parts of the computer device, and perform resource settings by running or executing instructions stored in the memory 802 and calling data stored in the memory 802. Optionally, the processor 801 may include one or more determination units, and the processor 801 may integrate an application processor and a modem processor, wherein the application processor mainly processes an operating system, a user interface, and application programs, and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 801. In some embodiments, the processor 801 and the memory 802 may be implemented on the same chip, and in some embodiments, they may also be implemented separately on independent chips.
[0107] Processor 801 can be a general-purpose processor, such as a central processing unit (CPU), a digital signal processor, an application-specific integrated circuit (ASIC), a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and can implement or execute the methods, steps and logic block diagrams disclosed in the embodiments of the present application. A general-purpose processor can be a microprocessor or any conventional processor, etc. The steps of the method disclosed in the embodiments of the present application can be directly embodied as a hardware processor for execution, or can be executed by a combination of hardware and software modules in the processor.
[0108] The memory 802 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs, non-volatile computer executable programs and modules. The memory 802 may include at least one type of storage medium, such as a flash memory, a hard disk, a multimedia card, a card-type memory, a random access memory (Random Access Memory, RAM), a static random access memory (Static Random Access Memory, SRAM), a programmable read-only memory (Programmable Read Only Memory, PROM), a read-only memory (Read Only Memory, ROM), an electrically erasable programmable read-only memory (Electrically Erasable Programmable Read-Only Memory, EEPROM), a magnetic memory, a disk, an optical disk, etc. The memory 802 is any other medium that can be used to carry or store a desired program code in the form of an instruction or data structure and can be accessed by a computer, but is not limited thereto. The memory 802 in the embodiment of the present application can also be a circuit or any other device that can realize a storage function, for storing program instructions and / or data.
[0109] An embodiment of the present application also provides a computer-readable storage medium, which stores a computer-executable program. The computer-executable program is used to enable a computer to execute a data processing method listed in any of the above-mentioned methods.
[0110] An embodiment of the present application provides a computer program product, including a computer program executable by a computer device. When the program is run on the computer device, the computer device executes a data processing method listed in any of the above-mentioned ways.
[0111] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0112] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0113] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0114] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0115] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.
Claims
1. A data processing method, characterized in that: Applicable to any transaction component in the same transaction group, the method includes: Obtain each transaction record processed by the transaction component in the same first time dimension; Determine a characteristic value of each transaction record in the transaction records, and use the characteristic value of each transaction record as a leaf node under the same upper node in the multi-branch tree of the transaction component; According to the characteristic values of each transaction record, the multi-branch tree of the transaction component is updated; wherein each layer of the multi-branch tree of the transaction component from the leaf node to the root node is determined according to the child nodes under different time dimensions, the first time dimension is the minimum time dimension under different time dimensions and the time dimensions corresponding to each layer are gradually increased; The multi-branch tree of the transaction components is updated to the blockchain; the multi-branch tree of each transaction component in the transaction group is stored on the blockchain.
2. The method according to claim 1, characterized in that The determining of the characteristic value of each transaction record in the transaction records includes: Determine key information of each transaction record in the transaction records; The key information of each transaction record is subjected to a hash operation to determine a characteristic value of each transaction record.
3. The method according to claim 1, characterized in that The method further comprises: Obtaining a multi-branch tree of each transaction component in the transaction group from the blockchain; It is determined whether the root nodes of the multi-branch trees of the transaction components are the same. If they are the same, it is determined that the transaction records processed by the transaction components are consistent.
4. The method according to claim 3, characterized in that The determining whether the root nodes of the multi-branch trees of the transaction components are the same further includes: If the root nodes are different, determining different lower-level nodes among the lower-level nodes of the root nodes under the multi-branch tree of each transaction component; The abnormal transaction records processed by each transaction component are determined through the leaf nodes corresponding to the different lower-level nodes.
5. The method according to claim 1, characterized in that Transaction components in the transaction group may be added or deleted.
6. The method according to claim 2, characterized in that The key information of each transaction record includes one or more of transaction time, transaction serial number, transaction type, transaction amount or payment account number.
7. A data processing device, characterized in that: It includes acquisition unit, determination unit and update unit: The acquisition unit is used to acquire each transaction record processed by the transaction component within the same first time dimension; The determining unit is used to determine a characteristic value of each transaction record in the transaction records, and use the characteristic value of each transaction record as a leaf node under the same upper node in the multi-branch tree of the transaction component; The updating unit is used to update the multi-branch tree of the transaction component according to the characteristic value of each transaction record; wherein each layer of the multi-branch tree of the transaction component from the leaf node to the root node is determined according to the child nodes under different time dimensions, the first time dimension is the minimum time dimension under different time dimensions and the time dimensions corresponding to each layer are gradually increasing; the multi-branch tree of the transaction component is updated to the blockchain; the blockchain stores the multi-branch tree of each transaction component in the transaction group.
8. A computing device, characterized in that include: A memory for storing program instructions; A processor is used to call the program instructions stored in the memory, and execute the method according to any one of claims 1 to 6 according to the obtained program instructions.
9. A computer-readable storage medium, characterized in that: The method comprises computer-readable instructions, and when a computer reads and executes the computer-readable instructions, the method according to any one of claims 1 to 6 is implemented.
10. A computer program product, characterized in that The invention comprises a computer program executable by a computer device, and when the program is run on the computer device, the computer device is caused to execute the steps of the method according to any one of claims 1 to 6.