Application Of Database System Research Articles

Back-end technology for high-performance knowledge-representation systems

PARKA-DB is a scalable ontology management system that uses relational database techniques and supports the large ontologies needed in medical database system applications (among others). The medical system lets doctors load information about their patients' conditions (specifically microbiological data) into a hybrid ontology. The doctor uses pure ontological information to load a KB containing a very large number of assertions about the patient. PARKA-DB supports a frame based AI language that uses high performance and scalable computing techniques.

On the completeness of object-creating database transformation languages

Object-oriented applications of database systems require database transformations involoving nonstandard functionalities such as set manipulation and object creation, that is, the introduction of new domain elements. To deal with thse functionalities, Abiteboul and Kanellakis [1989] introduced the “determinate” transformations as a generalization of the standard domain-preserving transformations. The obvious extensions of complete standard database programming languages, however, are not complete for the determinate transformations. To remedy this mismatch, the “constructive” transformations are proposed. It is shown that the constructive transformations are precisely the transformations that can be expressed in said extensions of complete standard languages. Thereto, a close correspondence between object creation and the construction of hereditarily finite sets is established.A restricted version of the main completeness result for the case where only list manipulations are involved is also presented.

Application of database systems in diabetes care.

The St Vincent Declaration includes a commitment to continuous quality improvement in diabetes care. This necessitates the collection of appropriate information to ensure that diabetes services are efficient, effective and equitable. The quantity of information, and the need for rapid access, means that this must be computer-based. The choice of architecture and the design of a database for diabetes care must take into account available equipment and operational requirements. Hardware topology may be determined by the operating system and/or netware software. An effective database system will include: user-friendliness, rapid but secure access to data, a facility for multiple selections for analysis and audit, the ability to be used as part of the patient consultation process, the ability to interface or integrate with other applications, and cost efficiency. An example of a clinical information database for diabetes care, Diamond, is described.

On heuristics for determining the thickness of a graph

We present an empirical analysis of some heuristics for the graph thickness problem, i.e., decomposing a graph into the minimum number of planar subgraphs. The problem has applications in database systems, e.g., the layout of E-R diagrams. The heuristics are based on some algorithms for finding a maximal planar subgraph of a nonplanar graph. Empirical results show that a randomized heuristic is a practical tool for solving this problem. We also improve upon a previously derived upper bound for the thickness of a graph with respect to its size.

キャンペーン特集 情報データベースの接合・加工プロセスへの応用 データベースの材料評価への応用

キャンペーン特集 情報データベースの接合・加工プロセスへの応用 データベースの材料評価への応用

SUXESS: towards a sound unification of extensions of the relational data model

Recently there has been a considerable interest in extending the relational model of data, in order to make it useful for data modeling in the context of nonstandard applications of database systems. As a result, a variety of models has been proposed, which concur in allowing more structure, complex objects, recursion, or other aspects within relational databases. However, no consensus has been reached yet on how general such an extension should be, or which model is the ‘best’ in the sense that it may become the ‘sucessor’ of the relational model. While answers to both questions probably depend on the respective application, this paper is an attempt to unify notable extended relational models into a common framework, the SUXESS model, in order to clarify the situation and to explore the current modeling power of these approaches.

ROSE and CHIDE: user interface management system implementation as object-oriented database system application

ROSE, an experimental object-oriented database system for interactive engineering applications, and CHIDE, a user interface development environment are both described. ROSE is a database system that combines features of relational database systems with those of object-oriented programming languages. CHIDE is a user interface management system that allows its user to create and edit user interfaces without writing code in a programming language. Instead, the CHIDE user creates user interfaces by editing representations of those interfaces displayed on a graphics display. CHIDE is implemented as an application of ROSE. It uses a ROSE database to store objects describing user interfaces, and it uses the ROSE data manipulation language to manipulate those objects. The advantages are described of implementing a user interface development environment as an application of a database system; why that database system should be object-oriented, and how ROSE has been implemented so that it is fast enough to support this type of application.

Computing transitive closures of multilevel relations

Recently many attempts have been made to implement recursive queries. Such queries are essential for the new generation intelligent database system applications. Much of the effort in recursive queries is focussed on transitive closure queries which are of practical significance. None of the work described investigates recursive query processing in secure database management systems. In this paper we propose centralized and distributed algorithms for implementing transitive closure queries for multilevel secure relational database management systems.

Architecture of data‐base maintenance for computer control system of electric network

Electrical Engineering in JapanVolume 110, Issue 2 p. 74-88 Article Architecture of data-base maintenance for computer control system of electric network Mario Uesugi, Mario Uesugi Hitachi, Ltd. Mario Uesugi obtained a Master's degree in 1972 from the Electronics Engineering Department of the Engineering Research Division, Kyushu University. He obtained a Dr. of Eng. degree from there in 1973 and joined Hitachi, Ltd. At present, he is working in the Computing Control Software First Design Division at the Omika Works of Hitachi. He is engaged mainly in the design of supervisory control system of power systems. He is a member of the Information Processing Society of Japan.Search for more papers by this authorHiroshi Kabasawa, Hiroshi Kabasawa Toshiba Corp. Hiroshi Kabasawa graduated in 1963 from Nagaoka Technical High School of Niigata Prefecture, and joined the Fuchu Works of Toshiba Corp. in March of the same year. He is engaged in the development of network-type database application systems and CAD systems using large-scale digital computers. At present, he is in charge of the design of computer systems for power system.Search for more papers by this authorYukio Nakai, Yukio Nakai Mitsubishi Electric Corp. Yukio Nakai obtained a Master's degree in 1978 from the University of Tokyo and joined Mitsubishi Electric Corp. in April of the same year. He is engaged in the development and design of control systems for power systems at Mitsubishi's Control Manufacturing Works. He is a member of the Information Processing Society of Japan.Search for more papers by this authorTakao Omata, Takao Omata Tokyo Electric Power Co., Inc. Takao Omata graduated in 1979 from the Department of Electrical Engineering, Faculty of Engineering, University of Tokyo, and joined Tokyo Electric Power Co., Inc., in April of the same year. He was engaged in the development of the power supply systems for facility-integrated automation after working in the design of substation facilities as well as planning and operation and business of electronic communication facilities. At present, he is studying at the California Institute of Technology. in the United States.Search for more papers by this author Mario Uesugi, Mario Uesugi Hitachi, Ltd. Mario Uesugi obtained a Master's degree in 1972 from the Electronics Engineering Department of the Engineering Research Division, Kyushu University. He obtained a Dr. of Eng. degree from there in 1973 and joined Hitachi, Ltd. At present, he is working in the Computing Control Software First Design Division at the Omika Works of Hitachi. He is engaged mainly in the design of supervisory control system of power systems. He is a member of the Information Processing Society of Japan.Search for more papers by this authorHiroshi Kabasawa, Hiroshi Kabasawa Toshiba Corp. Hiroshi Kabasawa graduated in 1963 from Nagaoka Technical High School of Niigata Prefecture, and joined the Fuchu Works of Toshiba Corp. in March of the same year. He is engaged in the development of network-type database application systems and CAD systems using large-scale digital computers. At present, he is in charge of the design of computer systems for power system.Search for more papers by this authorYukio Nakai, Yukio Nakai Mitsubishi Electric Corp. Yukio Nakai obtained a Master's degree in 1978 from the University of Tokyo and joined Mitsubishi Electric Corp. in April of the same year. He is engaged in the development and design of control systems for power systems at Mitsubishi's Control Manufacturing Works. He is a member of the Information Processing Society of Japan.Search for more papers by this authorTakao Omata, Takao Omata Tokyo Electric Power Co., Inc. Takao Omata graduated in 1979 from the Department of Electrical Engineering, Faculty of Engineering, University of Tokyo, and joined Tokyo Electric Power Co., Inc., in April of the same year. He was engaged in the development of the power supply systems for facility-integrated automation after working in the design of substation facilities as well as planning and operation and business of electronic communication facilities. At present, he is studying at the California Institute of Technology. in the United States.Search for more papers by this author First published: 1990 https://doi.org/10.1002/eej.4391100208 AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onFacebookTwitterLinked InRedditWechat Volume110, Issue21990Pages 74-88 RelatedInformation

Application and database design—putting it off

There seems to be two major schools of thought about designing database application systems: System design is mandatory, say the methodologers. How can you ever build a system unless you first determine in detail what it should do? System design is impossible, say the prototypists. How can you ever build a system if you must first determine in detail what it should do?

Rapid prototyping of database systems in human genetics data collection.

This work examines some of the problems encountered in developing small and large database application systems involving human genetics data collection efforts that include data on individuals as well as family pedigree data. Rapid prototyping of a database application requires software tools to produce the application with little or no programming. Features of MEGADATS-4 that provide for rapid prototyping and for producing stand-alone applications are examined.

The relational model with relation-valued attributes

Motivated by new applications of database systems we introduce relations which may have relation-valued attributes and propose a related algebra. Formal definitions for this extended relational model can be given by applying usual notions recursively. The main problem considered in this paper is the formal definition of an appropriate relational algebra for these non-first-normal-form relations. We allow the application of the basic relational operators to any relation-valued attribute within a relation. This leads to a (hierarchically) nested relational algebra.

An Array Algebra for Database Applications

Abstract:Array Algebra provides a complete and algebraic programming environment for database application systems where large quantities of highly structured data are involved. Some procedure is suppressed by utilizing an algebra based on the theory of generalized arrays to express the functional relationships among the data items, and more specifically between the inputs and the outputs of an application system.

Familial model of data

The family of sets is proposed as the basic structure for modeling data. A family is created by indexing one set of objects by another to represent a directed binary association between two sets. Familial models are shown to have a number of distinct advantages in supporting diverse user views through a hierarchy of abstractions and a variety of derived data, and in describing themselves and other data models through metamodels. An algebra of families is introduced to provide a data definition, maintenance and processing language that is minimal, intuitive, algebraic and theoretically sound. The language is extended to a specification language for database application systems, largely eliminating the need for embedding database constructs into procedural programming languages.

Highly available systems for database applications

As users entrust more and more of their applications to computer systems, the need for systems that are continuously operational (24 hours per day) has become even greater. This paper presents a survey and analysis of representative architectures and techniques that have been developed for constructing highly available systems for database applications. It then proposes a design of a distributed software subsystem that can serve as a unified framework for constructing database application systems that meet various requirements for high availability.

A familial specification language for database application systems

The Familial Specification Language is a set theoretic and functional language providing a unified approach to the less-procedural design of database application systems. The language is proposed to be both a database language and an application program specification language. The unique data structure employed, the family of sets, provides the designer with a unified framework, both to model and maintain data, and to algebraically specify the application programs without looping or branching, and with no side effects. Using the same data structure in both the data model and the problem specification creates a natural interface between the database and the application programs. Special emphasis is placed on aggregation and classification, the major problems is business data processing.