No abstract available.
A file definition facility for file structures
This paper describes a file definition facility (FDF) for defining files as graph structures. The structure of the file is explicitly declared in the file definition. Primitive functions (from graph theory), operators, and the format of the definition ...
Declaration and addressing of Varying Density Arrays and structures
In current higher level languages arrays are parallelepiped in N dimensions, each dimension having an index range from a lower limit to an upper limit (both must be integers), the increment between valid index values being one. By removing the ...
Data base languages, in particular DDL, development at CODASYL
Since the publication, in April, 1971, of the Data Base Task Group(DBTG) report(ref.1) to the CODASYL Programming Language (=COBOL) Committee(PLC) several committees and task groups of the CODASYL organization have enhanced and improved the languages ...
On interaction with data bases
The main thesis of this paper is that interaction with data bases is fundamentally different from file manipulation: In the former case the data base should be “the master,” while the file is a passive collection of data. The main corollaries of this ...
A functional view of data independence
Many researchers have used the term “data independence” without indicating a precise meaning. One common definition is—the isolation of a program from considerations of the data which it processes [1,2].Another is—the ability of an applications program ...
Towards a formulation and definition of data reorganization
Data reorganization can be informally defined as the process of changing the logical and/or physical organization of data so that it can be processed more effectively in a new hardware/software environment. Motivation for data reorganization is ...
Generalized page replacement algorithms in a relational data base
This paper describes a generalized page replacement problem in which the pages have variable sizes and the cost of a page fault is a function of the particular page referenced. In such an environment the conventional page replacement algorithms are ...
A study of order transformations of hierarchical structures in IMS data bases
Hierarchical structures are widely used in information processing. An application program written to traverse a hierarchical structure will not work properly, if at all, when the order of the structure (in the sense of tree order) is altered. This paper ...
Methodology for transferring programs and data
The paper presents an overview of current and proposed solutions to the problems of incompatible programs and data between dissimilar computer systems. The approaches are formalized, compared, and contrasted. Standardization, program translation, data ...
Architecture to an interactive migration system (AIMS)
Growth in the computer industry produces a need to convert data and/or programs from one system to another from time to time. While this process has been going on for years, the techniques used to execute this task have been ad hoc and expensive. Very ...
A record oriented, grammar driven data translation model
The Data Translation problem is the problem of translating data from one computer stored form into another, either with or without changing its original logical structure. A lot of work have been established in this field, but most of them are geared to ...
A data description language approach to file translation
The basic research on data definition languages and the translation algorithm was supported by the Air Force Office of Scientific Research, Air Force Systems Command, U.S.A.F., under Grant No. AFOSR-72-2219. The development and implementation of the ...
“Automatic generation of data conversion programs using a data description language”
The paper describes the application of automatic program generation methodology in generating file conversion programs. The system, accepts as input descriptions of source and target files in a Data Description Language (DDL) and data manipulation ...
A semi-automatic data base translation system for achieving data sharing in a network environment
This paper deals with the problems of data base translation for achieving data sharing through a computer network. A semiautomatic data base translation procedure and its prototype implementation are described. The procedure takes advantage of data ...
SEQUEL: A structured English query language
In this paper we present the data manipulation facility for a structured English query language (SEQUEL) which can be used for accessing data in an integrated relational data base. Without resorting to the concepts of bound variables and quantifiers ...
A high level data sublanguage for a context-addressed segment-sequential memory
This paper presents a high-level data sublanguage called SLICK for the manipulation and retrieval of data from normalized and unnormalized (hierarchically structured) relational tables. The language is designed to express the process used by information ...
An approach to implementing a relational data management system
One of the key developments in data base technology in recent years has been the introduction of the relation as a model for a data base and its manipulation language. This article begins with a very brief discussion of this concept particularly as it ...
The relational data management system: A perspective
In this paper, the functional capabilities and economic features of the Relational Data Management System (RDMS) are discussed. RDMS is a generalized on-line data management system written in PL/1 for the Multics operating system.
The basic concepts of ...
Relational data management implementation techniques
The use of relations as a model of information stored in large data bases has several significant advantages over other methods of data description. It is often, however, criticized as difficult to implement efficiently. In this paper, some of the pros ...
Restart and recovery in a transaction-oriented information processing system
We identify the performance aspects of restart and recovery. We present a model describing the relationships between the errors in information processing systems, the procedures needed to recover from the errors and the actions necessary to make the ...
A search path selection algorithm for the Data Independent Accessing Model (DIAM)
The Data Independent Accessing Model (DIAM) provides great flexibility in specification of access paths to data. When a query is expressed in a Representation Independent Language (RIL), the problem arises of finding the relevant access paths and ...
Analysis of indexed sequential and direct access file organizations
A computer systems designer is faced with a decision concerning the organization of data files. He often would like to design a file so that sequential and random processing can both be performed efficiently. Two file organizations often proposed for ...
Data base contamination and recovery
An approach to dealing with the contamination problem in the context of a simple model of a multi-process data base environment is described. We present an algorithm which, given a specification of a set of data transfers which are judged to have been ...
Data administration and the DBTG report
The April, 1971, Data Base Task Group Report has already had a profound impact on the data base management community. At least five currently released systems claim to follow the report's guidelines. Yet the report was criticized at the time of its ...
The futures of database management
This paper explores some futures of database management. A review of the historical development of database management facilities reveals a dichotomy of systems into host-language database management systems for application programmers, and self-...
Some thoughts on the future of associative memories/processors in the solution of data base management problems
Associative memories and processors have been discussed in the literature for the past 15 years and a small number of hardware devices have actually been built (21). A number of applications have been considered and include air traffic control (22), ...
A set-theoretic view of data-base representation
To achieve what I believe to be an acceptable. Information Management System, I propose that a set-theoretic view of a data-base be adopted. Most potential data-base users use the language of set-theory in their day to day references to the objects and ...
Cited By
Index Terms
- Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control