一种基于乐观方法的安全实时并发控制协议

实时数据库通常应用在一些安全关键类应用中，如电子商务、股票交易、军事指挥系统等。在这样一些应用中，实时数据库系统需同时满足两方面的需求：确保数据安全和尽可能减低实时事务错过截止期的比率。然而，通常这两方面需求是相互冲突的，满足一方面是以牺牲另一方面为代价。本文提出了一种基于乐观方法的安全实时并发控制协议，该协议将安全约束整合到实时乐观并发控制协议中，并能根据应用的需求在安全性和实时性方面进行了适当的折中。性能测试结果显示，该协议在确保数据安全的同时并未明显地降低实时性能。     

NCS中实时数据库的多版本并发控制研究

实时数据库是网络控制系统(NCS)的重要组成部分,是整个控制系统中数据交换的平台。本文在原有的两段锁机制的基础上,提出一种适用于多版本的两段锁并发控制方法。简述数据多版本给现场控制带来的不利影响。分析在数据多版本的情况下,现场事务的可串行性,用多版本并发控制协议MV2PL解决多版本并发控制问题。用简化的多版本并发协议2V2PL说明它的正确性,并通过实例表明该协议是可行的。     

Alternative correctness criteria for concurrent execution oftransactions in multilevel secure databases

Investigates issues related to transaction concurrency control in multilevel secure databases. This paper demonstrates how the conflicts between the correctness requirements and the secrecy requirements can be reconciled by proposing two different solutions. It first explores the correctness criteria that are weaker than one-copy serializability. Each of these weaker criteria, though not as strict as one-copy serializability, is required to preserve database consistency in some meaningful way, and moreover, its implementation does not require the scheduler to be trusted. It proposes three different, increasingly stricter notions of serializability (level-wise serializability, one-item read serializability and pair-wise serializability) that can serve as substitutes for one-copy serializability. The paper then investigates secure concurrency control protocols that generate one-copy serializable histories and presents a multiversion timestamping protocol that has several very desirable properties: it is secure, produces multiversion histories that are equivalent to serial one-copy histories in which transactions are placed in a timestamp order, eliminates starvation and can be implemented using single-level untrusted schedulers     

一种实时数据库系统的基于时间戳的多版本并发控制协议

实时数据库系统的定时限制包括数据的定时限制和事务的定时限制,一个好的并发控制协议必须要较好地满足这些定时限制。文章详细讨论了与并发控制有关的实时数据和实时事务的各种特征以及分类。并根据这些特点对传统数据库系统的多版本并发控制机制进行了扩展,提出了一种基于时间戳的多版本实时数据库系统的并发控制协议。该协议对硬实时事务不产生任何延迟,能够很好地保证实时事务和实时数据的定时限制,缺点是该并发控制协议仅是一个准一致性的协议。     

并行数据库实时多版本并发控制协议性能研究

随着对实时数据库事务处理性能要求的不断提高 ,将并行数据库和实时数据库相结合的并行实时数据库将成为新的发展方向 .然而通常的实时多版本并发控制协议不适合并行数据库的无共享结构 .比较了几种并发控制协议在无共享结构下的性能 ,该文提出了一种并行实时多版本并发控制协议 .它能有效地减少事务的重启 ,降低事务的错过率 .在长短事务混合的情况下 ,它的性能比其它的并发控制协议更好 .同时 ,它具有更好的可扩展性 .作者利用仿真模型对该协议进行了性能测试 ,与其它协议进行了比较 ,并分析了实验结果 ,仿真实验结果表明该协议性能良好     

实时数据库的准一致性可串行化并发控制

可串行化的并发控制对传统应用是合适的,它旨在确保数据的“绝对正确”性,然而在实时数据库中,事务的定时限制往往比数据的“绝对正确”性更重要。为此,本文提出了新颖的准一致性可串行化的并发控制策略,文中着重讨论了准一致性可串行化的有关概念与理论,调度的可准一致性可串行化的判别方法,并发控制协议以及在事务的准一致性可串行化并发执行中不一致性传播放大的控制策略。     

Real-time transaction scheduling in database systems

A database system supporting a real-time application, which can be called “a real-time database system (RTDBS)”, has to provide real-time information to the executing transactions. Each RTDB transaction is associated with a timing constraint, usually in the form of a deadline. Efficient resource scheduling algorithms and concurrency control protocols are required to schedule the transactions so as to satisfy both timing constraints and data consistency requirements. In this paper,^† we concentrate on the concurrency control problem in RTDBSs. Our work has two basic goals: real-time performance evaluation of existing concurrency control approaches in RTDBSs, and proposing new concurrency control protocols with improved performance. One of the new protocols is locking-based, and it prevents the priority inversion problem^{, †} by scheduling the data lock requests based on prioritizing data items. The second new protocol extends the basic timestamp-ordering method by involving real-time priorities of transactions in the timestamp assignment procedure. Performance of the protocols is evaluated through simulations by using a detailed model of a single-site RTDBS. The relative performance of the protocols is examined as a function of transaction load, data contention (which is determined by a number of system parameters) and resource contention. The protocols are also tested under various real-time transaction processing environments. The performance of the proposed protocols appears to be good, especially under conditions of high transaction load and high data contention.     

Integrating security and real-time requirements using covertchannel capacity

Database systems for real-time applications must satisfy timing constraints associated with transactions in addition to maintaining data consistency. In addition to real-time requirements, security is usually required in many applications. Multi-level security requirements introduce a new dimension to transaction processing in real-time database systems. In this paper, we argue that, due to the conflicting goals of each requirement, tradeoffs need to be made between security and timeliness. We first define mutual information, a measure of the degree to which security is being satisfied by a system. A secure two-phase locking protocol is then described and a scheme is proposed to allow partial violations of security for improved timeliness. Analytical expressions for the mutual information of the resultant covert channel are derived, and a feedback control scheme is proposed that does not allow the mutual information to exceed a specified upper bound. Results showing the efficacy of the scheme obtained through simulation experiments are also discussed     

Hybrid protocols using dynamic adjustment of serialization order for real-time concurrency control

Conclusions Time-critical scheduling in real-time database systems has two components: real-time scheduling and concurrency control. While both concurrency control and real-time scheduling are well-developed and well-understood, there is only limited knowledge about the integration of concurrency control and real-time scheduling. Though recently the problem has been studied actively, the proposed solutions are still at an initial stage. A major source of problems in integrating the two is the lack of coordination in the development. They are developed on different objectives and incompatible assumptions (Buchmann 1989).Most of the proposed work for real-time concurrency control employ a simple method to utilize one concurrency control scheme such as 2PL, TO and OCC, and to consider the priority of operations inherited from the timing constraints of transactions in operation scheduling. This method has an inherent disadvantage of being limited by the concurrency control method used as the base. Since neither of pessimistic nor optimistic concurrency control is satisfactory by itself for real-time scheduling, this simple method using only one control can hardly satisfy the timing requirements of RTDBS. Problems such as excessive blocking, wasted restarts, and priority inversion are serious in RTDBS.In this paper, we proposed two real-time transaction scheduling protocols which employ a hybrid approach, i.e., a combination of both pessimistic and optimistic approaches. These protocols make use of a new conflict resolution scheme called dynamic adjustment of serialization order, which supports priority-driven scheduling, and avoids unnecessary aborts.This work was supported in part by ONR, by NRaD, by DOE, and by IBM.     

实时数据库系统中的并发控制协议及分析

实时数据库系统是事务和数据都具有显示的时间限制的数据库系统,与传统的数据库系统相比,其调度和并发控制策略、方法、机制有所不同。该文在分析实时数据库系统事务并发执行的新特点的基础上,介绍了几种具有代表意义的并发控制协议,总结了三种用于分析比较并发控制性能的方法,并分析了上述并发控制协议的性能。     

基于验证因子的实时多版本并发控制

为了解决乐观并发控制方法的不必要重启与即将超过截止期事务的重启引发的负载问题，提出了验证因子的概念及基于验证因子的实时多版本并发控制方法（MVOCC-VF）．通过对验证因子的检测，优先调度完成度较高的事务；同时结合多版本技术增强事务调度的并发度，避免了更多的不必要重启问题，尤其能有效保证即将超截止期事务的完成，并证明了协议的正确性．实验结果表明：与已有的实时并发控制方法相比，MVOCC—VF降低了事务重启个数及超截止期百分率，提高了系统的总体性能．     

广播环境中的移动实时事务并发控制

研究了实时数据广播中的一致性问题，由于广播环境的通信不对称性，传统的可串行化并发控制协议显得过于严格，不必要，不可行，为此，提出使用伪可串行化并发控制；形式化定义了伪可串行化的概念，证明了它虽经传统可串行宽松但能保证数据一致性，给出相应的并发控制协议，实验结果表明，新协议可显著降低平均响应时间，使更多移动实时事务满足截止期要求。     

并行数据广播中的亚可串行化并发控制

考虑到移动计算环境的诸多限制以及移动数据库应用的特征,传统冲突可串行化在不对称通信的数据广播环境中显得过于严格而不必要.为此,文中提出一种并行亚可串行化并发控制协议.首先,形式化定义亚可串行化正确性准则,证明亚可串行化虽然比冲突可串行化宽松但能始终保证一致性,给出保证亚可串行化的充分必要条件.进而,提出相应的并行亚可串行化并发控制协议BCC-HSR.实验结果表明,BCC-HSR协议能有效改进移动事务的平均响应时间,更好地满足并行数据广播环境中高性能事务处理的要求.     

无线移动环境中的拉式实时并发控制机制

考虑到诸如带宽、移动性、频繁断接等限制，传统可串行化并发控制协议显得过于严格而无法满足移动实时数据库环境的要求。该文首先形式化定义并分析了弱可串行化正确性准则，弱可串行化比传统冲突可串行化宽松且能始终保证数据库的一致性。进而给出了一种适宜于移动实时数据库的弱可串行化并发控制协议WMHP-2PL。最后性能实验证实了新协议的有效性。     

基于多版本的安全实时并发控制协议

安全实时数据库必须同时满足安全性和实时性,然而这两者有时可能相互冲突.为了解决这种冲突,提出了基于多版本的安全实时并发控制协议.协议为每个数据对象提供两个版本:工作版本和只读版本,根据事务和数据对象的安全级为事务提供不同的数据版本,有效地解决了实时性与安全性之间的冲突,最后给出了协议的正确性证明.     

Algorithm to Process Read-only Transactions in Real-time Environments

In this study, we investigate a different approach to maintaining serializability in real-time database systems (RTDBS) such that concurrency among transactions can be increased. The study is motivated by the dominance of read only transactions (ROTs) in many real-time applications. Given the knowledge about the read/write characteristics of transactions, it can be more efficient and effective to process ROTs separately from update transactions (UTs). In particular, we have devised an independent algorithm to process ROTs while a conventional concurrency control protocol such as optimistic concurrency control (OCC) can be employed to process UTs. Using a separate algorithm to process ROTs can reduce the interference between UTs and ROTs. The undesirable overhead caused by transaction restart and blocking due to concurrency control can be alleviated. Consequently, the timeliness of the system can be improved. The performance of using this approach is examined through a series of simulation experiments. The results showed that the performance of ROTs in terms of miss rate and restart rate is improved significantly while the performance of UTs is also improved slightly. As a result, separate processing of ROTs is a viable approach that achieves better performance and resource utilization than using solely the OCC protocol, one of the best performing protocols in the literature of real-time database.     

Processing real-time transactions in a replicated database system

A database system supporting a real-time application has to provide real-time information to the executing transactions. Each real-time transaction is associated with a timing constraint, typically in the form of a deadline. It is difficult to satisfy all timing constraints due to the consistency requirements of the underlying database. In scheduling the transactions it is aimed to process as many transactions as possible within their deadlines. Replicated database systems possess desirable features for real-time applications, such as a high level of data availability, and potentially improved response time for queries. On the other hand, multiple copy updates lead to a considerable overhead due to the communication required among the data sites holding the copies. In this paper, we investigate the impact of storing multiple copies of data on satisfying the timing constraints of real-time transactions. A detailed performance model of a distributed database system is employed in evaluating the effects of various workload parameters and design alternatives on the system performance. The performance is expressed in terms of the fraction of satisfied transaction deadlines. A comparison of several real-time concurrency control protocols, which are based on different approaches in involving timing constraints of transactions in scheduling, is also provided in performance experiments. Recommended by: A. ElmagarmidThis work was initiated while the author was at the Computer Science Department, University of Illinois at Urbana-Champaign.     

Evaluation of concurrency control strategies for mixed soft real-time database systems

Previous research in real-time concurrency control mainly focuses on the schedulability guarantee of hard real-time transactions and the reduction of the miss rate of soft real-time transactions. Although many new database applications have significant response time requirements, not much work has been done in the joint scheduling of traditional non-real-time transactions and soft real-time transactions. In this paper, we study the concurrency control problems in mixed soft real-time database systems, in which both non-real-time and soft real-time transactions exist simultaneously. The objectives are to identify the cost and the performance tradeoff in the design of cost-effective and practical real-time concurrency control protocols, and to evaluate their performance under different real-time and non-real-time supports. In particular, we are interested in studying the impacts of different scheduling approaches for soft real-time transactions on the performance of non-real-time transactions. Instead of proposing yet another completely new real-time concurrency control protocol, our objective is to design an efficient integrated concurrency control method based on existing techniques. We propose several methods to integrate the well-known two phase locking and optimistic concurrency control with the aims to meet the deadline requirements of soft real-time transactions and, at the same time, to minimize the impact on the performance of non-real-time transactions. We have conducted a series of experiments based on a sanitized version of stock trading systems to evaluate the performance of both soft real-time and non-real-time transactions under different real-time supports in the system.     

一种面向混合实时事务调度的并发控制协议

首先给出了一个两层结构的混合实时数据库系统模型,其中支持采用非定期任务调度算法来改进系统的性能．进一步,针对这种模型下混合事务的数据一致性问题,提出了一种新的并发控制协议——MCC-DATI．该协议采用动态优先级驱动的调度算法,通过限制非定期的软实时事务对硬实时事务的阻塞时间,保证硬实时事务的可调度性;同时,采用非定期任务调度算法以及基于时间戳间隔的动态串行化顺序调整机制来减少软实时事务的截止期错失率．仿真实验表明,相对于先前的混合事务的并发控制协议,该协议在不同的系统负载与截止期约束下都能够改进系统的性能。     

安全数据库系统中的事务

在多级安全数据库系统中经典的BLP模型的“向上写”违反了数据库的完整性,并产生隐通道和带来多实例问题,事务间的提交和回退依赖也会产生隐通道,在对事务安全性分析的基础上提出了安全事务模型和安全事务正确性标准一安全冲突可串行化(SCSR),最后给出了一个避免隐通道的安全并发控制算法．