We discuss and prove the correctness of a transaction model for mobile computing. In our transaction model, we incorporate a prewrite operation (before a write) which does not update the state of a data object but makes visible the value that the data object will have after the commit of the transaction. Once a transaction read all the values and declares all the prewrite values, it pre-commits at mobile host. A pre-committed transaction's prewrite values are made visible both at mobile and stationary hosts before the final commit. Thus, increases data availability. A pre-committed transaction's remaining execution (i..e, writes on database) is delayed and shifted to the mobile service station to reduce the computing expenses at mobile host. We have analysed various cases of running transactions concurrently both at mobile and stationary hosts. We have proved that our algorithm produces only serializable schedules.
Sanjay Kumar Madria, Bharat K. Bhargava