节点文献
基于关联事务的移动数据库冲突处理算法
Conflict Reconciliation Algorithm Based on Union-transaction in Mobile Database
【摘要】 移动数据库系统由于自身的特点采用乐观复制机制。该文引入关联事务的概念,提出关联事务划分算法(UTDA)及冲突处理算法(CRA)。UTDA算法将移动终端在本地提交的移动事务划分成关联事务,把关联事务作为数据同步和冲突处理的基本粒度。实验结果表明,UTDA算法满足事务执行的原子性和串行性,提交时间比传统事务提交时间减少了2/3,为移动数据库系统的冲突处理提供了可行的解决方案。
【Abstract】 Mobile database system adopts optimistic replication mechanism because of its characteristics.This article introduces the concept of union-transaction,presents Union-Transaction Division Algorithm(UTDA) and Conflict Reconciliation Algorithm(CRA).UTDA algorithm divides mobile transactions in mobile terminal into union-transactions,makes union-transaction as basic granularity of data synchronization and conflict reconciliation.Experimental results show that UTDA algorithm satisfies atomic and serializability of transaction execution.The cost of commit time falls by two-third approximately.It provides a kind of feasible scheme for conflict reconciliation of mobile database system.
- 【文献出处】 计算机工程 ,Computer Engineering , 编辑部邮箱 ,2008年16期
- 【分类号】TP311.13
- 【被引频次】17
- 【下载频次】103