About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
Suffixes of addressable data graphs
Abstract
The notion of a self-insertion of a data graph yields a simple and natural definition of a suffix of a data graph. For addressable data graphs, addressing schemes yield a useful alternative definition of suffix, which also suggests a generalized version of suffix. Examples of addressable data graphs and their suffixes include: trees and their subtrees, and arrays with their (possibly lower dimensional) subarrays. Thus a suffix can be viewed as a highly structured type of substructure of a data graph. Necessary and sufficient conditions for a suffix of an addressable data graph to be addressable are derived. It is further shown that suffix data graphs, even when not addressable, often enjoy a slightly weaker property termed quasi-addressability; in fact suffixes of so-called deep-rooted data graphs are always quasi-addressable. © 1973 Academic Press, Inc.