数据广播环境下移动实时事务的有效并发控制

在无线数据广播环境下,从移动客户机到数据库服务器的上行带宽非常有限.传统的并发控制协议不适合这种不对称通讯环境.本文结合乐观并发控制协议和时标排序协议提出一种并发控制协议.只读事务满足弱一致性,包含所有更新事务和一个移动只读事务的可串行化图是非循环的.使用本文提出的并发控制协议,移动只读事务能够自主执行,移动更新事务能够较早地检测到数据冲突.模拟试验显示,我们提出的协议相对其它已经存在的并发控制协议来说,能够更好地满足事务截止期.     

移动广播环境中实时事务处理性能研究

提出了移动广播环境中MVOCC-DA-2PV(Multiversion Optimistic Concurrency Control with Dynamic Adjustment of serialization order using Two-Phase Validation)并发控制协议。移动实时事务处理分两阶段进行。第一阶段在移动主机(MobileHosts,MHs)上处理,第二阶段在服务器上处理。移动主机(MHs)上所有移动事务执行部分向后有效性确认,与在服务器提交事务进行有效性确认。如果移动事务通过MH上部分有效性确认,提交到服务器进行最终有效性确认。如此早地检测数据冲突,节省了处理和通信资源。协议消除了移动只读事务和移动更新事务的冲突,使用多版本动态调整串行次序技术,避免了不必要的事务重启动。降低了移动只读事务的响应时间。通过模拟仿真,对MVOCC-DA-2PV协议进行了性能测试,并与PVTO和HP2PL进行了比较。实验结果表明MVOCC-DA-2PV并发控制协议要优于其它协议。     

移动广播环境中有效处理实时只读事务

提出了移动广播环境中有效处理实时只读事务的方法。给出了多种多版本广播磁盘组织。采用多版本机制，实现移动只读事务无阻塞提交。通过乐观方法，消除移动只读事务和移动更新事务的冲突。使用多版本动态调整串行次序技术，避免了不必要的事务重启动。在移动主机上如果移动只读事务通过向后有效性确认，则可提交，不需要提交到服务器处理，降低移动只读事务的响应时间。通过模拟仿真对提出的方法进行了性能测试,实验结果表明新方法要优于其他协议。     

移动计算环境中实时嵌套事务并发控制协议的研究

提出了移动计算环境中多版本乐观并发控制协议(MultiversionOptimisticConcurrencyControl,MVOCC)处理移动实时嵌套事务.协议消除了只读事务和更新事务之间冲突,通过动态调整事务串行次序,避免不必要的事务重启动.只读事务在移动主机处理,只读事务的响应时间大大改善.事务有效性检查分两级局部有效性检查和全局有效性检查.局部有效性检查在移动主机进行.通过局部有效性检查的事务提交到服务器进行全局有效性检查.如此早地检测数据冲突,节省了处理和通信资源.通过模拟仿真,对协议进行了性能测试,并与OCC-TI-WAIT50和HP2PL协议进行了比较.实验结果表明该协议要优于其它协议.协议不但能有效地降低事务的重启动率和延误截止时间率,而且改善只读事物的响应时间.     

移动分布式实时数据库中并发控制框架

在移动分布式数据库系统中采用三层结构，提出了DMVOCC-DA-2PLV（Distributed Multiversion Optimistic Concurrency Control—Dynamic Adjustment of Serialization Order-Two-Phase Local Validation）协议处理移动分布式实时事务。移动实时事务处理分两阶段进行。第一阶段在移动主机（MHs）上处理，并进行局部部分有效性检查性确认，使用向后有效性确认机制，与在服务器提交事务进行有效性确认。及早地检测数据冲突，节省了处理和通信资源。第二阶段在服务器处理，通过局部部分有效性确认的事务，提交到服务器进行局部最终有效性确认。协议消除了移动只读事务和移动更新事务的冲突，使用多版本动态调整串行次序技术，避免了不必要的事务重启动。如果移动只读事务所有读数据项通过局部部分向后有效性确认，则可提交，大大降低了移动只读事务的响应时间。在全局有效性确认中对分布更新事务进行检查，以保证分布串行性。通过模拟仿真，对DMVOCC-DA-2PV协议进行了性能测试，并与DTO-2PC和DHP-2PL进行了比较。实验结果表明DMVOCC-DA-2PV并发控制协议要优于其它协议。     

实时Client/Server数据库并发控制和恢复机制研究

该文提出了实时Client／Server数据库系统多版本两阶段封锁并发控制协议和有效的恢复机制。协议区分只读事务和更新事务。只读事务在执行读操作时遵从多版本时间排序协议,更新事务执行强两阶段封锁协议,即持有全部锁直到事务结束。只读事务读请求从不失败,不必等待等特性。在典型数据库系统中,读操作比写操作频繁。这个特性对于实践来说至关重要。为了提高只读事务的响应时间,协议让每个客户端与一个一致数据库影子相联,只读事务在客户端处理。更新事务提交到服务端运行。服务端每个事务Ti在提交时系统必须向所有客户端广播信息。客户端根据得到的广播信息自动构造一致数据库影子。一致数据库影子还将用于系统恢复。通过仿真模拟。与2V2PL和OCC-TI-WAIT-50协议进行比较,结果表明：该并发控制协议不仅能有效降低事务延误截止时间率和重起动率,而且能改善只读事务的响应时间,减少优先级高事务的锁等待时间。协议性能优于2V2PL协议和OCC-TI-WAIT-50协议。     

一种嵌入式移动实时数据库的并发控制策略

嵌入式移动实时事务的并发控制除了满足传统事务的基本特性外,还要着重考虑优先级颠倒、不必要的事务重启和全局数据一致性及混合事务系统的性能等问题.基于绝对串行化时序与选择重启的乐观并发控制算法(OCC-ASTOSR),利用绝对时标在广播循环的支持下调整移动客户端和中心数据库服务器上的事务串行化顺序,检测事务的数据访问冲突,并应用选择重启的方法解决冲突.事务随着运行过程更新读写数据集信息,每个数据对象都维护相关的时间信息,通过无线网络通信传递这些控制信息,交互地完成移动客户端和中心服务器中的本地事务验证和移动事务两阶段验证提交.     

移动事务并发控制技术的研究

为有效降低移动计算环境下事务处理的重启动率、提高事务的吞吐量,在研究传统并发控制协议的基础上,提出了一种数据锁乐观并发控制协议DLOCC,DLOCC协议结合了锁并发控制协议与乐观并发控制协议的优点,利用数据项的更新次数和访问概率将服务器上的海量数据进行分类,依据不同的数据类型采用相应的并发控制协议.模拟实验结果表明,DLOCC协议性能优于OCC-TI协议,有效地提高了系统资源利用率.     

移动实时数据库系统中的更新分发

数据广播作为移动计算环境下有效的数据分发技术已有许多研究,当数据广播用于发送不断更新的数据时称它为更新分发．现有的更新分发协议因没有考虑实时数据库系统中数据和事务的定时要求而不适合移动实时只读事务的处理．重点研究了移动实时数据库系统中更新分发的问题,提出了混合前向多版本数据广播协议,该协议在保证事务一致性的同时满足了数据和事务的定时约束．模拟实验表明,该协议能够有效地降低事务错过率和提高数据流行性,较现有更新分发协议更适合移动实时只读事务的处理．     

移动数据库中数据更新与广播的并发控制

移动数据库系统中数据更新与数据广播并发处理,导致移动客户读取的数据可能不一致,本文分析了在移动数据库中数据更新与数据广播并发处理中可能出现的三类数据冲突,并提出了基于UFBL0原则的并发控制策略来解决上述的问题。该策略具有较好的独立性,对服务器和移动客户机的影响都较小,并且可以较大限度地提高广播给用户的数据项当前性。     

Efficient validation of mobile transactions in wireless environments

In broadcast environments, the limited bandwidth of the upstream communication channel from the mobile clients to the server bars the application of conventional concurrency control protocols. In this paper, we propose a new variant of the optimistic concurrency control (OCC) protocol that is suitable for broadcast environments. At the server, forward validation of a transaction is done against currently running transactions, including mobile transactions and server transactions. At the mobile clients, partial backward validation of a transaction is done against committed transactions at the beginning of every broadcast cycle. Upon completion of execution, read-only mobile transactions can be validated and committed locally and update mobile transactions are sent to the server for final validation. These update transactions have a better chance of commitment because they have gone through the partial backward validation. In addition to the nice properties of conventional OCC protocols, this protocol provides autonomy between the mobile clients and the server with minimum upstream communication, which is a desirable feature to the scalability of applications running in broadcast environments. This protocol is able to process both update transactions and read-only transactions at the mobile clients at low space and processing overheads.     

A concurrency control scheme for mobile transactions in broadcast disk environments

Broadcast disk technique has been often used to disseminate frequently requested data efficiently to a large volume of mobile clients over wireless channels. In broadcast disk environments, a server often broadcasts different data items with differing frequencies to reflect the skewed data access patterns of mobile clients. Previously proposed concurrency control methods for mobile transactions in wireless broadcast environments are focused on the mobile transactions with uniform data access patterns. These protocols perform poorly in broadcast disk environments where the data access patterns of mobile transactions are skewed. In broadcast disk environments, the time length of a broadcast cycle usually becomes large to reflect the skewed data access patterns. This will often cause read-only transactions to access old data items rather than the latest data items. Furthermore, updating mobile transactions will be frequently aborted and restarted in the final validation stage due to the update conflict of the same data items with high access frequencies. This problem will increase the average response time of the update mobile transactions and waste the uplink communication bandwidth. In this paper, we extend the existing FBOCC concurrency control method to efficiently handle mobile transactions with skewed data access patterns in broadcast disk environments. Our method allows read-only transactions to access the more updated data, and reduces the average response time of updating transactions through early aborts and restarts. Our method also reduces the amount of uplink communication bandwidth for the final validation of the update transactions. We present an in-depth experimental analysis of our method by comparing with existing concurrency control protocols. Our performance analysis shows that it significantly decreases the average response time and the amount of uplink bandwidths over existing methods.     

An energy-efficient mobile transaction processing method using random back-off in wireless broadcast environments

Broadcast is widely accepted as an efficient technique for disseminating data to a large number of mobile clients over a single or multiple channels. Due to the limited uplink bandwidth from mobile clients to server, conventional concurrency control methods cannot be directly applied. There has been many researches on concurrency control methods for wireless broadcast environments. However, they are mostly for read-only transactions or do not consider exploiting cache. They also suffer from the repetitive aborts and restarts of mobile transactions when the access patterns of mobile transactions are skewed. In this paper, we propose a new optimistic concurrency control method suitable for mobile broadcast environments. To prevent the repetitive aborts and restarts of mobile transactions, we propose a random back-off technique. To exploit the cache on mobile clients, our method keeps the read data set of mobile transactions and prefetches those data items when the mobile transactions are restarted. As other existing optimistic concurrency control methods for mobile broadcast environments does, it works for both read-only and update transactions. Read-only transactions are validated and locally committed without using any uplink bandwidth. Update transactions are validated with forward and backward validation, and committed after final validation consuming a small amount of uplink bandwidth. Our performance analysis shows that it significantly decreases uplink and downlink bandwidth usage compared to other existing methods.     

移动数据库广播的并发控制算法研究

在基于数据广播的移动信息服务中,由于更新数据和广播数据两个过程是并发执行的,所以移动客户将面临接收数据不一致性问题。为此,该文提出了一种基于规则的并发控制算法来解决以上问题。在允许同步更新的情况下采用事件-条件-操作规则来进行无冲突的数据广播。该算法对移动机和数据库服务器的影响很小,同时又为基于广播的移动计算提供了数据一致性服务。     

Concurrency control in mobile distributed real-time database systems

This paper presents DMVOCC-2PLV (Distributed Multiversion Optimistic Concurrency Control with Two-Phase Local Validation) protocol for processing mobile distributed real-time transactions in mobile broadcast environments. In DMVOCC-2PLV protocol, transaction validation is performed at two levels: local validation and global validation. Local validation of transactions is performed in two phases: local pre-validation and local final validation. At the MHs (Mobile Hosts), all mobile transactions perform local pre-validation of transactions by using a backward validation mechanism. The local pre-validation process is carried out against committed transactions at the server in the last broadcast cycle. Such an early data conflict detection feature can save processing and communication resources. Transactions that survive in local pre-validation must be submitted to the server for local final validation. In global validation distributed update transactions have to check to ensure distributed serializability in all participants. The protocol can eliminate conflicts between mobile read-only and mobile update transactions, and resolve data conflicts flexibly using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly reduced. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. The results of simulation experiment show that the new protocol proposed offers better performance in terms of miss rate, restart rate, commit rate and throughput.