Data processing methods, apparatus, equipment, storage media and program products
By establishing a multi-level data node structure in financial data processing, dynamically determining the data distribution path, and automatically managing tasks when sub-nodes are restricted, the problems of fixed data distribution paths and insufficient automated scheduling are solved, achieving efficient and stable data distribution.
Patent Information
- Application Number
- CN202611611678.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-10-19
- Publication Date
- 2026-11-17
AI Technical Summary
In existing financial data processing solutions, the fixed data distribution path leads to insufficient flexibility, and the lack of an automated task scheduling mechanism results in delayed response and a high risk of errors.
Establish a multi-level data node structure, dynamically determine the data distribution path through the tag field, and automatically obtain the restricted quota and the processing quota when the child node access is restricted, pause or resume the data distribution task, and set overdraft or borrow parameters for differentiated management.
It enables flexible configuration and automated management of data distribution paths, improves processing efficiency and operational stability in financial data distribution scenarios, and avoids response delays and errors caused by manual intervention.
Smart Images

Figure CN123114709A_ABST
Abstract
Description
Technical Field
[0001] This disclosure relates to the field of big data technology, and can be applied to the financial field, and more specifically to a data processing method, apparatus, device, storage medium and program product. Background Technology
[0002] In financial data processing scenarios, routine data merging and distribution are required between upper and lower processing levels. Existing solutions typically employ pre-defined distribution paths, which require reconfiguration when data types or routing rules change, resulting in insufficient flexibility. Furthermore, when lower-level processing ends experience access restrictions due to changes in access permissions, existing solutions lack automated task scheduling mechanisms, often relying on manual intervention to pause and resume data distribution operations. This leads to lag, error-proneness, and fails to meet the actual demands for processing efficiency and automation in financial data distribution scenarios. Summary of the Invention
[0003] In view of the above problems, this disclosure provides a data processing method, apparatus, device, storage medium, and program product.
[0004] According to a first aspect of this disclosure, a data processing method is provided, comprising: establishing a multi-level data node structure including a root node and at least one child node, and setting a label field for the data structure of each child node; determining the data distribution path of the child node based on the value of the label field; in response to access restriction of the child node, obtaining the restricted quota and the processable quota of the child node, wherein the restricted quota is the amount of data to be restricted in the child node, and the processable quota is the amount of available data in the child node; if the restricted quota is greater than the processable quota, suspending the data distribution task of the child node and marking it as over-restricted; and automatically removing the over-restricted mark and resuming the data distribution task of the child node if it is detected that the restricted quota has recovered to no greater than the processable quota.
[0005] According to embodiments of this disclosure, the root node is configured to be associated with a first type of data object, and the child nodes are configured to be associated with subordinate data objects; when the label field is a first value, the data distribution path is a two-layer distribution path; when the label field is a second value, the data distribution path is a three-layer distribution path; the data value of the root node is equal to the sum of the root node's own data value and the merged data values of each child node.
[0006] According to embodiments of this disclosure, data distribution is performed using a hierarchical routing method. The method further includes: when the label field is a first value, the data merging path is from the child node to the root node, and the data distribution path is from the root node to the child node; when the label field is a second value, the data merging path is from the child node through a transition node to the root node, and the data distribution path is from the root node through a transition node to the child node.
[0007] According to embodiments of this disclosure, the processing limit is calculated based on the current data value of the child node and the occupied limit; the transition node is used to record data transfer-in, transfer-out and return information, and the available data value of the transition node is the value after deducting the limited limit from its own data value; when the transition node transfers out data, it only transfers out its own data value and does not deduct the data value of other nodes in conjunction.
[0008] According to embodiments of this disclosure, when the root node merges data from child nodes, it is recorded as the child node transferring data to the root node; when a child node uses data within its own node's data value limit, it is recorded as the root node transferring data out of the child node; when a child node receives data and merges it with the root node, it is recorded as the child node returning data to the root node.
[0009] According to embodiments of this disclosure, the method further includes: setting overdraft parameters for child nodes whose tag field is a second value, and setting borrowing parameters for child nodes whose tag field is a first value; and maintaining overdraft limits or borrowing limits for the corresponding child nodes when the overdraft parameters or borrowing parameters are set to an enabled state.
[0010] According to embodiments of this disclosure, the method further includes: in the event of access restriction on a child node, distributing data from the root node to the child node with restricted access, wherein the amount of data distributed is limited to the data value of the child node that has been merged into the root node.
[0011] A second aspect of this disclosure provides a data processing apparatus, comprising: a multi-level data structure construction module for establishing a multi-level data node structure including a root node and at least one child node, and setting a label field for the data structure of each child node; a distribution path determination module for determining the data distribution path of the child node based on the value of the label field; a quota acquisition module for acquiring the restricted quota and the processable quota of the child node in response to access restriction of the child node, wherein the restricted quota is the amount of data to be restricted in the child node, and the processable quota is the amount of available data in the child node; a marking module for pausing the data distribution task of the child node and marking it as over-restricted when the restricted quota is greater than the processable quota; and a data distribution module for automatically removing the over-restricted mark and resuming the data distribution task of the child node when it is detected that the restricted quota has recovered to no greater than the processable quota.
[0012] A third aspect of this disclosure provides an electronic device comprising: one or more processors; and a memory for storing one or more computer programs, wherein the one or more processors execute the one or more computer programs to implement the steps of the method described above.
[0013] A fourth aspect of this disclosure also provides a computer-readable storage medium having a computer program or instructions stored thereon, which, when executed by a processor, implement the steps of the above-described method.
[0014] The fifth aspect of this disclosure also provides a computer program product, including a computer program or instructions that, when executed by a processor, implement the steps of the above-described method. Attached Figure Description
[0015] The foregoing contents, as well as other objects, features, and advantages of this disclosure, will become clearer from the following description of embodiments with reference to the accompanying drawings, in which:
[0016] Figure 1 This diagram illustrates an application scenario of the data processing method according to an embodiment of the present disclosure.
[0017] Figure 2 A flowchart illustrating a data processing method according to an embodiment of the present disclosure is shown schematically.
[0018] Figure 3 A schematic block diagram of a data processing apparatus according to an embodiment of the present disclosure is shown.
[0019] Figure 4 A block diagram schematically illustrates an electronic device suitable for implementing a data processing method according to an embodiment of the present disclosure. Detailed Implementation
[0020] The embodiments of the present disclosure will now be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the disclosure. In the following detailed description, numerous specific details are set forth to provide a thorough understanding of the embodiments of the present disclosure for ease of explanation. However, it will be apparent that one or more embodiments may be practiced without these specific details. Furthermore, descriptions of well-known structures and techniques are omitted in the following description to avoid unnecessarily obscuring the concepts of the present disclosure.
[0021] In the technical solution disclosed herein, the user information (including but not limited to user personal information, user image information, user device information, such as location information) and data (including but not limited to data used for analysis, stored data, and displayed data) involved are all information and data authorized by the user or fully authorized by all parties. Furthermore, the collection, storage, use, processing, transmission, provision, disclosure, and application of related data all comply with relevant laws, regulations, and standards, and necessary measures have been taken to ensure that they do not violate public order and good morals. Corresponding operation entry points are provided for users to choose to authorize or refuse.
[0022] It should be noted that in the embodiments of this application, certain software, components, models and other existing solutions in the industry may be mentioned. These should be regarded as exemplary and are only intended to illustrate the feasibility of implementing the technical solution of this application. However, it does not mean that the applicant has used or necessarily used the solution.
[0023] In scenarios involving automated decision-making using personal information, the methods, devices, and systems provided in this disclosure all offer users corresponding entry points for choosing to agree to or reject the automated decision-making results. If the user chooses to reject, the process proceeds to the expert decision-making stage. Here, "automated decision-making" refers to the activity of automatically analyzing and evaluating an individual's behavioral habits, interests, or economic, health, and credit status through computer programs, and then making a decision. Here, "expert decision-making" refers to the activity of making decisions by personnel who specialize in a particular field, possess specialized experience, knowledge, and skills, and have reached a certain level of professional expertise.
[0024] This disclosure provides a data processing method, comprising: establishing a multi-level data node structure including a root node and at least one child node, and setting a label field for the data structure of each child node; determining the data distribution path of the child node based on the value of the label field; in response to access restriction of a child node, obtaining the restricted quota and the processable quota of the child node, wherein the restricted quota is the amount of data to be restricted in the child node, and the processable quota is the amount of available data in the child node; if the restricted quota is greater than the processable quota, suspending the data distribution task of the child node and marking it as over-restricted; and automatically removing the over-restricted mark and resuming the data distribution task of the child node when it is detected that the restricted quota has recovered to no greater than the processable quota.
[0025] Through the embodiments of this disclosure, a multi-level data processing structure is established, comprising an upper-level processing terminal and at least one lower-level processing terminal. A label field is set in the data structure of each lower-level processing terminal, providing a data structure foundation for dynamically determining data merging and distribution paths based on label values. The data merging and distribution paths corresponding to each lower-level processing terminal are flexibly determined according to the values of the label fields, enabling differentiated configurations for different merging and distribution paths. When access is restricted at a lower-level processing terminal, the restricted limit and the processable limit are obtained, quantifying the restricted access event into a quantifiable numerical indicator. When the restricted limit exceeds the processable limit, the data merging and distribution task is automatically paused and marked as excessively restricted, achieving accurate identification of the excessively restricted state. When the restricted limit recovers to no more than the processable limit, the mark is automatically removed and the merging and distribution task is resumed, avoiding the lag of manual recovery operations. This approach solves the problem of insufficient flexibility caused by fixed merging and distribution paths in existing solutions, as well as the response lag and error susceptibility caused by the lack of an automated task scheduling mechanism. It achieves automated and accurate management of data merging and distribution tasks under access-restricted conditions, improving processing efficiency and operational stability in financial data distribution scenarios.
[0026] Figure 1 The diagram illustrates an application scenario of the data processing method according to an embodiment of the present disclosure.
[0027] like Figure 1 As shown, application scenario 100 according to this embodiment may include a first terminal device 101, a second terminal device 102, a third terminal device 103, a network 104, and a server 105. The network 104 serves as a medium for providing a communication link between the first terminal device 101, the second terminal device 102, the third terminal device 103, and the server 105. The network 104 may include various connection types, such as wired or wireless communication links, or fiber optic cables, etc.
[0028] Users can use the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 via the network 104 to receive or send messages, etc. Various communication client applications can be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social media platform software, etc. (for example only).
[0029] The first terminal device 101, the second terminal device 102, and the third terminal device 103 can be various electronic devices with displays and support web browsing, including but not limited to smartphones, tablets, laptops, and desktop computers.
[0030] Server 105 can be a server that provides various services, such as a backend management server that supports websites browsed by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103 (this is just an example). The backend management server can analyze and process data such as received user requests, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal devices.
[0031] It should be noted that the data processing method provided in this embodiment can generally be executed by server 105. Correspondingly, the data processing system provided in this embodiment can generally be located in server 105. The data processing method provided in this embodiment can also be executed by a server or server cluster that is different from server 105 and capable of communicating with the first terminal device 101, the second terminal device 102, the third terminal device 103, and / or server 105. Correspondingly, the data processing system provided in this embodiment can also be located in a server or server cluster that is different from server 105 and capable of communicating with the first terminal device 101, the second terminal device 102, the third terminal device 103, and / or server 105.
[0032] It should be understood that Figure 1 The number of terminal devices, networks, and servers shown is merely illustrative. Depending on implementation needs, any number of terminal devices, networks, and servers can be included.
[0033] The following will be based on Figure 1 The described scene, through Figure 2 The data processing method of the disclosed embodiments will be described in detail.
[0034] Figure 2 A flowchart illustrating a data processing method according to an embodiment of the present disclosure is shown schematically.
[0035] like Figure 2 As shown, the data processing method may further include operations S210 to S250.
[0036] In operation S210, a multi-level data node structure containing a root node and at least one child node is established, and a label field is set for the data structure of each child node.
[0037] In operation S220, the data distribution path of the child node is determined based on the value of the label field.
[0038] In operation S230, in response to a restricted access event occurring on a child node, the restricted limit and the processable limit of the child node are obtained. The restricted limit is the amount of data to be restricted on the child node, and the processable limit is the amount of available data on the child node.
[0039] In operation S240, if the restricted limit exceeds the processable limit, the data distribution task of the child node is paused and an over-limited flag is set.
[0040] When operating S250, if the restricted quota is detected to have recovered to no more than the processable quota, the excess limit flag is automatically removed and the data distribution task of the child node is resumed.
[0041] For example, a multi-level data node structure containing a root node and at least one child node is first established, and a label field is set for the data structure of each child node. Further, the data distribution path of the child node is determined based on the value of the label field to achieve sequential data flow between nodes. When a child node experiences access restriction, the restricted limit and the processable limit of the child node are obtained, where the restricted limit is the amount of data to be restricted in the child node, and the processable limit is the amount of available data in the child node. If the restricted limit exceeds the processable limit, the data distribution task of the child node is paused, and an over-restriction flag is set to prevent further data distribution. Subsequently, when it is detected that the restricted limit has recovered to no more than the processable limit, the over-restriction flag is automatically removed, and the data distribution task of the child node is resumed. Through the above method, automated management and control of the access restriction status of child nodes in a multi-level data node structure are achieved.
[0042] For example, in a corporate settlement data processing scenario, the root node is configured as the headquarters settlement node, and the child nodes are configured as settlement nodes for each branch. The first type of data object corresponds to operational settlement data, and the subordinate data object corresponds to the settlement data reported by each branch. The label field is used to distinguish the routing mode of settlement data. The first value corresponds to a two-layer distribution path, suitable for direct settlement data interaction between branches and headquarters. The second value corresponds to a three-layer distribution path, suitable for settlement data interaction that needs to be processed through an intermediate settlement node. When a branch's access is restricted due to regulatory verification, the system obtains the amount of settlement data to be restricted and the amount of available settlement data for that node. If the amount of data to be restricted exceeds the amount of available data, the system suspends data distribution for that node and marks it as over-restricted. After the verification is completed, the mark is automatically removed and distribution resumes, realizing automated control of the settlement data distribution process.
[0043] The embodiments disclosed herein solve the problems of insufficient flexibility caused by the fixed merging and distribution paths in existing solutions, as well as the problems of response lag and error susceptibility caused by the lack of an automated task scheduling mechanism. They realize the automated and precise management of data merging and distribution tasks under access-restricted conditions, and improve the processing efficiency and operational stability in financial data distribution scenarios.
[0044] According to embodiments of this disclosure, the root node is configured to be associated with a first type of data object, and the child nodes are configured to be associated with subordinate data objects; when the label field is a first value, the data distribution path is a two-layer distribution path; when the label field is a second value, the data distribution path is a three-layer distribution path; the data value of the root node is equal to the sum of the root node's own data value and the merged data values of each child node.
[0045] Understandably, the root node is configured with associated first-type data objects to receive and summarize data, while child nodes are configured with associated subordinate data objects to provide data to the root node. The value of the label field determines the data distribution path.
[0046] When the label field is the first value, a two-layer distribution path is used between the child node and the root node, with data flowing directly from the child node to the root node, or from the root node to the child node. When the label field is the second value, the child node reaches the root node via a transition node, using a three-layer distribution path, with data flowing sequentially through the child node, transition node, and root node. The data value of the root node equals the sum of its own data value and the merged data values of all child nodes, ensuring that the total system data value is centrally represented at the root node for unified management and scheduling.
[0047] For example, in an enterprise settlement data processing scenario, the root node is configured to associate with the first type of data object, and the child nodes are configured to associate with the subordinate data objects. The first type of data object corresponds to the aggregated data at the headquarters level, while the subordinate data objects correspond to the detailed data of each branch. Data interaction between the root node and child nodes is achieved through data merging and distribution. Specifically, the value of the label field determines the data distribution path between nodes. When the label field is the first value, the data distribution path is a two-layer path, meaning that data merging and distribution directly occur between the child node and the root node without passing through intermediate nodes. When the label field is the second value, the data distribution path is a three-layer path, meaning that the child node needs to merge and distribute data with the root node through a transition node, which is used for data transfer and recording. Furthermore, the data value of the root node equals the sum of its own data value and the merged data values of all child nodes. This means that the root node not only maintains its own data but also aggregates the merged data from all child nodes, centralizing the total data value at the root node. This facilitates unified management and scheduling of data values at all levels, enabling hierarchical processing and flexible routing of different types of data.
[0048] Through the embodiments of this disclosure, by configuring the upper-level processing end to associate with a first type of data object and the lower-level processing end to associate with subordinate data objects, the corresponding association between different levels and different types of data objects is achieved. When the tag field is a first value, a two-layer merging and distribution path is used; when the tag field is a second value, a three-layer merging and distribution path is used, enabling flexible selection and dynamic switching of merging and distribution paths. The data value of the upper-level processing end is equal to the sum of its own data value and the merged data values of each lower-level processing end, so that the total data value is centrally displayed at the upper-level end, facilitating unified management and scheduling. Through the above method, the technical problems of fixed merging and distribution paths and inflexible adaptation to different data type requirements are solved, improving the scalability and flexibility of the system.
[0049] According to embodiments of this disclosure, data distribution is performed using a hierarchical routing method. The method further includes: when the label field is a first value, the data merging path is from the child node to the root node, and the data distribution path is from the root node to the child node; when the label field is a second value, the data merging path is from the child node through a transition node to the root node, and the data distribution path is from the root node through a transition node to the child node.
[0050] For example, data distribution is performed using a hierarchical routing approach. Specifically, when the label field has a first value, the data merging path is from the child node to the root node, and the data distribution path is from the root node to the child node, forming a two-layer distribution path between the child node and the root node. When the label field has a second value, the data merging path is from the child node through a transition node to the root node, and the data distribution path is from the root node through a transition node to the child node, forming a three-layer distribution path from the child node through a transition node to the root node. In this way, the value of the label field determines the specific flow path of data between nodes, thereby enabling flexible configuration and dynamic selection of the data distribution path.
[0051] For example, in enterprise settlement data processing scenarios, data from branch office sub-nodes is merged towards the headquarters root node using a hierarchical routing method. Here, the value of the label field determines the specific data flow path. When the label field is the first value, it indicates a two-layer distribution path: the merging path is directly from the sub-node to the root node, and the distribution path is directly from the root node to the sub-node. This means that sub-nodes and the root node interact directly without intermediary nodes. When the label field is the second value, it indicates a three-layer distribution path: the merging path is from the sub-node to the root node via a transition node, and the distribution path is from the root node to the sub-node via a transition node. This means that data needs to pass through transition nodes during the flow; these transition nodes are used for temporary storage and recording of data flow information.
[0052] Based on the above, it can be understood that the label field is used to identify the data flow path of different business types: the first value corresponds to ordinary settlement business, where data is directly merged from branch sub-nodes to the headquarters root node, and distributed directly from the headquarters root node to the branch sub-nodes; the second value corresponds to settlement business, where data needs to be merged from branch sub-nodes to the regional summary node first, and then merged from the regional summary node to the headquarters root node, and distributed step by step in the opposite path.
[0053] Through the above-mentioned hierarchical routing method, data flows layer by layer during the merging and distribution process. Each node only processes the data transmission of its adjacent layer, avoiding management chaos caused by cross-level data interaction. At the same time, the value of the tag field determines whether the data adopts a two-layer or three-layer distribution path, enabling the data processing platform to flexibly configure the data merging and distribution path according to business needs, meet the differentiated needs under different business scenarios, and realize hierarchical processing of different types of settlement data.
[0054] Through embodiments of this disclosure, data merging and distribution are performed using a hierarchical routing approach. In the first scenario, the data merging path is from the lower-level processing end to the upper-level processing end, and the data distribution path is from the upper-level processing end to the lower-level processing end. In the second scenario, the data merging path is from the lower-level processing end through an intermediate processing end to the upper-level processing end, and the data distribution path is from the upper-level processing end through an intermediate processing end to the lower-level processing end. The merging and distribution paths are strictly symmetrical, ensuring complete data flow between each level. Merging is performed by a hierarchical upward aggregation, and distribution is performed by a hierarchical downward transmission. Each level only processes data transmission between adjacent levels, avoiding management confusion caused by cross-level interactions and improving the orderliness and standardization of the data merging and distribution process.
[0055] According to embodiments of this disclosure, the processing limit is calculated based on the current data value of the child node and the occupied limit; the transition node is used to record data transfer-in, transfer-out and return information, and the available data value of the transition node is the value after deducting the limited limit from its own data value; when the transition node transfers out data, it only transfers out its own data value and does not deduct the data value of other nodes in conjunction.
[0056] For example, the processing limit is calculated by subtracting the occupied limit from the current data value of the child node, and is used to determine the currently available data limit of the child node. Transition nodes are used to record data transfer-in, transfer-out, and return information; their available data value is their own data value minus the limited limit. When a transition node transfers data out, it only transfers its own data value and does not trigger a chain reaction of deductions from the data values of other nodes. In this way, the transition node, as an independent data relay node, only affects its own data value when it transfers data out, avoiding a chain reaction of deductions from other nodes due to data changes in one node. This limits the impact of data changes to a single node, improving stability and fault tolerance.
[0057] For example, in enterprise settlement data processing scenarios, the available data limit for each branch sub-node is calculated by subtracting the amount already occupied by regulatory checks from the current data value of that sub-node. The transition node, acting as a regional aggregation node, records the data transfer in, out, and return information of each branch. Its own available data value is the remaining value after deducting the restricted limit from its data value. When a regional aggregation node transfers data to the headquarters root node, only the corresponding amount is deducted from its own data value; it does not simultaneously deduct the data values of its subordinate branch sub-nodes. This keeps the scope of data changes within the transition node itself, avoiding impact on the data status of lower-level nodes.
[0058] Through the embodiments of this disclosure, the processable limit is calculated based on the current data value and the already occupied limit, thus achieving precise quantification of the available data volume. Intermediate transition nodes are used to record data transfer-in, transfer-out, and return information. In the merging path, they undertake data transfer and recording functions; in the distribution path, they undertake data distribution and traceability functions. Their available data value is their own data value minus the limited limit. When data is transferred out, only their own data value is transferred out, without triggering a chain reaction of deductions to other processing terminals. Through this method, the intermediate processing terminal acts as an independent data transfer terminal; its data transfer operation only affects its own data value, avoiding a chain reaction of deductions to other processing terminals caused by data changes at one processing terminal. This controls the impact of data changes within a single processing terminal, improving the stability and fault tolerance of the financial data merging and distribution system.
[0059] According to embodiments of this disclosure, when the root node merges data from child nodes, it is recorded as the child node transferring data to the root node; when a child node uses data within its own node's data value limit, it is recorded as the root node transferring data out of the child node; when a child node receives data and merges it with the root node, it is recorded as the child node returning data to the root node.
[0060] For example, in an enterprise settlement data processing scenario, when the root node merges data from child nodes, it is recorded as data being transferred from the child node to the root node. When a child node uses data within its own data value limit, it is recorded as data being transferred out of the root node. When a child node receives data and merges it with the root node, it is recorded as data being returned to the root node. Through the above recording method, the flow of each piece of data between nodes can be clearly tracked, forming a complete data flow record chain, which facilitates subsequent tracing and verification of data usage at each level of the node.
[0061] Understandably, when a child node merges data with the root node, it is recorded as data being transferred from the child node to the root node, indicating that data from lower-level nodes is being consolidated into higher-level nodes. When a child node uses data within its available data limit, it is recorded as data being transferred from the root node to the child node, indicating that data is being allocated from the higher-level node to the lower-level node. When a child node receives new data and merges it with the root node again, it is recorded as data being returned from the child node to the root node. Through these recording methods, the system generates corresponding record information for each data transfer, transfer, and return, forming a complete data flow traceability chain and providing verifiable evidence for data interaction between nodes at all levels.
[0062] Through the embodiments of this disclosure, when a superior merges data from a subordinate, it is recorded as data transferred from the subordinate to the superior; when a subordinate uses data within its own quota, it is recorded as data transferred from the superior to the subordinate; and when a subordinate receives data and merges it with the superior, it is recorded as data returned from the subordinate to the superior. Corresponding record information is generated at each stage of data merging and distribution, forming a complete data flow traceability chain, providing a verifiable basis for data interaction between processing terminals at all levels.
[0063] According to embodiments of this disclosure, the data processing method further includes: setting overdraft parameters for child nodes whose tag field is a second value, and setting borrowing parameters for child nodes whose tag field is a first value; and maintaining overdraft limits or borrowing limits for the corresponding child nodes when the overdraft parameters or borrowing parameters are set to an enabled state.
[0064] For example, in a corporate settlement data processing scenario, different limit parameters are configured for child nodes based on the value of the tag field.
[0065] Specifically, for child nodes whose label field is the second value, this type of child node corresponds to a data distribution mode that needs to be processed through a transition node. An overdraft parameter is set for it. The overdraft parameter is used to limit the upper limit of the amount of data that the child node can use when its own available data quota is insufficient. That is, the child node is allowed to temporarily exceed its own quota to complete data distribution in the short term, but the amount of the excess shall not exceed the overdraft quota value set by the overdraft parameter.
[0066] Furthermore, for child nodes whose label field is the first value, this type of child node corresponds to a data distribution mode that does not require transit through a transition node. A borrowing parameter is set for it. The borrowing parameter is used to limit the upper limit of the amount of supplementary data that the child node can obtain from the root node. That is, the child node is allowed to borrow data from the root node when its own available data quota is insufficient, but the amount borrowed shall not exceed the borrowing quota value set by the borrowing parameter.
[0067] Furthermore, when the overdraft parameter is set to the enabled state, an overdraft limit is maintained for the corresponding child node, and the data usage of the child node is monitored in real time according to the overdraft limit. When the usage reaches or exceeds the overdraft limit limit, an alert or interception is triggered. When the borrowing parameter is set to the enabled state, a borrowing limit is maintained for the corresponding child node, and the amount of data obtained by the child node from the root node is monitored in real time according to the borrowing limit. When the amount obtained reaches or exceeds the borrowing limit limit, an alert or interception is triggered.
[0068] The embodiments disclosed herein enable differentiated configuration and refined control of quotas for different types of sub-nodes.
[0069] According to an embodiment of this disclosure, the data processing method further includes: distributing data from the root node to the child node with restricted access when the child node has restricted access, wherein the amount of data distributed is limited to the data value of the child node that has been merged into the root node.
[0070] For example, in a corporate settlement data processing scenario, when a sub-node experiences access restrictions due to external compliance reviews, regulatory audits, or other reasons, the root node is triggered to distribute data to the sub-node with restricted access.
[0071] Specifically, the amount of data distributed is capped at the value of the data that the child node has previously merged into the root node. In other words, the amount of data distributed cannot exceed the total cumulative data that the child node has historically merged into the root node. For example, if a child node has 100 units of data merged into the root node, then when access is restricted for that child node, the maximum amount of data the root node will distribute to it is 100 units. This ensures that the amount of data distributed matches the total amount of data that the child node has already merged, avoiding over-distribution.
[0072] In this manner, when access is restricted at a lower-level endpoint, the upper-level endpoint automatically distributes data to the restricted endpoint, with the distribution amount limited to the data value already merged into the upper-level endpoint by the lower-level endpoint. The restricted lower-level endpoint can obtain necessary data support from the upper-level endpoint during the restricted period, and the distribution amount is strictly limited to the range of merged data values, preventing over-distribution and data imbalance. After the restriction ends, the lower-level endpoint returns the received data to the upper-level endpoint through data merging, forming a closed loop of data flow from merging to distribution to return, ensuring the continuity and balance of data merging and distribution under restricted conditions.
[0073] Based on the above data processing method, this disclosure also provides a data processing apparatus. The following will be combined with... Figure 3 The device is described in detail.
[0074] Figure 3 A schematic block diagram of a data processing apparatus according to an embodiment of the present disclosure is shown.
[0075] like Figure 3 As shown, the data processing device 300 of this embodiment includes a multi-level data structure construction module 310, a distribution path determination module 320, a quota acquisition module 330, a marking module 340, and a data distribution module 350.
[0076] The multi-level data structure construction module 310 is used to establish a multi-level data node structure containing a root node and at least one child node, and to set a label field for the data structure of each child node. In one embodiment, the multi-level data structure construction module 310 can be used to perform the operation S210 described above, which will not be repeated here.
[0077] The distribution path determination module 320 is used to determine the data distribution path of the child nodes based on the value of the tag field. In one embodiment, the distribution path determination module 320 can be used to perform the operation S220 described above, which will not be repeated here.
[0078] The quota acquisition module 330 is used to acquire the restricted quota and the processable quota of a child node in response to access restriction occurring at the child node. The restricted quota is the amount of data to be restricted at the child node, and the processable quota is the amount of available data at the child node. In one embodiment, the quota acquisition module 330 can be used to perform the operation S230 described above, which will not be repeated here.
[0079] The marking module 340 is used to pause the data distribution task of the child node and mark it as over-limited when the limited limit exceeds the processable limit. In one embodiment, the marking module 340 can be used to perform the operation S240 described above, which will not be repeated here.
[0080] The data distribution module 350 is used to automatically remove the over-limit flag and resume the data distribution task of the child node when it detects that the limited quota has recovered to no more than the processable quota. In one embodiment, the data distribution module 350 can be used to perform the operation S250 described above, which will not be repeated here.
[0081] According to embodiments of this disclosure, the distribution path determination module 320 includes a first distribution path determination submodule and a second distribution path determination submodule.
[0082] The first distribution path determination submodule is used to determine that the data distribution path is a two-layer distribution path when the label field is the first value.
[0083] The second distribution path determination submodule is used to determine that the data distribution path is a three-tier distribution path when the label field is the second value.
[0084] According to embodiments of this disclosure, the distribution path determination module 320 further includes a parameter setting submodule.
[0085] The parameter setting submodule is used to set overdraft parameters for child nodes whose label field is the second value, and to set borrowing parameters for child nodes whose label field is the first value; when the overdraft parameter or borrowing parameter is set to the enabled state, it maintains the overdraft limit or borrowing limit for the corresponding child node.
[0086] According to embodiments of this disclosure, the data processing apparatus 300 further includes a second data distribution module.
[0087] The second data distribution module is used to distribute data from the root node to the child node with restricted access when the child node has restricted access. The amount of data distributed is limited to the data value of the child node that has been merged into the root node.
[0088] According to embodiments of this disclosure, any multiple modules among the multi-level data structure construction module 310, distribution path determination module 320, quota acquisition module 330, marking module 340, and data distribution module 350 can be merged into one module, or any one of these modules can be split into multiple modules. Alternatively, at least some of the functions of one or more of these modules can be combined with at least some of the functions of other modules and implemented in one module. According to embodiments of this disclosure, at least one of the multi-level data structure construction module 310, distribution path determination module 320, quota acquisition module 330, marking module 340, and data distribution module 350 can be at least partially implemented as hardware circuitry, such as a field-programmable gate array (FPGA), a programmable logic array (PLA), a system-on-a-chip, a system-on-a-substrate, a system-on-package, an application-specific integrated circuit (ASIC), or implemented in hardware or firmware by any other reasonable means of integrating or packaging circuitry, or implemented in software, hardware, or firmware, or in any suitable combination of any of these three implementation methods. Alternatively, at least one of the multi-level data structure construction module 310, distribution path determination module 320, quota acquisition module 330, marking module 340 and data distribution module 350 can be at least partially implemented as a computer program module, which can perform corresponding functions when the computer program module is run.
[0089] Figure 4A block diagram schematically illustrates an electronic device suitable for implementing a data processing method according to an embodiment of the present disclosure.
[0090] like Figure 4 As shown, an electronic device 400 according to an embodiment of the present disclosure includes a processor 401, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 402 or a program loaded from a storage portion 408 into a random access memory (RAM) 403. The processor 401 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or an associated chipset and / or a special-purpose microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 401 may also include onboard memory for caching purposes. The processor 401 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present disclosure.
[0091] RAM 403 stores various programs and data required for the operation of electronic device 400. Processor 401, ROM 402, and RAM 403 are interconnected via bus 404. Processor 401 performs various operations of the method flow according to embodiments of the present disclosure by executing programs in ROM 402 and / or RAM 403. It should be noted that programs may also be stored in one or more memories other than ROM 402 and RAM 403. Processor 401 may also perform various operations of the method flow according to embodiments of the present disclosure by executing programs stored in one or more memories.
[0092] According to embodiments of this disclosure, the electronic device 400 may further include an input / output (I / O) interface 405, which is also connected to a bus 404. The electronic device 400 may also include one or more of the following components connected to the I / O interface 405: an input section 406 including a keyboard, mouse, etc.; an output section 407 including a cathode ray tube (CRT), liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 408 including a hard disk, etc.; and a communication section 409 including a network interface card such as a LAN card, modem, etc. The communication section 409 performs communication processing via a network such as the Internet. A drive 410 is also connected to the I / O interface 405 as needed. A removable medium 411, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., is installed on the drive 410 as needed so that computer programs read from it can be installed into the storage section 408 as needed.
[0093] This disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or it may exist independently and not assembled into the device / apparatus / system. The computer-readable storage medium carries one or more programs that, when executed, implement the method according to the embodiments of this disclosure.
[0094] According to embodiments of this disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, such as including, but not limited to: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this disclosure, the computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. For example, according to embodiments of this disclosure, the computer-readable storage medium may include ROM 402 and / or RAM 403 and / or one or more memories other than ROM 402 and RAM 403 described above.
[0095] Embodiments of this disclosure also include a computer program product comprising a computer program containing program code for performing the methods shown in the flowchart. When the computer program product is run on a computer system, the program code is used to cause the computer system to implement the methods provided in the embodiments of this disclosure.
[0096] When the computer program is executed by the processor 401, it performs the functions defined in the system / apparatus of this disclosure embodiments. According to embodiments of this disclosure, the systems, apparatuses, modules, units, etc., described above can be implemented by computer program modules.
[0097] In one embodiment, the computer program may rely on a tangible storage medium such as an optical storage device or a magnetic storage device. In another embodiment, the computer program may also be transmitted and distributed in the form of signals over a network medium, and downloaded and installed via communication section 409, and / or installed from removable medium 411. The program code contained in the computer program can be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination thereof.
[0098] In such an embodiment, the computer program can be downloaded and installed from a network via communication section 409, and / or installed from removable medium 411. When the computer program is executed by processor 401, it performs the functions defined in the system of this disclosure embodiment. According to embodiments of this disclosure, the systems, devices, apparatuses, modules, units, etc., described above can be implemented by computer program modules.
[0099] According to embodiments of this disclosure, program code for executing the computer programs provided in embodiments of this disclosure can be written in any combination of one or more programming languages. Specifically, these computational programs can be implemented using high-level procedural and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages include, but are not limited to, languages such as Java, C++, Python, "C", or similar programming languages. The program code can execute entirely on a user's computing device, partially on a user's device, partially on a remote computing device, or entirely on a remote computing device or server. In cases involving remote computing devices, the remote computing device can be connected to the user's computing device via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (e.g., via the Internet using an Internet service provider).
[0100] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram or flowchart, and combinations of blocks in a block diagram or flowchart, may be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.
[0101] Those skilled in the art will understand that the features described in the various embodiments of this disclosure can be combined and / or combined in various ways, even if such combinations or combinations are not explicitly described in this disclosure. In particular, the features described in the various embodiments of this disclosure can be combined and / or combined in various ways without departing from the spirit and teachings of this disclosure. All such combinations and / or combinations fall within the scope of this disclosure.
[0102] The embodiments of this disclosure have been described above. However, these embodiments are for illustrative purposes only and are not intended to limit the scope of this disclosure. Although various embodiments have been described above, this does not mean that the measures in the various embodiments cannot be used advantageously in combination. Various substitutions and modifications can be made by those skilled in the art without departing from the scope of this disclosure, and all such substitutions and modifications should fall within the scope of this disclosure.
Claims
1. A data processing method, characterized in that, include: Establish a multi-level data node structure containing a root node and at least one child node, and set a label field for the data structure of each child node; The data distribution path of the child node is determined based on the value of the tag field; In response to the access restriction of the child node, the restricted quota and the processable quota of the child node are obtained, wherein the restricted quota is the amount of data to be restricted of the child node, and the processable quota is the amount of available data of the child node; If the restricted limit exceeds the processable limit, the data distribution task of the child node is suspended and an over-limit flag is set. If the restricted limit is detected to have recovered to a level no greater than the processable limit, the excess limit flag is automatically removed, and the data distribution task of the child node is resumed.
2. The data processing method according to claim 1, characterized in that, The root node is configured to be associated with a first type of data object, and the child nodes are configured to be associated with subordinate data objects; When the label field is a first value, the data distribution path is a two-layer distribution path; When the label field is the second value, the data distribution path is a three-tier distribution path; The data value of the root node is equal to the sum of the root node's own data value and the merged data values of all child nodes.
3. The data processing method according to claim 2, characterized in that, The data distribution is performed using a step-by-step routing approach, and the method further includes: When the label field is the first value, the data merging path is from the child node to the root node, and the data distribution path is from the root node to the child node. When the label field is the second value, the data merging path is from the child node through the transition node to the root node, and the data distribution path is from the root node through the transition node to the child node.
4. The data processing method according to claim 3, characterized in that, The processable limit is calculated based on the current data value of the child node and the amount of limit already occupied; The transition node is used to record data transfer in, transfer out and return information. The available data value of the transition node is the value after deducting the limited amount from its own data value. When a transition node transfers data, it only transfers its own data value and does not deduct the data values of other nodes.
5. The data processing method according to claim 3, characterized in that, When the root node merges the data of the child nodes, it is recorded as the child node transferring data to the root node. When a child node uses data within its own node data value limit, it is recorded as the root node transferring data to the child node. When a child node receives data and merges it with the root node, it is recorded as the child node returning data to the root node.
6. The data processing method according to claim 2, characterized in that, Also includes: Set an overdraft parameter for child nodes whose label field has a second value, and set a borrow parameter for child nodes whose label field has a first value; When the overdraft parameter or borrowing parameter is set to the enabled state, the overdraft limit or borrowing limit is maintained for the corresponding child node.
7. The data processing method according to claim 2, characterized in that, Also includes: In the event that a child node has restricted access, the root node distributes data to the child node with restricted access, wherein the amount of data distributed is limited to the data value of the child node that has been merged into the root node.
8. A data processing apparatus, characterized in that, include: A multi-level data structure construction module is used to establish a multi-level data node structure containing a root node and at least one child node, and to set a label field for the data structure of each child node. The distribution path determination module is used to determine the data distribution path of the child node based on the value of the tag field; The quota acquisition module is used to acquire the restricted quota and the processable quota of the child node in response to the access restriction of the child node. The restricted quota is the amount of data to be restricted of the child node, and the processable quota is the amount of available data of the child node. The marking module is used to suspend the data distribution task of the child node and mark it as over-limited when the limited limit is greater than the processable limit; The data distribution module is used to automatically remove the over-limit flag and resume the data distribution task of the child node when it detects that the limited limit has recovered to no more than the processable limit.
9. An electronic device, comprising: One or more processors; Memory, used to store one or more computer programs. The characteristic feature is that the one or more processors execute the one or more computer programs to implement the steps of the method according to any one of claims 1 to 7.
10. A computer-readable storage medium having a computer program or instructions stored thereon, characterized in that, When the computer program or instructions are executed by a processor, they implement the steps of the method according to any one of claims 1 to 7.
11. A computer program product, comprising a computer program or instructions, characterized in that, When the computer program or instructions are executed by a processor, they implement the steps of the method according to any one of claims 1 to 7.
