NINF

AcronymDefinition
NINFNetwork Infrastructure
References in periodicals archive ?
--NINF-NINF: a node labeled with a pair of NINF types has at most six successors, all the pairs of different types that can be obtained by combining the four parents of the two labels;
--INF-NINF: in the presence of INF and NINF types, the node has at most three successors, all the pairs of different types that can be obtained by the triple represented by the INF type and the parents of the NINF type.
In the R-graph, two start nodes are present, labeled with secretary and employee, respectively, which are the NINF types of the schema.
Note that points (1) to (4), in Definition 4.1, refer to the case of single NINF types (start nodes), INF-NINF, NINF-NINF, and INF-INF pairs of types, respectively.
In Appendix A.3, it is shown that a regular schema [Sigma] can be transformed, without loss of generality, into another regular schema [[Sigma].sup.bin] (referred to as binary regular schema) that, with respect to the former, has the NINF types expressed by only using binary inheritance (i.e., every subtype is defined by two immediate supertypes).
if [Tau] [element of] [[Sigma].sup.bin] is a NINF type defined as: type [Tau] = [[Tau].sub.1] and [[Tau].sub.2] then: a = ([Tau]) and b = ([[Tau].sub.1], [[Tau].sub.2]); that is, ([Tau]) R ([[Tau].sub.1], [[Tau].sub.2]).
if [[Tau].sub.i] [element of] [[Sigma].sup.bin] is an INF type and [[Tau].sub.j] [element of] [[Sigma].sup.bin] is a NINF type defined as: type [[Tau].sub.j] = [[Sigma].sub.1] and [[Sigma].sub.2] then: a = ([[Tau].sub.i], [[Tau].sub.j]) and b [element of] B where: B = {([[Sigma].sub.1], [[Sigma].sub.2])} [union] C and
if [[Tau].sub.i], [[Tau].sub.j] [element of] [[Sigma].sup.bin], [[Tau].sub.i] [is not equal to] [[Tau].sub.j] and both are NINF types defined as:
As already mentioned, the nodes of the R-graph are labeled with all the NINF types of the schema (start nodes), and all the unordered pairs of types whose meet is required in order to accomplish the inheritance process for the NINF types of the schema.
[N.sub.1] = {([Tau])|[Tau] [Element of] [[Sigma].sup.bin]) is a NINF type}
--[[Tau].sub.i] is a NINF type (the case [[Tau].sub.i] and [[Tau].sub.j] both NINF types is a simple generalization).
Then, there exists a NINF type T and a node ([[Tau].sub.i], [[Tau].sub.j]) of ([[Sigma].sup.bin]) such that: ([Tau]) R* ([[Tau].sub.i], [[Tau].sub.j]) and ([[Tau].sub.i], [[Tau].sub.j]) R* ([[Tau].sub.i], [[Tau].sub.j]).