检索结果-内蒙古大学图书馆

Transaction management mechanisms for active and real-time databases: A comprehensive protocol and a performance study

引用

JOURNAL OF SYSTEMS AND SOFTWARE 1998年第3期42卷 205-225页

作者： Konana, P Ram, S Univ Texas Dept MSIS Coll & Grad Sch Business Austin TX 78712 USA Univ Arizona Dept MIS Tucson AZ 85721 USA

active and real-time databases (ARTDB) have a variety of applications in electronic brokerages in financial markets, stock trading, network management and manufacturing process control. Transaction processing (TP) in ARTDB is extremely complicated since transactions may trigger other real-time transactions to an arbitrary depth with various types of dependencies (coupling modes). Therefore, transaction processing must be cognizant of not only the time deadlines but also the types of semantic dependencies with other transactions. The conflict resolution between two transactions cannot be considered in isolation since affecting one transaction may affect every other semantically dependent transaction. Similarly, transaction scheduling needs to be compatible with the concurrency control to avoid unnecessary restarts. In this paper we argue that transaction pre-analysis using the pre-declaration paradigm is an efficient mechanism to integrate the various issues of transaction processing such as concurrency control, scheduling, and semantic dependencies. The pre-analysis is possible since in many applications transactions repeat from a set of transaction classes, and the conflicts can be easily determined at a logical level by partitioning relations into mutually exclusive subset (e.g., by stock-id in financial applications). We develop a pre-analysis based transaction processing mechanism called OCCWB. OCCWB is an extended optimistic concurrency control protocol with blocking that combines the benefits of both optimistic and lock based protocols. Such an approach also has an implicit overload management mechanism required in many applications. OCCWB consists of four phases, namely, transaction pre-analysis, serialization ordering, priority adjustment and priority wait. Our protocol is validated using simulation and is shown to outperform existing protocols under various workload and parameter settings. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： active and real-time databases concurrency control deadlines priority assignment

来源：评论

学校读者我要写书评

暂无评论

How to Construct Predictable Rule Sets

引用

IFAC Proceedings Volumes 1999年第1期32卷 81-88页

作者： Esa Falkenroth Anders Törne Real- Time Systems Laboratory Department of Computer and Information Science Linköping University Sweden

This paper addresses the problem of unanticipated rule interactions. It characterizes problems with active rules in dynamic manufacturing environments, and formally defines a number of interaction properties such as cascades, rule cycles, and race conditions. The inversion of these properties defines criteria for interaction-free rule sets that form the basis for a compiler that automatically generates active rules. A feasibility study was conducted where an active database system was embedded into a manufacturing control system. A compiler translate high-level manufacturing operations into queries and active rules for the embedded active DBMS. Since the generated rule sets conform to the inverse criteria, they cannot lead to rule cycles, non-termination, or non-determinism.

关键词： active and real-time databases rule-termination analysis automatic rule generation software analysis and design methods for predictable behaviour

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：