Blurring the lines between blockchains and database systems: the case of hyperledger fabric

A Sharma, FM Schuhknecht, D Agrawal… - Proceedings of the 2019 …, 2019 - dl.acm.org
Within the last few years, a countless number of blockchain systems have emerged on the
market, each one claiming to revolutionize the way of distributed transaction processing in …

Cicada: Dependably fast multi-core in-memory transactions

H Lim, M Kaminsky, DG Andersen - Proceedings of the 2017 ACM …, 2017 - dl.acm.org
Multi-core in-memory databases promise high-speed online transaction processing.
However, the performance of individual designs suffers when the workload characteristics …

The art of balance: a RateupDB™ experience of building a CPU/GPU hybrid database product

R Lee, M Zhou, C Li, S Hu, J Teng, D Li… - Proceedings of the VLDB …, 2021 - dl.acm.org
GPU-accelerated database systems have been studied for more than 10 years, ranging from
prototyping development to industry products serving in multiple domains of data …

An analysis of concurrency control protocols for in-memory databases with ccbench

T Tanabe, T Hoshino, H Kawashima… - Proceedings of the VLDB …, 2020 - dl.acm.org
This paper presents yet another concurrency control analysis platform, CCBench. CCBench
supports seven protocols (Silo, TicToc, MOCC, Cicada, SI, SI with latch-free SSN, 2PL) and …

Plor: General transactions with predictable, low tail latency

Y Chen, X Yu, P Koutris, AC Arpaci-Dusseau… - Proceedings of the …, 2022 - dl.acm.org
We present pessimistic locking and optimistic reading (PLOR), a hybrid concurrency control
protocol for in-memory transaction systems that delivers high throughput and low tail latency …

Polyjuice:{High-Performance} transactions via learned concurrency control

J Wang, D Ding, H Wang, C Christensen… - … USENIX Symposium on …, 2021 - usenix.org
Concurrency control algorithms are key determinants of the performance of in-memory
databases. Existing algorithms are designed to work well for certain workloads. For …

Handling highly contended OLTP workloads using fast dynamic partitioning

G Prasaad, A Cheung, D Suciu - Proceedings of the 2020 ACM SIGMOD …, 2020 - dl.acm.org
Research on transaction processing has made significant progress towards improving
performance of main memory multicore OLTP systems under low contention. However …

Sundial: Harmonizing concurrency control and caching in a distributed OLTP database management system

X Yu, Y Xia, A Pavlo, D Sanchez, L Rudolph… - Proceedings of the …, 2018 - dl.acm.org
Distributed transactions suffer from poor performance due to two major limiting factors. First,
distributed transactions suffer from high latency because each of their accesses to remote …

Epoch-based commit and replication in distributed OLTP databases

Y Lu, X Yu, L Cao, S Madden - 2021 - dspace.mit.edu
© 2021, VLDB Endowment. All rights reserved. Many modern data-oriented applications are
built on top of distributed OLTP databases for both scalability and high availability. Such …

Chiller: Contention-centric transaction execution and data partitioning for modern networks

E Zamanian, J Shun, C Binnig, T Kraska - Proceedings of the 2020 ACM …, 2020 - dl.acm.org
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 …