Transaction processing in PRO-MOTION
Proceedings of the 1999 ACM symposium on Applied computing
Transactional Cache Management with Aperiodic Invalidation Scheme in Mobile Environments
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Speculative Lock Management to Increase Concurrency in Mobile Environments
MDA '99 Proceedings of the First International Conference on Mobile Data Access
Quorum-Based Locking Protocol in Nested Invocations of Methods
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
O2PC-MT: A Novel Optimistic Two-Phase Commit Protocol for Mobile Transactions
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Quorum-Based Protocol for Locking Replicas of Objects
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
A Survey of Mobile Transactions
Distributed and Parallel Databases
Replica Placement Algorithms for Mobile Transaction Systems
IEEE Transactions on Knowledge and Data Engineering
Concurrency control for mobile transactions in presence of bandwidth variability
ICCC'11 Proceedings of the 2011 international conference on Computers and computing
| Hi-index | 0.00 |
Abstract: We present a new lock management scheme which allows a read unlock for an item to be executed at any copy site of that item; the site may be different from the copy site on which the read lock is set. The scheme utilizes the replicated copies of data items to reduce the message costs incurred by the mobility of the transaction host. We demonstrate this idea in an optimistic locking algorithm called O2PL-MT (Optimistic Two Phase Locking for Mobile Transactions). Like its counterpart algorithm O2PL (Optimistic Two Phase Locking), O2PL-MT grants read locks immediately on demand and defers write locks until the commitment time. However, O2PL-MT requires the transmission of fewer messages than O2PL in a mobile environment in which data items are replicated.