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

提出了移动广播环境中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并发控制协议要优于其它协议。     

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

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

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.     

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

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

移动实时事务预留广播空间的验证协议

在无线数据广播环境中,从移动客户机到服务器的上行带宽非常有限,传统的并发控制协议不适合这种不对称通信环境.本文提出一种可变乐观并发控制协议,服务器周期性向移动客户机广播数据对象,同时把一个广播周期分成若干个子周期,在两个连续的子周期间,一个保留空间被预留来存放服务器更新事务在第一个子周期开始后修改的所有数据对象,移动只读事务通过比较服务器更新事务提交的写集合和自己读集合来自主进行一致性验证,如果只读事务不能通过部分验证,它不会被草率地夭折并重新启动,相反,应用一个改进的向前验证策略,帮助移动只读事务争取更多提交机会.最后,本文进行充分的实验对提出的算法性能进行了评价.     

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.     

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.     

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

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

移动广播环境中的可串行化并发控制协议

研究了非对称通信数据广播环境中的一致性问题．PVTO协议中数据冲突的检测过于严格，存在很多不必要的事务夭折，限制了其并发度；O—PreH协议中数据冲突的检测过于宽松，必要的事务重启要等待服务器校验，浪费了大量昂贵的上行通信带宽．提出了一种新的可串行化并发控制协议BCC—SR．BCC—SR协议将时标段排序和乐观方法相结合，使用了恰当的校验条件，既避免了不必要的事务夭折，又可尽早处理必要的事务重启，节省了系统资源，提高了并发度．实验结果表明，BCC—SR协议能有效改进移动事务的平均响应时间，更好地满足数据广播环境中高性能事务处理的要求．     

移动分布式数据库中的实时事务处理

提出了移动事务实时提交协议(MTRTC)和多版本乐观并发控制协议(MVOCC)处理移动分布式实时事务。MVOCC有效性检查分为局部有效性检查和全局有效性检查,采用动态调整串行次序,避免了不必要的事务重启动,改善了只读事务的响应时间。MTRTC是一个实时提交协议,减少了通信信息。实验结果表明结合MVOCC和MTRTC事务处理协议优于其它事务处理协议。     

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

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

Efficient Dissemination of Transaction-Consistent Data in Broadcast Environments

In this paper, we present a novel protocol for disseminating data in broadcast environments such that view consistency, a useful correctness criterion for broadcast environments, is guaranteed. Our protocol is based on concurrency control information that is constructed by the server and is broadcasted at the beginning of each broadcast cycle. The concurrency control information mainly captures read-from relations among update transactions. A salient feature of the protocol is that the concurrency control information is small in size, but precise enough for reducing unnecessary abortion of mobile transactions. The small-sized concurrency control information implies low communication overhead on broadcasting system. In addition, the computation overheads imposed by the algorithm on the server and the clients are low. We also address the reliability issue of wireless communication and the incorporation of a prefetching mechanism into our protocol. Simulation results demonstrate the superiority of our protocol in comparison with existing methods. Furthermore, we have extended our protocol to deal with local view consistency which requires that all mobile transactions submitted by the same client observe the same serial order of update transactions     

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

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

Implementing Distributed Read-Only Transactions

This paper presents an efficient scheme for eliminating conflicts between distributed read-only transactions and distributed update transactions, thereby reducing synchronization delays. The scheme makes use of a multiversion mechanism in order to guarantee that distributed read-only transactions see semantically consistent snap-shots of the database, that they never have to be rolled-back due to their late arrival at retrieval sites, and that they inflict minimal synchronization delays on concurrent update transactions. Proof that the presented scheme guarantees semantic consistency is provided. Two important by-products of this scheme are that the recovery from transaction and system failures is greatly simplified and the taking of database dumps also can be accommodated while leaving the database on-line.     

移动实时数据库系统多版本数据广播

结合多版本乐观并发控制协议(MVOCC)提出了带失效报告多版本-有效性检查信息 (Multiversion- Validation Information, MV-VI) 广播机制,并给出了多种多版本广播磁盘组织。MV-VI广播机制支持移动主机(MHs)与网络断接。在广播周期中广播事务全局有效性检查信息VI,IR广播后插入多个快速失效报告(Fast Invalidation Report, FIR),广播快速更新的数据。通过模拟仿真,对MV-IV 广播机制进行了性能测试,实验结果表明,MV-IV 广播机制性能明显好于其它广播机制。     

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

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

Efficient execution of read-only transactions in replicatedmultiversion databases

Multiple versions of data are used in database systems to increase concurrency. The higher concurrency results since read-only transactions can be executed without any concurrency control overhead and, therefore, read-only transactions do not interfere with the execution of update transactions. Availability of data in a distributed environment is improved by data replication. We propose a protocol for managing data in a replicated multiversion environment, where execution of read-only transactions or queries becomes completely independent of the underlying concurrency control and replica control mechanisms, and the data availability for read-only transactions increases significantly since they can be executed as long as any one copy of the object is available in the system. In order to validate the feasibility of our approach, we developed a simple prototype to measure the performance improvement in the response times of queries. The results clearly establish the viability of the approach as a useful paradigm for the design of efficient and fault-tolerant distributed database systems     

实时Client/Server数据库多版本两个阶段封锁并发控制协议

提出了实时Client／Server数据库多版本两阶段封锁并发控制协议．该协议具有多版本并发控制机制与两阶段封锁机制的优点，使用如下策略以减少延误截止时间事务数量：若冲突集中有比持锁事务Ti优先级高的事务，且Ti重启动不会延误截止时间，则Ti重启动，冲突集中优先级最高的事务获得锁；否则，冲突集中其它事务等待．为了提高只读事务的响应时间，客户端设有一致数据库影子，只读事务在客户端处理．通过仿真模拟，与2V2PL和OCC—TI—WAIT—50协议进行比较，结果表明：该并发控制协议不仅能有效降低事务延误截止时间率，而且能改善只读事务的响应时间，减少优先级高事务的锁等待时间．协议性能优于2V2PL协议和OCC—TI—WAIT—50协议．     

Effects of broadcast errors on concurrency control in wireless broadcasting environments

In wireless broadcasting environments, mobile clients cannot receive data reliably over broadcast channels because a reliable transmission protocol is not applicable to the channels. If such broadcast errors are not properly handled by a concurrency control algorithm, it could lead to a fatal effect especially when clients are permitted to issue update transactions. However, the effects of broadcast errors on concurrency control have been little researched. In this paper, we have proposed a concurrency control algorithm to support update transactions issued by mobile clients and evaluated the performance of the algorithm by focusing the effects of broadcast errors with an analytic model. The analytic results show our algorithm is efficient in resolving the broadcast errors.     

Concurrency control strategies for ordered data broadcast in mobile computing systems

Although data broadcast has been shown to be an efficient method for disseminating data items in mobile computing systems, the issue on how to ensure consistency and currency of data items provided to mobile transactions (MT), which are generated by mobile clients, has not been examined adequately. While data items are being broadcast, update transactions may install new values for them. If the executions of update transactions and the broadcast of data items are interleaved without any control, mobile transactions may observe inconsistent data values. The problem will be more complex if the mobile clients maintain some cached data items for their mobile transactions. In this paper, we propose a concurrency control method, called ordered update first with order (OUFO), for the mobile computing systems where a mobile transaction consists of a sequence of read operations and each MT is associated with a time constraint on its completion time. Besides ensuring data consistency and maximizing currency of data to mobile transactions, OUFO also aims at reducing data access delay of mobile transactions using client caches. A hybrid re-broadcast/invalidation report (IR) mechanism is designed in OUFO for checking the validity of cached data items so as to improve cache consistency and minimize the overhead of transaction restarts due to data conflicts. This is highly important to the performance of the mobile computing systems where the mobile transactions are associated with a deadline constraint on their completion times. Extensive simulation experiments have been performed to compare the performance of OUFO with two other efficient schemes, the multi-version broadcast method and the periodic IR method. The performance results show that OUFO offers better performance in most aspects, even when network disconnection is common.