CN112988800B - Data processing method and device based on distributed environment - Google Patents
Data processing method and device based on distributed environment Download PDFInfo
- Publication number
- CN112988800B CN112988800B CN202110352535.5A CN202110352535A CN112988800B CN 112988800 B CN112988800 B CN 112988800B CN 202110352535 A CN202110352535 A CN 202110352535A CN 112988800 B CN112988800 B CN 112988800B
- Authority
- CN
- China
- Prior art keywords
- date
- routing
- node
- routing node
- local memory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2453—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Data Mining & Analysis (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Technology Law (AREA)
- Computing Systems (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Computational Linguistics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The invention discloses a data processing method and device based on a distributed environment, and relates to the technical field of data processing of distributed systems. One embodiment of the method comprises: responding to a daily cut instruction initiated by a daily cut initiating node, and updating the business date of the configuration center; after the configuration center successfully updates the business days, responding to the daily cutting instruction, and updating the local memory dates of one or more routing nodes, wherein the local memory dates are the business dates stored in the memories of the routing nodes; the transaction request is processed by one or more routing nodes according to the local memory dates of the one or more routing nodes. The embodiment can reduce the time spent on obtaining the business date to be completely ignored, reduces the transaction duration, can avoid the risk of single-point failure, and realizes the date switching of consistency.
Description
Technical Field
The present invention relates to the field of data processing technologies for distributed systems, and in particular, to a data processing method and apparatus based on a distributed environment.
Background
For banking, timeliness and accuracy of accounting are the most fundamental requirements. The timeliness requires the date and the accuracy requires the bank system to check the balance of total points and loans. The banking industry is continuously served for 7 x 24 hours, and the determination of the date switching time point is the key for realizing the balance check of the daily settlement and the loan. Therefore, how to realize daily cutting in a distributed environment becomes a technical difficulty.
The current day-to-day plan in the distributed environment is centralized to store the current business date. The end-of-day batch processing node is the only date switching write-in node, other business processing nodes need to execute at least one remote query every time when processing transactions, multiple remote queries can occur to a complex transaction, the transaction duration is increased, and the centralized storage also brings the risk of single point failure.
Disclosure of Invention
In view of this, embodiments of the present invention provide a data processing method and apparatus based on a distributed environment, which can reduce the time spent on acquiring business dates to be completely ignored, reduce transaction duration, avoid single point failure risk, and implement consistent date switching.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a data processing method based on a distributed environment.
The data processing method based on the distributed environment comprises the following steps: responding to a daily cut instruction initiated by a daily cut initiating node, and updating the business date of the configuration center; after the configuration center successfully updates the business dates, responding to the daily switching instruction, and updating the local memory dates of one or more routing nodes, wherein the local memory dates are the business dates stored in the memories of the routing nodes; and processing the transaction request according to the local memory date of the one or more routing nodes through the one or more routing nodes.
Optionally, the method further comprises: judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date; and if so, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
Optionally, the method further comprises: and if the reinitiation time corresponding to the daily cutting instruction is reached, reinitiating the daily cutting instruction, wherein the reinitiation time corresponding to the daily cutting instruction is greater than the effective date time.
Optionally, before reinitiating the cut-to-date instruction, the method further includes: acquiring a routing node with a successful date update and a routing node with a failed date update; judging whether the node number ratio of the routing node with the successful date updating to the routing node with the failed date updating is larger than a preset ratio threshold value or not; if so, determining that the Japanese switch initiating node gives up to reinitiate the Japanese switch instruction; if not, determining that the daily cutting initiating node initiates the daily cutting instruction again.
Optionally, the reinitiating the daily cutting instruction includes: and reinitiating the daily cut instruction to the routing node with the failed date updating through the daily cut initiating node so that the routing node with the failed date updating carries out the date updating in response to the daily cut instruction.
Optionally, the method further comprises: if the routing node meets at least one of the following options: if the number of failed update dates exceeds a preset number threshold and the update dates fail within preset time, determining that the routing node is an abnormal node, returning operation and maintenance fault processing information of the abnormal node, and triggering operation and maintenance alarm information.
Optionally, the update date failure comprises: reading the business date failure from the configuration center in response to the daily cutting instruction failing to update the date.
Optionally, the method further comprises: and if the newly started routing node exists, reading the business date from the configuration center, and storing the business date into the memory of the newly started routing node, so that the newly started routing node processes the transaction request according to the business date.
Optionally, the processing, by the one or more routing nodes, the transaction request according to the local memory date of the one or more routing nodes includes: receiving a transaction request through the one or more routing nodes, reading local memory dates from memories of the one or more routing nodes, splicing the read local memory dates with the received transaction request, forwarding the transaction request to a processing node, and processing the received transaction request by taking the read local memory dates as current business dates through the processing node.
Optionally, the updating the local memory date of one or more routing nodes in response to the daily cut instruction includes: updating the local memory date of the first routing node according to the time parameter in the daily cutting instruction; and responding to the daily cutting instruction, changing a routing state value corresponding to the second routing node, and updating the local memory date of the second routing node according to the routing state value.
Optionally, the changing a routing state value corresponding to the second routing node in response to the daily cut instruction includes: and changing the routing state value corresponding to the second routing node from 0 to 1 in response to the daily cutting instruction.
Optionally, the updating the local memory date of the second routing node according to the routing state value includes: if the routing state value corresponding to the second routing node is monitored to be 1, updating the local memory date of the second routing node, and then changing the routing state value corresponding to the second routing node from 1 to 0 by combining the failure time of the routing state value.
Optionally, the first routing node is a routing node that receives time parameter transmission, and the second routing node is a routing node that does not receive time parameter transmission.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided a data processing apparatus based on a distributed environment.
The data processing device based on the distributed environment of the embodiment of the invention comprises: the first updating module is used for responding to a daily cutting instruction initiated by the daily cutting initiating node and updating the business date of the configuration center; the second updating module is used for responding to the daily cutting instruction after the configuration center successfully updates the business date, and updating the local memory date of one or more routing nodes, wherein the local memory date is the business date stored in the memory of the routing node; and the processing module is used for processing the transaction request according to the local memory date of the one or more routing nodes through the one or more routing nodes.
Optionally, the second updating module is further configured to: judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date; and if so, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
Optionally, the apparatus further comprises an instruction initiating module configured to: and if the reinitiation time corresponding to the daily cutting instruction is reached, reinitiating the daily cutting instruction, wherein the reinitiation time corresponding to the daily cutting instruction is greater than the effective date time.
Optionally, the instruction initiating module is further configured to: acquiring a routing node with a successful date update and a routing node with a failed date update; judging whether the node number ratio of the routing node with the successful date updating to the routing node with the failed date updating is larger than a preset ratio threshold value or not; if so, determining that the Japanese switch initiating node gives up to reinitiate the Japanese switch instruction; if not, determining that the daily cut initiating node re-initiates the daily cut instruction.
Optionally, the instruction initiating module is further configured to: and reinitiating the daily cut instruction to the routing node with the failed date updating through the daily cut initiating node so that the routing node with the failed date updating carries out the date updating in response to the daily cut instruction.
Optionally, the second updating module is further configured to: if the routing node meets at least one of the following options: if the number of failed update dates exceeds a preset number threshold and the update dates fail within preset time, determining that the routing node is an abnormal node, returning operation and maintenance fault processing information of the abnormal node, and triggering operation and maintenance alarm information; wherein the failure to update the date comprises: reading the business date from the configuration center in response to failure of the daily cut instruction to update the date.
Optionally, the second updating module is further configured to: and if the newly started routing node exists, reading the business date from the configuration center, and storing the business date into the memory of the newly started routing node, so that the newly started routing node processes the transaction request according to the business date.
Optionally, the processing module is further configured to: receiving a transaction request through the one or more routing nodes, reading local memory dates from memories of the one or more routing nodes, splicing the read local memory dates with the received transaction request, forwarding the transaction request to a processing node, and processing the received transaction request by taking the read local memory dates as current business dates through the processing node.
Optionally, the second updating module is further configured to: updating the local memory date of the first routing node according to the time parameter in the daily cutting instruction; responding to the daily switching instruction, changing a routing state value corresponding to a second routing node, and updating a local memory date of the second routing node according to the routing state value; the first routing node is a routing node which receives the time parameter transmission, and the second routing node is a routing node which does not receive the time parameter transmission.
Optionally, the second updating module is further configured to: and responding to the daily cutting instruction, and changing the routing state value corresponding to the second routing node from 0 to 1.
Optionally, the second updating module is further configured to: if the routing state value corresponding to the second routing node is monitored to be 1, updating the local memory date of the second routing node, and then changing the routing state value corresponding to the second routing node from 1 to 0 by combining the failure time of the routing state value.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided an electronic apparatus.
An electronic device of an embodiment of the present invention includes: one or more processors; a storage device for storing one or more programs which, when executed by one or more processors, cause the one or more processors to implement the data processing method based on a distributed environment of the embodiments of the present invention.
To achieve the above object, according to still another aspect of an embodiment of the present invention, there is provided a computer-readable medium.
A computer-readable medium of an embodiment of the present invention has a computer program stored thereon, and when the program is executed by a processor, the computer program implements a distributed environment-based data processing method of an embodiment of the present invention.
One embodiment of the above invention has the following advantages or benefits: the data processing method based on the distributed environment can respond to the initiated daily switching instruction, update the business date of the configuration center and the business date stored in the memory by each routing node, realize that the business date is stored in the memory of each routing node, and change the remote date inquiry into local memory reading, thereby reducing the time spent on obtaining the business date to be completely ignored, reducing the transaction duration, avoiding the risk of single-point failure and realizing the consistent date switching.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of the main steps of a distributed environment based data processing method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a distributed system architecture;
FIG. 3 is a schematic diagram of the main process of reinitiating a cut-to-date instruction according to an embodiment of the present invention;
FIG. 4 is a diagram illustrating the main processes of a distributed environment-based data processing method according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of the main modules of a distributed environment based data processing apparatus according to an embodiment of the present invention;
FIG. 6 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 7 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of main steps of a data processing method based on a distributed environment according to an embodiment of the present invention. As shown in fig. 1, the main steps of the data processing method based on the distributed environment may include:
step S101, responding to a daily cut command initiated by a daily cut initiating node, and updating the business date of a configuration center;
step S102, after the business date is successfully updated by the configuration center, the local memory date of one or more routing nodes is updated in response to the daily cutting instruction;
step S103, processing the transaction request according to the local memory date of one or more routing nodes through one or more routing nodes.
The data processing method of the embodiment of the invention is in a distributed environment. Fig. 2 is a schematic structural diagram of a distributed system. Referring to fig. 2, the distributed system may include: the system comprises a daily handover initiating node, a configuration center, a routing node and a processing node. Next, the distributed environment-based data processing method of step S101 to step S103 will be described in detail in conjunction with the distributed system shown in fig. 2.
In step S101, the japanese-cut initiating node initiates a japanese-cut instruction. That is, the date switch initiating node may be understood as a writing node of the date switch. When the daily cut transaction needs to be carried out, namely the business date needs to be switched from the current working day to the next working day, a daily cut command is initiated through the daily cut initiating node. Then, in response to the daily cut instruction initiated by the daily cut initiating node, the configuration center may update its stored business date, that is, the configuration center switches its stored business date from the current working day to the next working day.
In step S102, if the configuration center successfully updates the business date, the routing node updates the local memory date of the routing node in response to the daily cut instruction initiated by the daily cut initiating node, where the local memory date is the business date stored in the memory of the routing node. In addition, the number of routing nodes is one or more. Therefore, in step S102, all routing nodes switch the business date stored in the memory of the routing node from the current working day to the next working day in response to the daily switching instruction.
It should be noted that there are situations where the update date of the partial routing node is successful. Therefore, in step S103, the routing node with the successfully updated date may process the transaction request according to the updated local memory date; the routing node with failed date update can process the transaction request according to the local memory date before update. That is, the routing node may obtain the date from the local memory during the process of processing the transaction request, and then process the transaction request according to the obtained date.
For ease of understanding, this is illustrated by the following example. Firstly, the daily cutting initiating node initiates a daily cutting instruction L to switch the business date from No. 1 to No. 2. Then, the configuration center switches its stored business date from number 1 to number 2 in response to the daily cutting instruction L. Then, after the configuration center is successfully switched, the routing nodes d1 to d5 respond to the daily switching command L to switch the business date in the memory from number 1 to number 2. Finally, the routing nodes d1 to d3 successfully switch the business date in the memory to number 2, and at this time, the routing nodes d1 to d3 can process the transaction request according to the business date of number 2; routing nodes d4 and d5 fail to switch the business date in memory to number 2, then at this point routing nodes d4 and d5 may process the transaction request for business date number 1.
As an embodiment of the present invention, the data processing method based on a distributed environment may further include: and if the newly started routing node exists, reading the business date from the configuration center, and storing the business date into the memory of the newly started routing node so that the newly started routing node processes the transaction request according to the business date. That is, after the configuration center successfully updates the business date, a new routing node is started, in this case, the newly started routing node reads the business date from the configuration center, and then processes the transaction request according to the read business date. Of course, the newly started routing node may also perform date switching in response to the date switching instruction initiated by the date switching initiating node. However, considering that the number of routing nodes for performing date switching in response to a date switching instruction is too large, a newly started routing node fails to respond to the date switching instruction or the time taken to perform date switching in response to the date switching instruction is too long, and thus a transaction request cannot be processed in time. Therefore, for a newly started routing node, reading the business date from the configuration center is preferentially selected.
On the other hand, the processing the transaction request according to the local memory date of the one or more routing nodes by the one or more routing nodes in step S103 may include: the transaction request is received through one or more routing nodes, the local memory date is read from the memories of the one or more routing nodes, the read local memory date and the received transaction request are spliced and forwarded to the processing node, and then the received transaction request is processed by taking the read local memory date as the current business date through the processing node.
Specifically, the processing chain of the transaction request is divided into two layers, the first layer is an application routing layer, the second layer is a service processing layer, and the application routing layer and the service processing layer are both stateless distributed services, that is, each routing node and each processing node are in a peer-to-peer relationship and have no dependency. The application routing layer is an entrance of the transaction request, and the service processing layer is used for processing the transaction request. Each routing node reads the local memory date from the local memory for splicing when receiving a transaction request once, and transmits the received transaction request and the read local memory date to the corresponding processing node (namely, the next service processing layer); then, the corresponding processing node directly uses the local memory date transmitted by the routing node as the current business date to process the transaction request. If the transaction is complex, the request processing chain is long and spans a plurality of processing nodes, the local memory date is transmitted all the time.
In the prior art, the current business date is stored in a centralized manner, the daily end batch processing node is the only date switching writing node, and other business processing nodes need to execute at least one remote query every time when processing transactions, so that multiple remote queries can occur to a complex transaction, the transaction duration is increased, and the centralized storage also brings the risk of single-point failure. However, the data processing method based on the distributed environment according to the embodiment of the present invention can update the business date of the configuration center and the business date stored in the memory by each routing node in response to the initiated daily switching instruction, so that the business date is stored in the memory of each routing node, and the remote date inquiry is changed into local memory reading, thereby reducing the time spent on obtaining the business date to be completely ignored, reducing the transaction duration, avoiding the risk of single point failure, and realizing consistent date switching.
In order to implement consistent date switching of each routing node, the data processing method based on a distributed environment according to the embodiment of the present invention may further include: judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date; and if so, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
Specifically, the effective date time is set for the local memory date of each routing node. And when the local memory date of the routing node is judged to be invalid, the routing node can access the configuration center, read the business date stored in the configuration center and update the local memory date of the routing node by using the read business date. Obviously, for the routing node with failed date updating in step S102, the routing node may access the configuration center, read the business date of the configuration center, and then update the business date of the routing node by using the read business date when the local memory date of the routing node is failed, so that consistent date switching of each routing node may be implemented.
In the above example, the routing nodes d4 and d5 fail to switch the business date in memory to number 2, i.e. the local memory dates of the routing nodes d4 and d5 are number 1. When the local memory date is invalid, that is, when it is determined that the local memory date No. 1 is invalid, the routing nodes d4 and d5 may access the configuration center, read that the business date stored in the configuration center is No. 2, and then update the local memory date from No. 1 to No. 2.
In addition, it should be noted that, as long as it is determined that the local memory date of the routing node is invalid, the routing node accesses the configuration center and updates the local memory date of the routing node by using the business date of the configuration center. Of course, if it is determined that the business date of the configuration center is the same as the local memory date of the routing node, the local memory date of the routing node does not need to be updated. In the above example, the local memory date of the routing node d1 is number 2, and the set effective date time is 5 minutes, so that the routing node d1 accesses the configuration center every 5 minutes, and updates the local memory date of the routing node by using the business date of the configuration center. The method has the advantages that the business date of the configuration center can be regularly used for verifying the local memory date of the routing node, so that the local memory date can be updated in time, the date consistency of each routing node is realized, and the timeliness and the accuracy of accounting are ensured.
As an embodiment of the present invention, the data processing method based on a distributed environment may further include: if the restart time corresponding to the arrival daily cutting instruction is reached, acquiring a routing node with a successful date update and a routing node with a failed date update; judging whether the node number ratio of the routing node with the successful date updating to the routing node with the failed date updating is larger than a preset ratio threshold value or not; if yes, determining that the Japanese cutting initiating node gives up the reinitiation of the Japanese cutting instruction; if not, the date switching instruction is reinitiated to the routing node with failed date updating through the date switching initiating node, so that the routing node with failed date updating responds to the date switching instruction to update the date.
It should be noted that the routing nodes whose date update is successful include: and responding to the daily switch instruction to update the routing node with successful date and reading the routing node with successful business date from the configuration center. And the routing node with failed date update comprises: and reading the routing node with failed business date from the configuration center in response to the daily cutting instruction. In addition, the restart time corresponding to the daily cutting instruction can be set to be greater than the effective date time of the local memory date of the routing node.
Considering that the number of routing nodes may be large, there may be a plurality of routing nodes that do not successfully respond to the daily cut instruction for date updating, and in this case, the daily cut initiating node needs to reinitiate the daily cut instruction. Specifically, in the data processing method based on the distributed environment according to the embodiment of the present invention, if the restart time corresponding to the switch-to-date instruction is reached, if the time difference between the current time and the time when the switch-to-date instruction was initiated last is 6 minutes, a routing node whose date update is successful and a routing node whose date update is failed are obtained; then, judging whether the ratio of the number of the routing nodes with successful date updating to the number of the routing nodes with failed date updating is greater than a preset ratio threshold, for example, judging whether the ratio of the number of the routing nodes with successful date updating to the number of the routing nodes with failed date updating is greater than a preset ratio threshold 9, namely whether 90% of the routing nodes have successfully updated dates; if the value is larger than the preset ratio threshold value, the Japanese cutting initiating node gives up the reinitiation of the Japanese cutting instruction; if the value is not larger than the preset ratio threshold value, the date switching initiating node initiates the date switching instruction again to the routing node with failed date updating, so that the routing node with failed date updating can respond to the date switching instruction to update the date, and the date switching consistency of the routing node can be quickly realized.
FIG. 3 is a schematic diagram of the main process of reinitiating the eager instruction according to an embodiment of the present invention. As shown in fig. 3, the main process of reinitiating the cutting instruction may include:
step S301, acquiring the time of initiating the daily cutting instruction last time;
step S302, judging whether the time difference between the current time and the acquired time reaches the reinitiation time corresponding to the daily cutting instruction, if so, executing step S303;
step S303, acquiring the route node which is updated successfully on the date of the current time and the route node which is updated unsuccessfully on the date;
step S304, determining whether a node number ratio of the routing node with the successful date update to the routing node with the failed date update is greater than a preset ratio threshold, if so, executing step S305, and if not, executing step S306;
step S305, the Japanese cutting initiating node gives up the reinitiation of the Japanese cutting instruction;
step S306, the daily cutting initiating node initiates the daily cutting instruction again to the routing node which fails in updating in the day.
After the step S306 is executed, after the switching-to-date initiating node re-initiates the switching-to-date instruction to the routing node with failed date updating, if there is a routing node with failed date updating, it may be determined that the routing node is an abnormal node, and the abnormal node needs to be manually checked. On the other hand, after the step S306 is executed, the day-cut initiating node re-initiates the day-cut instruction to the routing node with failed date updating, the time of initiating the day-cut instruction may be obtained, and then the steps S302 to S306 are executed again until the ratio of the number of the routing nodes with successful date updating to the number of the routing nodes with failed date updating is greater than the preset ratio threshold. It should be noted that after the same daily switching instruction is initiated several times or within a period of time, if there is a routing node with a failed date update, it needs to be determined that the routing node with the failed date update is an abnormal node, and an operation and maintenance fault occurs. In addition, it should be noted that the daily cutting command in steps S301 to S306 is the same daily cutting command, such as switching business day from No. 1 to No. 2.
Further, the data processing method based on the distributed environment may further include: if the routing node meets at least one of the following options: if the number of failed update dates exceeds a preset number threshold and the update dates fail within preset time, determining that the routing node is an abnormal node, returning operation and maintenance fault processing information of the abnormal node, and triggering operation and maintenance alarm information; wherein failing to update the date comprises: reading the business date from the configuration center fails in response to a date-cut instruction failing to update the date. For example, if the preset time threshold is 3, the number of times that the routing node d6 fails to update the date in response to the daily cutting command is 2, and the number of times that the routing node d6 fails to access the configuration center is 2, it may be determined that the routing node d6 is an abnormal node, and it is necessary to return an error handling code and trigger an operation and maintenance alarm. In addition, the failure of updating the date within the preset time means that the date updating is not completed within the preset time range. The preset time can be set according to the time for initiating the daily cutting instruction, if the preset time is 8 minutes after the first time of initiating the daily cutting instruction, the preset time is reached, and if the date updating of a certain routing node is not completed, the routing node is determined to be an abnormal node.
Considering that there may be routing nodes that do not receive new parameters in the existing distributed system, and the time parameter in the daily cut instruction is a new parameter, these routing nodes that do not receive new parameters cannot directly perform daily cut update according to the time parameter in the daily cut instruction. In the embodiment of the invention, the date can be updated by changing the routing state value. The concrete implementation is as follows: updating the local memory date of the first routing node according to the time parameter in the daily cutting instruction; and responding to the daily cutting instruction, changing the routing state value corresponding to the second routing node, and updating the local memory date of the second routing node according to the routing state value. The first routing node is a routing node which receives the time parameter transmission, and the second routing node is a routing node which does not receive the time parameter transmission.
For the routing node receiving the time parameter transmission, that is, the first routing node, the local memory date of the first routing node may be updated according to the time parameter in the daily cutting instruction. For a routing node not receiving the time parameter transmission, that is, the second routing node may change its routing state value in response to the daily handover instruction, and then update its local memory date according to the routing state value.
Further, in response to the daily cutting instruction, changing a routing state value corresponding to the second routing node, and then updating a local memory date of the second routing node according to the routing state value may include: responding to the daily cutting instruction, and changing the routing state value corresponding to the second routing node from 0 to 1; if the routing state value corresponding to the second routing node is monitored to be 1, the local memory date of the second routing node is updated, and then the routing state value corresponding to the second routing node is changed from 1 to 0 by combining the failure time of the routing state value. For example, there are 5 second routing nodes, and these 5 second routing nodes may change their corresponding routing state values from 0 to 1 in response to the daily handover command. Because the time for each second routing node to respond to the daily switching instruction is different, at this time, the routing state values corresponding to the 5 second routing nodes are in a mixed state of 0 and 1, that is, the routing state values corresponding to part of the second routing nodes are 0, and the routing state values corresponding to part of the second routing nodes are 1. When the second routing node monitors that the corresponding routing state value is 1, the local memory date of the second routing node is updated, and then the corresponding routing state value is changed from 1 to 0 by combining the failure time of the routing state value. And finally, all the second routing nodes are updated successfully, and the corresponding routing state values are all reset to 0.
According to the data processing method based on the distributed environment, for the routing nodes which receive the time parameter transmission, the date can be updated according to the time parameter in the time-of-day instruction, for the routing nodes which do not receive the time parameter transmission, the date can be updated by changing the routing state value, a transition state system can be well compatible, other special implementation limitations do not exist, the existing distributed system does not need to be modified, and the practicability is high.
Fig. 4 is a schematic diagram of a main process of a distributed environment-based data processing method according to an embodiment of the present invention. As shown in fig. 4, the main processes of the distributed environment-based data processing method may include:
step S401, responding to a daily cut instruction initiated by a daily cut initiating node, and updating the business date of a configuration center;
step S402, updating the local memory date of the first routing node according to the time parameter in the daily cutting instruction, wherein the first routing node is the routing node which receives the time parameter transmission;
step S403, responding to the daily cutting instruction, changing the routing state value corresponding to the second routing node from 0 to 1, wherein the second routing node is a routing node which does not receive the time parameter transmission;
step S404, if the routing state value corresponding to the second routing node is monitored to be 1, updating the local memory date of the second routing node, and then changing the routing state value corresponding to the second routing node from 1 to 0 by combining the failure time of the routing state value;
step S405, receiving a transaction request through a routing node, reading a local memory date from a memory of the routing node, splicing the read local memory date and the received transaction request, and forwarding the spliced local memory date and the received transaction request to a processing node;
step S406, the processing node takes the read local memory date as the current business date to process the received transaction request.
The local memory date is the business date stored in the memory of the routing node. After the business date of the configuration center is updated in step S401, if a newly started routing node exists, the business date is read from the configuration center and stored in the memory of the newly started routing node, so that the newly started routing node processes the transaction request according to the business date.
And, the data processing method based on the distributed environment may further include: judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date; if yes, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
In addition, in the process of updating the date through steps S402 to S404, there may be a case where a part of the routing nodes fails to update the date, and therefore the data processing method based on the distributed environment may further include: if the reinitiation time corresponding to the daily cutting instruction is reached, acquiring a routing node with a successful date update and a routing node with a failed date update, wherein the reinitiation time corresponding to the daily cutting instruction is greater than the effective date time; judging whether the ratio of the number of the routing nodes with successful date updating to the number of the routing nodes with failed date updating is greater than a preset ratio threshold value or not; if so, determining that the Japanese switch initiating node gives up reinitiating the Japanese switch instruction; if not, the date switching instruction is reinitiated to the routing node with failed date updating through the date switching initiating node, so that the routing node with failed date updating responds to the date switching instruction to update the date.
In addition, the data processing method based on the distributed environment may further include: if the routing node meets at least one of the following options: if the number of failed update dates exceeds a preset number threshold and the update dates fail within preset time, determining that the routing node is an abnormal node, returning operation and maintenance fault processing information of the abnormal node, and triggering operation and maintenance alarm information; wherein failing to update the date comprises: reading the business date from the configuration center fails in response to a date-cut instruction failing to update the date.
According to the data processing method based on the distributed environment, the business date of the configuration center and the business date stored in the memory by each routing node can be updated in response to the initiated daily switching instruction, the business date is stored in the memory of each routing node, remote date inquiry is changed into local memory reading, the time spent on obtaining the business date can be reduced to be completely ignored, the transaction duration is reduced, the single-point failure risk can be avoided, and the consistent date switching is realized.
Fig. 5 is a schematic diagram of main blocks of a data processing apparatus based on a distributed environment according to an embodiment of the present invention. As shown in fig. 5, the main modules of the distributed environment-based data processing apparatus 500 may include: a first update module 501, a second update module 502 and a processing module 503.
Wherein, the first update module 501 is operable to: responding to a daily cut instruction initiated by a daily cut initiating node, and updating the business date of the configuration center; the second update module 502 may be operable to: after the configuration center successfully updates the business days, responding to the daily switching instruction, and updating the local memory dates of one or more routing nodes, wherein the local memory dates are the business dates stored in the memories of the routing nodes; the processing module 503 may be configured to: the transaction request is processed by one or more routing nodes according to the local memory dates of the one or more routing nodes.
As an embodiment of the present invention, the second update module 502 may further be configured to: judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date; and if so, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
As shown in fig. 5, the data processing apparatus 500 based on the distributed environment according to the embodiment of the present invention may further include: an instruction initiation module 504. The instruction initiation module 504 may be operable to: and if the reinitiation time corresponding to the daily cutting instruction is reached, reinitiating the daily cutting instruction, wherein the reinitiation time corresponding to the daily cutting instruction is greater than the effective date time.
As an embodiment of the present invention, the instruction initiating module 504 may further be configured to: acquiring a routing node with a successful date update and a routing node with a failed date update; judging whether the node number ratio of the routing node with the successful date updating to the routing node with the failed date updating is larger than a preset ratio threshold value or not; if yes, determining that the Japanese cutting initiating node gives up the reinitiation of the Japanese cutting instruction; if not, determining that the daily cutting initiating node initiates the daily cutting instruction again.
As an embodiment of the present invention, the instruction initiating module 504 may further be configured to: and reinitiating the daily cut instruction to the routing node with failed date updating through the daily cut initiating node so that the routing node with failed date updating carries out date updating in response to the daily cut instruction.
As an embodiment of the present invention, the second update module 502 may further be configured to: if the routing node meets at least one of the following options: if the number of failed update dates exceeds a preset number threshold and the update dates fail within preset time, determining that the routing node is an abnormal node, returning operation and maintenance fault processing information of the abnormal node, and triggering operation and maintenance alarm information; wherein failing to update the date comprises: reading the business date from the configuration center fails in response to a date-cut instruction failing to update the date.
As an embodiment of the present invention, the second update module 502 may further be configured to: and if the newly started routing node exists, reading the business date from the configuration center, and storing the business date into the memory of the newly started routing node so that the newly started routing node processes the transaction request according to the business date.
As an embodiment of the present invention, the processing module 503 may be further configured to: the transaction request is received through one or more routing nodes, the local memory date is read from the memories of the one or more routing nodes, the read local memory date and the received transaction request are spliced and forwarded to the processing node, and then the received transaction request is processed by taking the read local memory date as the current business date through the processing node.
As an embodiment of the present invention, the second update module 502 may further be configured to: updating the local memory date of the first routing node according to the time parameter in the daily cutting instruction; responding to the daily cutting instruction, changing a routing state value corresponding to the second routing node, and updating a local memory date of the second routing node according to the routing state value; the first routing node is a routing node which receives the time parameter transmission, and the second routing node is a routing node which does not receive the time parameter transmission.
As an embodiment of the present invention, the second update module 502 may further be configured to: and responding to the daily cutting instruction, and changing the routing state value corresponding to the second routing node from 0 to 1.
As an embodiment of the present invention, the second update module 502 may further be configured to: if the routing state value corresponding to the second routing node is monitored to be 1, the local memory date of the second routing node is updated, and then the routing state value corresponding to the second routing node is changed from 1 to 0 by combining the failure time of the routing state value.
According to the data processing device based on the distributed environment, the business date of the configuration center and the business dates stored in the memory of each routing node can be updated in response to the initiated daily cutting instruction, the business dates are stored in the memory of each routing node, remote date inquiry is changed into local memory reading, the time spent on obtaining the business dates can be completely ignored, the transaction duration is shortened, the single-point failure risk can be avoided, and the consistent date switching is realized.
Fig. 6 illustrates an exemplary system architecture 600 of a distributed environment based data processing method or distributed environment based data processing apparatus to which embodiments of the present invention may be applied.
As shown in fig. 6, the system architecture 600 may include terminal devices 601, 602, 603, a network 604, and a server 605. The network 604 serves to provide a medium for communication links between the terminal devices 601, 602, 603 and the server 605. Network 604 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 601, 602, 603 to interact with the server 605 via the network 604 to receive or send messages or the like. The terminal devices 601, 602, 603 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 605 may be a server that provides various services, such as a background management server (for example only) that provides support in data processing based on a distributed environment using the terminal apparatuses 601, 602, 603 as users; as another example, server 605 may perform data processing in accordance with embodiments of the present invention in a distributed environment.
It should be noted that the data processing method based on the distributed environment provided by the embodiment of the present invention is generally executed by the server 605, and accordingly, the data processing apparatus based on the distributed environment is generally disposed in the server 605.
It should be understood that the number of terminal devices, networks, and servers in fig. 6 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 7 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a first update module, a second update module, and a processing module. The names of these modules do not in some cases constitute a limitation on the module itself, for example, the first updating module may also be described as a "module that updates the business date of the configuration center in response to a daily cut instruction initiated by the daily cut initiating node".
As another aspect, the present invention also provides a computer-readable medium, which may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: responding to a daily cut instruction initiated by a daily cut initiating node, and updating the business date of the configuration center; after the configuration center successfully updates the business days, responding to the daily cutting instruction, and updating the local memory dates of one or more routing nodes, wherein the local memory dates are the business dates stored in the memories of the routing nodes; the transaction request is processed by one or more routing nodes according to the local memory dates of the one or more routing nodes.
According to the technical scheme of the embodiment of the invention, the business date of the configuration center and the business date stored in the memory of each routing node can be updated in response to the initiated daily switching instruction, so that the business date is stored in the memory of each routing node, and the remote date inquiry is changed into local memory reading, thereby completely neglecting the time spent on obtaining the business date, reducing the transaction duration, avoiding the risk of single-point failure and realizing the consistent date switching.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (16)
1. A method for data processing based on a distributed environment, comprising:
responding to a daily cut command initiated by a daily cut initiating node, and updating the business date of the configuration center;
after the configuration center successfully updates the business dates, responding to the daily switching instruction, and updating the local memory dates of one or more routing nodes, wherein the local memory dates are the business dates stored in the memories of the routing nodes;
receiving a transaction request through the one or more routing nodes, reading local memory dates from memories of the one or more routing nodes, splicing the read local memory dates with the received transaction request, forwarding the transaction request to a processing node, and processing the received transaction request by taking the read local memory dates as current business dates through the processing node.
2. The method of claim 1, further comprising:
judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date;
and if so, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
3. The method of claim 2, further comprising:
and if the reinitiation time corresponding to the date switching instruction is reached, reinitiating the date switching instruction, wherein the reinitiation time corresponding to the date switching instruction is greater than the effective date time.
4. The method of claim 3, wherein prior to re-initiating the daily cut instruction, the method further comprises:
acquiring a routing node with a successful date update and a routing node with a failed date update;
judging whether the node number ratio of the routing node with the successful date updating to the routing node with the failed date updating is larger than a preset ratio threshold value or not;
if so, determining that the Japanese switch initiating node gives up to reinitiate the Japanese switch instruction;
if not, determining that the daily cutting initiating node initiates the daily cutting instruction again.
5. The method of claim 4, wherein the reinitiating the daily cut instruction comprises:
and reinitiating the daily cut instruction to the routing node with the failed date updating through the daily cut initiating node so that the routing node with the failed date updating carries out the date updating in response to the daily cut instruction.
6. The method of claim 5, further comprising:
if the routing node meets at least one of the following options: if the number of failed update dates exceeds a preset number threshold and the update dates fail within preset time, determining that the routing node is an abnormal node, returning operation and maintenance fault processing information of the abnormal node, and triggering operation and maintenance alarm information.
7. The method of claim 6, wherein the failure to update the date comprises: reading the business date failure from the configuration center in response to the daily cutting instruction failing to update the date.
8. The method of claim 1, further comprising:
and if the newly started routing node exists, reading the business date from the configuration center, and storing the business date into the memory of the newly started routing node, so that the newly started routing node processes the transaction request according to the business date.
9. The method of any one of claims 1 to 8, wherein updating the local memory date of one or more routing nodes in response to the daily cut instruction comprises:
updating the local memory date of the first routing node according to the time parameter in the daily cutting instruction;
and responding to the daily cutting instruction, changing a routing state value corresponding to the second routing node, and updating the local memory date of the second routing node according to the routing state value.
10. The method of claim 9, wherein altering the routing state value corresponding to the second routing node in response to the daily cut instruction comprises:
and changing the routing state value corresponding to the second routing node from 0 to 1 in response to the daily cutting instruction.
11. The method of claim 10, wherein updating the local memory date of the second routing node based on the routing state value comprises:
if the routing state value corresponding to the second routing node is monitored to be 1, updating the local memory date of the second routing node, and then changing the routing state value corresponding to the second routing node from 1 to 0 by combining the failure time of the routing state value.
12. The method of claim 9, wherein the first routing node is a routing node that receives a time parameter transfer, and wherein the second routing node is a routing node that does not receive a time parameter transfer.
13. A data processing apparatus based on a distributed environment, comprising:
the first updating module is used for responding to a daily cutting instruction initiated by the daily cutting initiating node and updating the business date of the configuration center;
the second updating module is used for responding to the daily cutting instruction after the configuration center successfully updates the business date, and updating the local memory date of one or more routing nodes, wherein the local memory date is the business date stored in the memory of the routing node;
and the processing module is used for receiving the transaction request through the one or more routing nodes, reading the local memory date from the memories of the one or more routing nodes, splicing the read local memory date with the received transaction request, forwarding the spliced local memory date to the processing node, and processing the received transaction request by taking the read local memory date as the current business date through the processing node.
14. The apparatus of claim 13, wherein the second update module is further configured to:
judging whether the local memory date of the routing node is invalid or not according to the date valid time corresponding to the routing node, wherein the date valid time is the valid time of the local memory date;
and if so, reading the business date from the configuration center, and updating the local memory date of the routing node by using the business date.
15. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-12.
16. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110352535.5A CN112988800B (en) | 2021-03-31 | 2021-03-31 | Data processing method and device based on distributed environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110352535.5A CN112988800B (en) | 2021-03-31 | 2021-03-31 | Data processing method and device based on distributed environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112988800A CN112988800A (en) | 2021-06-18 |
| CN112988800B true CN112988800B (en) | 2022-09-27 |
Family
ID=76339173
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110352535.5A Active CN112988800B (en) | 2021-03-31 | 2021-03-31 | Data processing method and device based on distributed environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112988800B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114090605A (en) * | 2021-11-30 | 2022-02-25 | 中国建设银行股份有限公司 | Daily cutting method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107563887A (en) * | 2017-08-22 | 2018-01-09 | 福建省农村信用社联合社 | Day blanking method is shut down based on AS400 bank cores billing and accounting system zero |
| CN111369333A (en) * | 2020-02-28 | 2020-07-03 | 中国工商银行股份有限公司 | Daily cutting cooperative processing method and system for distributed system |
| CN111382028A (en) * | 2020-03-05 | 2020-07-07 | 中国银行股份有限公司 | Method and device for processing date switching errors of batch processing system and server |
| CN111444003A (en) * | 2020-03-27 | 2020-07-24 | 上海数禾信息科技有限公司 | Multi-system daily-cutting preparation method and device based on credit bill and financial settlement |
| CN112163946A (en) * | 2020-09-30 | 2021-01-01 | 中国工商银行股份有限公司 | Accounting processing method and device based on distributed transaction system |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108830705B (en) * | 2018-04-09 | 2021-09-03 | 创新先进技术有限公司 | Method, device and equipment for summarizing transaction data |
| CN109146653B (en) * | 2018-07-06 | 2022-11-22 | 南京星云数字技术有限公司 | Distributed environment-based accounting daily cutting checking method and device |
| CN110163742B (en) * | 2019-04-22 | 2023-08-04 | 创新先进技术有限公司 | Account resource data determining method and system |
| CN111813793A (en) * | 2020-07-08 | 2020-10-23 | 中国建设银行股份有限公司 | Method and device for processing daily handover, computer equipment and storage medium |
-
2021
- 2021-03-31 CN CN202110352535.5A patent/CN112988800B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107563887A (en) * | 2017-08-22 | 2018-01-09 | 福建省农村信用社联合社 | Day blanking method is shut down based on AS400 bank cores billing and accounting system zero |
| CN111369333A (en) * | 2020-02-28 | 2020-07-03 | 中国工商银行股份有限公司 | Daily cutting cooperative processing method and system for distributed system |
| CN111382028A (en) * | 2020-03-05 | 2020-07-07 | 中国银行股份有限公司 | Method and device for processing date switching errors of batch processing system and server |
| CN111444003A (en) * | 2020-03-27 | 2020-07-24 | 上海数禾信息科技有限公司 | Multi-system daily-cutting preparation method and device based on credit bill and financial settlement |
| CN112163946A (en) * | 2020-09-30 | 2021-01-01 | 中国工商银行股份有限公司 | Accounting processing method and device based on distributed transaction system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112988800A (en) | 2021-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111460129A (en) | Method and device for generating identification, electronic equipment and storage medium | |
| CN112860342A (en) | Method, device, equipment, system and storage medium for microservice configuration | |
| CN112988800B (en) | Data processing method and device based on distributed environment | |
| CN107818027B (en) | Method and device for switching main name node and standby name node and distributed system | |
| CN111245939B (en) | Data synchronization method, device and system | |
| CN113282589A (en) | Data acquisition method and device | |
| WO2024066374A1 (en) | Service degradation method and apparatus, device, computer-readable medium and program product | |
| CN113595887B (en) | Flow control method and device in mail system | |
| CN113420275A (en) | Data connection processing method, related device and computer program product | |
| CN113364887A (en) | File downloading method based on FTP, proxy server and system | |
| CN113726885A (en) | Method and device for adjusting flow quota | |
| CN113761075A (en) | Method, device, equipment and computer readable medium for switching databases | |
| CN111210349A (en) | Virtual asset transfer hosting method and device, electronic equipment and storage medium | |
| CN112182003A (en) | Data synchronization method and device | |
| CN113741951A (en) | Local packaging method and device | |
| CN112883103A (en) | Method and device for data transfer between clusters | |
| CN111179097B (en) | Method, device, electronic equipment and storage medium for modifying warranty | |
| CN111581032B (en) | Method, device, equipment and storage medium for operating data and rolling back data | |
| CN111314457B (en) | Method and device for setting virtual private cloud | |
| CN113872808B (en) | Application processing method and device | |
| CN113364615B (en) | Method, device, equipment and computer readable medium for rolling upgrade | |
| CN113761001A (en) | Cross-system data synchronization method and device | |
| CN113765971A (en) | Method, device, equipment and computer readable medium for controlling interface | |
| WO2023221002A1 (en) | Ota-based system updating method and apparatus, electronic device, and storage medium | |
| CN113269605A (en) | Order processing method, device, equipment and computer readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |