Computer driven systems and methods for managing data which use two generic data elements and a single ordered file
First Claim
1. A method of employing a computer with input means, memory, and a data processing unit to manage data, said method comprising the steps of:
- employing said computer to create an original array of data sets, each said data set having a data type element for differentiating one kind of subject matter from another and a data value element for differentiating data sets with the same data type element and said array containing a key data set and data sets related to said key data set;
employing said computer to link the related data sets in a hierarchy in which the related data sets are each in an indentured relationship to the key data set;
so employing the computer to invert the relationship between an indentured data set in the original array and the remaining data sets in said array as to create an inverted data set array having;
(a) the data set entered in the original array as its key data set, and (b) all data sets higher in the hierarchy of the original data set linked to that key data set in inverted order; and
storing the original and inverted data set arrays in the memory of the computer.
1 Assignment
0 Petitions
Accused Products
Abstract
Computer-based systems and methods for managing data. These systems and methods take advantage of a unique model which: increases speed and flexibility; eliminates the need for a complex data manipulation language, data or application dependent software, and separate structuring tools such as pointers, lists, and indexes; and automatically creates among the data relationships which may or may not have been apparent to a user or the designer. Salient, unique features of the systems and methods are their capabilities for providing: a generic data structure consisting of two generic data elements and a generic data set array, indentured data set relationships, inversion of data set relationships, dynamic reorganization of data sets, control over the data relationships that can be established, global linking of data sets, and automatic connection projection. A database structure which is independent of the type of data being managed is established, and the data is entered into a single file in which the data is automatically logically and physically ordered.
147 Citations
87 Claims
-
1. A method of employing a computer with input means, memory, and a data processing unit to manage data, said method comprising the steps of:
-
employing said computer to create an original array of data sets, each said data set having a data type element for differentiating one kind of subject matter from another and a data value element for differentiating data sets with the same data type element and said array containing a key data set and data sets related to said key data set; employing said computer to link the related data sets in a hierarchy in which the related data sets are each in an indentured relationship to the key data set; so employing the computer to invert the relationship between an indentured data set in the original array and the remaining data sets in said array as to create an inverted data set array having;
(a) the data set entered in the original array as its key data set, and (b) all data sets higher in the hierarchy of the original data set linked to that key data set in inverted order; andstoring the original and inverted data set arrays in the memory of the computer. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26)
-
-
27. In a method which:
- (1) utilizes a computer with input means, memory, and a data processing unit to retrieve relevant data from a compilation of data that;
(a) is inputted by said input means, (b) is stored in said memory, and (c) includes the relevant data, and (2) requires only said computer for structuring relationships among the items of data, the steps of;employing the computer to resolve the compilation of data into multiple arrays of data sets, each said data set having a data type element for differentiating one type of subject matter from another and a data value element for differentiating data sets with the same data type element from each other and each said data set array containing a key data set and data sets related to said key data set; and employing said computer to so link the data sets in the data arrays as to make evident relationships among the data sets which exist but are not directly connected. - View Dependent Claims (28, 29, 30, 31, 32, 33, 34, 35, 36, 37)
- (1) utilizes a computer with input means, memory, and a data processing unit to retrieve relevant data from a compilation of data that;
-
38. A method of managing data which includes the steps of:
-
generating a multiplicity of data sets, each of which contains a data type element for differentiating one type of subject matter from another and a data value element which differentiates data sets with the same data type element from each other; grouping said data sets into one or more original hierarchial arrays, each having a key data set and linked data sets indentured to the key data set; and so inverting relationships between an indentured data set and the other data sets in the same data set array as to create a new, inverted array of data sets in which the indentured data set is the key data set and all higher level data sets in the original array are indentured to the key data set of the new, inverted array. - View Dependent Claims (39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59)
-
-
60. In a method of retrieving relevant data from a compilation of data elements without the use of a separate means for structuring relationships among the data elements, the steps of:
-
resolving the compilation of data elements into one or more arrays of data sets, each having a data type element for differentiating one type of subject matter from another and a data value element for differentiating data-sets with the same data type element from each other and each said data set array containing a key data set and data sets related to said key data set; and so linking the data sets in the data arrays as to make visible relationships among the data sets which exist but are not defined. - View Dependent Claims (61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71)
-
-
72. A data management computer system which comprises:
-
means for creating data sets, each having a data type element for differentiating one type of subject matter from another and a data value element for differentiating data sets with the same data type element from each other; means for organizing said data sets into one or more data arrays, each of said data set arrays having a key data set and one or more linked data sets indentured to the key data set in a sequential hierarchial relationship; and memory means in which the thus generated and organized data sets can be stored. - View Dependent Claims (73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83)
-
-
84. A method for employing a computer with input means, random access memory, and a data processing unit to manage data, said method comprising the steps of:
-
employing said computer to create and manipulate a plurality of original data set arrays comprised of a key data set and zero or more related data sets linked to the key data set, each said key and related data set having a variable length data type element for differentiating one kind of subject matter from another and a variable length data value element for differentiating data sets with the same data type element, each data type being delimited with a unique character or binary number at its end to separate it from the data value element and each key and related data set being delimited by a unique character or binary number at the end thereof to separate said data set from other data sets; employing said computer, without the use of memory pointers, to contiguously link selected related data sets in memory to a key data set or to existing related data sets in a data set array in a hierarchical tree arrangement with an indenturing process which uses hierarchy designators to establish a hierarchy of related data sets indentured to the key data set, the key data set acting as a root of said hierarchy and the related data sets being linked as multiple level branches to said root; so employing the computer to create one or more new inverted data set arrays with the same structure as the original data set array, using an inversion process by which;
(a) each selected indentured data set from the original data set array is used to create a new key data set, and (b) all data sets in said original data set array which are data set hierarchy branches containing the indentured data set which re nearer said root are indentured to the new key data set in inverted order using said indenturing process; andstoring the original and inverted data set arrays in the memory of the computer. - View Dependent Claims (85, 86, 87)
-
Specification