Michael W. Blasgen

System R: relational approach to database management

System R is a database management system which provides a high level relational data interface. The systems provides a high level of data independence by isolating the end user as much as possible from underlying storage structures. The system permits definition of a variety of relational views on common underlying data. Data control features are provided, including authorization, integrity assertions, triggered transactions, a logging and recovery subsystem, and facilities for maintaining data consistency in a shared-update environment. This paper contains a description of the overall architecture and design of the system. At the present time the system is being implemented and the design evaluated. We emphasize that System R is a vehicle for research in database architecture, and is not planned as a product.

A history and evaluation of System R

System R, an experimental database system, was constructed to demonstrate that the usability advantages of the relational data model can be realized in a system with the complete function and high performance required for everyday production use. This paper describes the three principal phases of the System R project and discusses some of the lessons learned from System R about the design of relational systems and database systems in general.

System R: an architectural overview

We have described the architecture of System R, including the Relational Data System and the Research Storage System. The RDS supports a flexible spectrum of binding times, ranging from precompilation of “canned transactions” to on-line execution of ad hoc queries. The advantages of this approach may be summarized as follows: 1. For repetitive transactions, all the work of parsing, name binding, and access path selection is done once at precompilation time and need not be repeated. 2. Ad hoc queries are compiled on line into small machine-language routines that execute more efficiently than an interpreter. 3. Users are given a single language, SQL, for use in ad hoc queries as well as in writing PL/I and COBOL transaction programs. 4. The SQL parser, access path selection routines, and machine language code generator are used in common between query processing and precompilation of transaction programs. 5. When an index used by a transaction program is dropped, a new access path is automatically selected for the transaction without user intervention.

Orienting Mechanical Parts by Computer-Controlled Manipulator

In order to assemble mechanical parts which are initially disordered, a computer-controlled manipulator needs some procedure for orienting these parts. An apparatus is described which assists the manipulator in performing this function. The device is a dihedrally tipped open box attached to a vibrator. When placed in the box, a typical mechanical part assumes one of a small finite number of possible orientations. Once the particular orientation is established, the manipulator shifts the part into the desired orientation.

An encoding method for multifield sorting and indexing

Sequences of character strings with an order relation imposed between sequences are considered. An encoding scheme is described which produces a single, order-preserving string from a sequence of strings. The original sequence can be recovered from the encoded string, and one sequence of strings precedes another if and only if the encoding of the first precedes the encoding of the second. The strings may be variable length, without a maximum length restriction, and no symbols need be reserved for control purposes. Hence any symbol may occur in any string. The scheme is useful for multifield sorting, multifield indexing, and other applications where ordering on more than one field is important.

IBM RISC System/6000: architecture and performance

The IBM RISC System/6000, a superscalar microprocessor, is presented. The architecture of this processor has its instruction set specifically designed for a superscalar machine containing three independent units-branch, fixed-point, and floating-point. The design also emphasizes high-performance floating-point operations. The design principles are to offer maximum overlap of the three functional units, avoid dead cycles, and define instructions that can (for the most part) be completed at a rate of one per cycle. The branch cycle, fixed- and floating-point units, cache management, and performance are described. Benchmark results are given.<<ETX>>