Results 231 to 240 of about 7,260 (279)
Some of the next articles are maybe not open access.
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.
Weihan Wang, Cristiana Amza
openaire +1 more source
Observations on optimistic concurrency control schemes
Information Systems, 1984Abstract Optimistic concurrency control schemes allow uncontrolled access to shared data objects during transaction processing under the explicit assumption that read and write conflicts among transactions are rare events. Before a transaction commits, the DBMS has to validate that no conflict has occurred.
openaire +1 more source
Distributed real-time optimistic concurrency control protocol
Proceedings of the 4th International Workshop on Parallel and Distributed Real-Time Systems, 2002Although many recent studies have suggested that optimistic concurrency control (OCC) with dynamic adjustment of serialization order (DASO) is more suitable than two phase locking (2PL) for real-time database systems (RTDBS), most of the protocols proposed for DRTDBS are based on 2PL. When OCC with DASO is extended to DRTDBS, a number of issues have to
null Kwok-Wa Lam +3 more
openaire +1 more source
Adaptive optimistic concurrency control for heterogeneous workloads
Proceedings of the VLDB Endowment, 2019Optimistic concurrency control (OCC) protocols validate whether a transaction has conflicts with other concurrent transactions after this transaction completes its execution. In this work, we demonstrate that the validation phase has a great influence on the performance of modern in-memory database systems, especially under heterogeneous workloads. The
Jinwei Guo +4 more
openaire +1 more source
Less optimism about optimistic concurrency control
[1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing, 2003This paper discusses some of the shortcomings of the optimistic concurrency control (OCC) approach in supporting all the features expected in a full-function DBMS. Surprisingly, in spite of OCC having been around for a long time and its performance having been studied in various contexts, no complete system design, let alone a full-blown implementation,
openaire +1 more source
Polaris: Enabling Transaction Priority in Optimistic Concurrency Control
Proceedings of the ACM on Management of 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. Such a prioritization mechanism is commonly implemented in locking-based concurrency control protocols as some lock scheduling mechanisms, but it is rarely supported in
Chenhao Ye +3 more
openaire +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
Martin L. Kersten, Hans Tebra
openaire +1 more source
Bounded locking for optimistic concurrency control
1996Optimistic methods of concurrency control are gaining popularity. This is especially true with the resurgence of mobile and distributed databases, which inherently rely on optimistic techniques to improve availability and performance of the database system.
Phatak, Shirish, Badrinath, B. R.
openaire +1 more source
Checkpointing for optimistic concurrency control methods
IEEE Transactions on Knowledge and Data Engineering, 1995Restart-oriented concurrency control (CC) methods, such as optimistic CC, outperform blocking-oriented methods, such as standard two-phase locking in a high data contention environment, but this is at the cost of wasted processing due to restarts. Volatile savepoints are considered in this study as a method to reduce this wasted processing and to ...
openaire +1 more source
Quorum-Based Optimistic Concurrency Control in Replicated DHTs
2009 International Symposium on Information Engineering and Electronic Commerce, 2009Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To achieve fault tolerance and ensure high data availability, DHTs typically rely on data replication. However, nodes churn, lacking of global view and existence of malicious nodes in P2P environment bring new challenges to the concurrency control for replicated
Yang Bao +5 more
openaire +1 more source