research-article

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

Authors:

Erfan Zamanian,

Carsten Binnig,

Tim KraskaAuthors Info & Claims

ACM SIGMOD Record, Volume 50, Issue 1

Pages 15 - 22

https://doi.org/10.1145/3471485.3471490

Published: 17 June 2021 Publication History

Abstract

Distributed transactions on high-overhead TCP/IP-based networks were conventionally considered to be prohibitively expensive. In fact, the primary goal of existing partitioning schemes is to minimize the number of cross-partition transactions. However, with the new generation of fast RDMAenabled networks, this assumption is no longer valid.

In this paper, we first make the case that the new bottleneck which hinders truly scalable transaction processing in modern RDMA-enabled databases is data contention, and that optimizing for data contention leads to different partitioning layouts than optimizing for the number of distributed transactions. We then present Chiller, a new approach to data partitioning and transaction execution, which aims to minimize data contention for both local and distributed transactions.

References

[1]

C. Binnig, A. Crotty, A. Galakatos, T. Kraska, and E. Zamanian. The end of slow networks: It's time for a redesign. PVLDB, 9(7):528--539, 2016.

Digital Library

[2]

C. Curino, E. Jones, Y. Zhang, and S. Madden. Schism: a workload-driven approach to database replication and partitioning. VLDB Endowment, 3(1--2):48--57, 2010.

Digital Library

[3]

A. Dragojevi´c, D. Narayanan, E. B. Nightingale, M. Renzelmann, A. Shamis, A. Badam, and M. Castro. No compromises: distributed transactions with consistency, availability, and performance. In ACM SOSP, pages 54--70, 2015.

Digital Library

[4]

Instacart. The instacart online grocery shopping dataset 2017, 2017.

[5]

A. Kalia, M. Kaminsky, and D. G. Andersen. FaSST: Fast, scalable and simple distributed transactions with two-sided (RDMA) datagram RPCs. In 12th USENIX OSDI, pages 185--201, 2016.

Digital Library

[6]

R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. Jones, S. Madden, M. Stonebraker, Y. Zhang, et al. H-store: a high-performance, distributed main memory transaction processing system. VLDB Endowment, 1(2):1496--1499, 2008.

Digital Library

[7]

G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359--392, 1998.

Digital Library

[8]

H. A. Mahmoud, V. Arora, F. Nawab, D. Agrawal, and A. El Abbadi. Maat: Effective and scalable coordination of distributed transactions in the cloud. VLDB Endowment, 7(5):329--340, 2014.

Digital Library

[9]

C. Mitchell, Y. Geng, and J. Li. Using one-sided RDMA reads to build a fast, cpu-efficient key-value store. In USENIX Annual Technical Conference, pages 103--114, 2013.

Digital Library

[10]

M. Serafini, R. Taft, A. J. Elmore, A. Pavlo, A. Aboulnaga, and M. Stonebraker. Clay: fine-grained adaptive partitioning for general database schemas. VLDB Endowment, 10(4):445--456, 2016.

Digital Library

[11]

D. Shasha, F. Llirbat, E. Simon, and P. Valduriez. Transaction chopping: Algorithms and performance studies. ACM Trans. Database Syst., 20(3):325--363, Sept. 1995.

Digital Library

[12]

M. Stonebraker and A. Weisberg. The VoltDB main memory DBMS. IEEE Data Eng. Bull., 36(2):21--27, 2013.

[13]

A. Thomson, T. Diamond, S.-C. Weng, K. Ren, P. Shao, and D. J. Abadi. Calvin: fast distributed transactions for partitioned database systems. In ACM SIGMOD, pages 1--12, 2012.

Digital Library

[14]

A. G. Thomson. Deterministic Transaction Execution in Distributed Database Systems. PhD thesis, Yale University, 2013.

Digital Library

[15]

C. Yan and A. Cheung. Leveraging lock contention to improve OLTP application performance. VLDB Endowment, 9(5):444--455, 2016.

Digital Library

[16]

E. Zamanian, C. Binnig, T. Harris, and T. Kraska. The end of a myth: Distributed transactions can scale. VLDB Endowment, 10(6):685--696, 2017.

Digital Library

[17]

E. Zamanian, J. Shun, C. Binnig, and T. Kraska. Chiller: Contention-centric transaction execution and data partitioning for modern networks. In ACM SIGMOD, page 511--526, 2020.

Digital Library

[18]

Y. Zhang, R. Power, S. Zhou, Y. Sovran, M. K. Aguilera, and J. Li. Transaction chains: Achieving serializability with low latency in geo-distributed storage systems. In ACM SOSP, page 276--291, 2013.

Digital Library

Cited By

Jasny MZiegler TBinnig C(2025)Scalable Data Management on Next-Generation Data Center NetworksScalable Data Management for Future Hardware10.1007/978-3-031-74097-8_8(199-221)Online publication date: 24-Jan-2025
https://doi.org/10.1007/978-3-031-74097-8_8
Ziegler TNelson-Slivon JLeis VBinnig C(2023)Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMAProceedings of the ACM on Management of Data10.1145/35892761:2(1-26)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589276
Zhu BHua YLong ZLiu X(2023)CATS: A Computation-Aware Transaction Processing System with Proactive Unlocking2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS)10.1109/IWQoS57198.2023.10188780(1-10)Online publication date: 19-Jun-2023
https://doi.org/10.1109/IWQoS57198.2023.10188780
Show More Cited By

Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks
1. Information systems
  1. Data management systems
    1. Database management system engines

Recommendations

Chiller: Contention-centric Transaction Execution and Data Partitioning for Modern Networks
SIGMOD '20: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data

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 ...
WFR-TM

Transactional Memory (TM) is a promising concurrent programming paradigm which employs transactions to achieve synchronization in accessing common data known as transactional variables. A transaction may either commit, making its updates to ...
Speculation-based techniques for transactional lock-free execution of lock-based programs

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 50, Issue 1

March 2021

90 pages

ISSN:0163-5808

DOI:10.1145/3471485

Editors:
Rada Chirkova
North Carolina State University
,
Vanessa Braganholo
Universidade Federal Fluminense
,
Wim Martens
University of Bayreuth
,
Divesh Srivastava
ATT research
,
Marcelo Arenas
Research Highlights
,
Marianne Winslett
University of Illinois
,
Jun Yang
Duke University
,
Azza Abouzied
NYU
,
Lyublena Antova
Datometry
,
Aaron J. Elmore
University of Chicago
,
Kyriakos Mouratidis
Singapore Management University
,
Dan Olteanu
University of Oxford
,
Immanuel Trummer
Cornell University
,
Yannis Velegrakis
Utrecht University
,
Renata Borovica-Gajic
Surveys

Issue’s Table of Contents

Copyright © 2021 Copyright is held by the owner/author(s).

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 June 2021

Published in SIGMOD Volume 50, Issue 1

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
85
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)1

Reflects downloads up to 02 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jasny MZiegler TBinnig C(2025)Scalable Data Management on Next-Generation Data Center NetworksScalable Data Management for Future Hardware10.1007/978-3-031-74097-8_8(199-221)Online publication date: 24-Jan-2025
https://doi.org/10.1007/978-3-031-74097-8_8
Ziegler TNelson-Slivon JLeis VBinnig C(2023)Design Guidelines for Correct, Efficient, and Scalable Synchronization using One-Sided RDMAProceedings of the ACM on Management of Data10.1145/35892761:2(1-26)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1145/3589276
Zhu BHua YLong ZLiu X(2023)CATS: A Computation-Aware Transaction Processing System with Proactive Unlocking2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS)10.1109/IWQoS57198.2023.10188780(1-10)Online publication date: 19-Jun-2023
https://doi.org/10.1109/IWQoS57198.2023.10188780
Ziegler TBindiganavile Mohan DLeis VBinnig C(2022)EFA: A Viable Alternative to RDMA over InfiniBand for DBMSs?Proceedings of the 18th International Workshop on Data Management on New Hardware10.1145/3533737.3538506(1-5)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3533737.3538506
Ziegler TBinnig CLeis VIves ZBonifati AEl Abbadi A(2022)ScaleStore: A Fast and Cost-Efficient Storage Engine using DRAM, NVMe, and RDMAProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526187(685-699)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526187
An SCao YZhao W(2022)Competitive Consistent Caching for Transactions2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00207(2154-2167)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00207

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents