CN109002462A - A kind of method and system for realizing distributed things - Google Patents
A kind of method and system for realizing distributed things Download PDFInfo
- Publication number
- CN109002462A CN109002462A CN201810564968.5A CN201810564968A CN109002462A CN 109002462 A CN109002462 A CN 109002462A CN 201810564968 A CN201810564968 A CN 201810564968A CN 109002462 A CN109002462 A CN 109002462A
- Authority
- CN
- China
- Prior art keywords
- chain
- things
- executing
- data
- execution
- 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.)
- Granted
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a kind of method and system for realizing distributed things, and this method comprises the following steps: when executing distributed things request, generating an execution chain for all operations；According to the sequence for executing chain, relevant sub-services are successively called, send related data, and wait to be feedback；After the feedback message for receiving sub-services, refresh the data-base recording for executing chain, if feedback message is success, execute the next step executed in chain, if feedback message is failed message, according to execution chain, reverse execution contrary operation.The present invention can alleviate the obstructing problem of participant's subsystem；Due to having recorded the failure situation of things in whole process, the modification of failure operation may be implemented, cancel, it is possible to the consistency of system be effectively ensured；The present invention combines reasonable record data and cluster disaster tolerance appropriate configuration, it is possible to prevente effectively from Single Point of Faliure problem, enhances the robustness of system.
Description
[technical field]
The invention belongs to technical field of information processing more particularly to a kind of method and system for realizing distributed things.
[background technique]
In traditional OLTP system regions, we can face the demand in terms of things consistency, example under many scenes
The case transferred accounts such as most classic Bob to Smith.Traditional enterprise development, system often exist in the form of monomer applications
, also not across multiple databases.And Large-Scale Interconnected net platform be often by a series of distributed systems all at, develop language
Technical station of making peace is also relatively complicated, and today especially prevailing in SOA and micro services framework, one seems simple function
Can, inside may need to call multiple " services " and operate multiple databases or fragment to realize, situation is often complicated very much.
These complicated scenes can not be coped with and be met to single technological means and solution.
Distributed system is mentioned, distributed things must be mentioned.Distributed things is exactly to run under distributed environment
Things, for distributed things, each operating procedure of things is the service run on different machines.How to protect
The consistency between system in card operation and different machines is exactly distributed things problem of interest.
Mention distributed things, it is easy to it is envisioned that 2PC and Two-phase commitment.Thing is participated in Two-phase commitment scheme
The node of object can be divided into two roles, and one is coordinator, usually the initiator of things, and one is the participation serviced
Person, and a side of service is provided.
Two-stage in the prior art submits (Two-phase-commit) to refer in computer network and database neck
In domain, in order to make based on all nodes under distributed system architecture the being consistent property when carrying out things submission and design one
Kind algorithm, as shown in Figs. 1-2.So-called two stages refer to: the first stage: preparation stage (ballot stage) and second stage:
Presentation stage (executes the stage)
Preparation stage: things coordinator (task manager) sends Prepare to each participant (resource manager) and disappears
Breath, each participant or direct return fail and (enter Authority Verification failure) or be performed locally things, the redo on handwritten copy ground
With undo log, but things is not submitted, leads the state of a kind of " finish and have, before east wind ".
Further the preparation stage can be divided into the following three steps:
(1) coordinator's node asks whether that submission operation (vote) can be executed to all participant's nodes, and starts
To a response for participating in node.
(2) participant executes all things operation until inquiry is initiated, and log is written in undo and redo information.
(3) inquiry that each participant's node response coordinator's node is initiated.If the things of participant's node operates practical
It executes into
Function, then he returns to system " agreement " message；If the things operation of participant's node is practical to execute failure, Zeta
Return to " termination " message.
Presentation stage: it if coordinator has received the failed message or time-out of participant, is sent directly to each participant
Rollback (Rollback) message；Otherwise, it sends and submits (Commit) message；Participant according to the instruction execution of coordinator submit or
Rolling back action discharges and locks resource used in all transaction processes.
Next the process of presentation stage is discussed respectively in two kinds of situation.
When coordinator from the response message that all participant's nodes obtain all be "Yes" when, as shown in Figure 1:
(1) coordinator's node issues the request of " being submitted to " to all participant's nodes.
(2) participant's node formally completes things operation, and discharges the resource occupied during entire things.
(3) participant's node sends " completion " message to coordinator's node
(4) after coordinator's node receives " completion " message that all participation combined joints are fed back, things is completed
If any participant's node returns to refuse information "No" in the first stage, such as Fig. 2 or coordinator's node are being ask
When asking that time-out can not obtain the response message of all nodes before:
(1) coordinator's node sends the request that " rollback " operates to all participant's nodes
(2) the undo information being written before participant's node utilizes executes rollback, and occupies during discharging entire things
System resource.
(3) participant's node sends " rollback completion " message to coordinator's node.
(4) after coordinator's node receives " rollback completion " message of all participant's node feeding backs, cancel things.
Regardless of final result, second stage can all terminate current things.
Two-phase commitment in the prior art has the disadvantage in that
(1) synchronous obstructing problem.In implementation procedure, all participation nodes are all things obstructive types.When participant occupies
When public resource, the application node that other third parties access public resource be will have in blocked state.
(2) Single Point of Faliure.Due to the importance of coordinator, once coordinator breaks down, under participant can block always
It goes.
(3) data are inconsistent.In the stage two, during coordinator sends commit request to participant, have occurred
Localized network failure, then will lead to only some participation group has received commit request, and another part coordinator does not have
Receive commit request.Then just there is the inconsistent phenomenon of data in whole system.
Therefore, following technical problem in the urgent need to address:
(1) execution chain is generated by carrying out topological sorting to the sequence of operations in distributed things, then according to execution
Chain sequentially executes, and occupancy to public resource in whole system can be effectively reduced, and alleviates synchronous obstructing problem.
(2) due to will be executed with reasonable data structure, chain is saved and each sub-services also protect execution information
It stores away, it can effectively influence of the avoidance system failure to whole system consistency.
(3) cooperation executes the data record of chain and sub-services execute record, along with cluster disaster tolerance, can be
When system nodes break down, rapid recovery nodes function avoids Single Point of Faliure problem.
[summary of the invention]
In order to solve the above problem in the prior art, the invention proposes a kind of method for realizing distributed things,
It is characterized in that, this method comprises the following steps:
1) when executing distributed things request, an execution chain is generated for all operations；
2) according to the sequence for executing chain, relevant sub-services are successively called, send related data, and wait to be feedback；
3) after the feedback message for receiving sub-services, refresh the data-base recording for executing chain, if feedback message is success,
The next step in chain is executed, step 2) is jumped to, if feedback message is failed message, according to chain is executed, is reversely held
Row contrary operation.
With the method for the invention it is preferred to, the execution chain is saved using data structure, the data structure includes closing
It is the database and/or non-relational database of type.
With the method for the invention it is preferred to, in the step 1), when executing distributed things request, first to request
All operations for including carry out topological sorting, and are one contrary operation of each operative configuration, ultimately generate one by all behaviour
Make the execution chain for meeting topological sorting formed.
With the method for the invention it is preferred to, sub-services record recalls information after receiving call request, and handle
Call request feeds back successfully/failure information after the completion of executing, and refreshes local call and record；
In the data structure comprising unique mark ID, item data, upstream and downstream operation mark, current operation node,
Node executes state and node executes nodal information；
By caching system, data structure is saved, is updated.
With the method for the invention it is preferred to, in the step 3), during executing contrary operation, if certain is grasped
Work fails, then shows that this things executes failure, and refreshes the data-base recording record for executing chain, is designated as things mistake
It loses.
In order to solve the above problem in the prior art, the invention proposes a kind of system for realizing distributed things,
It is characterized in that, which includes:
Chain generation module is executed, when executing distributed things request, generates an execution chain for all operations；
Service calling module successively calls relevant sub-services according to the sequence for executing chain, sends related data, and wait
It is to be feedback；
Feedback reception processing module after the feedback message for receiving sub-services, refreshes the data-base recording for executing chain, if instead
Presenting message is success, then executes the next step executed in chain, if feedback message is failed message, according to chain is executed, reversely
Execute contrary operation.
The system according to the present invention, it is preferred that the execution chain is saved using data structure, the data structure includes closing
It is the database and/or non-relational database of type.
The system according to the present invention, it is preferred that the execution chain generation module, when executing distributed things request, first
To request include all operations carry out topological sorting, and be one contrary operation of each operative configuration, ultimately generate one by
The execution chain for meeting topological sorting of all operation compositions.
The system according to the present invention, it is preferred that include unique mark ID, item data, up and down in the data structure
It swims operation mark, current operation node, node and executes state and node execution nodal information；
By caching system, data structure is saved, is updated.
The system according to the present invention, it is preferred that further include things mark module, during executing contrary operation, such as
Fruit operation fails, then shows that this things executes failure, and refreshes the data-base recording record for executing chain, is designated as
Things failure.
The beneficial effect comprise that the obstructing problem of participant's subsystem can be alleviated；Due to remembering in whole process
The modification of failure operation may be implemented in the failure situation for having recorded things, revocation, it is possible to the consistency of system be effectively ensured；
The present invention combines reasonable record data and cluster disaster tolerance appropriate configuration, it is possible to prevente effectively from Single Point of Faliure problem, enhancing
The robustness of system.
[Detailed description of the invention]
Described herein the drawings are intended to provide a further understanding of the invention, constitutes a part of the invention, but
It does not constitute improper limitations of the present invention, in the accompanying drawings:
Fig. 1 is the successful schematic diagram submitted the two-stage in the prior art.
Fig. 2 is the failure schematic diagram submitted the two-stage in the prior art.
Fig. 3 is execution chain schematic diagram of the invention.
Fig. 4 is the execution method flow diagram using the present invention program.
[specific embodiment]
Come that the present invention will be described in detail below in conjunction with attached drawing and specific embodiment, illustrative examples therein and says
It is bright to be only used to explain the present invention but not as a limitation of the invention.
Affairs: affairs refer to sequence of operations or all execute or do not execute fully.Issued transaction may insure
Except all operations in non-transactional unit all successfully complete, the resource of data-oriented otherwise will not be permanently updated.By by one
The relevant operative combination of group is either all a success or all unit unsuccessfully, can simplify Fault recovery and makes to apply
Program is relatively reliable.
ACID: the abbreviation for four fundamentals that database things correctly executes is referred to.Atomicity (Atomicity):
Sequence of operations or all success or all failure in entire things, will not rest on certain intermediate state；Consistency
(Consistency): the operation of things has no effect on the consistency of data in database, such as a+b=10, if a changes,
So b also changes therewith.Isolation (Isolation): more than two things are not in the state staggeredly executed, because this
It is inconsistent that sample may result in data.Persistence (Durability): after the persistence of things refers to that things runs succeeded, the thing
Object to the change of database will be lasting preservation in the database, will not unprovoked rollback.
CAP principle: CAP principle is also known as CAP theorem, is worth being in a distributed system, Consistency is (consistent
Property), Availability (availability), Partition tolerance (subregion fault-tolerance), three can not get both.
Consistency (consistency): under distributed environment, consistency is worth being the characteristic being consistent between multiple copy datas,
All data movements are all synchronous；Availability (availability): it refers to that distributed system will can be used always, has
Responsiveness, return the result within the limited time；Partition tolerance (subregion fault-tolerance): distributed system exists
When encountering the failure of any network partition, still want externally provide the service for meeting consistency and availability, it is only whole
Failure all has occurred in a network environment.
BASE is theoretical, and: BASE is Basically Available (basically available), Soft state (soft state) and
The abbreviation of Eventually consistent (final consistency) three phrases.BASE theory be to consistency in CAP principle,
Availability tradeoff as a result, device derives from summary practice to large-scale internet distribution, be to be based on CAP theorem gradually to develop
And come, core concept is: can not accomplish strong consistency in time, but each application can be adopted according to own service feature
System is set to reach final consistency with mode appropriate.It is basically available: to refer to that unpredictable failure is occurring in distributed system
When, allow to lose part availability, rather than system is unavailable.Soft state: the data in value permission system exist intermediate
State, the data carried out between the data copy of different nodes are synchronous there may be delay, and the entirety without will affect system can
The property used.Final consistency: though some data copies after synchronization after a period of time, be finally attained by one it is consistent
State.
Topological sorting: topological row is carried out to a directed acyclic graph (Directed Acyclic Graph abbreviation DAG) G
Sequence is that a linear order is lined up on vertex all in G, so that any pair of vertex u and v in figure, if side (u, v) belongs to E
(G), then before u appears in v in linear order.In general, such linear order, which becomes, meets topological order
The sequence of (Topological Order), abbreviation topological sequences.
Distributed things often relates to multiple operations, and these operations need to execute on different network nodes, and
There is dependences between these operations.Still these operations can be ranked up in a manner of topological sorting, thus
One for obtaining these operations meets the sequence of topological order, and is one contrary operation of each operational design.We can be with
This sequence is referred to as to execute chain.
It transmits this for saving for the well-designed data structure of this execution chain and executes chain.This data structure
In comprising unique mark ID, item data, upstream and downstream operation mark, current operation node, node executes state and node
Execute nodal information etc. volume of data.By efficient caching system, this data structure is saved, is updated.This
In efficient caching system refer to the memory databases of some non-relationals, such as Redis, by its distribution subscription function,
The corresponding theme of each service, and the message of oneself theme is only consumed, but each service can issue other themes
Message.
Then each sub-services are called step by step according to the sequence for executing chain.Sub-services are after receiving call request, note
Recalls information is recorded, and handles request, feeds back successfully failure information after the completion of executing, and refreshes local calling record.Here sheet
Ground calls record to refer to starting to process the recalls information recorded when request, is a calling log of a local.Called side
It after being connected to feedback information, if it is success, then continues to execute in next step, is finished until executing chain, if it is failure, then
Reverse calling contrary operation, if fruit fails during calling contrary operation, directly by this things labeled as failure.
Wherein, executing each step in chain is exactly an operation, and this operation is completed by specific ISP.
System executes process
It 1. first carrying out topological sorting to all operations that request includes when executing distributed things, and is each operation
A contrary operation is configured, one is ultimately generated and operates the execution chain for meeting topological sorting formed by all.
2. designing reasonable data structure to execute chain, saved, it here can be by the database of relationship type
It can also be by the non-relational database and high-efficiency cache system of NOSQL type.
3. successively calling relevant sub-services according to the sequence for executing chain, related data is sent, and wait feedback.Here
Related data refer to item data, the unique identification comprising things, business datum and upstream and downstream nodal information.
4. sub-services are upon receiving a request, calling record is first done, request is then executed.If it succeeds, to caller
Feedback is called successfully, if it fails, then feeding back malloc failure malloc message to caller, and is updated local call and is recorded, executes rollback.
5. caller after receiving the feedback message of sub-services, refreshes the data-base recording for executing chain, if it is success, then
Then the next step in chain is executed, if it is failed message, then according to execution chain, reverse execution contrary operation.
6., if certain operation fails, directly showing that this things executes mistake during executing contrary operation
It loses, and refreshes the data-base recording record for executing chain, be designated as failure.
Primary system calling is broken down into an execution chain, includes the operation in multiple services.If that step is lost
It loses, then retracts according to the contrary operation executed in chain, also fail if retracted, directly termination rollback operation, record day
Will.
7. for failure things, then need system either automatically or manually handle.
In addition, the invention also discloses a kind of system for realizing distributed things, which includes:
Chain generation module is executed, when executing distributed things request, generates an execution chain for all operations；
Service calling module successively calls relevant sub-services according to the sequence for executing chain, sends related data, and wait
It is to be feedback；
Feedback reception processing module after the feedback message for receiving sub-services, refreshes the data-base recording for executing chain, if instead
Presenting message is success, then executes the next step executed in chain, if feedback message is failed message, according to chain is executed, reversely
Execute contrary operation.
The execution chain is saved using data structure, the data structure include relationship type database and/or non-relationship
Type database.
The execution chain generation module first carries out all operations that request includes when executing distributed things request
Topological sorting, and be one contrary operation of each operative configuration, it ultimately generates one and is arranged by all satisfaction topologys formed that operate
The execution chain of sequence.
In the data structure comprising unique mark ID, item data, upstream and downstream operation mark, current operation node,
Node executes state and node executes nodal information；
By caching system, data structure is saved, is updated.
The system further includes things mark module, during executing contrary operation, if certain operation fails,
Show that this things executes failure, and refresh the data-base recording record for executing chain, is designated as things failure.
It is needed in the present invention program reasonably using caching, ingenious meticulous design message structure, in conjunction with reasonable process
It calculates, the obstructing problem that can alleviate participant's subsystem in the execution of distributed things can be made.
Technology maturation involved in the present invention program is easy to develop, and implements.
Due to having recorded the failure situation of things in whole process, the modification of failure operation may be implemented, cancel, so can
The consistency of system is effectively ensured.
The present invention program combines reasonable record data and cluster disaster tolerance appropriate configuration, it is possible to prevente effectively from single-point
Failure problems enhance the robustness of system.
All the embodiments in this specification are described in a progressive manner, the highlights of each of the examples are with
The difference of other embodiments, the same or similar parts between the embodiments can be referred to each other.
It should be understood by those skilled in the art that, the embodiment of the embodiment of the present invention can provide as method, system or calculate
Machine program product.Therefore, the embodiment of the present invention can be used complete hardware embodiment, complete software embodiment or combine software and
The form of the embodiment of hardware aspect.Moreover, the embodiment of the present invention can be used one or more wherein include computer can
With in the computer-usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) of program code
The form of the computer program product of implementation.
The embodiment of the present invention be referring to according to the method for the embodiment of the present invention, terminal device (system) and computer program
The flowchart and/or the block diagram of product describes.It should be understood that flowchart and/or the block diagram can be realized by computer program instructions
In each flow and/or block and flowchart and/or the block diagram in process and/or box combination.It can provide these
Computer program instructions send terminal to general purpose computer, special purpose computer, embedded transmitter or other programmable datas and set
Standby transmitter is to generate a machine, so that being held by the transmitter that computer or other programmable datas send terminal device
Capable instruction generates for realizing in one or more flows of the flowchart and/or one or more blocks of the block diagram
The system of specified function.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable datas transmission terminal device
In computer-readable memory operate in a specific manner, so that instruction stored in the computer readable memory generates packet
The manufacture of instruction system is included, which realizes in one side of one or more flows of the flowchart and/or block diagram
The function of being specified in frame or multiple boxes.
These computer program instructions can also be loaded into computer or other programmable datas are sent on terminal device, so that
Series of operation steps are executed on computer or other programmable terminal equipments to generate computer implemented transmission, thus
The instruction executed on computer or other programmable terminal equipments is provided for realizing in one or more flows of the flowchart
And/or in one or more blocks of the block diagram specify function the step of.
Although the preferred embodiment of the embodiment of the present invention has been described, once a person skilled in the art knows bases
This creative concept, then additional changes and modifications can be made to these embodiments.So the following claims are intended to be interpreted as
Including preferred embodiment and fall into all change and modification of range of embodiment of the invention.
Finally, it is to be noted that, herein, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that process, method, article or terminal device including a series of elements not only wrap
Those elements are included, but also including other elements that are not explicitly listed, or further includes for this process, method, article
Or the element that terminal device is intrinsic.In the absence of more restrictions, being wanted by what sentence "including a ..." limited
Element, it is not excluded that there is also other identical elements in process, method, article or the terminal device for including the element.
Above to a kind of method and system for realizing distributed things provided by the present invention, it is described in detail, this
Apply that a specific example illustrates the principle and implementation of the invention in text, the explanation of above example is only intended to
It facilitates the understanding of the method and its core concept of the invention；At the same time, for those skilled in the art, think of according to the present invention
Think, there will be changes in the specific implementation manner and application range, in conclusion the content of the present specification should not be construed as pair
Limitation of the invention.
Claims (11)
1. a kind of method for realizing distributed things, which is characterized in that this method comprises the following steps:
1) when executing distributed things request, an execution chain is generated for all operations；
2) according to the sequence for executing chain, relevant sub-services are successively called, send related data, and wait to be feedback；
3) after the feedback message for receiving sub-services, the data-base recording for refreshing execution chain executes if feedback message is success
The next step in chain is executed, step 2) is jumped to, if feedback message is failed message, according to chain is executed, reverse execution is inverse
To operation.
2. the method according to claim 1, wherein saving the execution chain, the data using data structure
Structure includes the database and/or non-relational database of relationship type.
3. the method according to claim 1, wherein in the step 1), when executing distributed things request,
Topological sorting first is carried out to all operations that request includes, and is one contrary operation of each operative configuration, ultimately generates one
The execution chain for meeting topological sorting formed is operated by all.
4. according to the method described in claim 2, record calls letter it is characterized in that, sub-services are after receiving call request
Breath, and call request is handled, successfully/failure information is fed back after the completion of executing, and refresh local calling record；
Include unique mark ID, item data, upstream and downstream operation mark, current operation node, node in the data structure
Execution state and node execute nodal information；
By caching system, data structure is saved, is updated.
5. the method according to claim 1, wherein in the step 3), during executing contrary operation,
If certain operation fails, show that this things executes failure, and refresh the data-base recording record for executing chain, is marked
Fail for things, and is either automatically or manually handled.
6. a kind of system for realizing distributed things, which is characterized in that the system includes:
Chain generation module is executed, when executing distributed things request, generates an execution chain for all operations；
Service calling module successively calls relevant sub-services according to the sequence for executing chain, sends related data, and waits anti-
Feedback；
Feedback reception processing module after the feedback message for receiving sub-services, refreshes the data-base recording for executing chain, if feedback disappears
Breath is success, then executes the next step executed in chain, if feedback message is failed message, according to execution chain, reverse execution
Contrary operation.
7. system according to claim 6, which is characterized in that save the execution chain, the data using data structure
Structure includes the database and/or non-relational database of relationship type.
8. system according to claim 6, which is characterized in that the execution chain generation module is executing distributed things
When request, topological sorting first is carried out to all operations that request includes, and is one contrary operation of each operative configuration, most throughout one's life
The execution chain for meeting topological sorting formed is operated by all at one.
9. system according to claim 7, which is characterized in that include unique mark ID, things in the data structure
Data, upstream and downstream operation mark, current operation node, node execute state and node executes nodal information；
By caching system, data structure is saved, is updated.
10. system according to claim 6, which is characterized in that further include things mark module, executing contrary operation
In the process, if certain operation fails, show that this things executes failure, and refresh the data-base recording note for executing chain
Record is designated as things failure, and is either automatically or manually handled.
11. a kind of computer readable storage medium is stored with a plurality of computer program instructions, by executing the computer program
The method as described in one of claim 1-5 is realized in instruction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810564968.5A CN109002462B (en) | 2018-06-04 | 2018-06-04 | Method and system for realizing distributed transaction |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810564968.5A CN109002462B (en) | 2018-06-04 | 2018-06-04 | Method and system for realizing distributed transaction |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109002462A true CN109002462A (en) | 2018-12-14 |
| CN109002462B CN109002462B (en) | 2020-11-27 |
Family
ID=64572890
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810564968.5A Active CN109002462B (en) | 2018-06-04 | 2018-06-04 | Method and system for realizing distributed transaction |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109002462B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109799981A (en) * | 2018-12-19 | 2019-05-24 | 成都多用科技有限公司 | A kind of integrated system and method based on execution chain |
| CN109819023A (en) * | 2018-12-29 | 2019-05-28 | 杭州励飞软件技术有限公司 | Distributed transaction processing method and Related product |
| CN110413447A (en) * | 2019-06-27 | 2019-11-05 | 苏州浪潮智能科技有限公司 | A kind of big data cluster resetting method and system |
| CN111277639A (en) * | 2020-01-16 | 2020-06-12 | 中国建设银行股份有限公司 | Method and device for maintaining data consistency |
| WO2020207310A1 (en) * | 2019-04-12 | 2020-10-15 | 阿里巴巴集团控股有限公司 | Defect detection/processing method and device |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080235245A1 (en) * | 2005-12-19 | 2008-09-25 | International Business Machines Corporation | Commitment of transactions in a distributed system |
| US20100250899A1 (en) * | 2009-03-24 | 2010-09-30 | Olympus Corporation | Distributed processing system |
| US20120179645A1 (en) * | 2011-01-07 | 2012-07-12 | Microsoft Corporation | Transaction support for distributed data |
| CN103345502A (en) * | 2013-07-01 | 2013-10-09 | 曙光信息产业(北京)有限公司 | Transaction processing method and system of distributed type database |
| CN103514028A (en) * | 2012-06-14 | 2014-01-15 | 北京新媒传信科技有限公司 | Method and device for processing distributed transactions |
| CN103577588A (en) * | 2013-11-12 | 2014-02-12 | 西安雷迪维护系统设备有限公司 | Implement method for distributed transactions in cloud data base |
| CN104216955A (en) * | 2014-08-20 | 2014-12-17 | 百度在线网络技术（北京）有限公司 | Methods and devices for operating data and managing events and distributed system |
| CN104424018A (en) * | 2013-08-23 | 2015-03-18 | 阿里巴巴集团控股有限公司 | Distributed calculating transaction processing method and device |
| CN104793988A (en) * | 2014-01-20 | 2015-07-22 | 阿里巴巴集团控股有限公司 | Cross-database distributed transaction implementation method and device |
| CN104866403A (en) * | 2015-05-13 | 2015-08-26 | 上海钢富电子商务有限公司 | Distributed task processing system and method |
| US20150261563A1 (en) * | 2014-03-17 | 2015-09-17 | International Business Machines Corporation | Passive two-phase commit system for high-performance distributed transaction execution |
| CN105721337A (en) * | 2014-12-04 | 2016-06-29 | 中国移动通信集团公司 | Distributed transaction processing method and device in software definition network |
| CN106503132A (en) * | 2016-10-19 | 2017-03-15 | 广州快塑电子商务有限公司 | A kind of distributed transaction management method and system |
| CN106557514A (en) * | 2015-09-29 | 2017-04-05 | 中兴通讯股份有限公司 | A kind of distributed transaction rollback method and device |
| CN106775959A (en) * | 2016-12-06 | 2017-05-31 | 上海亿账通互联网科技有限公司 | Distributed transaction processing method and system |
-
2018
- 2018-06-04 CN CN201810564968.5A patent/CN109002462B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080235245A1 (en) * | 2005-12-19 | 2008-09-25 | International Business Machines Corporation | Commitment of transactions in a distributed system |
| US20100250899A1 (en) * | 2009-03-24 | 2010-09-30 | Olympus Corporation | Distributed processing system |
| US20120179645A1 (en) * | 2011-01-07 | 2012-07-12 | Microsoft Corporation | Transaction support for distributed data |
| CN103514028A (en) * | 2012-06-14 | 2014-01-15 | 北京新媒传信科技有限公司 | Method and device for processing distributed transactions |
| CN103345502A (en) * | 2013-07-01 | 2013-10-09 | 曙光信息产业(北京)有限公司 | Transaction processing method and system of distributed type database |
| CN104424018A (en) * | 2013-08-23 | 2015-03-18 | 阿里巴巴集团控股有限公司 | Distributed calculating transaction processing method and device |
| CN103577588A (en) * | 2013-11-12 | 2014-02-12 | 西安雷迪维护系统设备有限公司 | Implement method for distributed transactions in cloud data base |
| CN104793988A (en) * | 2014-01-20 | 2015-07-22 | 阿里巴巴集团控股有限公司 | Cross-database distributed transaction implementation method and device |
| US20150261563A1 (en) * | 2014-03-17 | 2015-09-17 | International Business Machines Corporation | Passive two-phase commit system for high-performance distributed transaction execution |
| CN104216955A (en) * | 2014-08-20 | 2014-12-17 | 百度在线网络技术（北京）有限公司 | Methods and devices for operating data and managing events and distributed system |
| CN105721337A (en) * | 2014-12-04 | 2016-06-29 | 中国移动通信集团公司 | Distributed transaction processing method and device in software definition network |
| CN104866403A (en) * | 2015-05-13 | 2015-08-26 | 上海钢富电子商务有限公司 | Distributed task processing system and method |
| CN106557514A (en) * | 2015-09-29 | 2017-04-05 | 中兴通讯股份有限公司 | A kind of distributed transaction rollback method and device |
| CN106503132A (en) * | 2016-10-19 | 2017-03-15 | 广州快塑电子商务有限公司 | A kind of distributed transaction management method and system |
| CN106775959A (en) * | 2016-12-06 | 2017-05-31 | 上海亿账通互联网科技有限公司 | Distributed transaction processing method and system |
Non-Patent Citations (2)
| Title |
|---|
| BRUNO SADEG ETC: "A causal-phase protocol to order soft real-time transactions in a distributed database", 《PROCEEDINGS LCN 2001. 26TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS》 * |
| 王成良: "基于JMS的分布式事务处理系统的研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109799981A (en) * | 2018-12-19 | 2019-05-24 | 成都多用科技有限公司 | A kind of integrated system and method based on execution chain |
| CN109819023A (en) * | 2018-12-29 | 2019-05-28 | 杭州励飞软件技术有限公司 | Distributed transaction processing method and Related product |
| CN109819023B (en) * | 2018-12-29 | 2021-09-14 | 杭州励飞软件技术有限公司 | Distributed transaction processing method and related product |
| WO2020207310A1 (en) * | 2019-04-12 | 2020-10-15 | 阿里巴巴集团控股有限公司 | Defect detection/processing method and device |
| CN110413447A (en) * | 2019-06-27 | 2019-11-05 | 苏州浪潮智能科技有限公司 | A kind of big data cluster resetting method and system |
| CN111277639A (en) * | 2020-01-16 | 2020-06-12 | 中国建设银行股份有限公司 | Method and device for maintaining data consistency |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109002462B (en) | 2020-11-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109002462A (en) | A kind of method and system for realizing distributed things | |
| CN109739935B (en) | Data reading method and device, electronic equipment and storage medium | |
| WO2018103318A1 (en) | Distributed transaction handling method and system | |
| CN103116596B (en) | System and method of performing snapshot isolation in distributed databases | |
| WO2016180164A1 (en) | Method and apparatus for rolling back distributed transaction | |
| US7631016B2 (en) | Providing the latest version of a data item from an N-replica set | |
| CN104216955B (en) | A kind of operation data and the method, apparatus and distributed system for managing affairs | |
| CN102103642B (en) | Data-erasure method based on OLTP, system and graphic data base server | |
| CN105574187B (en) | A kind of Heterogeneous Database Replication transaction consistency support method and system | |
| CN110032428B (en) | Method and device for executing distributed transaction | |
| CN106445644A (en) | Distributed transaction processing method and device based on improved one-phase commit | |
| CN106547643B (en) | Recovery method and device of abnormal data | |
| CN106503257B (en) | Distributed transaction server method and system based on binlog compensation mechanism | |
| CN103092903A (en) | Database Log Parallelization | |
| CA2375376A1 (en) | Collision avoidance in bidirectional database replication | |
| CN106570027B (en) | Transactional task processing method and device | |
| CN103995691B (en) | Service state consistency maintenance method based on transactions | |
| CN108845866B (en) | Method and apparatus for processing distributed transactions | |
| CN110413687B (en) | Distributed transaction fault processing method and related equipment based on node interaction verification | |
| US20200226011A1 (en) | Policy-based distributed transactional processing in a distributed system | |
| CN103019826B (en) | A kind of method and apparatus of issued transaction | |
| Chan et al. | Reliableweb services: Methodology, experiment and modeling | |
| CN112925614A (en) | Distributed transaction processing method, device, medium and equipment | |
| CN109783578A (en) | Method for reading data, device, electronic equipment and storage medium | |
| CN110427427B (en) | Method for realizing global transaction distributed processing through pin bridging |
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 |