Accession Number : AD0706792

Title :   DATA GRAPHS AND ADDRESSING SCHEMES: EXTENDED ABSTRACT,

Corporate Author : IBM WATSON RESEARCH CENTER YORKTOWN HEIGHTS N Y

Personal Author(s) : Rosenberg,Arnold L.

Report Date : 12 NOV 1969

Pagination or Media Count : 39

Abstract : A data graph is obtained from a data structure by masking out the specific data items at the nodes of the structure and concentrating only on the linkages in the structure. This factoring operation is done implicitly when one refers to 'tree structures' or 'arrays' as generic objects. Structural uniformities in data graphs can often be exploited to facilitate and systematize the accessing of nodes in the graph and the implementation of the graph in a computer. The paper presents a model for data graphs which can be used to study such uniformities. The main results reported characterize, in terms of structural uniformities, those classes of data graphs which can be implemented by 'relative addressing' and by 'relocatable relative addressing'. (Author)

Descriptors :   (*COMPUTATIONAL LINGUISTICS, REPORTS), MATHEMATICAL MODELS, COMPUTER PROGRAMMING, SET THEORY, ALGORITHMS, THEOREMS

Subject Categories : Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE