A relational model of data for large shared data banks
Communications of the ACM
Programming Techniques: ASP—a ring implemented associative structure package
Communications of the ACM
Compound data structure for computer aided design; a survey
ACM '67 Proceedings of the 1967 22nd national conference
GRASP—a graphic service program
ACM '67 Proceedings of the 1967 22nd national conference
APL: a language for associative data handling in PL/I
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
A compact data structure for storing, retrieving and manipulating line drawings
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Data structures and techniques for remote computer graphics
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
| Hi-index | 0.00 |
When a model of an object to be designed, or more generally a set of data interrelated in an intricate way, is to be created in the computer, a suitable data structure must be built up in the machine memory. This paper deals with the problem of representing objects composed of other objects, hierarchically organized and linked together by connection relations. A careful analysis of these objects, which are encountered in several applications, has provided the base for designing a flexible, systematic, expandable and relatively compact data structure for their computer representation. The characteristics which are common to several parts of the object are stored without duplication. An implementation of the structure based on the ring technique, which gives the structure its flexibility, is also described in detail.