Distributed Version Management for Read-Only Actions
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Modular synchronization in multiversion databases: version control and concurrency control
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Replica control in distributed systems: as asynchronous approach
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
Concurrency control for high contention environments
ACM Transactions on Database Systems (TODS)
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Database Systems (TODS)
Building information systems for mobile environments
CIKM '94 Proceedings of the third international conference on Information and knowledge management
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 serializability of concurrent database updates
Journal of the ACM (JACM)
Mobile data and transaction management
Information Sciences—Informatics and Computer Science: An International Journal
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
A Model for Adaptable Systems for Transaction Processing
IEEE Transactions on Knowledge and Data Engineering
The Performance of Protocols Based on Locks with Ordered Sharing
IEEE Transactions on Knowledge and Data Engineering
Split-Transactions for Open-Ended Activities
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
An Adaptable Constrained Locking Protocol for High Data Contention Environments
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Crash Recovery in an Open and Safe Nested Transaction Model
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Improving data consistency in mobile computing using isolation-only transactions
HOTOS '95 Proceedings of the Fifth Workshop on Hot Topics in Operating Systems (HotOS-V)
Supporting semantics-based transaction processing in mobile database applications
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
A Transaction Model for Mobile Computing
IDEAS '98 Proceedings of the 1998 International Symposium on Database Engineering & Applications
Maintaining consistency of data in mobile distributed environments
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
NESTED TRANSACTIONS: AN APPROACH TO RELIABLE DISTRIBUTED COMPUTING
A Multi-version Transaction Model to Improve Data Availability in Mobile Computing
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
A Survey of Mobile Transactions
Distributed and Parallel Databases
Making Distributed Transactions Resilient to Intermittent Network Connections
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
A transaction model and multiversion concurrency control for mobile database systems
Distributed and Parallel Databases
A collective transaction processing scheme for mobile environment
Proceedings of the 2009 International Conference on Hybrid Information Technology
On the design of perturbation-resilient atomic commit protocols for mobile transactions
ACM Transactions on Computer Systems (TOCS)
A multi-version data model and semantic-based transaction processing protocol
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Hi-index | 0.00 |
We incorporate a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the future value that the data object will have after the final commit of the transaction. Once a transaction reads all the values and declares all the prewrites, it can pre-commit at mobile host (MH) (computer connected to unreliable mobile communication network). The remaining transaction's execution (writes on database) is shifted to the mobile service station (MSS) (computer connected to the reliable fixed network). Writes on database consume time and resources and are therefore shifted to MSS and delayed. This reduces wireless network traffic congestion. Since the responsibility of expensive part of the transaction's execution is shifted to the MSS, it also reduces the computing expenses at mobile host. A pre-committed transaction's prewrite values are made visible both at mobile and at fixed database servers before the final commit of the transaction. Thus, it increases data availability during frequent disconnection common in mobile computing. Since a pre-committed transaction does not abort, no undo recovery needs to be performed in our model. A mobile host needs to cache only prewrite values of the data objects which take less memory, transmission time, energy and can be transmitted over low bandwidth. We have analysed various possible schedules of running transactions concurrently both at mobile and fixed database servers. We have discussed the concurrency control algorithm for our transaction model and proved that the concurrent execution of our transaction processing model produces only serializable schedules. Our performance study shows that our model increases throughput and decreases transaction-abort-ratio in comparison to other lock based schemes. We have briefly discussed the recovery issues and implementation of our model.