A system tool for electronically generating a machine directory entity having a binary tree relationship. The method generates the directory entity directly from a sequence of input keys without using an intermediate stack. The input key sequence may be sorted or unsorted; but if sorted (whether ascending or descending), the system tool is made more efficient. The directory entity is used by the machine to address objects which may be found within the confines of the machine. Unique connectors called invertible edges, are generated in the machine organization of the directory entity being generated.
A digital data processing system having an index file containing a plurality of file headers includes an arrangement having a file header processing portion for iteratively retrieving file headers from an index file and for establishing in response thereto a descriptor defining a directory in a directory tree, each descriptor defining the relationship of the corresponding directory to a parent directory in the directory tree, and a group vector processing portion, responsive to processing of a file header by the file header processing portion, for generating a group vector comprising a plurality of pointers to said descriptors, each pointer defining the relationship of a directory to one or more child directories in said directory tree.
A method and apparatus for aligning a restored parent environment to its child environments with minimal data loss is disclosed. The method and apparatus achieve the alignment by re-executing the transactions affecting the objects in the child environments and the revisions of the objects in the parent environment in their order of execution, thereby, allowing the restored parent to further recover loss data from its child environments. The transactions are enhanced to facilitate collection of information regarding the transactions during normal operation, and to adjust their actions during their re-execution based on the information collected. As a result of further data recovery by the restored parent environment, alignment may be achieved with substantially less data loss.
Arrangement of fields in binary tree nodes provides a minimal storage encoding storing fixed and variable length keys in factored form in a multilevel tree. A locating method, and apparatus embodying that method, directed by an argument key, which may or may not be stored in the tree, traces a path following arcs upward or downward between nodes in said binary tree, starting from the top node or any other node, until it finds either the argument key or the delta arc where said argument key would be inserted into said tree. The novel binary tree encoding also provides for path tracing starting at a data backpointer field, which allows accessing of neighboring data entries in collating sequence order.
A generic key, for allowing a data use to efficiently search a set of user data recorded in blocks in an efficient method using a multiplicity of user keys. As user data blocks are built up for recording, the unique identifiers are placed in the header of the data block, recorded on the disk surface with the contents stored on the device and the platter index. The user can then sort and search the index based upon which of the multiplicity of user keys he selects.
A system of data storage tables (10A) include an extendable subject table (12) for storing subject UID entries, and an extendable element table (16) for storing UID element entries and aggregate UID entries and role UID entries. The UIDs stored in the tables specify relationships between the UIDs, and collectively define a tangle (10B) of connecting paths. The tangle spreads out between subject nodes corresponding to subject UIDs, and aggregation nodes corresponding to aggregate UIDs, and role nodes corresponding to role UIDs. Each subject node and aggregation node and role node is path connected through the tangle to other subject UIDs and aggregate UIDs and role UIDs defining the relationship between the UIDs in the tables.
