CN107992290B - Background data processing method and system - Google Patents
Background data processing method and system Download PDFInfo
- Publication number
- CN107992290B CN107992290B CN201610996933.XA CN201610996933A CN107992290B CN 107992290 B CN107992290 B CN 107992290B CN 201610996933 A CN201610996933 A CN 201610996933A CN 107992290 B CN107992290 B CN 107992290B
- Authority
- CN
- China
- Prior art keywords
- data
- state
- slave node
- valid
- invalid
- 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
- G06F8/00—Arrangements for software engineering
- G06F8/20—Software design
-
- 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
- G06Q30/00—Commerce
- G06Q30/01—Customer relationship services
- G06Q30/015—Providing customer assistance, e.g. assisting a customer within a business location or via helpdesk
- G06Q30/016—After-sales
Abstract
The disclosure relates to a background data processing method and a system, wherein the method comprises the following steps: storing data of an active state to a slave node; when a data validation instruction for the data in the to-be-validated state is received, the data in the to-be-validated state stored by the slave node is stored in a master node, and the state of the data stored in the master node is configured to be the validated state. The method and the device improve the correctness of background data setting and achieve the purpose of safely operating the background data.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a background data processing method and a background data processing system.
Background
With the development of internet technology, people's work and life style are more and more convenient. Currently, in the field of internet services, most background data processing modes are set to be directly effective, for example, operations such as adding, deleting and modifying data are set to be immediately effective. In other background data processing modes, there is a step of confirming execution before the background data operation is effective, for example, a pop-up box with a confirmation button appears before the background data operation is effective, and whether the background data operation is effective or not can be confirmed by the administrator.
The background data processing method is feasible for some simple data setting functions, however, for complex data setting functions, once an error occurs, the application of data may be affected immediately, and it is difficult to ensure the correctness of data processing. In this case, because of the problem of the storage mechanism of the data and the inability of the data to be rolled back, the conventional solution is to reset the data and to overwrite the previous error data with the reset data, however, for some complicated data settings, on the one hand, the scheme for resetting the data is inefficient, on the other hand, the reset scheme cannot avoid the problem of resetting errors in a short time, and the accumulation of errors may have a serious impact on the application of the data.
In view of this, a new background data processing method and system are needed to solve the problem that a setting error may occur during background data processing.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
An object of the present disclosure is to provide a background data processing method and a background data processing system, which overcome one or more of the problems due to the limitations and disadvantages of the related art, at least to a certain extent.
According to an aspect of the present disclosure, there is provided a background data processing method, including:
storing data of an active state to a slave node;
when a data validation instruction for the data to be in the valid state is received, the data to be in the valid state stored by the slave node is stored to a master node, and the state of the data stored to the master node is configured to be in the valid state.
In an exemplary embodiment of the present disclosure, the to-be-active state includes a newly-added active state; the background data processing method further comprises the following steps:
and when a newly added data instruction is received, configuring the state of the data corresponding to the newly added data instruction into the newly added standby valid state.
In an exemplary embodiment of the present disclosure, the to-be-active state includes a modified to-be-active state; the background data processing method further comprises the following steps:
when a first data modification instruction for modifying the data to be in the valid state is received, modifying the data to be in the valid state and configuring the state of the modified data to be in the modified valid state.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a second data modification instruction for modifying the data in the valid state is received, judging whether a slave node exists in a master node for storing the data in the valid state to be modified;
under the condition that a master node storing the data of the effective state to be modified is judged to have a slave node, modifying the data of the effective state to be modified and storing the modified data to the slave node, and configuring the state of the data stored to the slave node as the modified effective state;
and under the condition that the master node for storing the data in the valid state to be modified does not have a slave node, newly building a slave node, modifying the data in the valid state to be modified, storing the modified data to the newly built slave node, and configuring the state of the data stored to the slave node as the modified state to be valid.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
and when a data deleting instruction for deleting the data to be in the valid state is received, configuring the state of the data to be in the valid state into an invalid state.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a data deleting instruction for deleting the data in the valid state is received, judging whether a slave node exists in a master node for storing the data in the valid state to be deleted;
under the condition that a master node storing the data in the valid state to be deleted has a slave node, configuring the state of the data stored in the slave node into a state to be deleted and invalid;
and under the condition that the master node for storing the data in the valid state to be deleted does not have a slave node, newly building a slave node, copying the data in the valid state to be deleted to the newly built slave node, and configuring the state of the data copied to the newly built slave node as a state to be deleted to be invalid.
In an exemplary embodiment of the present disclosure, the to-be-active state includes a modified to-be-active state; the background data processing method further comprises the following steps:
when a third data modification instruction for modifying the data to be deleted and to be invalid is received, modifying the data to be deleted and to be invalid and configuring the state of the modified data to be the modified and to be valid.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a data deleting instruction for deleting the data to be invalid is received, configuring the state of deleting the data to be invalid into an invalid state.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a data validation instruction for deleting the data to be invalid is received, configuring the data to be invalid and the data in the valid state stored by the master node corresponding to the slave node for storing the data to be invalid as the data in the invalid state.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a first rollback operation instruction is received, selecting invalid-state data to be restored, and configuring the state of the invalid-state data to be restored as the valid state.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a data validation instruction for the data to be in the valid state is received, the data to be in the valid state stored by the slave node is stored to a master node, the state of the data stored to the master node is configured to be in the valid state, original data on the master node is stored to the slave node, and the state of the data stored to the slave node is configured to be in the invalid state.
In an exemplary embodiment of the present disclosure, the background data processing method further includes:
when a second rollback operation instruction is received, the data stored on the slave node and the data stored on the master node are exchanged, the state of the exchanged data on the master node is configured to be the valid state, and the state of the exchanged data on the slave node is configured to be the invalid state.
According to an aspect of the present disclosure, there is provided a background data processing system, including:
the storage module is used for storing data in a standby state to a slave node;
a processing module, configured to, when a data validation instruction for the data in the to-be-validated state is received, store the data in the to-be-validated state stored in the slave node to a master node, and configure a state of the data stored in the master node as a validated state
In the technical solutions provided by some embodiments of the present disclosure, by storing a to-be-validated state of data to a slave node, and when receiving a data validation instruction for the to-be-validated state of data, storing the to-be-validated state of data stored by the slave node to a master node and configuring the state of the data stored to the master node to be the validated state, on one hand, a reliable data storage manner is provided, and the problem that an operation on data is validated immediately after being set is avoided; on the other hand, a data transfer mode from the slave node to the master node is realized, so that data rollback can be quickly carried out, and a guarantee is provided for solving the problem of setting errors; on the other hand, through the background data processing method, for complex data setting, the setting correctness can be ensured through twice confirmation, and the purpose of safely operating background data is achieved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty. In the drawings:
FIG. 1 schematically illustrates an underlying data table structure according to an exemplary embodiment of the present disclosure;
FIG. 2 schematically illustrates a data state transition diagram, according to an exemplary embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart of modifying data in a valid state according to an exemplary embodiment of the present disclosure; and
fig. 4 schematically shows a flowchart for deleting data of a valid state according to an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and the like. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.
Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the steps. For example, some steps may be decomposed, and some steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
Taking an online customer service system of electronic commerce as an example, in the online customer service system of electronic commerce, different classes of customer service personnel are required to have different skills for the purpose of realizing that professional customer service personnel answer professional questions (for example, after-sales customer service personnel answer the return-related questions and before-sales customer service personnel answer the commodity consultation questions). Therefore, the fine rule setting of the skill group bound by the customer service staff is the key for realizing the above-mentioned goal. Once a skill set rule is set and bound to a class of customer service personnel, the class of customer service personnel can only accept the inquiry of customers meeting the rules of the skill set, thereby achieving the aim that professional customer service personnel answer professional questions.
Meanwhile, the old rules are always used online before the new rules are set, which constantly affects the distribution of customer consultation to different types of customer service staff, which requires that the new rules must be set accurately. Therefore, how to safely set (add, modify, delete) the rules of the skill set is critical to the accurate consultation of customers or other similar business scenarios.
In order to clearly describe the technical solution of the present disclosure, the technical group rule bound by the customer service staff is still taken as an example for explanation.
Fig. 1 schematically illustrates an underlying data table structure according to an exemplary embodiment of the present disclosure.
As shown in fig. 1, waiter represents a customer service person entity table, group represents a skill group entity table, rule represents a rule entity table, waiter _ group represents a contact table between a customer service person and a skill group, and group _ rule represents a contact table between a skill group and a rule. In addition to the Primary Key (PK) number (id) and Foreign Key (FK) number (id) of each table, of particular interest, a rule table may include status that indicates the status of rule data. In an exemplary embodiment of the present disclosure, a status may include a valid state (valid), a to-be-valid state, an invalid state (invalid), and a delete to-be-invalid state (del _ to _ invalid); the to-be-validated state may include an add _ to _ valid state (add _ to _ valid) and a modified to-be-validated state (exit _ to _ valid).
In the above five data states, the valid state and the invalid state are stable states, and the newly added to-be-valid state, the modified to-be-valid state, and the deleted to-be-invalid state are intermediate states. Data in the active state may be in use while data in the intermediate and inactive states are unused. For convenience of describing a data operation process, in the present exemplary embodiment, each piece of data in the rule table is stored to the master node or the slave node, and a value of a master number (master _ id) of the master node may be set to null, and a master _ id of the slave node may be set to a natural number (including zero). It should be noted that the node in the active state is a master node, the node in the intermediate state is a slave node, and the node in the inactive state may be either a master node or a slave node.
Based on the above description, the background data processing method and system according to the exemplary embodiments of the present disclosure will be described in detail below.
As described above, in the rule table, the states of data may include five states, and the five states may be subjected to state transition in certain cases. For example, when a data validation instruction for the data to be in the valid state is received, the data to be in the valid state stored by the slave node is stored to a master node, and the state of the data stored to the master node is configured to be in the valid state. More and more specific state transition procedures in this example embodiment will be further described below with primary reference to fig. 2.
FIG. 2 schematically illustrates a data state transition diagram, according to an exemplary embodiment of the present disclosure; referring to fig. 2, the state transition of five types of data may occur through four operations of adding, modifying, deleting, and validating, and the state transition process will be described in detail below.
< New addition >
According to some embodiments of the present disclosure, when a new data instruction is received, the state of data corresponding to the new data instruction may be configured as a new standby valid state, and meanwhile, the value of the master _ id of the node storing the data may be set to 0 to indicate that the node is a slave node. In addition, the new data instruction may be input by the administrator through the computer, and the administrator may input the new data at the same time as inputting the new data instruction. Of course, in other exemplary embodiments of the present disclosure, the new data command and the new data may be configured in other manners, for example, a new data command and a new data may be automatically generated by the internet system, which also belongs to the protection scope of the present disclosure.
By configuring the state of the newly added data to be the newly added standby state, the problem that the newly added data is directly used after being set can be avoided.
< modification >
According to some embodiments of the present disclosure, when a first data modification instruction for modifying data to be in an active state is received, the data to be in the active state may be modified and a state of the modified data may be configured to modify the data to be in the active state. It should be noted that the data of the to-be-enabled state described in the exemplary embodiment of the present disclosure may include data of a newly added to-be-enabled state and data of a modified to-be-enabled state. In addition, the modification of the data to be in the valid state is a process from the intermediate state to the intermediate state of the data state, and the operation of transferring the data from the slave node to the master node is not generated.
According to other embodiments of the present disclosure, as shown in fig. 3, when a second data modification instruction for modifying data in an active state is received, it is determined whether a slave node exists in a master node storing the data in the active state to be modified. The method of determining may include, but is not limited to, querying a rule table to see whether the master node has an associated slave node.
When it is determined that the master node storing the data in the valid state to be modified exists in the slave node, the data in the valid state to be modified may be modified and stored in the slave node, and the state of the data stored in the slave node may be configured to be the modified valid state.
When it is determined that the master node storing the data in the valid state to be modified does not have a slave node, a new slave node may be created, the data in the valid state to be modified may be modified and the modified data may be stored in the new slave node, and the state of the data stored in the slave node may be configured to be the modified state to be valid.
It should be noted that, when the data of the valid state to be modified is modified, the master node storing the valid state and the data of the valid state on the master node are not changed, only the slave node of the master node is added or modified, and the modified content is stored on the slave node of the master node.
According to some embodiments of the present disclosure, when a third data modification instruction for modifying data to be deleted to be invalidated is received, the data to be deleted to be invalidated may be modified and the state of the modified data may be configured to be modified to be validated.
From the above, the master-slave node storage manner of the embodiment of the present disclosure can provide an administrator with an effective buffer and sufficient decision time during the deletion operation.
< deletion >
According to some embodiments of the present disclosure, when a data deletion instruction for deleting data to be in an active state is received, the state of the data to be in the active state may be configured to be in an inactive state.
In addition, since the data to be in the valid state is unused data, in other embodiments according to the present disclosure, when a data deletion instruction is received, the data to be in the valid state and the slave node storing the data to be in the valid state may also be directly deleted.
According to some embodiments of the present disclosure, as shown in fig. 4, when a data deletion instruction for deleting data in an active state is received, it is determined whether a slave node exists in a master node that stores the data in the active state to be deleted. The method of determining may include, but is not limited to, querying a rule table to see whether the master node has an associated slave node.
In the case where it is determined that the master node storing the data of the valid state to be deleted exists in the slave node, the state of the data stored in the slave node may be configured to be the deleted data of the invalid state.
In the case where it is determined that the master node storing the data of the valid state to be deleted does not have a slave node, a slave node may be newly created, and the data of the valid state to be deleted is copied to the newly created slave node and the state of the data copied to the newly created slave node is configured as the delete-to-be-invalid state.
It should be noted that when deleting data in the valid state, only the slave node corresponding to the master node storing the data in the valid state is subjected to the deletion operation, and the data in the valid state and the master node storing the data in the valid state are not changed.
According to some embodiments of the present disclosure, when a data deletion instruction for deleting data to be invalidated is received, a state where the data to be invalidated is deleted may be configured as an invalid state.
< validation >
According to some embodiments of the present disclosure, when a data validation instruction for data to be in an active state is received, the data to be in the active state stored by the slave node may be stored to a master node and the state of the data stored to the master node may be configured to be in the active state.
When the data in the to-be-valid state is newly added data in the to-be-valid state, the state of the newly added data in the to-be-valid state may be configured as a valid state, and the master _ id may be set to null to indicate that the slave node storing the newly added data in the to-be-valid state transits to the master node in the valid state. At this time, the data on the master node can be bound in the group _ rule relation table for use.
In addition, according to other embodiments of the present disclosure, when the data in the to-be-valid state is the modified to-be-valid state, it is determined whether a corresponding master node exists in the slave node storing the data in the to-be-valid state. Under the condition that the slave node storing the data in the to-be-valid state is judged to have a corresponding master node, the data in the to-be-valid state on the slave node can be copied to the master node, and the slave node is directly deleted; in the case where it is determined that the slave node storing the data in the to-be-validated state does not have a corresponding master node, the master _ id of the slave node may be set to null.
According to some embodiments of the present disclosure, when a data validation instruction for deleting data to be invalidated is received, data of an valid state stored by a master node corresponding to a slave node that deletes the data to be invalidated and stores the data to be invalidated may be configured as data of an invalid state.
It should be noted that after the data to be invalidated is deleted, the relationship between the slave node storing the data to be invalidated and the corresponding master node bound in the group _ rule should be deleted, so as to avoid generating unpredictable problems, for example, a problem that the relationship between the slave node and the master node may be confused, which is not described in detail in the exemplary embodiments of the present disclosure.
The transition between background data states based on the background data storage method of the master-slave node according to the exemplary embodiment of the present disclosure is described above. The method and the device can reduce the risk of operation errors when operations such as addition, modification and deletion of data face operation of complex data. A rollback method according to an exemplary embodiment of the present disclosure will be described below. In an exemplary embodiment of the present disclosure, the rollback means a process that may restore data to data at a point in time before an error operation of the data has been performed to completion.
According to some embodiments of the present disclosure, after a deletion operation is performed on data in an active state, the state of the data in the active state is configured to be deleted to be in an inactive state, and at this time, in a case where the validation operation is performed on the data, the data and data of a master node corresponding to a slave node storing the data are configured to be data in an inactive state. When a first rollback operation instruction is received, data in an invalid state to be restored can be selected according to the first rollback operation instruction, and the state of the data in the invalid state to be restored is configured to be a valid state.
The rollback method in the case where deletion is erroneously performed as invalid is described above, and next, the rollback method in the case where modification is erroneously performed as valid will be described.
According to some embodiments of the present disclosure, after a validation operation is performed on data in a to-be-validated state, the data in the to-be-validated state is stored to a master node and a state of the data stored to the master node is configured to be a validated state, and data existing on the master node is stored to a slave node storing the data in the validated state and the state of the data stored to the slave node is configured to be an invalidated state. When a second rollback operation instruction is received, the data stored on the slave node and the data stored on the master node may be interchanged, and the state of the interchanged data on the master node may be configured as an active state and the state of the interchanged data on the slave node may be configured as an inactive state.
It should be noted that there may be multiple invalid slave nodes in the rule table that store data prior to the historical modification data for the same master node. Thus, in the event of an erroneous operation, the data on the slave node may be interchanged with the data on the master node to effect a roll-back of all historical data.
Through the rollback method of the exemplary embodiment of the disclosure, the influence generated when an error occurs is reduced, so that the effect of improving the experience of a customer is achieved.
As can be seen from the above, in the present exemplary embodiment, by storing data in a to-be-validated state to a slave node, and when receiving a data validation instruction for the data in the to-be-validated state, storing the data in the to-be-validated state stored by the slave node to a master node and configuring the state of the data stored in the master node to be the validated state, on the one hand, a reliable data storage manner is provided, which avoids the problem that an operation on data is validated immediately after being set; on the other hand, a data transfer mode from the slave node to the master node is realized, so that data rollback can be quickly carried out, and a guarantee is provided for solving the problem of setting errors; on the other hand, through the background data processing method, for complex data setting, the setting correctness can be ensured through twice confirmation, and the purpose of safely operating background data is achieved.
It should be understood by those skilled in the art that although the exemplary embodiment is described based on the setting of the customer service background distribution rule, the technical solution is not affected by a specific service scenario, and the exemplary embodiment may be applied to any background management system in the internet.
It should be noted that although the various steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that these steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken into multiple step executions, etc.
Further, the present example embodiment also provides a background data processing system.
The background data processing system according to an exemplary embodiment of the present disclosure may include:
the storage module can be used for storing data in a standby state to a slave node;
the processing module may be configured to, when receiving a data validation instruction for the data in the to-be-validated state, store the data in the to-be-validated state stored in the slave node to a master node and configure a state of the data stored in the master node to be the validated state.
Since each functional module of the program operation performance analysis apparatus according to the embodiment of the present invention is the same as that in the embodiment of the present invention, it is not described herein again.
It should be noted that although several modules or units of the program execution performance analysis apparatus are mentioned in the above detailed description, such division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (8)
1. A method for background data processing, comprising:
storing data of a valid state to a slave node;
when a data validation instruction for the data in the to-be-validated state is received, storing the data in the to-be-validated state stored by the slave node to a master node and configuring the state of the data stored to the master node to be the validated state; wherein the master node has a plurality of slave nodes;
the to-be-valid states comprise newly-added to-be-valid states and modified to-be-valid states;
when a newly added data instruction is received, configuring the state of data corresponding to the newly added data instruction into a newly added standby valid state;
when a first data modification instruction for modifying the data to be in the valid state is received, modifying the data to be in the valid state and configuring the state of the modified data to be in the valid state;
when a data deleting instruction for deleting the data in the valid state is received, judging whether a slave node exists in a master node for storing the data in the valid state to be deleted;
under the condition that a master node storing the data in the valid state to be deleted has a slave node, configuring the state of the data stored in the slave node into a state to be deleted and invalid;
under the condition that the master node for storing the data of the valid state to be deleted does not have a slave node, a slave node is newly built, the data of the valid state to be deleted is copied to the newly built slave node, and the state of the data copied to the newly built slave node is configured to be a to-be-deleted invalid state;
when a data validation instruction for deleting the data to be invalid is received, configuring the data to be invalid and the data in the valid state stored by the master node corresponding to the slave node for storing the data to be invalid as data in the invalid state;
when a first rollback operation instruction is received, selecting invalid-state data to be restored, and configuring the state of the invalid-state data to be restored as the valid state.
2. A background data processing method according to claim 1, wherein the background data processing method further comprises:
when a second data modification instruction for modifying the data in the valid state is received, judging whether a slave node exists in a master node for storing the data in the valid state to be modified;
under the condition that a master node storing the data of the effective state to be modified is judged to have a slave node, modifying the data of the effective state to be modified and storing the modified data to the slave node, and configuring the state of the data stored to the slave node as the modified effective state;
and under the condition that the master node for storing the data in the valid state to be modified does not have a slave node, newly building a slave node, modifying the data in the valid state to be modified, storing the modified data to the newly built slave node, and configuring the state of the data stored to the slave node as the modified state to be valid.
3. A background data processing method according to claim 1, wherein the background data processing method further comprises:
and when a data deleting instruction for deleting the data in the to-be-valid state is received, configuring the state of the data in the to-be-valid state into an invalid state.
4. A background data processing method according to claim 1, wherein the to-be-active state comprises a modified to-be-active state; the background data processing method further comprises the following steps:
when a third data modification instruction for modifying the data to be deleted and to be invalid is received, modifying the data to be deleted and to be invalid and configuring the state of the modified data into the modified and to be valid state.
5. A background data processing method according to claim 1, wherein the background data processing method further comprises:
when a data deleting instruction for deleting the data to be invalid is received, configuring the state of deleting the data to be invalid into an invalid state.
6. A background data processing method according to claim 1, wherein the background data processing method further comprises:
when a data validation instruction for the data to be in the valid state is received, the data to be in the valid state stored by the slave node is stored to a master node, the state of the data stored to the master node is configured to be in the valid state, original data on the master node is stored to the slave node, and the state of the data stored to the slave node is configured to be in the invalid state.
7. A background data processing method according to claim 6, wherein the background data processing method further comprises:
when a second rollback operation instruction is received, the data stored on the slave node and the data stored on the master node are exchanged, the state of the exchanged data on the master node is configured to be the valid state, and the state of the exchanged data on the slave node is configured to be the invalid state.
8. A background data processing system, comprising:
the storage module is used for storing data in a standby state to a slave node;
the processing module is used for storing the data to be in the valid state stored by the slave node to a master node and configuring the state of the data stored to the master node to be in the valid state when a data validation instruction aiming at the data to be in the valid state is received; wherein the master node has a plurality of slave nodes;
the to-be-valid state comprises a newly-added to-be-valid state and a modified to-be-valid state; when a newly added data instruction is received, configuring the state of data corresponding to the newly added data instruction into a newly added standby valid state;
when a first data modification instruction for modifying the data in the to-be-valid state is received, modifying the data in the to-be-valid state and configuring the state of the modified data into the modified to-be-valid state;
when a data deleting instruction for deleting the data in the valid state is received, judging whether a slave node exists in a master node for storing the data in the valid state to be deleted;
under the condition that a master node storing the data in the valid state to be deleted has a slave node, configuring the state of the data stored in the slave node into a state to be deleted and invalid;
under the condition that the master node for storing the data in the valid state to be deleted does not have a slave node, a slave node is newly established, the data in the valid state to be deleted is copied to the newly established slave node, and the state of the data copied to the newly established slave node is configured to be a state to be deleted and to be invalid;
when a data validation instruction for deleting the data to be invalid is received, configuring the data to be invalid and the data in the valid state stored by the master node corresponding to the slave node for storing the data to be invalid as data in the invalid state;
when a first rollback operation instruction is received, selecting invalid-state data to be restored, and configuring the state of the invalid-state data to be restored as the valid state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610996933.XA CN107992290B (en) | 2016-10-26 | 2016-10-26 | Background data processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610996933.XA CN107992290B (en) | 2016-10-26 | 2016-10-26 | Background data processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107992290A CN107992290A (en) | 2018-05-04 |
| CN107992290B true CN107992290B (en) | 2022-06-07 |
Family
ID=62028747
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610996933.XA Active CN107992290B (en) | 2016-10-26 | 2016-10-26 | Background data processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107992290B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109377132A (en) * | 2018-11-07 | 2019-02-22 | 珠海市视微网络科技有限公司 | A kind of logistics company and freight charges template setting method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101150624A (en) * | 2006-09-22 | 2008-03-26 | 华为技术有限公司 | A data configuration system and method |
| CN103324679A (en) * | 2013-05-28 | 2013-09-25 | 杭州朗和科技有限公司 | Method and device for controlling data update in cache server |
| CN103838642A (en) * | 2012-11-26 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Data recovery method, device and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4900784B2 (en) * | 2006-04-13 | 2012-03-21 | 株式会社日立製作所 | Storage system and storage system data migration method |
-
2016
- 2016-10-26 CN CN201610996933.XA patent/CN107992290B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101150624A (en) * | 2006-09-22 | 2008-03-26 | 华为技术有限公司 | A data configuration system and method |
| CN103838642A (en) * | 2012-11-26 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Data recovery method, device and system |
| CN103324679A (en) * | 2013-05-28 | 2013-09-25 | 杭州朗和科技有限公司 | Method and device for controlling data update in cache server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107992290A (en) | 2018-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102934114B (en) | For the checkpoint of file system | |
| US8984472B1 (en) | Software development standards compliance system | |
| CN106445644B (en) | Treating method and apparatus based on the distributed transaction that an improved stage submits | |
| CN103999065B (en) | Network equipments configuration manages | |
| Balegas et al. | IPA: Invariant-preserving applications for weakly-consistent replicated databases | |
| CN104636130A (en) | Method and system for generating event trees | |
| CN107562459A (en) | Management system, interface generation/display/operation/display methods, end-of-medium | |
| CN107992290B (en) | Background data processing method and system | |
| Hierons et al. | Scenarios‐based testing of systems with distributed ports | |
| CN109254791A (en) | Develop management method, computer readable storage medium and the terminal device of data | |
| Mansour et al. | UML‐based regression testing for OO software | |
| Bielova et al. | Iterative enforcement by suppression: Towards practical enforcement theories | |
| Sheff et al. | Safe serializable secure scheduling: Transactions and the trade-off between security and consistency | |
| CN103107898A (en) | Method, device and system for sending or receiving multiple managed objects simultaneously | |
| WO2014097598A1 (en) | Information processing device which carries out risk analysis and risk analysis method | |
| CN109710629A (en) | Data access method, device, server and storage medium | |
| CN105320737A (en) | Firefighting inspection and acceptance retrieving system | |
| CN113689296A (en) | Contract scheduling method and device for asynchronous trusted computing and electronic equipment | |
| Arantes et al. | Tool support for generating model-based test cases via web | |
| US10936984B2 (en) | System for mitigating exposure associated with identified impacts of technological system changes based on solution data modelling | |
| CN112286909A (en) | Execution state determination method, device, server and storage medium | |
| JP2003050904A (en) | Device and system for information processing, operation flow support method, storage medium, and program | |
| CN113220605B (en) | Distributed cache management method and device and electronic equipment | |
| CN111198675B (en) | Management and control method and system | |
| Nett et al. | How to commit concurrent, non-isolated computations |
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 |