SADDLE: A computer-aided structural analysis and dynamic design language—part II. database management system

The SADDLE program is a tool for computer-aided optimal design of structural and mechanical systems. The system is divided into four parts; the pre-processor, the “analyzer”, the “synthesizer” and the post-processor. The structural model and the design data are generated by the preprocessor. The analyzer used the finite-element method to compute deflections and stresses in the structure. The synthesizer solves the design problem that is cast into a nonlinear programming format. The post-processor is used to examine the analysis and design results. Different parts of the system interact via a global database. The database management system is presented in detail, in this part of a two part paper. The data manager has three distinct parts: the data model processor, the resource manager and the I/O manager. Both the relational and hierarchical data models are supported. Tuning parameters are provided to enhance computational efficiency on different computers. The emphasis is on friendlier user-system interaction; free-format input, error recoveries, and easy means to create, edit, and update information.     

A GENERAL APPROACH TO THE STUDY OF SPATIAL SYSTEMS;I. The Relational Representation of Measurable Attributes

In this, the First part of a two part work, a general model of spatial organization is introduced. Following a brief synopsis of some of Spinoza's and Leibniz's views regarding natural structure, an extension of the Spinozian model is presented in which the attribute spatial extension is portrayed as a relational system that implicitly underlies the differentiation of sensible space into “modifications” (“natural systems”) and the latter's subdifferentiation into “modes” On the basis of this model, all instances of modal differentiation are understood to take place in a manner explained by this relational structure, the existence (but not the specific characteristics) of which is initially assumed. The nature of the structure is then deduced according to a “most-probable-state” kind of logic; next, it is demonstrated via simulation that the resulting aspatial model of internal relations has a corresponding spatial interpretation (and therefore, in theory, that sensible space structures can be supported by the particular rational ordering posed). The matter of how to apply the model to the study of real world systems is taken up last; discussion focuses on related aspects of the treatment of equilibrium and nonequilibrium systems and the recognition and measurement of modal structures.     

Effects of update techniques on main memory database systemperformance

Update technique is an important issue related to database recovery. In a main memory database environment, transaction execution can be processed without any I/O, and all I/O operations involved are for recovery purposes. The efficiency of update techniques therefore has an important impact on the performance of main memory database systems. We compared the techniques of immediate and deferred update based on a database machine, MARS. The simulation results showed that immediate update outperforms deferred update unless system failure is a frequent occurrence     

EXTENSION OF THE RELATIONAL DATABASE AND ITS ALGEBRA WITH ROUGH SET TECHNIQUES

This paper describes a database model based on the original rough sets theory. Its rough relations permit the representation of a rough set of tuples not definable in terms of the elementary classes, except through use of lower and upper approximations. The rough relational database model also incorporates indiscernibility in the representation and in all the operators of the rough relational algebra. This indiscernibility is based strictly on equivalence classes which must be defined for every attribute domain. There are several obvious applications for which the rough relational database model can more accurately model an enterprise than does the standard relational model. These include systems involving ambiguous, imprecise, or uncertain data. Retrieval over mismatched domains caused by the merging of one or more applications can be facilitated by the use of indiscernibility, and naive system users can achieve greater recall with the rough relational database. In addition, applications inherently “rough” could be more easily implemented and maintained in the rough relational database.     

Improving the performance and functionality of Mondrian open‐source OLAP systems

For a long time, the design of relational databases has focused on the optimization of atomic transactions (insert, select, update or delete). Currently, relational databases store tactical information of data warehouses, mainly for select‐like operations. However, the database paradigm has evolved, and nowadays on‐line analytical processing (OLAP) systems handle strategic information for further analysis. These systems enable fast, interactive and consistent information analysis of data warehouses, including shared calculations and allocations. OLAP and data warehouses jointly allow multidimensional data views, turning raw data into knowledge. OLAP allows ‘slice and dice’ navigation and a top‐down perspective of data hierarchies. In this paper, we describe our experience in the migration from a large relational database management system to an OLAP system on top of a relational layer (the data warehouse), and the resulting contributions in open‐source ROLAP optimization. Existing open‐source ROLAP technologies rely on summarized tables with materialized aggregate views to improve system performance (in terms of response time). The design and maintenance of those tables are cumbersome. Instead, we intensively exploit cache memory, where key data reside, yielding low response times. A cold start process brings summarized data from the relational database to cache memory, subsequently reducing the response time. We ensure concurrent access to the summarized data, as well as consistency when the relational database updates data. We also improve the OLAP functionality, by providing new features for automating the creation of calculated members. This makes it possible to define new measures on the fly using virtual dimensions, without re‐designing the multidimensional cube. We have chosen the XML/A de facto standard for service provision. Copyright © 2008 John Wiley & Sons, Ltd.     

Integrating relational and object-oriented database systems using a metaclass concept

This paper presents a specific approach of integrating a relational database system into a federated database system. The underlying database integration process consist of three steps: first, the external database systems have to be connected to the integrated database system environment and the external data models have to be mapped into a canonical data model. This step is often called syntactic transformation including structural enrichment and leads to component schemas for each external DBMS. Second, the resulting schemas from the first step are used to construct export schemas which are then integrated into global, individual schemas or views in the third step. In this paper we focus on the first step for relational databases, i.e., the connection of a relational database system and the mapping of the relational model into a canonical data model. We take POSTGRES as the relational database system and the object-oriented federated database system VODAK as the integration platform which provides the open, object-oriented data model as the canonical data model for the integration. We show different variations of mapping the relational model. By exploiting the metaclass concept provided by VML, the modelling language of VODAK, we show how to tailor VML such that the canonical data model meets the requirements of integrating POSTGRES into the global database system VODAK in an efficient way.     

A Generalized Query-by-Example Data Manipulation Language Based on Database Logic

The purpose of this paper is to introduce a Generalized-Query-By-Example (GQBE) data manipulation language (DML) that can be built on top of most existing databases (ie., relational, hierarchical, and network). The data manipulation language supports retrieval, insertion, deletion, and update operations and has a formal semantics based on database logic. It is also seen that GQBE can by used as a DML on external views of an integrated database. We also show the advantages of GQBE on heterogeneous databases over Zloof's QBE on relational external views.     

An object-based architecture for biomedical expert database systems

Objects play a major role in both database and artificial intelligence research. In this paper, we present a novel architecture for expert database systems that introduces an object-based interface between relational databases and expert systems. We exploit a semantic model of the database structure to map relations automatically into object templates, where each template can be a complex combination of join and projection operations. Moreover, we arrange the templates into object networks that represent different views of the same database. Separate processes instantiate those templates using data from the base relations, cache the resulting instances in main memory, navigate through a given network's objects, and update the database according to changes made at the object layer. In the context of an immunologic-research application, we demonstrate the capabilities of a prototype implementation of the architecture. The resulting model provides enhanced tools for database structuring and manipulation. In addition, this architecture supports efficient bidirectional communication between database and expert systems through the shared object layer.     

Non-first normal form universal relations: An application to information retrieval systems

The relational model has gained wide popularity because it is conceptually simple and provides “physical independence”. Furthermore, the universal relation model provides “logical independence”, while non-first normal form relations further simplify the conceptual view. A number of proposals have been made to apply database techniques to Information Retrieval (DBMIRS); this is principally due to the commonality of functions in Database Management systems and Information Retrieval Systems. The proposals have, most commonly, included attempts to extend the relational model, thus losing some of the inherent simplicity of the relational model. In this paper we propose the use of non-first normal form universal relations to simply the user interface in DBMIRS.     

Magnetic bubble memory structures for relational database management systems

Recently the concept of using magnetic bubble technology to store data and to perform logical operations has received considerable attention. By exploiting this hardware approach for relational database management systems, we introduce an efficient support for records permutation, sorting and searching for data. Actually these are substantial operations in relational data models.The organization of a relational data model in a magnetic bubbie memory is straightforward. In such systems the memory consists of loops, where each loop is capable of holding one record. Under the control of a switch, a loop can circulate the records or can hold them in position. However, as the number of switches in the memory system increases, the number of control lines becomes large and the model structure may lose its practical significance.In this investigation three different models of bubble memories are applied to a simple relational database example. The two basic operations of permuting records and searching for data are emphasized. For these models, some theoretical features, the essential characteristics and their applicability are pointed out.     

基于遗传算法的实时内存数据库查询优化

各种事务类型的查询处理是实时数据库实现的关键点之一．由于现有的关系查询处理不能适合于实时数据库，因此实时数据库系统必须具有自己的查询处理器．为此，结合正在开发的嵌入式实时数据库系统ERTDBMS，给出了一个实时数据库查询处理的系统RTQP，并在对实时数据库查询处理做了一般性探讨后，将重点放在内存代价和遗传算法上，类似于关系系统RTQP提供了在MMDB环境下节省内存的查询处理的实现算法，以及遗传算法和实时数据库规则相结合的查询优化方案。     

Integrating XML and Relational Database Systems

Relational databases get more and more employed in order to store the content of a web site. At the same time, XML is fast emerging as the dominant standard at the hypertext level of web site management describing pages and links between them. Thus, the integration of XML with relational database systems to enable the storage, retrieval, and update of XML documents is of major importance. Data model heterogeneity and schema heterogeneity, however, make this a challenging task. In this respect, the contribution of this paper is threefold. First, a comparison of concepts available in XML schema specification languages and relational database systems is provided. Second, basic kinds of mappings between XML concepts and relational concepts are presented and reasonable mappings in terms of mapping patterns are determined. Third, design alternatives for integrating XML and relational database systems are examined and X-Ray, a generic approach for integrating XML with relational database systems is proposed. Finally, an in-depth evaluation of related approaches illustrates the current state of the art with respect to the design goals of X-Ray.     

An extensible DBMS for small and medium systems

An extensible, relational database management system called Requiem is described that offers users a truly relational interface, and is independent of query language. Requiem (relational query and update interactive system) is an interactive system with facilities for querying and updating a database. The organization of Requiem, the structure of its query language RQL, and the structure of the database are discussed     

基于分布式技术的气象系统数据服务平台构建

现有气象系统建设和设计缺乏统一规划,导致各系统林立,数据管理散、乱、差,整体安全防护能力较弱,集约化差。本文利用分布式技术,构建基于“分布式关系型数据库+事务性数据库+列式数据库+表格系统+分布式文件系统”的混合型模式大数据服务中心,进行数据的存储、管理和服务,并通过MUSIC接口与省级CIMISS系统无缝衔接在一起,有效实现了数据的共享、流程的高度集约,并极大提升了数据的影响能力。相同条件下,10年自动站数据查询的性能提升了22倍多,而随着时间维度的增加,这种提升的优势会更大。     

Web数据库环境中分子结构式的处理

讨论了在Web数据库环境中处理分子结构式的问题。分子结构式可存储为静态图片格式或动态结构式格式。静态图片格式具有平台无关性,动态结构式格式则具有可编辑性及动态显示的优势。在关系数据库中,既可将分子式文件名或所在路径作为数据项,也可直接将分子式方 本身作为数据项。文中给出将分子式文件存入数据库的程序流程的示例,使用插件（Plug-in）或ActiveX控件,可在Web浏览器中直接显示动态的分子结构式,文中分析了二者处的优势,并结合ASP和Chime插件技术,给出了在数据库中检索分子结构式的具体实现方法。     

地理信息系统与数据库结合研究

鉴于地理信息系统需要对外提供灵活高效的地理信息访问途径,因此采用数据库管理地理信息是发展趋势,目前存在关系型,对象-关系型,面向对象型3类数据库产品,在讨论它们与地理信息系统结合可行性的基础上,重点介绍了纯关系模型,空间扩展模型,包装模型3种结合方案,还通过对这3种方案实现原理的分析及其优缺点的比较,指出了各方面的应用前景,并由此归纳出,在GIS与数据库结合中需要注意的问题及解决这些问题的关键技术。     

DETECTOR:基于关系数据库通用的在线关键词查询系统

关系数据库上的现有数据库关键词检索系统可分为在线和离线两大类,它们都难以兼顾查询效率和效果:在线系统能够获得数据库最新结果,但速度较慢;离线系统使用预处理提高查询速度,但若数据库更新就要重新执行预处理.在离线系统DETECTOR基础上,设计并实现增量更新方案,在不影响查询效率的前提下最大程度地保证了查询结果的准确性.另一个贡献是实现了通用的预处理模块,使得普通用户也能顺利进行预处理操作.     

A New Approach to Database Auto-Design by Logic

The database auto-design is an important problem in database research.In this paper we propose some new ideas and an approach called “logic approach” to implement the database auto-design.Given a relational scheme and a set of the functional dependencies for the relation we can obtain all of the functional dependencies and key for the relation and determine the normal form the relation satisfies.     

Tuning a parallel database algorithm on a shared-memory multiprocessor

Database query processing can benefit significantly from parallelism. Parallel database algorithms combine substantial CPU and I/O activity, memory requirements, and massive data exchange between processes, all of which must be considered to obtain optimal performance. Since parallel external sorting is a very typical example, we have focused on sorting to tune Volcano, a new query processing system. The purpose of the Volcano project is to provide efficient, extensible tools for query and request processing in novel application domains, particularly in object-oriented and scientific database systems, and for experimental database performance research. It includes all query processing algorithms conventionally used in relational database systems as well as several new ones, and can execute all of them in parallel. In this article, we present Volcano's parallel external sorting algorithm and a sequence of enhancements to improve its performance. We obtained very good absolute performance, 84 seconds for 100 MB of data, as well as near-linear speedup with sixteen CPUs and disks. Furthermore, these results were achieved on a shared-memory machine despite the common belief that parallel query processing is best implemented on distributed-memory systems. We detail our tuning measures and report on their effectiveness.     

Translating update operations from relational to object-oriented databases

In migrating a legacy relational database system to the object-oriented (OO) platform, when database migration completes, application modules are to be migrated, where embedded relational database operations are mapped into their OO correspondents. In this paper we study mapping relational update operations to their OO equivalents, which include UPDATE¹, INSERT and DELETE operations. Relational update operation translation from relational to OO faces the touchy problem of transformation from a value-based relationship model to a reference-based model and maintaining the relational integrity constraints. Moreover, with a relational database where inheritance is expressed as attribute value subset relationship, changing of some attribute values may lead to the change of the position of an object in the class inheritance hierarchy, which we call object migration. Considering all these aspects, algorithms are given mapping relational UPDATE, INSERT and DELETE operations to their OO correspondents. Our work emphasize in examining the differences in the representation of the source schema's semantics resulting from the translation process, as well as differences in the inherent semantics of the two models.