CN112732414A - Distributed transaction processing method, system and related components in OLTP mode - Google Patents
Distributed transaction processing method, system and related components in OLTP mode Download PDFInfo
- Publication number
- CN112732414A CN112732414A CN202011600837.1A CN202011600837A CN112732414A CN 112732414 A CN112732414 A CN 112732414A CN 202011600837 A CN202011600837 A CN 202011600837A CN 112732414 A CN112732414 A CN 112732414A
- Authority
- CN
- China
- Prior art keywords
- node
- transaction
- logic center
- center node
- logic
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 25
- 238000012545 processing Methods 0.000 claims abstract description 38
- 238000000034 method Methods 0.000 claims description 29
- 238000012986 modification Methods 0.000 claims description 22
- 230000004048 modification Effects 0.000 claims description 22
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000005192 partition Methods 0.000 abstract description 5
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/466—Transaction processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Abstract
The application discloses a distributed transaction processing method in an OLTP mode, partial number of node ack information is selected and obtained by a logic center node to serve as feedback to carry out the next action, when the feedback ack information exceeding a first preset number is received, an operation instruction starts to be pushed, and when the completion ack information exceeding a second preset number is received, the completion of a transaction is judged, the transaction processing flow improves the availability and partition fault tolerance of each node, and the transaction processing efficiency of a graph database in the OLTP mode is improved. Correspondingly, the application also discloses a distributed transaction processing system and device in the OLTP mode and a readable storage medium.
Description
Technical Field
The present invention relates to the field of graph databases, and in particular, to a distributed transaction processing method, system and related components in an OLTP mode.
Background
Currently, distributed graph databases On the market are various, but the support for the OLTP (On-Line Transaction Processing) mode is different. The method uses more open source graph databases, the supported OLTP mode only has a scheme of processing a single node, and the supporting scheme of distributed transaction related processing of the OLTP mode does not appear in the prior art.
Therefore, how to provide a solution to the above technical problems is a problem to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, the present invention provides a method, a system and related components for distributed transaction processing in OLTP mode. The specific scheme is as follows:
a distributed transaction processing method in OLTP mode comprises the following steps:
taking a node receiving a customer operation request as a source node, and sending a transaction ID request to a logic center node through the source node so as to enable the logic center node to return a transaction ID distributed according to the increasing sequence of global variables;
when the source node receives the transaction ID, sending a modified information log corresponding to the client operation request to the logic center node through the source node, and pushing the modified information log to all the nodes through the logic center node;
when any node receives the modification log information, sending feedback ack information corresponding to the modification information log to the logic center node through the node;
when the number of the feedback ack information received by the logic center node exceeds a first preset number, pushing an operation instruction corresponding to the client operation request to all the nodes through the logic center node;
when any node receives the operation instruction, the node executes the operation instruction and sends completion ack information corresponding to the operation instruction to the logic center node;
and when the number of the completion ack information received by the logic center node exceeds a second preset number, marking that the transaction corresponding to the transaction ID is completed through the logic center node.
Preferably, the distributed transaction processing method further includes:
monitoring whether the logic center node is effective or not through a zookeeper service;
and when the logic center node fails, determining the node with the latest processing process as the logic center node from a third preset number of the nodes.
Preferably, the step of determining, from the third preset number of nodes, a node with the latest processing procedure as the logical center node includes:
and acquiring the latest transaction ID of the completed transaction of each node from the nodes with the third preset number, and determining the node corresponding to the latest transaction ID with the maximum value as the logic center node.
Preferably, after determining the node with the latest processing procedure as the logical center node, the method further includes:
when the logic center node has a transaction to be processed, pushing a rollback instruction corresponding to the transaction to be processed to all the nodes through the logic center node;
and when any node receives the rollback instruction, the node executes the rollback instruction and sends rollback ack information corresponding to the rollback instruction to the logic center node.
Preferably, the client operation request includes a modification operation request for attribute information of the attribute map.
Preferably, the attribute information includes vertex information and/or side information.
Preferably, the first preset number and the second preset number are half of the number of all the nodes.
Accordingly, the present application discloses an OLTP-mode distributed transaction processing system, comprising:
the ID request module is used for taking the node receiving the client operation request as a source node, and sending a transaction ID request to the logic center node through the source node so as to enable the logic center node to return the transaction ID distributed according to the increasing sequence of the global variable;
a log sending module, configured to send, when the source node receives the transaction ID, a modification information log corresponding to the client operation request to the logic center node through the source node, and push, to all the nodes, the modification information log through the logic center node;
a first feedback module, configured to send, when any node receives the modification log information, feedback ack information corresponding to the modification information log to the logic center node through the node;
the instruction sending module is used for pushing the operation instructions corresponding to the client operation requests to all the nodes through the logic center node when the number of the feedback ack information received by the logic center node exceeds a first preset number;
the second feedback module is used for executing the operation instruction through any node and sending completion ack information corresponding to the operation instruction to the logic center node when the operation instruction is received by the node;
and the marking module is used for marking that the transaction corresponding to the transaction ID is completed through the logic center node when the number of the completion ack information received by the logic center node exceeds a second preset number.
Correspondingly, the present application also discloses a distributed transaction processing apparatus in OLTP mode, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the OLTP mode distributed transaction processing method as described in any of the above when the computer program is executed.
Accordingly, the present application also discloses a readable storage medium having stored thereon a computer program which, when being executed by a processor, implements the steps of the OLTP-mode distributed transaction processing method as described in any of the above.
According to the method and the device, the logic center node selects and acquires partial number of node ack information as feedback to perform the next action, when the feedback ack information exceeding the first preset number is received, the operation instruction starts to be pushed, and when the completion ack information exceeding the second preset number is received, the transaction completion is judged, the transaction processing flow improves the availability and the partition fault tolerance of each node, and the transaction processing efficiency of the graph database in the OLTP mode is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flowchart illustrating steps of a distributed transaction processing method in OLTP mode according to an embodiment of the present invention;
fig. 2 is a structural distribution diagram of an OLTP-mode distributed transaction processing system according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the prior art, no supporting scheme of distributed transaction related processing in an OLTP mode exists. The transaction processing flow designed by the application improves the availability and partition fault tolerance of each node, and the transaction processing efficiency of the graph database in the OLTP mode is improved.
The embodiment of the invention discloses a distributed transaction processing method in OLTP mode, which is shown in figure 1 and comprises the following steps:
s1: taking the node receiving the client operation request as a source node, and sending a transaction ID request to the logic center node through the source node so as to enable the logic center node to return a transaction ID distributed according to the increasing sequence of the global variable;
s2: when the source node receives the transaction ID, sending a modified information log corresponding to the client operation request to the logic center node through the source node, and pushing the modified information log to all nodes through the logic center node;
s3: when any node receives the modification log information, sending feedback ack information corresponding to the modification information log to the logic center node through the node;
s4: when the number of the feedback ack information received by the logic center node exceeds a first preset number, pushing an operation instruction corresponding to the client operation request to all the nodes through the logic center node;
s5: when any node receives the operation instruction, the node executes the operation instruction and sends completion ack information corresponding to the operation instruction to the logic center node;
s6: and when the number of the completion ack information received by the logic center node exceeds a second preset number, marking that the transaction corresponding to the transaction ID is completed through the logic center node.
It is understood that the OLTP model in this embodiment is mainly applied to a distributed graph database, such as an open source graph database janusgraph, and therefore the client operation request includes a modification operation request for attribute information of the attribute graph, specifically, the attribute information includes vertex information and/or side information. The attribute information may include, among other things, operations related to other attributes.
It can be understood that, in this embodiment, modification of any data in the entire distributed system only needs to confirm synchronization by some nodes in the cluster, the synchronization step of each node is divided into two steps of receiving modification log information and receiving an operation instruction, the logic center node receives feedback ack information of nodes exceeding the first preset number, and then performs an action of pushing the operation instruction in the next step, and receives completion ack information of nodes exceeding the second preset number, and then determines that the transaction is completed, and further, the first preset number and the second preset number may be set to be half of the number of all nodes.
It can be understood that, in steps S1-S2, a flow is generated for the necessary transaction during the execution of the client operation request, the transaction ID of the global variable provides an absolute reference coordinate for node synchronization in the distributed system, and each transaction has a unique transaction ID, so as to avoid the cases of transaction execution overlap and coverage.
The implementation process of the embodiment in the whole distributed map database is as follows: a client sends a client operation request, a node receiving the client operation request is used as a source node, and a transaction ID request is sent to a logic center node; after receiving the transaction ID request, the logic center node allocates a transaction ID to send to the source node; the source node sends the transaction ID and the modification log information corresponding to the client operation request to the logic center node, and the logic center node pushes the transaction ID and the modification log information to all nodes of the whole system; each node returns a feedback ack message to the logic center node after receiving the modification log message, and because of the difference of physical distance, topological relation and transaction queue, the communication speeds of other nodes and the logic center node are different, so that the logic center node does not simultaneously collect all the feedback ack messages, and after the feedback ack messages exceeding the first preset number are collected, the logic center node does not need to wait for the rest nodes and directly enters the next pushing operation instruction; after receiving the push instruction, each node executes the operation instruction and returns a completion ack message; similarly, the time when the logic center node receives the completion ack messages is not consistent, and the transaction can be judged to be completed as long as the completion ack messages exceeding the first preset number are received. In fact, each node in the distributed system affects the synchronization speed by physical distance and topological relation, and the number of the to-be-processed transactions in the transaction queue of each node also affects the feedback speed of the node on the information sent by the logic center node.
According to the method and the device, the logic center node selects and acquires partial number of node ack information as feedback to perform the next action, when the feedback ack information exceeding the first preset number is received, the operation instruction starts to be pushed, and when the completion ack information exceeding the second preset number is received, the transaction completion is judged, the transaction processing flow improves the availability and the partition fault tolerance of each node, and the transaction processing efficiency of the graph database in the OLTP mode is improved.
The embodiment of the invention discloses a specific OLTP mode distributed transaction processing method, and compared with the previous embodiment, the embodiment further explains and optimizes the technical scheme. Specifically, the distributed transaction processing method further includes:
monitoring whether the logic center node is effective or not through a zookeeper service;
and when the logic center node fails, determining the node with the latest processing process as the logic center node from the nodes with the third preset number.
It can be understood that, in this embodiment, there is a case where the logical center node may fail, and therefore, the current logical center node is monitored by the zookeeper service, and once the logical center node fails, another node is selected from other nodes as the logical center node. The Zookeeper service can be arranged on other servers independent of the distributed system in the embodiment, so that the Zookeeper service failure caused by the distributed system failure is avoided.
Further, the process of determining the node with the latest processing progress as the logic center node from the third preset number of nodes includes:
and acquiring the latest transaction ID of the completed transaction of each node from the nodes with the third preset number, and determining the node corresponding to the latest transaction ID with the maximum value as the logic center node.
It is understood that, in the transaction processing process of this embodiment, each node may send a current transaction processing process to the zookeeper service according to a certain period or each time when a transaction is completed, and then select a node with the latest processing process as a logical center node. Because the transaction ID belongs to the increasing global variable, the transaction ID with the maximum value means that the process is latest and other transactions are completed earlier, and the node corresponding to the latest transaction ID with the maximum value is used as the logic center node, namely the node with the highest transaction synchronization and update speed is selected as the logic center node. Further, since the present embodiment always follows the principle of selecting part, all the node data does not need to be obtained, and the number of the nodes to be selected reaches the third preset number.
Further, after determining the node with the latest processing procedure as the logical center node, the method further includes:
when the logic center node has a transaction to be processed, pushing a rollback instruction corresponding to the transaction to be processed to all nodes through the logic center node;
when any node receives the rollback instruction, the node executes the rollback instruction and sends rollback ack information corresponding to the rollback instruction to the logic center node.
It can be understood that when the last logical center node fails, the transaction processing status of each node is different, and there may be nodes executing transactions, so the latest transaction ID recorded by the logical center node needs to be compared among multiple nodes to determine whether the latest transaction needs to be rolled back. Specifically, if the transaction in the logic center node is completed and submitted, that is, the operation instruction is executed and ack information is sent, it is determined whether nodes exceeding a second preset number in the whole distributed system have executed the operation instruction, if yes, rollback is not needed, and the transaction queued in the waiting queue is finally executed by each node; if the number of the nodes which execute the operation instruction and send the ack completion information does not reach the second preset number, a rollback instruction needs to be sent to all the nodes, and all the nodes are rolled back to the position before the transaction is executed; if the transaction in the logic center node is a to-be-processed transaction or an unfinished transaction, a rollback instruction is directly pushed in the distributed system, all nodes are rolled back to the position before the transaction is executed, and therefore the fact that the transaction is missed in the synchronization process of the whole distributed system is guaranteed, and the final consistency of the cluster is guaranteed.
Accordingly, the present application discloses an OLTP-mode distributed transaction processing system, as shown in fig. 2, including:
the ID request module 1 is used for taking the node which receives the client operation request as a source node, and sending a transaction ID request to the logic center node through the source node so as to enable the logic center node to return a transaction ID which is distributed according to the increasing sequence of the global variable;
the log sending module 2 is used for sending a modified information log corresponding to the client operation request to the logic center node through the source node when the source node receives the transaction ID, and pushing the modified information log to all nodes through the logic center node;
the first feedback module 3 is configured to send feedback ack information corresponding to the modified information log to the logic center node through any node when the node receives the modified log information;
the instruction sending module 4 is used for pushing the operation instructions corresponding to the client operation requests to all the nodes through the logic center node when the number of the feedback ack information received by the logic center node exceeds a first preset number;
the second feedback module 5 is configured to, when any node receives the operation instruction, execute the operation instruction through the node and send completion ack information corresponding to the operation instruction to the logic center node;
and the marking module 6 is used for marking that the transaction corresponding to the transaction ID is completed through the logic center node when the number of the completion ack information received by the logic center node exceeds a second preset number.
According to the method and the device, the logic center node selects and acquires partial number of node ack information as feedback to perform the next action, when the feedback ack information exceeding the first preset number is received, the operation instruction starts to be pushed, and when the completion ack information exceeding the second preset number is received, the transaction completion is judged, the transaction processing flow improves the availability and the partition fault tolerance of each node, and the transaction processing efficiency of the graph database in the OLTP mode is improved.
Correspondingly, the present application also discloses a distributed transaction processing apparatus in OLTP mode, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the OLTP mode distributed transaction processing method as described in any of the above when the computer program is executed.
Accordingly, the present application also discloses a readable storage medium having stored thereon a computer program which, when being executed by a processor, implements the steps of the OLTP-mode distributed transaction processing method as described in any of the above.
In this embodiment, the details of the distributed transaction processing method in the OLTP mode may refer to the related contents in the above embodiments, and are not described herein again.
The distributed transaction processing apparatus and the readable storage medium in the OLTP mode in this embodiment have the same beneficial effects as the distributed transaction processing method in the OLTP mode in the above embodiment, and are not described herein again.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The method, system and related components of distributed transaction processing in OLTP mode provided by the present invention are described in detail above, and a specific example is applied in the present document to explain the principle and the implementation of the present invention, and the description of the above embodiment is only used to help understanding the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (10)
1. A distributed transaction processing method in OLTP mode is characterized by comprising the following steps:
taking a node receiving a customer operation request as a source node, and sending a transaction ID request to a logic center node through the source node so as to enable the logic center node to return a transaction ID distributed according to the increasing sequence of global variables;
when the source node receives the transaction ID, sending a modified information log corresponding to the client operation request to the logic center node through the source node, and pushing the modified information log to all the nodes through the logic center node;
when any node receives the modification log information, sending feedback ack information corresponding to the modification information log to the logic center node through the node;
when the number of the feedback ack information received by the logic center node exceeds a first preset number, pushing an operation instruction corresponding to the client operation request to all the nodes through the logic center node;
when any node receives the operation instruction, the node executes the operation instruction and sends completion ack information corresponding to the operation instruction to the logic center node;
and when the number of the completion ack information received by the logic center node exceeds a second preset number, marking that the transaction corresponding to the transaction ID is completed through the logic center node.
2. The distributed transaction processing method of claim 1, further comprising:
monitoring whether the logic center node is effective or not through a zookeeper service;
and when the logic center node fails, determining the node with the latest processing process as the logic center node from a third preset number of the nodes.
3. The distributed transaction processing method according to claim 2, wherein the step of determining, from the third preset number of nodes, a node with the latest processing progress as the logical center node includes:
and acquiring the latest transaction ID of the completed transaction of each node from the nodes with the third preset number, and determining the node corresponding to the latest transaction ID with the maximum value as the logic center node.
4. The distributed transaction processing method of claim 3, wherein after determining the node with the newest processing process as the logical center node, further comprising:
when the logic center node has a transaction to be processed, pushing a rollback instruction corresponding to the transaction to be processed to all the nodes through the logic center node;
and when any node receives the rollback instruction, the node executes the rollback instruction and sends rollback ack information corresponding to the rollback instruction to the logic center node.
5. A distributed transaction processing method according to any of claims 1 to 4, wherein the client operation request comprises a modification operation request for attribute information of an attribute map.
6. A distributed transaction processing method according to claim 5, wherein the attribute information comprises vertex information and/or side information.
7. The distributed transaction processing method of claim 6, wherein the first predetermined number and the second predetermined number are each half of the number of all the nodes.
8. An OLTP-mode distributed transaction processing system, comprising:
the ID request module is used for taking the node receiving the client operation request as a source node, and sending a transaction ID request to the logic center node through the source node so as to enable the logic center node to return the transaction ID distributed according to the increasing sequence of the global variable;
a log sending module, configured to send, when the source node receives the transaction ID, a modification information log corresponding to the client operation request to the logic center node through the source node, and push, to all the nodes, the modification information log through the logic center node;
a first feedback module, configured to send, when any node receives the modification log information, feedback ack information corresponding to the modification information log to the logic center node through the node;
the instruction sending module is used for pushing the operation instructions corresponding to the client operation requests to all the nodes through the logic center node when the number of the feedback ack information received by the logic center node exceeds a first preset number;
the second feedback module is used for executing the operation instruction through any node and sending completion ack information corresponding to the operation instruction to the logic center node when the operation instruction is received by the node;
and the marking module is used for marking that the transaction corresponding to the transaction ID is completed through the logic center node when the number of the completion ack information received by the logic center node exceeds a second preset number.
9. An OLTP-mode distributed transaction processing apparatus, comprising:
a memory for storing a computer program;
processor for implementing the steps of the OLTP-mode distributed transaction processing method according to any of claims 1 to 7 when executing said computer program.
10. A readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the OLTP-mode distributed transaction processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011600837.1A CN112732414B (en) | 2020-12-29 | 2020-12-29 | Distributed transaction processing method and system in OLTP mode and related components |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011600837.1A CN112732414B (en) | 2020-12-29 | 2020-12-29 | Distributed transaction processing method and system in OLTP mode and related components |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112732414A true CN112732414A (en) | 2021-04-30 |
| CN112732414B CN112732414B (en) | 2023-12-08 |
Family
ID=75611609
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011600837.1A Active CN112732414B (en) | 2020-12-29 | 2020-12-29 | Distributed transaction processing method and system in OLTP mode and related components |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112732414B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105824842A (en) * | 2015-01-07 | 2016-08-03 | 阿里巴巴集团控股有限公司 | Distributed transaction processing method and system |
| WO2016180164A1 (en) * | 2015-09-29 | 2016-11-17 | 中兴通讯股份有限公司 | Method and apparatus for rolling back distributed transaction |
| CN108459919A (en) * | 2018-03-29 | 2018-08-28 | 中信百信银行股份有限公司 | A kind of distributed transaction processing method and device |
| CN109977171A (en) * | 2019-02-02 | 2019-07-05 | 中国人民大学 | A kind of distributed system and method guaranteeing transaction consistency and linear consistency |
| CN110134735A (en) * | 2019-04-10 | 2019-08-16 | 阿里巴巴集团控股有限公司 | The storage method and device of distributed transaction log |
-
2020
- 2020-12-29 CN CN202011600837.1A patent/CN112732414B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105824842A (en) * | 2015-01-07 | 2016-08-03 | 阿里巴巴集团控股有限公司 | Distributed transaction processing method and system |
| WO2016180164A1 (en) * | 2015-09-29 | 2016-11-17 | 中兴通讯股份有限公司 | Method and apparatus for rolling back distributed transaction |
| CN108459919A (en) * | 2018-03-29 | 2018-08-28 | 中信百信银行股份有限公司 | A kind of distributed transaction processing method and device |
| CN109977171A (en) * | 2019-02-02 | 2019-07-05 | 中国人民大学 | A kind of distributed system and method guaranteeing transaction consistency and linear consistency |
| CN110134735A (en) * | 2019-04-10 | 2019-08-16 | 阿里巴巴集团控股有限公司 | The storage method and device of distributed transaction log |
Non-Patent Citations (1)
| Title |
|---|
| 张剑;刘梦赤;: "面向信息网模型的高可扩展性分布式事务处理机制", 计算机工程, no. 11 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112732414B (en) | 2023-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11210185B2 (en) | Method and system for data recovery in a data system | |
| CN106899648B (en) | Data processing method and equipment | |
| CN110968586B (en) | Distributed transaction processing method and device | |
| CN106059825A (en) | Distributed system and configuration method | |
| JP5686034B2 (en) | Cluster system, synchronization control method, server device, and synchronization control program | |
| CN109561151B (en) | Data storage method, device, server and storage medium | |
| CN113094430B (en) | Data processing method, device, equipment and storage medium | |
| CN107025257B (en) | Transaction processing method and device | |
| CN113193947A (en) | Method, apparatus, medium, and program product for implementing distributed global ordering | |
| CN113946287A (en) | Distributed storage system and data processing method and related device thereof | |
| CN111506388B (en) | Container performance detection method, container management platform and computer storage medium | |
| CN112732414A (en) | Distributed transaction processing method, system and related components in OLTP mode | |
| CN108475211B (en) | Stateless system and system for obtaining resources | |
| CN112783613B (en) | Method and device for scheduling units | |
| CN114205354A (en) | Event management system, event management method, server, and storage medium | |
| US20110214130A1 (en) | Data processing system, data processing method, and data processing program | |
| CN114130035A (en) | User matching method, device, equipment and storage medium | |
| US11347564B2 (en) | Synchronizing batch job status across nodes on a clustered system | |
| CN112507193A (en) | Data updating method, device, equipment and storage medium | |
| CN107153699B (en) | Method and device for dynamically expanding cluster server | |
| CN116414579B (en) | Method for realizing data consistency among multiple copies based on distributed group communication | |
| CN117610914A (en) | Business wind control method, device and system and computer readable storage medium | |
| CN114416405A (en) | Semantic method and device based on message middleware | |
| CN115665245A (en) | Local cache refreshing method and device, electronic equipment and storage medium | |
| CN112487081A (en) | Data synchronization method, device, storage medium and equipment |
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 |