A file definition facility for file structures

Authors:
Billy G. Claybrook
Affiliations:
-
Venue:
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
Year:
1974

Citing 5
Cited 2

List tracing in systems allowing multiple cell-types

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
Symmetric list processor

Communications of the ACM
ALGOL Sixty-Eight Implementation

ALGOL Sixty-Eight Implementation
FOL: a language for implementing file organizations for information storage and retrieval systems

SIGPLAN '73 Proceedings of the 1973 meeting on Programming languages and information retrieval

A facility for defining and manipulating generalized data structures

ACM Transactions on Database Systems (TODS)
Logical Structure Specification and data type definition

ACM '79 Proceedings of the 1979 annual conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 statements are given. The combination of functions and operators appear as directives to the programming system for structuring files. Several simple examples are given to illustrate the use of the FDF. The data organization for the implementation of this facility is described in detail. Problems of considerable importance that are treated are: (1) garbage collection, (2) template construction, and (3) runtime address calculation. The external definitions are represented internally by descriptors. The format of the descriptors is given and a discussion of the items in the descriptors is presented.