Efficient Geo-Distributed Transaction Processing
Abstract
Distributed deterministic database systems support OLTP workloads over geo-replicated data. Providing these transactions with ACID guarantees requires a delay of multiple wide-area network (WAN) round trips of messaging to totally order transactions globally. This thesis presents Sloth, a geo-replicated database system that can serializably commit transactions after a delay of only a single WAN round trip of messaging. Sloth reduces the cost of determining the total global order for all transactions by leveraging deterministic merging of partial sequences of transactions per geographic region. Using popular workload benchmarks over geo-replicated Azure, this thesis shows that Sloth outperforms state-of-the-art comparison systems to deliver low-latency transaction execution.
Collections
Cite this version of the work
Joshua Thomas Hildred
(2023).
Efficient Geo-Distributed Transaction Processing. UWSpace.
http://hdl.handle.net/10012/19516
Other formats