|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Bachman, C.W. and Williams, S.B. "The Integrated Data Store—A General Purpose Programming System for Random Access Memories", AFIPS 1964 FJCC, Vol. 26, Spartan Books, N.Y., pp. 411-422.
|
 |
2
|
|
| |
3
|
Claybrook, Billy G. "LPL: A Generalized List Processing Language", To appear in the 1974 Proceedings of the NCC&E.
|
 |
4
|
|
| |
5
|
Dodd, George D. "APL—A Language for Associative Data Handling in PL/1", AFIPS 1966 FJCC, Vol. 29, Spartan Books, N.Y., pp. 677-684.
|
 |
6
|
|
| |
7
|
Lefkovitz, David. File Structures for On-Line Systems, Spartan Books, New York, 1969.
|
| |
8
|
McGee, William C. "File Structures for Generalized Data Management", Information Processing 68, North-Holland Publishing Company, Amsterdam, 1968, pp. 1233-1239.
|
| |
9
|
|
| |
10
|
Standish, T. A. "A Data Definition Facility for Programming Languages", Dissertation, Department of Computer Science, Carnegie Institute of Technology, May 1967.
|
 |
11
|
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen
, Daniel D. Gajski
|