Value-based scheduling in real-time database systems

In a real-time database system, an application may assign avalue to a transaction to reflect the return it expects to receive if the transaction commits before its deadline. Most research on real-time database systems has focused on systems where all transactions are assigned the same value, the performance goal being to minimize the number of missed deadlines. When transactions are assigned different values, the goal of the system shifts to maximizing the sum of the values of those transactions that commit by their deadlines. Minimizing the number of missed deadlines becomes a secondary concern. In this article, we address the problem of establishing a priority ordering among transactions characterized by both values and deadlines that results in maximizing the realized value. Of particular interest is the tradeoff established between these values and deadlines in constructing the priority ordering. Using a detailed simulation model, we evaluate the performance of several priority mappings that make this tradeoff in different, but fixed, ways. In addition, a bucket priority mechanism that allows the relative importannce of values and deadlines to be controlled is introduced and studied. The notion of associating a penalty with transactions whose deadlines are not met is also briefly considered.When this work was done he was with the Computer Sciences Department, University of Wisconsin-Madison.     

Buffer management in a real-time shared disks cluster

A great deal of research indicates that the shared disks (SD) cluster is suitable to high performance transaction processing. However, the aggregation of SD cluster with real-time processing has not been investigated. By adopting cluster technology, the real-time services will be highly available and can exploit internode parallelism. In this paper, we consider buffer management issues in a real-time SD cluster. We first propose a real-time buffer coherency algorithm that exploits inherent characteristics of real-time applications and SD cluster. Then we extend traditional buffer replacement algorithms to the real-time SD cluster. They emphasize specific attributes of buffer pages to capitalize locality of references, transaction deadline, and affinity-based routing. We evaluate the performance of the proposed algorithms under a wide variety of transaction workloads and system configurations.     

Secure buffering in firm real-time database systems

Many real-time database applications arise in electronic financial services, safety-critical installations and military systems where enforcing security is crucial to the success of the enterprise. We investigate here the performance implications, in terms of killed transactions, of guaranteeing multi-level secrecy in a real-time database system supporting applications with firm deadlines. In particular, we focus on the buffer management aspects of this issue. Our main contributions are the following. First, we identify the importance and difficulties of providing secure buffer management in the real-time database environment. Second, we present SABRE, a novel buffer management algorithm that provides covert-channel-free security. SABRE employs a fully dynamic one-copy allocation policy for efficient usage of buffer resources. It also incorporates several optimizations for reducing the overall number of killed transactions and for decreasing the unfairness in the distribution of killed transactions across security levels. Third, using a detailed simulation model, the real-time performance of SABRE is evaluated against unsecure conventional and real-time buffer management policies for a variety of security-classified transaction workloads and system configurations. Our experiments show that SABRE provides security with only a modest drop in real-time performance. Finally, we evaluate SABRE's performance when augmented with the GUARD adaptive admission control policy. Our experiments show that this combination provides close to ideal fairness for real-time applications that can tolerate covert-channel bandwidths of up to one bit per second (a limit specified in military standards). Received March 1, 1999 / Accepted October 1, 1999     

Multiclass query scheduling in real-time database systems

In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emergence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. This objective is achieved by dynamically adapting the system's admission, memory allocation, and priority assignment policies according to its current resource configuration and workload characteristics. A series of experiments confirms that PAQRS is very effective for real-time query scheduling     

非精确计算中的实时数据库服务质量管理

传统的数据库已经不能满足仿真数据库对性能优化的要求。因此,提出了非精确计算中由反馈环节控制的实时调度算法。在这些研究的基础上对该方法提出了改进,提出了使其在各种负载条件下,通过在反馈控制中设定遗忘因子以及引入最大限度数据错误的平均值来减少系统的突变,增强了系统的稳定性,提高了实时系统服务质量。     

Data management for component-based embedded real-time systems: The database proxy approach

We introduce the concept of database proxies intended to mitigate the gap between two disjoint productivity-enhancing techniques: component based software engineering (CBSE) and real-time database management systems (RTDBMS). The two techniques promote opposing design goals and their coexistence is neither obvious nor intuitive. CBSE promotes encapsulation and decoupling of component internals from the component environment, whilst an RTDBMS provide mechanisms for efficient and predictable global data sharing. A component with direct access to an RTDBMS is dependent on that specific RTDBMS and may not be useable in an alternative environment. For components to remain encapsulated and reusable, database proxies decouple components from an underlying database residing in the component framework, while providing temporally predictable access to data maintained in a database. Our approach provide access to features such as extensive data modeling tools, predictable access to hard real-time data, dynamic access to soft real-time data using standardized queries and controlled data sharing; thus allowing developers to employ the full potential of both CBSE and an RTDBMS. Our approach primarily targets embedded systems with a subset of functionality with real-time requirements. The implementation results show that the benefits of using proxies do not come at the expense of significant run-time overheads or less accurate timing predictions.     

基于不精确计算移动实时数据库服务质量管理

移动实时数据库服务应用逐渐广泛,但系统负载不可预测和有限资源常导致事务重启或夭折,给系统带来损失甚至灾难。传统的基于最长执行时间实时调度算法已不能满足性能要求,提出结合不精确计算和反馈控制的新算法。考虑更新数据对象间联系并结合时间和值域有效性,提出性能新参数标准去保证系统性能和服务质量。通过仿真实验表明：算法可从稳定性能和暂态性能保证系统预定的服务质量规范。     

ARTDBL-基于SQL的主动实时数据库语言

提出了一种新型的主动实时数据库语言（ＡＲＴＤＢＬ），它是传统的标准ＳＱＬ语言的扩充。讨论了ＡＲＴＤＢＬ的设计思想、功能特色和使用方式。该语言现已成功地应用到ＡＲ－ＴＤＢＳ中     

Data access scheduling in firm real-time database systems

A major challenge addressed by conventional database systems has been to efficiently implement the transaction model, which provides the properties of atomicity, serializability, and permanence. Real-time applications have added a complex new dimension to this challenge by placing deadlines on the response time of the database system. In this paper, we examine the problem of real-time data access scheduling, that is, the problem of scheduling the data accesses of real-time transactions in order to meet their deadlines. In particular, we focus on firm deadline real-time database applications, where transactions that miss their deadlines are discarded and the objective of the real-time database system is to minimize the number of missed deadlines. Within this framework, we use a detailed simulation model to compare the performance of several real-time locking protocols and optimistic concurrency control algorithms under a variety of real-time transaction workloads. The results of our study show that in moving from the conventional database system domain to the real-time domain, there are new performance-related forces that come into effect. Our experiments demonstrate that these factors can cause performance recommendations that were valid in a conventional database setting to be significantly altered in the corresponding real-time setting.This work was done while the author was with the Computer Sciences Department, University of Wisconsin-Madison. This research was partially supported by the National Science Foundation under grant IRI-8657323.     

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.     

嵌入式实时数据库系统及其相关问题

嵌入式实时数据库系统（ＥＲＴＤＢＳ）的特性、与传统数据库系统的区别，并对今后值得重视和研究的问题进行了探讨。     

Rule activation techniques in active database systems

Efficient activation of rules is a fundamental issue in active database systems; choosing the suitable rule activation technique is therefore an important task. We have developed a technique, called join pattern indexing, to support incremental update of rule-derived data. In this paper, we compare join pattern indexing with discrimination networks (Rete and TREAT) for data-derivation rules. A performance study based on a stochastic model indicates that join pattern indexing is more efficient than discrimination networks in many cases.     

Multi-level security in database management systems

Multi-level secure database management system (MLS-DBMS) security requirements are defined in terms of the view of the database presented to users with different authorizations. These security requirements are intended to be consistent with DoD secure computing system requirements. An informal security policy for a multi-level secure database management system is outlined, and mechanisms are introduced that support the policy. Security constraints are the mechanism for defining classification rules, and query modification is the mechanism for implementing the classification policy. These mechanisms ensure that responses to users' queries can be assigned classifications which will make them observable to the querying users.     

Transaction management in distributed heterogeneous database management systems

Current distributed, heterogeneous database management systems (DBMSs) address the issue of distributed transaction management (DTM) in two different ways: some systems rely solely on unmodified local transaction managers (LTMs), thereby helping preserve local DBMS autonomy, but limit functionality (e.g. allow only unsynchronized retrievals, preclude distributed updates, etc.); others maintain full functionality but require the (re)design of the LTMs to enforce homogeneous DTM across all heterogeneous DBMSs, thereby giving up most of the local DBMS autonomy.

The goal of the work presented here is to establish the minimum set of modifications to LTMs that allow synchronized retrievals and distributed updates (whenever semantic conflicts can be resolved), and will continue to maintain a high degree of local DBMS autonomy. The problems of: (1) distribution of responsibility between DTM and LTMs, (2) concatenation of functionally-equivalent LTM mechanisms, and (3) providing compensation mechanisms for functionally-limited LTMs are introduced. Solutions to the above problems are shown to exist. However, the interconnection of autonomous, heterogeneous DBMSs is significantly more difficult than anticipated, despite communication standardization and current optimism.     

Dealing with fuzziness in active mobile database systems

Current needs of industry required the development of advanced database models like active mobile database systems. An active mobile database system can be designed by incorporation of triggering rules into a mobile computing environment in which the users are able to access a collection of database services using mobile and non-mobile computers at any location. Fuzzy concepts are adapted to the field of databases in order to deal with ambiguous, uncertain data. Fuzziness comes into picture in active mobile databases especially with spatial queries on moving objects. Incorporating fuzziness into rules would also improve the effectiveness of active mobile databases as it provides much flexibility in defining rules for the supported application. In this paper we present some methods to adapt the concepts developed for fuzzy systems to active mobile databases.     

Buffer model and management in distributed multimedia presentation systems

The delivery of continuous and synchronous multimedia data from a database (or file) server to multiple destinations over a network presents new challenges in the area of buffer management. Many factors that were not considered in conventional buffer management must be examined. In this paper, we investigate the principles of buffer model and management for multimedia data presentations in distributed systems. The primary goal is to minimize the response time of multimedia presentations while ensuring that all continuity and synchronization requirements are satisfied. A framework for buffer model and management is introduced. Minimum buffering requirements at both client and server sides to guarantee the continuity and synchrony of the presentation of multimedia data are examined. A prefetching and replacement strategy which satisfies these requirements is then offered. These principles and techniques provide users with the full range of information required to develop a distributed system for multimedia presentations.     

Global lock escalation in database management systems

Since database management systems (DBMSs) have limited lock resources, transactions requesting locks beyond the limit must be aborted, degrading the performance abruptly. Lock escalation can be effectively used in such circumstances to alleviate the problem. Many lock escalation methods have been proposed and implemented in commercial DBMSs. However, they have certain problems due to the local nature of their decisions on when to execute lock escalation. In this paper, we propose a new lock escalation method, global lock escalation, that makes such decision globally based on the total number of locks. Through extensive simulation, we show that the global lock escalation method outperforms the existing ones significantly. Especially, we show that the number of concurrent transactions allowable increases by 2-16 times. We believe our method can be easily implemented in the commercial DBMSs enhancing the performance significantly under excessive lock requests.     

信息管理中大型数据库管理系统的应用研究

随着社会的发展,信息时代和大数据的到来,各行各业对信息管理系统性能要求越来越高。而在信息管理系统中大型数据库管理系统的应用,不仅能够提高信息管理系统的性能,而且对提升信息的利用率也具有重要的作用。下面本研究首先分析了信息管理中大型数据库管理系统的特点,然后详细分析了信息管理中大型数据库管理系统的具体应用,以供参考。     

Microcomputers and distributed database management systems

The role of a DDBMS is to provide overall system integrity, appropriate data access, and recovery over the whole network. Many of the supermicros with powerful 16 and 32 bit architectures will soon be running advanced DBMS and DDBMS software, thus, playing an important role as a distributed database on a network. The article discusses this and future trends.