Results 1 to 10 of about 343,466 (294)
SQL Access Patterns for Optimistic Concurrency Control [PDF]
5 pages, 1 ...
Martti Laiho, Fritz Laux
arxiv +5 more sources
The Impact of Timestamp Granularity in Optimistic Concurrency Control [PDF]
Optimistic concurrency control (OCC) can exploit the strengths of parallel hardware to provide excellent performance for uncontended transactions, and is popular in high-performance in-memory databases and transactional systems. But at high contention levels, OCC is susceptible to frequent aborts, leading to wasted work and degraded performance ...
Huang, Yihe+4 more
arxiv +5 more sources
On Optimistic Methods For Concurrency Control [PDF]
Most current approaches to concurrency control in database systems rely on locking of data objects as a control mechanism. In this paper, two families of nonlocking concurrency controls are presented. The methods used are “optimistic” in the sense that they rely mainly on transaction backup as a control mechanism, “hoping” that conflicts between ...
J.T. Robinson, H.T. King
semanticscholar +6 more sources
Infinite Resources for Optimistic Concurrency Control [PDF]
Optimistic concurrency control (OCC) is inefficient for high-contention workloads. When concurrent transactions conflict, an OCC system wastes CPU resources verifying transactions, only to abort them. This paper presents a new system, called Network Optimistic Concurrency Control (NOCC), which reduces load on storage servers by identifying transactions
Leandro Pacheco de Sousa+4 more
semanticscholar +3 more sources
Optimistic Concurrency Control for Distributed Unsupervised Learning [PDF]
Research on distributed machine learning algorithms has focused primarily on one of two extremes - algorithms that obey strict concurrency constraints or algorithms that obey few or no such constraints. We consider an intermediate alternative in which algorithms optimistically assume that conflicts are unlikely and if conflicts do arise a conflict ...
Pan, Xinghao+4 more
arxiv +5 more sources
FOCCX: An Optimistic Concurrency Control Protocol over XML [PDF]
XML concurrency control protocol (CCP) is used to guard the consistence and isolation of transactions in Native XML databases. Experiments show that locking overhead of existing approaches based on locking may be huge, especially in the applications with few or without conflicts. Optimistic concurrency control (OCC) is an alternative to locking.
Weifeng Shan, Husheng Liao
semanticscholar +3 more sources
Comparison and an Improved Validation Optimistic Approach for Concurrency Control [PDF]
Concurrency Control entails the synchronization of accesses to the distributed database, such that the integrity of the database is maintained. Devising an efficient concurrency control technique is challenging. There is a need for improvised concurrency control technique to coordinate the simultaneous execution of transactions in a multi-processing ...
Monika Patel, Dhiren B. Patel
semanticscholar +3 more sources
A distributed file service based on optimistic concurrency control [PDF]
The design of a layered file service for the Amoeba Distributed System is discussed, on top of which various applications can easily be intplemented. The bottom layer is formed by the Amoeba Block Services, responsible for implementing stable storage and repficated, highly available disk blocks. The next layer is formed by the Amoeba File Service which
Sape J. Mullender, Andrew S. Tanenbaum
+9 more sources
Optimistic Concurrency Control for Real-world Go Programs (Extended Version with Appendix) [PDF]
We present a source-to-source transformation framework, GOCC, that consumes lock-based pessimistic concurrency programs in the Go language and transforms them into optimistic concurrency programs that use Hardware Transactional Memory (HTM). The choice of the Go language is motivated by the fact that concurrency is a first-class citizen in Go, and it ...
Zhizhou Zhang+3 more
openalex +3 more sources
Concurrency control for on-line transaction processing (OLTP) database management systems (DBMSs) is a nasty game. Achieving higher performance on emerging many-core systems is difficult. Previous research has shown that timestamp management is the key scalability bottleneck in concurrency control algorithms.
Yu, Xiangyao+3 more
openaire +5 more sources