CN107944300A - A kind of method for writing data and device, verification method and device - Google Patents

A kind of method for writing data and device, verification method and device Download PDF

Info

Publication number
CN107944300A
CN107944300A CN201711059996.3A CN201711059996A CN107944300A CN 107944300 A CN107944300 A CN 107944300A CN 201711059996 A CN201711059996 A CN 201711059996A CN 107944300 A CN107944300 A CN 107944300A
Authority
CN
China
Prior art keywords
data
node
timestamp
verification
time stamp
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.)
Pending
Application number
CN201711059996.3A
Other languages
Chinese (zh)
Inventor
古亮
李诗逸
赵辉宇
吴大立
李庆
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sangfor Technologies Co Ltd
Original Assignee
Sangfor Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sangfor Technologies Co Ltd filed Critical Sangfor Technologies Co Ltd
Priority to CN201711059996.3A priority Critical patent/CN107944300A/en
Publication of CN107944300A publication Critical patent/CN107944300A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/64Protecting data integrity, e.g. using checksums, certificates or signatures
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2308Concurrency control
    • G06F16/2315Optimistic concurrency control
    • G06F16/2322Optimistic concurrency control using timestamps
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2365Ensuring data consistency and integrity

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Software Systems (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The embodiment of the invention discloses a kind of method for writing data and device, verification method and device, computer installation, readable storage medium storing program for executing, for detecting timing error in data writing process, and the inconsistent situation of node is found in data read process.In the embodiment of the present invention, method for writing data is applied to the distributed system for including N number of node, and this method includes:Receive the write request for the first data;According to write request, determine to stab at the first time according to preset rules;Detection at the first time stamp whether earlier than the second timestamp, the second timestamp M node writing position be for write at the first time stamp;If, it is determined that generation timing sequence mistake;If not, then the second update of time stamp in M node is stabbed for the first time, be the first data by corresponding second data update of the second timestamp in M node, by the second timestamp in M node it is corresponding second verification and be updated to using first data generation first verification and.

Description

A kind of method for writing data and device, verification method and device
Technical field
The present invention relates to data processing field, more particularly to a kind of method for writing data and device, verification method and dress Put, computer installation, readable storage medium storing program for executing.
Background technology
Keep the most important thing that data integrity is modern memory systems.At present, have various technologies by exploitation and Using improving the protection of data integrity, most common of which, it is most popular be exactly verification and method.
Traditional is generally divided into two classes for the verification of storage system and method:One kind is end-to-end verification, another kind of to be Disk verify and.And when generally using verifying and data being protected, it is exactly mistake when data are come in itself , then verify and can not detect such mistake.Each operate in a distributed system from upper-layer user or using journey All having time order when sequence issues, and the communication of the more concurrent characteristics and different nodes due to distributed system in itself is unstable, Such mistake includes timing error and causes the mistake covering of data and mistake to return, and current mechanism lacks effective means and comes Detect timing error.
The content of the invention
An embodiment of the present invention provides a kind of method for writing data and device, verification method and device, computer installation, Readable storage medium storing program for executing, for detecting timing error in data writing process, avoids timing error from causing corrupted data/loss, It can find that node is inconsistent to system in data read process at the same time
In view of this, first aspect present invention provides a kind of method for writing data, applied to distributed system, described point Cloth system includes N number of node, and the N is positive integer, it may include:
Receive the write request for the first data;
According to write request, determine to stab at the first time according to preset rules;
Detection at the first time stamp whether earlier than the second timestamp, the second timestamp M node writing position for for Write-in is stabbed at the first time, and M is the positive integer no more than N;
If, it is determined that generation timing sequence mistake;
If it is not, then by the second update of time stamp in M node to stab at the first time, by the second timestamp in M node Corresponding second data update is the first data, and first is verified and be updated to by the second timestamp in M node corresponding second Verification and, first verification and for utilize the first data generation.
Further, whether stamp includes earlier than the second timestamp at the first time for detection:
Detection at the first time stamp whether earlier than default region of memory the second timestamp;Or,
The second timestamp in M node is contrasted;
If the second timestamp all same, whether detection is stabbed earlier than the second timestamp at the first time.
Further, the second timestamp in M node corresponding second is being verified and is being updated to the first verification and it Before, method further includes:
If exist in default region of memory the second verification and, by the second verification and be updated to the first verification with.
Further, by the second update of time stamp in M node to stab at the first time, by the second time in M node It is the first data to stab corresponding second data update, by corresponding second verification of the second timestamp in M node and is updated to the One verification and including:
First data, first time stamp, first are verified and handled according to preset format, obtains the 3rd data;
Be the 3rd data by the 4th data update in M node, the 4th data be by the second timestamp, the second data, Second verifies and is handled to obtain according to preset format;Or,
By the first data, at the first time stamp, the first verification and handled according to two kinds in preset format, obtain the Five data;
It is the 5th data by the 6th data update in M node, by corresponding 7th number of the 6th data in M node According to being updated to corresponding 8th data of the 5th data, the 6th data be by the second timestamp, the second data, the second verification and in Two kinds handled to obtain according to preset format.
Second aspect of the present invention provides a kind of verification method, and applied to distributed system, distributed system includes N number of section Point, N are positive integer, it may include:
Receive the read requests for the first data;
The corresponding timestamp of the first data in M node is contrasted according to read requests, M is just whole no more than N's Number;
If at least two in timestamp are different, it is determined that at least one node in M node exists abnormal.
Further, method further includes:
If timestamp all same, using in M node destination node the first data generation first verification and;
By the first verification and the second verification corresponding with the first data in destination node and contrasted;
If first verification and with second verification and it is identical, it is determined that the first data are correct.
Further, using the first verification of the first data generation of destination node in M node with before, method is also wrapped Include:
Determine the data processing policy of distributed system;
The node for determining optimization from M node according to data processing policy is destination node.
Third aspect present invention provides a kind of data transfer apparatus, and applied to distributed system, distributed system includes N A node, N are positive integer, it may include:
Receiving unit, for receiving the write request for the first data;
First determination unit, for according to write request, determining to stab at the first time according to preset rules;
Detection unit, for detecting, whether stamp is earlier than the second timestamp at the first time, and the second timestamp is in M node Writing position is to be stabbed at the first time for writing, and M is the positive integer no more than N;
Second determination unit, for when first time, stamp was earlier than the second timestamp, it is determined that generation timing sequence mistake;
First updating block, for when first time stamp be no earlier than the second timestamp when, then by second in M node Corresponding second data update of second timestamp in M node is the first data, by M to stab at the first time by update of time stamp The second timestamp corresponding second verifies and is updated to the first verification in a node and first verifies and to utilize the first data Generation.
Further, detection unit, is specifically used for:
Detection at the first time stamp whether earlier than default region of memory the second timestamp;Or,
The second timestamp in M node is contrasted;
If the second timestamp all same, whether detection is stabbed earlier than the second timestamp at the first time.
Further, device further includes:
Second updating block, for when exist in default region of memory the second verification and when, then by the second verification and update For first verification and.
Further, the first updating block, is specifically used for:
First data, first time stamp, first are verified and handled according to preset format, obtains the 3rd data;
Be the 3rd data by the 4th data update in M node, the 4th data be by the second timestamp, the second data, Second verifies and is handled to obtain according to preset format;Or,
By the first data, at the first time stamp, the first verification and handled according to two kinds in preset format, obtain the Five data;
It is the 5th data by the 6th data update in M node, by corresponding 7th number of the 6th data in M node According to being updated to corresponding 8th data of the 5th data, the 6th data be by the second timestamp, the second data, the second verification and in Two kinds handled to obtain according to preset format.
Fourth aspect present invention provides a kind of verification device, and applied to distributed system, distributed system includes N number of section Point, N are positive integer, it may include:
Receiving unit, for receiving the read requests for the first data;
First comparison unit, for being carried out the corresponding timestamp of the first data in M node pair according to read requests Than M is not more than the positive integer of N;
First determination unit, for when at least two in timestamp are different, it is determined that at least one in M node A node exists abnormal.
Further, device further includes:
Generation unit, for when timestamp all same, then being generated using the first data of destination node in M node First verification and;
Second comparison unit, for by first verification and it is corresponding with the first data in destination node second verification and into Row contrast;
Second determination unit, for when first verifies and verify with second and is identical, it is determined that the first data are correct.
Further, device further includes:
3rd determination unit, for determining the data processing policy of distributed system;
4th determination unit, the node for determining to optimize from M node according to data processing policy is target section Point.
Fifth aspect present invention provides a kind of computer installation, and applied to distributed system, distributed system includes N number of Node, N are positive integer, and computer installation includes processor, and processor is used to perform the computer program stored in memory When, realize following steps:
Receive the write request for the first data;
According to write request, determine to stab at the first time according to preset rules;
Detection at the first time stamp whether earlier than the second timestamp, the second timestamp M node writing position for for Write-in is stabbed at the first time, and M is the positive integer no more than N;
If, it is determined that generation timing sequence mistake;
If it is not, then by the second update of time stamp in M node to stab at the first time, by the second timestamp in M node Corresponding second data update is the first data, and first is verified and be updated to by the second timestamp in M node corresponding second Verification and, first verification and for utilize the first data generation.
Sixth aspect present invention provides a kind of computer-readable recording medium, applied to distributed system, distributed system Including N number of node, N is positive integer, and computer program is stored with readable storage medium storing program for executing, and computer program is executed by processor When, realize following steps:
Receive the write request for the first data;
According to write request, determine to stab at the first time according to preset rules;
Detection at the first time stamp whether earlier than the second timestamp, the second timestamp M node writing position for for Write-in is stabbed at the first time, and M is the positive integer no more than N;
If, it is determined that generation timing sequence mistake;
If it is not, then by the second update of time stamp in M node to stab at the first time, by the second timestamp in M node Corresponding second data update is the first data, and first is verified and be updated to by the second timestamp in M node corresponding second Verification and, first verification and for utilize the first data generation.
Seventh aspect present invention provides a kind of computer installation, and applied to distributed system, distributed system includes N number of Node, N are positive integer, and computer installation includes processor, and processor is used to perform the computer program stored in memory When, realize following steps:
Receive the read requests for the first data;
The corresponding timestamp of the first data in M node is contrasted according to read requests, M is not more than N, and M is just whole Number;
If at least two in timestamp are different, it is determined that at least one node in M node exists abnormal.
Eighth aspect present invention provides a kind of computer-readable recording medium, applied to distributed system, distributed system Including N number of node, N is positive integer, and computer program is stored with readable storage medium storing program for executing, and computer program is executed by processor When, realize following steps:
Receive the read requests for the first data;
The corresponding timestamp of the first data in M node is contrasted according to read requests, M is not more than N, and M is just whole Number;
If at least two in timestamp are different, it is determined that at least one node in M node exists abnormal.
As can be seen from the above technical solutions, the embodiment of the present invention has the following advantages:
An embodiment of the present invention provides a kind of method for writing data, after the write request for the first data is received, It can determine to stab at the first time according to preset rules, and can detect and whether stab earlier than second at the first time according to write request Timestamp, wherein, the writing position of M node is to be stabbed at the first time for writing to the second timestamp in a distributed system, if Stamp can then determine generation timing sequence mistake, conversely, then can be by default region of memory earlier than the second timestamp at the first time The second update of time stamp be the first time stamp, and by the second update of time stamp in M node at the first time stamp, It is the first data by corresponding second data update of the second timestamp in M node, the second timestamp in M node is corresponded to Second verification and be updated to using the first data generation first verification and.It follows that every time in the M of distributed system , can be to avoid generation by verifying stamp at the first time and the second timestamp when relevant position in a node carries out data update The potential risk that such as error in data covering and mistake return caused by timing error.
Brief description of the drawings
Fig. 1 is method for writing data one embodiment schematic diagram in the embodiment of the present invention;
Fig. 2 is verification method one embodiment schematic diagram in the embodiment of the present invention;
Fig. 3 is another embodiment schematic diagram of verification method in the embodiment of the present invention;
Fig. 4 is data transfer apparatus one embodiment schematic diagram in the embodiment of the present invention;
Fig. 5 is another embodiment schematic diagram of data transfer apparatus in the embodiment of the present invention;
Fig. 6 is that device one embodiment schematic diagram is verified in the embodiment of the present invention;
Fig. 7 is that another embodiment schematic diagram of device is verified in the embodiment of the present invention;
Fig. 8 is that another embodiment schematic diagram of device is verified in the embodiment of the present invention.
Embodiment
An embodiment of the present invention provides a kind of method for writing data and device, verification method and device, computer installation, Readable storage medium storing program for executing, for detecting timing error in data writing process, avoids timing error from causing corrupted data/loss, The inconsistent situation of node can be found in data read process at the same time, prevents from causing more serious consequence to system.
In order to make those skilled in the art more fully understand the present invention program, below in conjunction with the embodiment of the present invention Attached drawing, the technical solution in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only It is the embodiment of a part of the invention, instead of all the embodiments.Based on the embodiments of the present invention, the common skill in this area Art personnel all other embodiments obtained without making creative work, should all belong to protection of the present invention Scope.
Term " first ", " second ", " the 3rd " in description and claims of this specification and above-mentioned attached drawing, " The (if present)s such as four " are for distinguishing similar object, without for describing specific order or precedence.Should Understand that the data so used can exchange in the appropriate case, so that the embodiments described herein can be with except herein Order beyond diagram or the content of description is implemented.In addition, term " comprising " and " having " and their any deformation, meaning Figure be to cover it is non-exclusive include, for example, containing the process of series of steps or unit, method, system, product or setting Standby those steps or the unit for being not necessarily limited to clearly list, but may include not list clearly or for these mistakes The intrinsic other steps of journey, method, product or equipment or unit.
For ease of understanding, the idiographic flow in the embodiment of the present invention is described below, referring to Fig. 1, the present invention is real Applying method for writing data one embodiment in example includes:
101st, the write request for the first data is received;
In the present embodiment, it is necessary to when being stored to the first data, the write request for the first data can be received.
102nd, according to write request, determine to stab at the first time according to preset rules;
, can be according to the write request, according to pre- after receiving the write request for the first data in the present embodiment If rule determines to stab at the first time.
It is understood that at the first time stamp definite method can have it is a variety of, for example, can with receive write-in please Time for asking, can also be to obtain time of the first data as stabbing at the first time as stabbing at the first time, can also be using the The time of one data generation the first verification sum as stabbing at the first time, can set corresponding preset rules according to being actually needed, To determine to stab at the first time, it is not specifically limited herein.
103rd, whether stamp is earlier than the second timestamp at the first time for detection, if so, step 104 is then performed, if it is not, then performing Step 105;
In the present embodiment, determine after stabbing at the first time, can detect and whether stab at the first time earlier than in default region of memory The second timestamp.Wherein, the second timestamp can be to be stabbed at the first time for writing in the writing position of M node, and M is Positive integer no more than N;
Specifically, the first data need to write in M node of distributed system, which includes N number of section Point, can include at least one disk in each node, wherein, N can be positive integer.When the first data need to write M During the location A of each in node, the first data can be replicated, obtain M the first data of part, each in M node Location A can write a first data.
In practical applications, the location A of each can be stored with corresponding second number of the second timestamp in M node According to then when the second data of the location A of each during the first data need to M node are updated, can detecting in advance First data corresponding first time stamp whether the second timestamp corresponding earlier than the second data, to avoid due to timing error The mistake covering and mistake for causing data return.Wherein, the second timestamp can be to receive the write-in for the second data Determined after request according to preset rules.
In the present embodiment, which can only be stored in the B location of each in M node, can also both exist The B location storage of each in M node, and stored in default region of memory, such as cache, then based on the second timestamp Storage mode, detection at the first time stamp whether earlier than the concrete mode of the second timestamp can be:
Detection at the first time stamp whether earlier than default region of memory the second timestamp;Or,
The second timestamp in M node is contrasted;
If the second timestamp all same, whether detection is stabbed earlier than the second timestamp at the first time.
, can be with after determining to stab at the first time specifically, when the second timestamp can be stored in default region of memory Corresponding second timestamp is read from default region of memory, without reading the second timestamp stored in M node, and First time stamp can be contrasted with the second timestamp, this advantageously reduces the reading times of the second timestamp and reduction System load.And when the second timestamp only stores in M node, then the second time that will can be stored in M node Stamp is read out, and can be contrasted M the second timestamps of part, can be by first if M part the second timestamp all sames Timestamp is contrasted with wherein any a second timestamp, conversely, M node in this explanation distributed system exists The problem of unstable or data that communicate are tampered, this not only contributes to find timing error, also helps while find distribution The inconsistent situation of system interior joint, avoids causing more serious consequence to system.
It is understood that in the present embodiment only with above-mentioned several examples illustrate detection at the first time stamp whether earlier than The concrete mode of second timestamp, in practical applications, can also use other manner, if can will at the first time stamp with Second timestamp is contrasted, and is not specifically limited herein.
104th, generation timing sequence mistake is determined;
In the present embodiment, if stamp can determine to occur due to distributed system earlier than the second timestamp at the first time More concurrent characteristic timing errors.
Further, after the error of definite sequential, reporting an error for timing error can be carried out, so that staff can be with Analyze the error reason of timing error.
105th, by the second update of time stamp in M node to stab at the first time, by the second timestamp pair in M node The second data update answered is the first data, by corresponding second verification of the second timestamp in M node and is updated to the first school Test and.
, can be by the second time in M node if stamp is no earlier than the second timestamp at the first time in the present embodiment Stamp is updated to stab at the first time, is the first data by corresponding second data update of the second timestamp in M node, by M section In point the second timestamp it is corresponding second verification and be updated to the first verification and.Wherein, first verify and to utilize the first data Generation.
Specifically, in M node, each node can be stored with a second timestamp, the second timestamp corresponds to The second data and the second timestamp it is corresponding second verification and, this second verification and for using the second data generate, then exist In the case of non-generation timing sequence mistake, can by stored in M node the second timestamp, the second data, second verification sum position Put be updated to respectively at the first time stamp, the first data, first verify and.
Wherein, when default region of memory is stored with the second timestamp, can also by default region of memory second when Between stamp be updated at the first time stab.In practical applications, using the second data generation second verification and after, can in advance by Second verifies and is stored in default region of memory, then by M node of the second verification and write-in, can be subtracted by such a mode The write-in number of few second verification sum, while the space hold of default region of memory can be controlled as much as possible.Thus, true After fixed first time stamp is no earlier than the second timestamp, second in default region of memory can also be verified and be updated to first Verification and.
Further, in the present embodiment, the second timestamp, the second data, the second verification and the storage in M node Form can be various, for example, the second timestamp, the second data, second verification and can individually be stored, can also carry out Combination storage, such as, it is assumed that the second timestamp be A, and the second data are B, and second verifies and be C, can be by the second timestamp, the Two data, second verify and are handled to obtain the 4th data of the forms such as ABC, BAC, CAB according to preset format, that When the 4th data are updated, the first data, first time stamp, first can also be verified and according to preset format Handled to obtain the 3rd data of same format, and can be the 3rd data by the 4th data update.Further, it is also possible to will Second timestamp, the second data, second verification and in two kinds handled to obtain the 6th data according to preset format, for example, By the second timestamp and the second verification and handled to obtain the 6th data of such as AC forms, then the second data B is the Corresponding 7th data of six data, then can verify with first by first time stamp and be handled to obtain the 5th data, and can Using by the 6th data update as the 7th data, can also be the 5th corresponding the by corresponding 7th data update of the 6th data Eight data, i.e., be the first data by the second data update, in practical applications, the second timestamp, the second data, the second verification It can as needed be configured with the storage form in M node, be not specifically limited herein.
, can be according to write request, according to pre- after the write request for the first data is received in the present embodiment If whether rule determines to stab at the first time, and can detect first time stamp earlier than the second timestamp, wherein, the second timestamp The writing position of M node is to be stabbed at the first time for writing in a distributed system, if stamp is earlier than the second time at the first time Stamp, then can determine generation timing sequence mistake, conversely, can be then first by the second update of time stamp in default region of memory Timestamp, and by the second update of time stamp in M node to stab at the first time, the second timestamp in M node is corresponding Second data update is the first data, by corresponding second verification of the second timestamp in M node and is updated to utilize the first number According to generation first verification and.It follows that the relevant position in M node of distributed system carries out data more every time , can be to avoid such as error in data caused by generation timing sequence mistake by verifying stamp at the first time and the second timestamp when new The potential risk that covering and mistake return.
Method for writing data is described above, after the data writing is finished, the data of write-in can be read into enforcement With, after data are read, relevant verification can be carried out to the data of write-in, to ensure the proper use of of correct data, below It is specifically described:
Referring to Fig. 2, verification method one embodiment includes in the embodiment of the present invention:
201st, the read requests for the first data are received;
, it is necessary to carry out the first data in use, the read requests for the first data can be received in the present embodiment.
202nd, the corresponding timestamp of the first data in M node is contrasted according to read requests;
, can be according to read requests by M node after receiving the read requests for the first data in the present embodiment The timestamp of first data is contrasted.
Specifically, the first data can be copied into M parts, M of distributed system can be written in per the first data of portion In node, which includes N number of node, can include at least one disk in each node, wherein, N can be Positive integer, and in each of M node, can be stored with the corresponding timestamp of the first data, the timestamp can be Determined after receiving the write request for the first data according to preset rules.
In practical applications, the inconsistent feelings of node are caused in order to avoid being tampered due to the data in part of nodes The timestamp stored in M node, can be read out by condition, and can be contrasted M parts of timestamps, if M parts of timestamps All same, then explanation is there is no the inconsistent situation of node, conversely, M node in this explanation distributed system has communication The problem of unstable or data are tampered, has that node is inconsistent, and more serious consequence may be caused to system.
The 203rd, if at least two in timestamp are different, it is determined that at least one node in M node exists abnormal;
In the present embodiment, however, it is determined that the corresponding timestamp of the first data at least two differences are stored in M node, then It is abnormal can to determine that at least one node in M node exists.
Further, i.e., can when at least one node has abnormal in M node when there is a situation where node is inconsistent To be prompted accordingly, so which node staff can investigate in the presence of abnormal, and can be with analysis node There are it is abnormal the reason for.
Further, in the present embodiment, if timestamp all same, then the inconsistent situation of node is implied the absence of, Other flows can be then performed, as returned to the first data in any of M node node, are not specifically limited herein.
Referring to Fig. 3, another embodiment of verification method includes in the embodiment of the present invention:
301st, the read requests for the first data are received;
302nd, the corresponding timestamp of the first data in M node is contrasted according to read requests;
The 303rd, if at least two in timestamp are different, it is determined that at least one node in M node exists abnormal;
Step 301 in the present embodiment is identical to step 203 with the step 201 in embodiment illustrated in fig. 2 to step 303, Details are not described herein again.
If the 304, timestamp all same, using in M node destination node the first data generation first verification and;
In the present embodiment, however, it is determined that the corresponding timestamp all same of the first data is stored in M node, then can utilize M In a node destination node the first data generation first verification and.
Specifically, when storing the corresponding timestamp all same of the first data in M node, can be from M node really A fixed destination node, and the first data stored in destination node can be read, utilize the first verification of the first data generation With.
Wherein, the concrete mode of definite destination node can be from M node:
Determine the data processing policy of distributed system;
The node for determining optimization from M node according to data processing policy is destination node.
In practical applications, distributed system can be equipped with corresponding data processing policy as needed, according to setting Data processing policy, it may be determined that the node state of each node in M node, so that by being carried out to M node pair Than the node that can therefrom determine to optimize is as destination node.
It is understood that the mode that destination node is determined in the present embodiment actually should except the content of described above In, other manner can also be used, as long as can determine satisfactory destination node, is not specifically limited herein.
305th, the first verification and corresponding with the first data in destination node second are verified and contrasted;
In the present embodiment, using in destination node the first data generation first verification and after, can by first verification and Corresponding with the first data in destination node second verifies and is contrasted.
Specifically, in each of M node, a first data are not only stored with, a the can also be stored with One data it is corresponding second verification and, it is possible thereby to by second verification and the first data are verified, with judge first count According to whether changing.
If the 306th, first verification and with second verification and it is identical, it is determined that the first data are correct;
In the present embodiment, if first verification and with second verification and it is identical, can determine in destination node first count According to correct.
Further, after determining that the first data in destination node are correct, first data can be returned.
If the 307th, first verify and verify and differ with second, it is determined that the first error in data.
In the present embodiment, if first verifies and verify and differ with second, the first error in data can be determined.
Further, after the first corrupt data is determined, reporting an error for the first data can be carried out, so that staff The error reason of the first data can be analyzed.
The method for writing data in the embodiment of the present invention, verification method are illustrated respectively above, below to this hair Data transfer apparatus, verification device in bright embodiment illustrate respectively:
Referring to Fig. 4, data transfer apparatus is applied to distributed system, distributed system includes N number of node, and N is just whole Count, data transfer apparatus one embodiment includes in the embodiment of the present invention:
Receiving unit 401, for receiving the write request for the first data;
First determination unit 402, for according to write request, determining to stab at the first time according to preset rules;
Detection unit 403, for detecting, whether stamp is earlier than the second timestamp at the first time, and the second timestamp is in M node Writing position be to be stabbed at the first time for writing, M is positive integer no more than N;
Second determination unit 404, for when first time, stamp was earlier than the second timestamp, it is determined that generation timing sequence mistake;
First updating block 405, for when first time, stamp was no earlier than the second timestamp, then by the in M node Corresponding second data update of second timestamp in M node is the first data to stab at the first time by two update of time stamp, Second timestamp in M node corresponding second is verified and be updated to the first verification and first verifies and to utilize the first number According to generation.
Optionally, in some embodiments of the invention, detection unit 403, can further be specifically used for:
Detection at the first time stamp whether earlier than default region of memory the second timestamp;Or,
The second timestamp in M node is contrasted;
If the second timestamp all same, whether detection is stabbed earlier than the second timestamp at the first time.
Optionally, in some embodiments of the invention, based on Fig. 4, as shown in figure 5, device can also be wrapped further Include:
Second updating block 406, for when exist in default region of memory the second verification and when, then by the second verification with Be updated to the first verification and.
Optionally, in some embodiments of the invention, the first updating block 405, can further be specifically used for:
First data, first time stamp, first are verified and handled according to preset format, obtains the 3rd data;
Be the 3rd data by the 4th data update in M node, the 4th data be by the second timestamp, the second data, Second verifies and is handled to obtain according to preset format;Or,
By the first data, at the first time stamp, the first verification and handled according to two kinds in preset format, obtain the Five data;
It is the 5th data by the 6th data update in M node, by corresponding 7th number of the 6th data in M node According to being updated to corresponding 8th data of the 5th data, the 6th data be by the second timestamp, the second data, the second verification and in Two kinds handled to obtain according to preset format.
Referring to Fig. 6, verification device is applied to distributed system, distributed system includes N number of node, and N is positive integer, Verify that device one embodiment includes in the embodiment of the present invention:
Receiving unit 601, for receiving the read requests for the first data;
First comparison unit 602, for being carried out the corresponding timestamp of the first data in M node according to read requests Contrast, M are not more than N, and M is positive integer;
First determination unit 603, for when at least two in timestamp are different, it is determined that in M node at least One node exists abnormal.
Optionally, in some embodiments of the invention, based on Fig. 6, as shown in fig. 7, device can also be wrapped further Include:
Generation unit 604, for when timestamp all same, then being given birth to using the first data of destination node in M node Into first verification and;
Second comparison unit 605, for by first verification and it is corresponding with the first data in destination node second verification and Contrasted;
Second determination unit 606, for when first verifies and verify with second and is identical, it is determined that the first data are just Really.
Optionally, in some embodiments of the invention, based on Fig. 7, as shown in figure 8, device can also be wrapped further Include:
3rd determination unit 607, for determining the data processing policy of distributed system;
4th determination unit 608, the node for determining to optimize from M node according to data processing policy is mesh Mark node.
Above the angle of slave module functional entity to the data transfer apparatus in the embodiment of the present invention, verification device into Description is gone, the computer installation in the embodiment of the present invention has been described from the angle of hardware handles below:
Based on method for writing data, which is applied to distributed system, and distributed system includes N node, N is positive integer, and Computer device one embodiment of the embodiment of the present invention includes:
Processor and memory;
Memory is used to store computer program, can when processor is used to perform the computer program stored in memory To realize following steps:
Receive the write request for the first data;
According to write request, determine to stab at the first time according to preset rules;
Detection at the first time stamp whether earlier than the second timestamp, the second timestamp M node writing position for use Stabbed at the first time in write-in, M is the positive integer no more than N;
If, it is determined that generation timing sequence mistake;
If it is not, then by the second update of time stamp in M node to stab at the first time, by the second timestamp in M node Corresponding second data update is the first data, and first is verified and be updated to by the second timestamp in M node corresponding second Verification and, first verification and for utilize the first data generation.
In some embodiments of the invention, when processor is used to perform the computer program stored in memory, may be used also To realize following steps:
Detection at the first time stamp whether earlier than default region of memory the second timestamp;Or,
The second timestamp in M node is contrasted;
If the second timestamp all same, whether detection is stabbed earlier than the second timestamp at the first time.
In some embodiments of the invention, when processor is used to perform the computer program stored in memory, may be used also To realize following steps:
If exist in default region of memory the second verification and, by the second verification and be updated to the first verification with.
In some embodiments of the invention, when processor is used to perform the computer program stored in memory, may be used also To realize following steps:
First data, first time stamp, first are verified and handled according to preset format, obtains the 3rd data;
Be the 3rd data by the 4th data update in M node, the 4th data be by the second timestamp, the second data, Second verifies and is handled to obtain according to preset format;Or,
By the first data, at the first time stamp, the first verification and handled according to two kinds in preset format, obtain the Five data;
It is the 5th data by the 6th data update in M node, by corresponding 7th number of the 6th data in M node According to being updated to corresponding 8th data of the 5th data, the 6th data be by the second timestamp, the second data, the second verification and in Two kinds handled to obtain according to preset format.
Based on verification method, which is applied to distributed system, and distributed system includes N number of node, and N is Positive integer, another embodiment of Computer device of the embodiment of the present invention include:
Processor and memory;
Memory is used to store computer program, can when processor is used to perform the computer program stored in memory To realize following steps:
Receive the read requests for the first data;
The corresponding timestamp of the first data in M node is contrasted according to read requests, M is just whole no more than N's Number;
If at least two in timestamp are different, it is determined that at least one node in M node exists abnormal.
In some embodiments of the invention, when processor is used to perform the computer program stored in memory, may be used also To realize following steps:
If timestamp all same, using in M node destination node the first data generation first verification and;
By the first verification and the second verification corresponding with the first data in destination node and contrasted;
If first verification and with second verification and it is identical, it is determined that the first data are correct.
In some embodiments of the invention, when processor is used to perform the computer program stored in memory, may be used also To realize following steps:
Determine the data processing policy of distributed system;
The node for determining optimization from M node according to data processing policy is destination node.
It is understood that when the processor in the computer installation of described above performs the computer program, also may be used To realize the function of each unit in above-mentioned corresponding each device embodiment, details are not described herein again.Exemplary, the computer Program can be divided into one or more module/units, and one or more of module/units are stored in described deposit In reservoir, and performed by the processor, to complete the present invention.One or more of module/units can be completed The series of computation machine programmed instruction section of specific function, the instruction segment are used to describe the computer program in such as described number According to the implementation procedure in writing station.For example, the computer program can be divided into it is each in above-mentioned data transfer apparatus Unit, each unit can realize the concrete function as described in above-mentioned corresponding data writing station.
The computer installation can be that the calculating such as desktop PC, notebook, palm PC and cloud server are set It is standby.The computer installation may include but be not limited only to processor, memory.It will be understood by those skilled in the art that processing Device, memory are only the example of computer installation, do not form the restriction to computer installation, can be including more or more Few component, either combines some components or different components, such as the computer installation can also be defeated including inputting Go out equipment, network access equipment, bus etc..
The processor can be central processing unit (Central Processing Unit, CPU), can also be it His general processor, digital signal processor (Digital Signal Processor, DSP), application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field- Programmable GateArray, FPGA) either other programmable logic device, discrete gate or transistor logic, Discrete hardware components etc..General processor can be microprocessor or the processor can also be any conventional processor Deng the processor is the control centre of the computer installation, utilizes various interfaces and the whole computer installation of connection Various pieces.
The memory can be used for storing the computer program and/or module, and the processor is by running or performing The computer program and/or module being stored in the memory, and the data being stored in memory are called, realize institute State the various functions of computer installation.The memory can mainly include storing program area and storage data field, wherein, storage Program area can storage program area, application program needed at least one function etc.;Storage data field can be stored according to terminal Use created data etc..In addition, memory can include high-speed random access memory, can also include non-volatile Memory, such as hard disk, memory, plug-in type hard disk, intelligent memory card (SmartMedia Card, SMC), secure digital (Secure Digital, SD) block, flash card (Flash Card), at least one disk memory, flush memory device or its His volatile solid-state part.
Based on method for writing data, present invention also offers a kind of computer-readable recording medium, this is computer-readable to deposit Storage media is applied to distributed system, and the distributed system includes N number of node, and the N is positive integer, this is computer-readable Computer program is stored with storage medium, when computer program is executed by processor, it is possible to achieve following steps:
Receive the write request for the first data;
According to write request, determine to stab at the first time according to preset rules;
Detection at the first time stamp whether earlier than the second timestamp, the second timestamp M node writing position for use Stabbed at the first time in write-in, M is the positive integer no more than N;
If, it is determined that generation timing sequence mistake;
If it is not, then by the second update of time stamp in M node to stab at the first time, by the second timestamp in M node Corresponding second data update is the first data, and first is verified and be updated to by the second timestamp in M node corresponding second Verification and, first verification and for utilize the first data generation.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is held by processor During row, following steps can also be realized:
Detection at the first time stamp whether earlier than default region of memory the second timestamp;Or,
The second timestamp in M node is contrasted;
If the second timestamp all same, whether detection is stabbed earlier than the second timestamp at the first time.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is held by processor During row, following steps can also be realized:
If exist in default region of memory the second verification and, by the second verification and be updated to the first verification with.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is held by processor During row, following steps can also be realized:
First data, first time stamp, first are verified and handled according to preset format, obtains the 3rd data;
Be the 3rd data by the 4th data update in M node, the 4th data be by the second timestamp, the second data, Second verifies and is handled to obtain according to preset format;Or,
By the first data, at the first time stamp, the first verification and handled according to two kinds in preset format, obtain the Five data;
It is the 5th data by the 6th data update in M node, by corresponding 7th number of the 6th data in M node According to being updated to corresponding 8th data of the 5th data, the 6th data be by the second timestamp, the second data, the second verification and in Two kinds handled to obtain according to preset format.
Based on verification method, present invention also offers a kind of computer-readable recording medium, the computer-readable storage medium Matter is applied to distributed system, and distributed system includes N number of node, and N is positive integer, is deposited on the computer-readable recording medium Computer program is contained, when computer program is executed by processor, it is possible to achieve following steps:
Receive the read requests for the first data;
The corresponding timestamp of the first data in M node is contrasted according to read requests, M is just whole no more than N's Number;
If at least two in timestamp are different, it is determined that at least one node in M node exists abnormal.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is held by processor During row, following steps can also be realized:
If timestamp all same, using in M node destination node the first data generation first verification and;
By the first verification and the second verification corresponding with the first data in destination node and contrasted;
If first verification and with second verification and it is identical, it is determined that the first data are correct.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is held by processor During row, following steps can also be realized:
Determine the data processing policy of distributed system;
The node for determining optimization from M node according to data processing policy is destination node.
If it is understood that the integrated unit is realized in the form of SFU software functional unit and as independent Production marketing in use, can be stored in a corresponding computer read/write memory medium.Based on such understanding, The present invention realizes all or part of flow in above-mentioned corresponding embodiment method, can also be instructed by computer program Relevant hardware is completed, and the computer program can be stored in a computer-readable recording medium, the computer program When being executed by processor, it can be achieved that the step of above-mentioned each embodiment of the method.Wherein, the computer program includes calculating Machine program code, the computer program code can be source code form, object identification code form, executable file or some Intermediate form etc..The computer-readable medium can include:Any entity of the computer program code can be carried Or device, recording medium, USB flash disk, mobile hard disk, magnetic disc, CD, computer storage, read-only storage (ROM, Read- OnlyMemory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and Software distribution medium etc..It should be noted that the content that the computer-readable medium includes can be according in jurisdiction Legislation and the requirement of patent practice carry out appropriate increase and decrease, such as in some jurisdictions, according to legislation and patent practice, Computer-readable medium does not include electric carrier signal and telecommunication signal.
It is apparent to those skilled in the art that for convenience and simplicity of description, foregoing description is The specific work process of system, device and unit, may be referred to the corresponding process in preceding method embodiment, details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method can be with Realize by another way.For example, device embodiment described above is only schematical, for example, the unit Division, is only a kind of division of logic function, can there is other dividing mode, such as multiple units or group when actually realizing Part can combine or be desirably integrated into another system, or some features can be ignored, or not perform.It is another, it is shown Or the mutual coupling, direct-coupling or communication connection discussed can be by some interfaces, between device or unit Coupling or communication connection are connect, can be electrical, machinery or other forms.
The unit illustrated as separating component may or may not be it is physically separate, as unit The component of display may or may not be physical location, you can with positioned at a place, or can also be distributed to more In a network unit.Some or all of unit therein can be selected to realize this embodiment scheme according to the actual needs Purpose.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can also That unit is individually physically present, can also two or more units integrate in a unit.
The above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations;Although reference The present invention is described in detail in previous embodiment, it will be understood by those of ordinary skill in the art that:It still can be right Technical solution described in foregoing embodiments is modified, or carries out equivalent substitution to which part technical characteristic;And this A little modifications are replaced, and the essence of appropriate technical solution is departed from the spirit and model of various embodiments of the present invention technical solution Enclose.

Claims (13)

1. a kind of method for writing data, applied to distributed system, the distributed system includes N number of node, and the N is just whole Number, it is characterised in that including:
Receive the write request for the first data;
Asked according to said write, determine to stab at the first time according to preset rules;
Detect first time stamp whether earlier than the second timestamp, second timestamp be in the writing position of M node For writing the first time stamp, the M is the positive integer no more than the N;
If, it is determined that generation timing sequence mistake;
If it is not, then second update of time stamp in the M node is stabbed for the first time, by the M node Described in corresponding second data update of the second timestamp be first data, by the second time described in the M node Stab it is corresponding second verification and be updated to the first verification and, it is described first verification and for using first data generate.
2. according to the method described in claim 1, it is characterized in that, when whether the detection first time stamp is earlier than second Between stab and include:
Detect first time stamp whether earlier than default region of memory second timestamp;Or,
Second timestamp in the M node is contrasted;
If the second timestamp all same, whether the first time stamp is detected earlier than the second timestamp.
3. according to the method described in claim 2, it is characterized in that, described by the second timestamp described in the M node Corresponding second verification and the first verification and before is updated to, the method further includes:
If verify there are described second in the default region of memory and verify and be updated to first school by described second Test and.
4. according to the method in any one of claims 1 to 3, it is characterised in that described by described in the M node Second update of time stamp stabs for the first time, by corresponding second data of the second timestamp described in the M node more It is newly first data, by corresponding second verification of the second timestamp described in the M node and is updated to the first verification With including:
First data, first time stamp, first are verified and handled according to preset format, obtains the 3rd number According to;
It is the 3rd data by the 4th data update in the M node, the 4th data are by second time Stamp, second data, described second verify and are handled to obtain according to the preset format;Or,
First data, first time stamp, first are verified and handled according to two kinds in preset format, is obtained 5th data;
It is the 5th data by the 6th data update in the M node, by the 6th data pair described in the M node The 7th data update answered is corresponding 8th data of the 5th data, the 6th data be by second timestamp, Second data, it is described second verification and in two kinds handled to obtain according to the preset format.
5. a kind of verification method, applied to distributed system, the distributed system includes N number of node, and the N is positive integer, It is characterised in that it includes:
Receive the read requests for the first data;
The corresponding timestamp of the first data described in M node are contrasted according to the read requests, the M is not more than institute State the positive integer of N;
If at least two in the timestamp are different, it is determined that at least one node in the M node exists abnormal.
6. according to the method described in claim 5, it is characterized in that, the method further includes:
If the timestamp all same, the first verification of first data generation of destination node in the M node is utilized With;
Described first is verified and corresponding with the first data described in the destination node second verifies and contrasted;
If it is described first verification and with described second verification and it is identical, it is determined that first data are correct.
It is 7. according to the method described in claim 6, it is characterized in that, described using described in destination node in the M node With before, the method further includes the first verification of first data generation:
Determine the data processing policy of the distributed system;
The node for determining optimization from the M node according to the data processing policy is destination node.
8. a kind of data transfer apparatus, applied to distributed system, the distributed system includes N number of node, and the N is just whole Number, it is characterised in that including:
Receiving unit, for receiving the write request for the first data;
First determination unit, for being asked according to said write, determines to stab at the first time according to preset rules;
Detection unit, for whether detecting the first time stamp earlier than the second timestamp, second timestamp is in M node Writing position be for writing first time stamp, the M is the positive integer no more than the N;
Second determination unit, for when stabbing earlier than second timestamp first time, it is determined that generation timing sequence mistake;
First updating block, for when the first time stamp be no earlier than second timestamp when, then by the M node Second update of time stamp be the first time stamp, by the second timestamp corresponding second described in the M node Data update is first data, by corresponding second verification of the second timestamp described in the M node and is updated to the One verification and, it is described first verification and for using first data generate.
9. one kind verification device, applied to distributed system, the distributed system includes N number of node, and the N is positive integer, It is characterised in that it includes:
Receiving unit, for receiving the read requests for the first data;
Comparison unit, for the corresponding timestamp of the first data described in M node to be contrasted according to the read requests, The M is not more than the N, and the M is positive integer;
First determination unit, for when at least two in the timestamp are different, it is determined that in the M node at least One node exists abnormal.
A kind of 10. computer installation, it is characterised in that:The computer installation includes processor, and the processor is used to perform Realized during the computer program stored in memory as described in any one in Claims 1-4 the step of method for writing data.
11. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that:The computer program Realized when being executed by processor as described in any one in Claims 1-4 the step of method for writing data.
A kind of 12. computer installation, it is characterised in that:The computer installation includes processor, and the processor is used to perform Realized during the computer program stored in memory as described in any one in claim 5 to 7 the step of verification method.
13. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that:The computer program Realized when being executed by processor as described in any one in claim 5 to 7 the step of verification method.
CN201711059996.3A 2017-11-01 2017-11-01 A kind of method for writing data and device, verification method and device Pending CN107944300A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711059996.3A CN107944300A (en) 2017-11-01 2017-11-01 A kind of method for writing data and device, verification method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711059996.3A CN107944300A (en) 2017-11-01 2017-11-01 A kind of method for writing data and device, verification method and device

Publications (1)

Publication Number Publication Date
CN107944300A true CN107944300A (en) 2018-04-20

Family

ID=61934085

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711059996.3A Pending CN107944300A (en) 2017-11-01 2017-11-01 A kind of method for writing data and device, verification method and device

Country Status (1)

Country Link
CN (1) CN107944300A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110955916A (en) * 2018-09-26 2020-04-03 深信服科技股份有限公司 Data integrity protection method, system and related equipment
CN115437577A (en) * 2022-11-04 2022-12-06 平安银行股份有限公司 Data writing method, computer device and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102801543A (en) * 2011-05-24 2012-11-28 ***股份有限公司 Method for dynamic data synchronization between active-active systems
US20140289234A1 (en) * 2008-03-14 2014-09-25 William J. Johnson System and Method for Location Based Exchanges of Data Facilitating Distributed Locational Applications
CN107219997A (en) * 2016-03-21 2017-09-29 阿里巴巴集团控股有限公司 A kind of method and device for being used to verify data consistency

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140289234A1 (en) * 2008-03-14 2014-09-25 William J. Johnson System and Method for Location Based Exchanges of Data Facilitating Distributed Locational Applications
CN102801543A (en) * 2011-05-24 2012-11-28 ***股份有限公司 Method for dynamic data synchronization between active-active systems
CN107219997A (en) * 2016-03-21 2017-09-29 阿里巴巴集团控股有限公司 A kind of method and device for being used to verify data consistency

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110955916A (en) * 2018-09-26 2020-04-03 深信服科技股份有限公司 Data integrity protection method, system and related equipment
CN110955916B (en) * 2018-09-26 2023-09-05 深信服科技股份有限公司 Data integrity protection method, system and related equipment
CN115437577A (en) * 2022-11-04 2022-12-06 平安银行股份有限公司 Data writing method, computer device and storage medium

Similar Documents

Publication Publication Date Title
CN110597925B (en) Cross-chain data processing method and device based on block chain
CN109474578A (en) Message method of calibration, device, computer equipment and storage medium
US20210049715A1 (en) Blockchain-based data procesing method, apparatus, and electronic device
CN112597153B (en) Block chain-based data storage method, device and storage medium
CN107404481B (en) User information recognition methods and device
CN109656873A (en) Data archiving method, device and terminal device based on block chain
CN107783857A (en) A kind of abnormal restorative procedure and device, computer installation, readable storage medium storing program for executing
CN108248612A (en) Management method, device and the terminal device of vehicle diagnosis information
CN105468302B (en) A kind of method, apparatus and system of processing data
CN108900353A (en) Fault alarming method and terminal device
CN109144548A (en) A kind of multicompartment software upgrade method, device and server realized based on git
CN107092491A (en) A kind of configuring load application method and system
CN107944300A (en) A kind of method for writing data and device, verification method and device
CN110209529A (en) The guard method of radio frequency parameter and electronic equipment
CN109462507A (en) Configure update method, device, system and electronic equipment
CN108600184A (en) A kind of equipment authentication method of embedded chip certificate
CN111338869A (en) Configuration parameter management method, device, equipment and storage medium
CN108763062A (en) Bury the filter method and terminal device of a title
CN110007946B (en) Method, device, equipment and medium for updating algorithm model
CN103595573B (en) Method and device for issuing strategy rules
CN106156173A (en) Cheating identification method and device and terminal
CN105430052B (en) A kind of referee method and device for group system
CN108038127A (en) A kind of method, apparatus, terminal device and the storage medium of data synchronization
CN108536773A (en) A kind of auto alarm information integrating method, device, equipment and medium
CN108038378A (en) High in the clouds detection function is by the method for malicious modification, terminal device and storage 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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20180420