Information Technology Reference
In-Depth Information
agriculture, etc. This hierarchical (directory-like) recursion is modeled by the
below recursion in H.
Data identied \occur" only at the V level of a `complete' (list of one or
more) (D,C,V) triples.
Use of the hierarchy (H) entails navigating \up and down" the layers of the
hierarchy of (D,C,V) levels. At any one time a user has traversed a Stack of such
(d,c,v)'s.
Unary and
-ary Functions | O, On: With each data version there may be
some specic, named (unary) functions applicable to that specic data. Desig-
nating an operation for application shall mean that the operation is applied to
the data designated by the current stack top (which will be a list of (d,c,v) triples
| with the list length denoting the current depth of the traversed hierarchy wrt.
the root System Hierarchy).
With each specic type we may likewise associate a set of named, unary
functions. Each such function is then understood to be applicable to any version
of data of that type and domain. The actual data is designated by the topmost
stack element whose type matches the operation type.
With each domain we may associate a set of usually
N
-ary functions. Each
such function is then understood to be applied to data designated by the n
topmost stack elements whose types matches, in order, the designated operation
type.
Some operations may not be computable. Instead text is given which directs
the user to \perform" an appropriate evaluation and to enter a resulting value!
n
Function Result Storage | Stg: Results of operation applications must be uniquely
named (by the user) and are stored in a local storage (Stg) under that name
together with a historical record of the stack of the time of application, and the
appropriately (D,C,V) marked operation name.
At any layer and level domain names, type names, version names, data and
operations are annotated by explanatory, descriptive and other text ( Text ).
Operations can be shared across domains, types and versions, as well as across
layers of the recursive hierarchy.
Database Sharing and Data Filtering | F: Since also data can be shared across
domains, types, versions and layers of the recursive hierarchy, a lter function (F)
is provided which, for dierent levels and layers (etc.) may specialize, generalize
or otherwise instantiate the immediately location designated data.
This potentially allows a simple information repository to be viewed, through
the (D,C,V) hierarchy as a highly structured (network) of data.
6.4
A Formal (Data Structure) Model
\A small set of formulas is often worth a thousand pictures":
Search WWH ::




Custom Search