Results 231 to 240 of about 343,466 (294)

Read-Write-Validate Approach for Optimistic Concurrency Control about Michael Kors (MK) Sale Transaction

International Conferences on Computing Advancements
Concurrency describes how database management system normally permits several transactions to access the same database simultaneously. Using the optimistic concurrency control approach, this system aims to demonstrate concurrency control.
O. Hlaing, Hla Hla Htwe, Wai Wai Myint
semanticscholar   +1 more source

Range Optimistic Concurrency Control for a Composite OLTP and Bulk Processing Workload

IEEE International Conference on Data Engineering, 2018
This work addresses the need for efficient key-range validation for a composite OLTP and bulk processing workload characterized by modern enterprise applications.
Jiahao Wang, Peng Cai, Jinwei Guo, Weining Qian, Aoying Zhou   +4 more
semanticscholar   +1 more source

Priority Heuristic in Mobile Distributed Real Time Database Using Optimistic Concurrency Control

2017 23RD Annual International Conference in Advanced Computing and Communications (ADCOM), 2017
Priority scheduling among running transactions is one of the most important issues in the design of mobile distributed real-time database systems (MDRTDBS). In MDRTDBS, to perform correct transaction scheduling, several priority heuristics with different
P. Singh, Udai Shanker
semanticscholar   +1 more source

Optimizing Optimistic Concurrency Control for Tree-Structured, Log-Structured Databases

SIGMOD Conference, 2015
Scaling-out a database system typically requires partitioning the database across multiple servers. If applications do not partition perfectly, then transactions accessing multiple partitions end up being distributed, which has well-known scalability ...
P. Bernstein, Sudipto Das, B. Ding, Markus Pilman   +3 more
semanticscholar   +1 more source

Observations on optimistic concurrency control schemes

Information Systems, 1984
Abstract 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   +2 more sources

An optimistic locking technique for concurrency control in distributed databases

IEEE Transactions on Software Engineering, 1991
A method called optimistic method with dummy locks (ODL) is suggested for concurrency control in distributed databases. It is shown that by using long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated and, during the validation test, only the related sites are checked.
Halıcı, Uğur, DOGAC, A
openaire   +2 more sources

Centiman: elastic, high performance optimistic concurrency control by watermarking

ACM Symposium on Cloud Computing, 2015
We present Centiman, a system for high performance, elastic transaction processing in the cloud. Centiman provides serializability on top of a key-value store with a lightweight protocol based on optimistic concurrency control (OCC). Centiman is designed
B. Ding, Lucja Kot, A. Demers, J. Gehrke
semanticscholar   +1 more source

Effect of transaction start time interval on the performance of optimistic concurrency control scheme in mobile environment

2017 International Conference on Computing Networking and Informatics (ICCNI), 2017
Optimistic concurrency control technique is widely used as non-locking scheme to control concurrent access in mobile database environment. One of the key parameter that dictates the performance of optimistic scheme is the transaction start time interval.
Sirajo Abdullahi Bakura, Aminu Mohammed
semanticscholar   +1 more source

Precise serialization for optimistic concurrency control

Data & Knowledge Engineering, 1999
Abstract Despite the fact that transaction implementation in most commercial database management systems uses locking for concurrency control, optimistic concurrency control has recently gained attention for its efficiency in new types of data-intensive applications such as computer-aided design, computer-aided software engineering, and computer ...
openaire   +2 more sources

Checkpointing for optimistic concurrency control methods

IEEE Transactions on Knowledge and Data Engineering, 1995
Restart-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   +2 more sources