Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
Database system issues in nomadic computing
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Mobile wireless computing: challenges in data management
Communications of the ACM
A mobile transaction model that captures both the data and movement behavior
Mobile Networks and Applications
The Performance of Protocols Based on Locks with Ordered Sharing
IEEE Transactions on Knowledge and Data Engineering
Proclamation-Based Model for Cooperating Transactions
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Value-cognizant Speculative Concurrency Control
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Branching Transactions: A Transaction Model for Parallel Database Systems
BNCOD 12 Proceedings of the 12th British National Conference on Databases: Directions in Databases
Crash Recovery in an Open and Safe Nested Transaction Model
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
Supporting semantics-based transaction processing in mobile database applications
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Maintaining consistency of data in mobile distributed environments
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Distributed lock management for mobile transactions
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
Since mobile transactions are long-lived, in case of a conflict, the waiting transactions are either blocked for longer durations or aborted if two-phase locking is employed for concurrency control. In this paper, we propose mobile speculative locking (MSL) protocol to reduce the blocking of transactions. MSL allows a transaction to release a lock on a data object whenever it produces corresponding after-image value. By accessing both before- and after-images, the waiting transaction carries out speculative executions at the mobile host. Before the end of commit processing, the transaction that has carried out speculative executions retains appropriate execution based on the termination decisions of preceding transactions. The MSL approach requires extra resources at the mobile host to carry out speculative executions. Since mobile host is operated by single user, we assume that it can support a reasonable number of speculative executions. Through analysis it has been shown that MSL increases concurrency with limited resources available at mobile host.