Article

Evaluation of conversion to a back-end data base management system

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

This paper presents a methodology for, and an evaluation of the feasibility of converting a typical data processing system to a data base management system. This methodology is applied to a particular system. The data base management system under evaluation uses a back-end mini-computer to perform the data management functions. The evaluation is made in terms of changes in system resources, program requirements, and human factors. The results of this study provide considerable insight into the problem of conversion to a data base management system, and suggest guidelines for the evaluation of any proposed data base conversions.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

Article
A survey of minicomputer data base management systems was conducted to determine the current state of the industry. The results of the survey are highlighted in this paper to provide a broad view of the features of commercially available mini-data base systems. Among the topics presented are hardware requirements, software implementation, data independence, binding, integrity, privacy controls, installation base, availability, and user considerations. In addition, the relationship between the growth of the minicomputer market and mini-DBMS market in the second half of the 70's is emphasized.
Article
There has been much interest in the use of special purpose processors as the data base management component of data processing systems. The generic terms “backend” and “data management machine” have been applied to such devices. Examination of the literature reveals a broad cross section of host to backend functional distribution and interconnection methodology. This discussion represents an attempt to examine and classify several of these backend data base management machine configurations in terms of their operational parameters and application constraints. A formal taxonomy of such systems remains yet to be performed. At least three distinct classes of data management machine (DMM) are evidenced in the literature; they are the large host backend, distributed network data node and smart peripheral. The intended classes of problem that the various authors envision amenable to solution by the DMM approach exhibit overlap while the performance envelope in which each DMM architecture would provide a technically acceptable, economically sound solution to a given user requirement set varies. Some of the papers used as source for this work contained no explicit mention of either the problem classes or performance constraints that the described configuration was to address; thus liberty has been taken in interpreting the implicit application goals of these authors.
Article
There has been much interest in the use of special purpose processors as the data base management component of data processing systems. The generic terms “backend” and “data management machine” have been applied to such devices. Examination of the literature reveals a broad cross section of host to backend functional distribution and interconnection methodology. This discussion represents an attempt to examine and classify several of these backend data base management machine configurations in terms of their operational parameters and application constraints. A formal taxonomy of such systems remains yet to be performed. At least three distinct classes of data management machine (DMM) are evidenced in the literature; they are the large host backend, distributed network data node and smart peripheral. The intended classes of problem that the various authors envision amenable to solution by the DMM approach exhibit overlap while the performance envelope in which each DMM architecture would provide a technically acceptable, economically sound solution to a given user requirement set varies. Some of the papers used as source for this work contained no explicit mention of either the problem classes or performance constraints that the described configuration was to address; thus liberty has been taken in interpreting the implicit application goals of these authors.
Article
A data base management system must have the characteristics of a public utility. It has to be able to support shared, concurrent access while enforcing the integrity and security constraints specified by its users; have enough capacity to serve the needs of its users: and be reliable, cost-effective, and responsive [BAUM, HSIAO, STELLORN].
Article
The functional requirements of secure database systems, and underlying security mechanisms needed to support these requirements impose the need for these very general characteristics in a system design: modularity, simplicity, isolatability, and flexibility. It has been observed MANOF77 that thus far the solutions to data security problems have largely been ad hoc and brute force. A view that can stand back and consider the entire system architecture, rather than concentrating on tuning up individual mechanisms, offers hope for more elegant solutions in the future. Perhaps the single most important conclusion of this report is, not to suggest a solution or a particular system, but to recommend a direction and an approach. The bulk of the evidence and information that went into the making of this report points toward system architecture approaches as the most effective way to satisfy the increasingly complex and often competing requirements. In fact, it appears to be the only approach in which the design of such large systems can be understood and believed to be secure.
Conference Paper
There has been much interest in the use of special purpose processors as the data base management component of data processing systems. The generic terms “backend” and “data management machine” have been applied to such devices. Examination of the literature reveals a broad cross section of host to backend functional distribution and interconnection methodology. This discussion represents an attempt to examine and classify several of these backend data base management machine configurations in terms of their operational parameters and application constraints. A formal taxonomy of such systems remains yet to be performed. At least three distinct classes of data management machine (DMM) are evidenced in the literature; they are the large host backend, distributed network data node and smart peripheral. The intended classes of problem that the various authors envision amenable to solution by the DMM approach exhibit overlap while the performance envelope in which each DMM architecture would provide a technically acceptable, economically sound solution to a given user requirement set varies. Some of the papers used as source for this work contained no explicit mention of either the problem classes or performance constraints that the described configuration was to address; thus liberty has been taken in interpreting the implicit application goals of these authors.
Article
The use of large buffers by the on-line I/O routines and high-volume data transfers from secondary storage tend to create memory shortage, device contention, and channel saturation. Consequently, the performance of the host computer in supporting the user needs (data base management and otherwise) is degraded. This article considers various approaches to upgrade the computing environment so that both data base management and nondata base management applications can be facilitated with good performance.
Article
A software organization which provides for data definition and manipulation in a distributed data base system is presented by describing the functions and interrelations of the component processes; with its methodology for access, the physical location of the data is transparent to the user program. The concepts of distributed data bases are discussed and current research is summarized as a means of establishing a method for the data placement and location mechanism. Procedures for the movement of data in a distributed data base system are presented, along with the data manipulation procedures, in terms of their performance and integrity effects. Enhancements to the mechanisms are suggested.
Article
A survey of the literature on Distributed Data Base Management Systems is presented. The problems associated with distributing data throughout a network are summarized into two major areas: Data Distribution and Data Transfer. Each area is described detailing some of the major proposed solutions to the problems therein. The intention here is to provide the reader with an overview and an extensive bibliography for further study on any aspect of Distributed DBMS.
Article
Database security is a rapidly growing research area, spawning work in several different subareas proceeding independently in many directions. In surveying the subject this paper draws together some of this diverse work and attempts to indicate relationships among the parts. A theme of the paper is to recommend a system architecture approach to database security. Such a view is more likely to bring modularity, simplicity, isolatability and flexibility to overall system solutions than will ad hoc attempts to tune-up individual parts.Systems requirements are stated and the relation to operating system security is discussed. Security kernels, their history as well as their advantages and problems, are described. Security requirements found in databases, but not in operating systems, are introduced. Some models and experimental systems are reviewed, representing non-architectural and architectural approaches to non-secure and secure database systems. Some conclusions and trends for the furure are discussed.
Article
A new concept in architecture of data base management computer systems is considered - to free the CPU and release the channel traffic of the host computer by off-loading the data base and much of the DBMS software to a backend machine. Such a machine can attain very large content-addressable blocks using tracks-in-parallel readout. The architecture also features the use of a specialized index processor and directory memory. A backend hardware machine employing this architecture could be designed and built in the next several years.
Article
Distributed data base management systems extend the capacities of computing systems to give many people access to a wide range of information. These systems, which arise from the combination of recent important advances in computer networks with general-purpose data base management systems, should shortly represent another significant step in commercial system development. So it is not surprising that they have been the focus of much research and development activity in both the academic and industrial environments.
Article
The CODASYL specifications, it is generally assumed, represent currently the most viable approach towards developing commonality among data base management systems. Though it is still a long way from becoming a standard, implementations based on the CODASYL specifications may significantly diminish the problems associated with data base sharing and portability of programs between heterogeneous computer systems, problems which are becoming more prevalent with the advent of computer networking. This report will look in detail at four systems of the CODASYL family. Their features will be outlined to allow a judgement on the commonality that exists with the CODASYL approach. The four systems are DBMS-10, available from Digital Equipment Corporation on the PDP-10; IDMS, marketed by the Cullinane Corporation and running primarily on IBM equipment; DMS 1100, a Univac product on the 1100 series; and EDMS by Xerox, implemented on its Sigma and 560 series.
Implementation of a Distributed Data Base System
  • V E Wallentine
  • F J Maryanski