Proceedings of the VLDB Endowment · 2020 · 297 citations · 27 references
ComputingComputer ScienceComputer SystemsDatabasesDistributed SystemsStorage SystemsData ReplicationDistributed ComputingDistributed ConsensusDistributed DatabasesDistributed StorageStorage ConsistencyConsistency Models For Replicated DataConsistency-aware ReplicationDistributed Storage ConsistencyDistributed Transaction ProcessingIsolationRaft ConsensusRaft Log ReplicationTransaction Processing
Hybrid Transactional and Analytical Processing (HTAP) databases require processing transactional and analytical queries in isolation to remove the interference between them. To achieve this, it is necessary to maintain different replicas of data specified for the two types of queries. However, it is challenging to provide a consistent view for distributed replicas within a storage system, where analytical requests can efficiently read consistent and fresh data from transactional workloads at scale and with high availability. To meet this challenge, we propose extending replicated state machine-based consensus algorithms to provide consistent replicas for HTAP workloads. Based on this novel idea, we present a Raft-based HTAP database: TiDB. In the database, we design a multi-Raft storage system which consists of a row store and a column store. The row store is built based on the Raft algorithm. It is scalable to materialize updates from transactional requests with high availability. In particular, it asynchronously replicates Raft logs to learners which transform row format to column format for tuples, forming a real-time updatable column store. This column store allows analytical queries to efficiently read fresh and consistent data with strong isolation from transactions on the row store. Based on this storage system, we build an SQL engine to process large-scale distributed transactions and expensive analytical queries. The SQL engine optimally accesses row-format and column-format replicas of data. We also include a powerful analysis engine, TiSpark, to help TiDB connect to the Hadoop ecosystem. Comprehensive experiments show that TiDB achieves isolated high performance under CH-benCHmark, a benchmark focusing on HTAP workloads.
27
Leslie Lamport · ACM Transactions on Computer Systems · 1998 · 2.7K citations · Full text
Bigtable: a distributed storage system for structured data
Fay W. Chang, Jay B. Dean, Sanjay Ghemawat et al. · 2006 · 2K citations
In search of an understandable consensus algorithm
Diego Ongaro, John K. Ousterhout · 2014 · 1.5K citations
Scalable SQL and NoSQL data stores
R. G. G. Cattell · ACM SIGMOD Record · 2011 · 1.3K citations
The log-structured merge-tree (LSM-tree)
Patrick E. O׳Neil, E.T. Cheng, Dieter Gawlick et al. · Acta Informatica · 1996 · 1.3K citations