Carousel
| Autor: | Linguan Yang, Hongbo Zhang, Bernard Wong, Kenneth Salem, Xiayue Charles Lin, Tim Brecht, Xinan Yan |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Distributed database
business.industry Transaction processing Computer science 020206 networking & telecommunications 02 engineering and technology Commit Replication (computing) Low latency (capital markets) Serializability 020204 information systems 0202 electrical engineering electronic engineering information engineering Distributed transaction business Database transaction Computer network |
| Zdroj: | SIGMOD Conference |
| DOI: | 10.1145/3183713.3196912 |
| Popis: | The trend towards global applications and services has created an increasing demand for transaction processing on globally-distributed data. Many database systems, such as Spanner and CockroachDB, support distributed transactions but require a large number of wide-area network roundtrips to commit each transaction and ensure the transaction's state is durably replicated across multiple datacenters. This can significantly increase transaction completion time, resulting in developers replacing database-level transactions with their own error-prone application-level solutions. This paper introduces Carousel, a distributed database system that provides low-latency transaction processing for multi-partition globally-distributed transactions. Carousel shortens transaction processing time by reducing the number of sequential wide-area network round trips required to commit a transaction and replicate its results while maintaining serializability. This is possible in part by using information about a transaction's potential write set to enable transaction processing, including any necessary remote read operations, to overlap with 2PC and state replication. Carousel further reduces transaction completion time by introducing a consensus protocol that can perform state replication in parallel with 2PC. For a multi-partition 2-round Fixed-set Interactive (2FI) transaction, Carousel requires at most two wide-area network roundtrips to commit the transaction when there are no failures, and only one round trip in the common case if local replicas are available. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|