Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks

@article{Zamanian2020ChillerCT,
  title={Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks},
  author={Erfan Zamanian and Julian Shun and Carsten Binnig and Tim Kraska},
  journal={Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data},
  year={2020}
}
Distributed transactions on high-overhead TCP/IP-based networks were conventionally considered to be prohibitively expensive and thus were avoided at all costs. To that end, the primary goal of almost any existing partitioning scheme is to minimize the number of cross-partition transactions. However, with the new generation of fast RDMA-enabled networks, this assumption is no longer valid. In fact, recent work has shown that distributed databases can scale even when the majority of transactions… Expand
Rethinking Database High Availability with RDMA Networks
TLDR
The case is made that in modern RDMAenabled networks, the bottleneck has shifted to CPUs, and therefore the existing network-optimized replication techniques are no longer optimal, and this paper presents Active-Memory Replication, a new high availability scheme that efficiently leverages RDMA to completely eliminate the processing redundancy in replication. Expand
Highly Available Queue-oriented Speculative Transaction Processing
TLDR
This paper designs and implements QR-Store, a queue-oriented replicated transaction processing system, and extensively evaluate it with various workloads based on a transactional version of YCSB, and proposes a generic framework to model the replication process in deterministic transaction processing systems. Expand
Samya: Geo-Distributed Data System for High Contention Data Aggregates
Geo-distributed databases are the state of the art to manage data in the cloud. But maintaining hot records in geo-distributed databases such as Google’s Spanner can be expensive, as it synchronizesExpand
DFI: The Data Flow Interface for High-Speed Networks
TLDR
The Data Flow Interface (DFI) is proposed as a way to make it easier for data processing systems to exploit high-speed networks without the need to deal with the complexity of RDMA. Expand
Saguaro: Efficient Processing of Transactions in Wide Area Networks using a Hierarchical Permissioned Blockchain
TLDR
Saguaro is presented, a hierarchical permissioned blockchain designed specifically for Internet-scale mobile networks and demonstrated the high potential of Saguaro being the first 5G-enabled permissioned Blockchain system in the community. Expand

References

SHOWING 1-10 OF 65 REFERENCES
Squall: Fine-Grained Live Reconfiguration for Partitioned Main Memory Databases
TLDR
The Squall technique for supporting live reconfiguration in partitioned, main memory DBMSs supports fine-grained repartitioning of databases in the presence of distributed transactions, high throughput client workloads, and replicated data. Expand
JECB: a join-extension, code-based approach to OLTP data partitioning
TLDR
A low-overhead data partitioning approach, termed JECB, that can reduce the number of distributed transactions in complex database workloads such as TPC-E. Expand
SWORD: scalable workload-aware data placement for transactional workloads
TLDR
SWORD, a transparently scaling out transactional (OLTP) workloads on relational databases, is proposed, that incorporates a suite of novel techniques to significantly reduce the overheads incurred both during the initial placement, and during query execution at runtime, and is the first system that uses fine-grained quorums defined at the level of groups of tuples in this context. Expand
No compromises: distributed transactions with consistency, availability, and performance
TLDR
It is shown that a main memory distributed computing platform called FaRM can provide distributed transactions with strict serializability, high performance, durability, and high availability in modern data centers. Expand
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
TLDR
A novel approach to automatically partitioning databases for enterprise-class OLTP systems that significantly extends the state of the art by minimizing the number distributed transactions, while concurrently mitigating the effects of temporal skew in both the data distribution and accesses is presented. Expand
Rethinking Database High Availability with RDMA Networks
TLDR
The case is made that in modern RDMAenabled networks, the bottleneck has shifted to CPUs, and therefore the existing network-optimized replication techniques are no longer optimal, and this paper presents Active-Memory Replication, a new high availability scheme that efficiently leverages RDMA to completely eliminate the processing redundancy in replication. Expand
Analyzing the Impact of System Architecture on the Scalability of OLTP Engines for High-Contention Workloads
TLDR
An extensive experimental study is presented to understand the impact of each system architecture on overall scalability, the interaction between system architecture and concurrency control protocols, and the pros and cons of new architectures that have been proposed recently to explicitly deal with high-contention workloads. Expand
Schism: a Workload-Driven Approach to Database Replication and Partitioning
TLDR
Schism consistently outperforms simple partitioning schemes, and in some cases proves superior to the best known manual partitioning, reducing the cost of distributed transactions up to 30%. Expand
MaaT: Effective and scalable coordination of distributed transactions in the cloud
TLDR
An extensive experimental study is conducted to evaluate the re-design of optimistic concurrency control to eliminate any need for locking even for atomic commitment, while handling the practical issues in earlier theoretical work related to this problem. Expand
An Evaluation of Distributed Concurrency Control
TLDR
To achieve truly scalable operation, distributed concurrency control solutions must seek a tighter coupling with either novel network hardware or applications (via data modeling and semantically-aware execution), or both. Expand
...
1
2
3
4
5
...