A Concurrency Control Method Based on Commitment Ordering in Mobile Databases

@article{Karami2011ACC,
  title={A Concurrency Control Method Based on Commitment Ordering in Mobile Databases},
  author={Ali Karami and Ahmad Baraani-Dastjerdi},
  journal={ArXiv},
  year={2011},
  volume={abs/1112.2155}
}
Disconnection of mobile clients from server, in an unclear time and for an unknown duration, due to mobility of mobile clients, is the most important challenges for concurrency control in mobile database with client-server model. Applying pessimistic common classic methods of concurrency control (like 2pl) in mobile database leads to long duration blocking and increasing waiting time of transactions. Because of high rate of aborting transactions, optimistic methods arent appropriate in mobile… 

Lock-free hybrid concurrency control strategy for mobile environment

A lock-free hybrid concurrency control strategy that combines the features of optimistic and timestamp-ordering strategies is presented that allows mobile devices to freely read data items and allowed to pre-commit while in disconnection mode and propagate the pre-committed data during reconnection for global commitment.

Guaranteeing Global Conflict Serializability in Concurrent Distributed Database Systems using Commitment Ordering

A top down approach is presented to ensure proper execution of global transactions across client server systems and Commitment ordering applicable to distributed systems environment is explored in order to address latency between transactions.

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

This paper evaluates the effect of different transaction start time intervals on the performance of optimistic strategy in terms of aborted transaction rate and response time and shows thatTransaction start time interval of 300 milliseconds incurred less number of aborted transactions without sacrificing response time.

Concurrency control for real‐time and mobile transactions: Historical view, challenges, and evolution of practices

A taxonomy of concurrency control solutions is defined and the maturity of these solutions is assessed in the light of characteristics of real‐time and mobile environment.

Mobile Transaction Processing for a Distributed War Environment

  • Romani Farid Ibrahim
  • Computer Science
    2019 14th International Conference on Computer Science & Education (ICCSE)
  • 2019
This research proposes two transaction techniques to handle the disconnection problem during transaction processing and uses different concurrency control protocols, depending on the nature of the transaction and not a one Concurrency control protocol for all types of transactions.

TRANSACTION PROCESSING, TECHNIQUES IN MOBILE DATABASE: An OVERVIEW

The mobile database environment is shown and a lot of proposed model of mobile transaction is overviewed and many techniques used to enhance transaction execution are shown.

All nearest neighbor calculation based on Delaunay graphs

The performance of this algorithm is compared with one of the best existing algorithms for computing ANN operator in terms of CPU time and the number of IOs and the experimental results show that this algorithm has better performance than the other.

An Efficient Concurrency Control Technique for Mobile Database Environment

A modified optimistic concurrency control scheme is proposed which is based on the number of data items cached, amount of execution time and current load of the database server, and Experimental results show performance benefits, such as increase in average response time and decrease in waiting time of the transactions.

References

SHOWING 1-10 OF 24 REFERENCES

A Timestamp-Based Optimistic Concurrency Control for Handling Mobile Transactions

This paper proposes an OCC/DTA (Optimistic Concurrency Control with Dynamic Timestamp Adjustment) protocol that can be efficiently adapted to mobile computing environments and reduces communication overhead by using client-side validation procedure and enhances transaction throughput by adjusting serialization order without violating transaction semantics.

A transaction model and multiversion concurrency control for mobile database systems

Experimental results demonstrate that the proposed multi-versions transaction processing approach and a deadlock-free concurrency control mechanism based on multiversiontwo-phase locking scheme integrated with a timestamp approach provide significantly higher throughput.

A Real Time Optimistic Strategy to achieve Concurrency Control in Mobile Environments Using On-demand Multicasting

An optimistic concurrency control strategy using on-demand multicasting is proposed for mobile database environments which guarantees consistency and introduces application-specific conflict detection and resolution strategies.

Hybrid concurrency control for mobile computing

A hybrid concurrency control scheme which can alleviate the effects of frequent disconnections and bandwidth limitations in mobile computing environments and reduces the number of aborts and the validation time without message overheads is proposed.

Concurrency Control Strategy to Reduce Frequent Rollbacks in Mobile Environments

  • S. A. MoizL. Rajamani
  • Computer Science
    2009 International Conference on Computational Science and Engineering
  • 2009
This paper proposes a preemptive dynamic timer adjustment strategy which achieves concurrency control and at the same time reduces the frequent rollbacks and experimental results show better throughput, increase in commit rates and reduction in number of rollbacks.

Pre-serialization of long running transactions to improve concurrency in mobile environments

This paper proposes a novel method in order to improve concurrency of particular kind of transaction, known as long running transactions, and designs a sort of hybrid approach between optimistic and pessimistic concurrency models.

Concurrency Control without Locking in Mobile Environments

  • S. A. MoizM. K. Nizamuddin
  • Computer Science
    2008 First International Conference on Emerging Trends in Engineering and Technology
  • 2008
A lockless concurrency control mechanism which helps in reducing the communication overhead and enhances the transaction throughput and the performance trade off benefits of the proposed approach is proposed.

Single Lock Manager Approach for Achieving Concurrency Control in Mobile Environments

A concurrency control mechanism with dynamic timer adjustment which helps in reducing the communication overhead and enhances the transaction throughput and the performance trade off metrics is proposed.

Efficient validation of mobile transactions in wireless environments

The Principle of Commitment Ordering, or Guaranteeing Serializability in a Heterogeneous Environment of Multiple Autonomous Resource Mangers Using Atomic Commitment

CO generalizes the popular Strong-Strict Two Phase Locking concept (S-S2PL; “release locks applied on behalf of a transaction only after the transaction has ended”) and exhibits deadlocked executions when implemented as nonblocking (optimistic) concurrency control mechanisms.