A transaction-consistent global checkpoint of a database records a state of the database which reflects the effect of only completed transactions and not the re- sults of any partially executed transactions. This thesis establishes the necessary and sufficient conditions for a checkpoint of a data item (or the checkpoints of a set of data items) to be part of a transaction-consistent global checkpoint of the database. This result would be useful for constructing transaction-consistent global checkpoints incrementally from the checkpoints of each individual data item of a database. By applying this condition, we can start from any useful checkpoint of any data item and then incrementally add checkpoints of other data items until we get a transaction- consistent global checkpoint of the database. This result can also help in designing non-intrusive checkpointing protocols for database systems. Based on the intuition gained from the development of the necessary and sufficient conditions, we also de- veloped a non-intrusive low-overhead checkpointing protocol for distributed database systems. Checkpointing and rollback recovery are also established techniques for achiev- ing fault-tolerance in distributed systems. Communication-induced checkpointing algorithms allow processes involved in a distributed computation take checkpoints independently while at the same time force processes to take additional checkpoints to make each checkpoint to be part of a consistent global checkpoint. This thesis develops a low-overhead communication-induced checkpointing protocol and presents a performance evaluation of the protocol.

本研究之主要目標在於建構一個能評估分散式關聯資料庫中之特色的需求導向績效評估方法。在過去的績效評估研究中，已經有許多人對於關聯式資料庫績效評估做了多方面的努力。但是，過去的關聯式資料庫資效評估方法如：Wisconsin、AS3AP、TPC系列的Benchmarks都有著一些限制及不足的地方。 過去的關聯式資料庫績效評估方法並無法完全的評估出分散式資料庫的特殊需求及其表現。所以本研究嘗試要建立出一個能專門適用於分散式資料庫導向的績效評估方法。為了要作出此績效評估方法，本研究採用了工作量模式的研究方法。先建出分散式資料庫績效評估的工作量模式，再以其來實作出績效評估方法。工作量模式分成三部分：資料模式、交易模式、控制模式。 / This thesis is intended to design a requirements-centric database benchmark, which can evaluate the general performance of the distributed relational database systems. In the past, there are many relational database benchmarks. But the relational database benchmarks like Wisconsin, AS3AP, TPC, TP1 have some constraints. In this study, we aim to design a general-purpose distributed database workload model and implement it. To design this benchmark, we need to build our workload model. The workload model consists of three components：data model, transaction model, control model. Each model has the requirement specification language to accommodate user's workloads.

No description available.

With the shifting landscape of computing hardware architectures and the emergence of new computing environments (e.g., large main-memory systems, hundreds of CPUs, distributed and virtualized cloud-based resources), state-of-the-art designs of transaction processing systems that rely on conventional wisdom suffer from lost performance optimization opportunities. This dissertation challenges conventional wisdom to rethink the design and implementation of transaction processing systems for modern computing environments.<div><br></div><div>We start by tackling the vertical hardware scaling challenge, and propose a deterministic approach to transaction processing on emerging multi-sockets, many-core, shared memory architecture to harness its unprecedented available parallelism. Our proposed priority-based queue-oriented transaction processing architecture eliminates the transaction contention footprint and uses speculative execution to improve the throughput of centralized deterministic transaction processing systems. We build QueCC and demonstrate up to two orders of magnitude better performance over the state-of-the-art.<br></div><div><br></div><div>We further tackle the horizontal scaling challenge and propose a distributed queue-oriented transaction processing engine that relies on queue-oriented communication to eliminate the traditional overhead of commitment protocols for multi-partition transactions. We build Q-Store, and demonstrate up to 22x improvement in system throughput over the state-of-the-art deterministic transaction processing systems.<br></div><div><br></div><div>Finally, we propose a generalized framework for designing distributed and replicated deterministic transaction processing systems. We introduce the concept of speculative replication to hide the latency overhead of replication. We prototype the speculative replication protocol in QR-Store and perform an extensive experimental evaluation using standard benchmarks. We show that QR-Store can achieve a throughput of 1.9 million replicated transactions per second in under 200 milliseconds and a replication overhead of 8%-25%compared to non-replicated configurations.<br></div>