Polaris: Enabling Transaction Priority in Optimistic Concurrency Control
Proc. ACM Manag. Data, 2023Transaction priority is a critical feature for real-world database systems. Under high contention, certain classes of transactions should be given a higher chance to commit than others.
Chenhao Ye+3 more
semanticscholar +1 more source
Parallel Block Execution in SoCC Blockchains through Optimistic Concurrency Control
2021 IEEE Globecom Workshops (GC Wkshps), 2021The blockchain ecosystem is growing rapidly with new decentralized applications being released constantly, boasting significant growth in functionality and adoption.
Alex Valtchanov+3 more
semanticscholar +1 more source
On Optimal Concurrency Control for Optimistic Replication
2009 29th IEEE International Conference on Distributed Computing Systems, 2009Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, version vectors or causal graphs exchanged on synchronization opportunities. However, the size of such metadata increases at least linearly with the number of active sites.
Cristiana Amza, Weihan Wang
openaire +2 more sources
Improving Optimistic Concurrency Control Through Transaction Batching and Operation Reordering
Proceedings of the VLDB Endowment, 2018OLTP systems can often improve throughput by batching transactions and processing them as a group. Batching has been used for optimizations such as message packing and group commits; however, there is little research on the benefits of a holistic ...
B. Ding, Lucja Kot, J. Gehrke
semanticscholar +1 more source
Distributed Logical Timestamp Allocation for DBMS Concurrency Control on Many-core Machines
IEEE International Symposium on High-Performance Parallel Distributed Computing, 2023We investigate the timestamp allocation scheme in classical concurrency controls of the database management systems (DBMS) on many-core machines. Then we discuss a distributed logical timestamp allocation scheme with uniqueness and fairness to improve ...
Qingsheng Zhang, Chengjia Liang
semanticscholar +1 more source
Application of an optimistic concurrency control method
Software: Practice and Experience, 1984AbstractThis paper illustrates the implementation feasibility of an optimistic approach to concurrency control. After reviewing the approach and clarifying the underlying algorithms and assumptions, it is applied to the design of a multiāuser version of an existing relational database management system. Two different system architectures for a UNIXUNIX
Hans Tebra, Martin L. Kersten
openaire +2 more sources
Mostly-Optimistic Concurrency Control for Highly Contended Dynamic Workloads on a Thousand Cores
Proceedings of the VLDB Endowment, 2016Future servers will be equipped with thousands of CPU cores and deep memory hierarchies. Traditional concurrency control (CC) schemes---both optimistic and pessimistic---slow down orders of magnitude in such environments for highly contended workloads ...
Tianzheng Wang, Hideaki Kimura
semanticscholar +1 more source
Timestamp Based Optimistic Concurrency Control
TENCON 2005 - 2005 IEEE Region 10 Conference, 2005Optimistic concurrency control demonstrates a few improvements over pessimistic concurrency controls like two-phase locking protocol or time-stamp based protocol. But the price of coarse detection of conflicts may sometimes be high and consequently discounts the advantage of optimistic concurrency control protocol.
Hidenori Nakazato, Quazi Mamun
openaire +2 more sources
BCC: Reducing False Aborts in Optimistic Concurrency Control with Low Cost for In-Memory Databases
Proceedings of the VLDB Endowment, 2016The Optimistic Concurrency Control (OCC) method has been commonly used for in-memory databases to ensure transaction serializability --- a transaction will be aborted if its read set has been changed during execution.
Yuan Yuan+6 more
semanticscholar +1 more source
Transaction Healing: Scaling Optimistic Concurrency Control on Multicores
SIGMOD Conference, 2016Today's main-memory databases can support very high transaction rate for OLTP applications. However, when a large number of concurrent transactions contend on the same data records, the system performance can deteriorate significantly. This is especially
Yingjun Wu, C. Chan, K. Tan
semanticscholar +1 more source