DB - Fast and General Distributed Transactions using RDMA and HTM.pdf Recent transaction processing systems attempt to leverage advanced hardware features like RDMA and HTM to significantly boost performance, which, however, pose several limitations like requiring priori knowledge of read/write sets of transactions and providing no availability support. In this paper, we present DrTM+R, a fast in-memory transaction processing system that retains the performance benefit from advanced hardware

Large-scale Incremental Processing Using Distributed Transactions and Notifications.pdf Updating an index of the web as documents are crawled requires continuously transforming a large repository of existing documents as new documents arrive. This task is one example of a class of data processing tasks that transform a large repository of data via small, independent mutations. These tasks lie in a gap between the capabilities of existing infrastructure.

The common wisdom is that distributed transactions do not scale. But what if distributed transactions could be made scalable using the next generation of networks and a redesign of distributed databases? There would be no need for developers anymore to worry about co-partitioning schemes to achieve decent performance. Application development would become easier as data placement would no longer determine how scalable an application is. Hardware provisioning would be simplified as the system ...

We live in an increasingly interconnected world, with many organizations operating across countries or even continents. To serve their global user base, organizations are replacing their legacy DBMSs with cloud-based systems capable of scaling OLTP workloads to millions of users. CockroachDB is a scalable SQL DBMS that was built from the ground up to support these global OLTP workloads while maintaining high availability and strong consistency. Just like its namesake, CockroachDB is ...

DB - Consistency Tradeoffs in Modern Distributed Database System Design The CAP theorem’s impact on modern distributed database system design is more limited than is often perceived. Another tradeoff—between consistency and latency —has had a more direct influence on several well-known DDBSs. A proposed new formulation, PACELC, unifies this tradeoff with CAP.

Title : Designing Distributed Systems Using Approximate Synchrony in Data Center Networks.pdf Distributed systems are traditionally designed independently from the underlying network, making worst-case assumptions (e.g., complete asynchrony) about its behavior. However, many of today’s distributed applications are deployed in data centers, where the network is more reliable, predictable, and extensible. In these environments, it is possible to co-design distributed systems with their network

DB - Paxos vs Raft - Have we reached consensus on distributed consensus.pdf Distributed consensus is a fundamental primitive for constructing fault-tolerant, strongly-consistent distributed systems. Though many distributed consensus algorithms have been proposed, just two dominate production systems: Paxos, the traditional, famously subtle, algorithm; and Raft, a more recent algorithm positioned as a more understandable alternative to Paxos.

openGauss_3.0.0 分布式镜像（openGauss-distributed-CentOS-x86_64.tar.gz）适用于centos_x86_64

经典教材及参考书，英文版parallel distributed simulation system 作者Richard M. Fujimoto，本领域必看的专业书籍

raft raft是一个Go库，它管理复制的日志，并且可以与FSM一起使用以管理复制的状态机。 它是一个用于提供共识的库。 这种库的用例范围很广，例如repli raft raft是Go库，它管理复制的日志，并且可以与FSM一起使用以管理复制的状态机。 它是一个用于提供共识的库。 这种库的用例范围很广，例如复制状态机是许多分布式系统的关键组成部分。 它们使构建一致的，分区容错（CP）的系统也具有有限的容错能力。 构建如果要构建木筏，则需要安装Go 1.2+版本。 请检查一下