Data management systems and methods including creation of composite views of data

• US 5,555,409 A
• Filed: 04/11/1994
• Issued: 09/10/1996
• Est. Priority Date: 12/04/1990
• Status: Expired due to Term

• Current Assignee: Applied Technical Systems Incorporated
• Original Assignee: Applied Technical Systems Incorporated
• Inventors: Wurden, Frederick L., Leenstra, Richard B. Sr., Wurden, Edwin H., Otis, Lance N.
• Primary Examiner(s): Kulik, Paul V.
• Application Number:
  US08/226,071
• Time in Patent Office: 883 Days
• Field of Search: 395/600, 395/149, 395/160, 395/700
• US Class Current: 1/1
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

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: efficiently creating a composite view of the data; importing data from and exporting data to external databases; and otherwise providing significant and advantageous, additional control over the creation, maintenance, and display of the data making up a database constructed in according with the principles described in parent application Ser. No. 07/621,834 filed 4 Dec. 1990.

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 original 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 each of the related data sets is in an indentured relationship to the key data set;

so employing the computer to invert the relationship between at least one 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) said indentured data set 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;

employing said computer to create a file containing the original data array and the inverted data array or arrays; and

employing said computer to construct and store a list of all the key data sets in said file.

2. A method as defined in claim 1 which includes the step of employing said computer to place successive items in said list at the beginning of successive data set arrays in said file.

3. 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 a file comprising an 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 related data sets in said array in a hierarchy in which each of the related data sets is in an indentured relationship to the key data set; and

employing said computer to find any and all direct and indirect relationships among stored data types, data elements, and/or data sets that meet user specified criteria.

4. A method as defined in claim 3 which includes the step of providing means by which a user can input a request for at least one of the following selection criteria to the data processing unit of the computer:

data sets with a particular type, data sets with a particular data value, particular data sets, and data sets with a particular relationship therebetween.

5. A method as defined in claim 4 in which the user'"'"'s request is fulfilled by building a separate list of key data sets for each of said selection criteria and searching said list for key data sets which meet all of the selection criteria.

6. A method as defined in claim 4 in which the user'"'"'s request encompasses more than one data type and is fulfilled by searching said file for all allowed linked data types and creating a list of linked data types common to all of the related data sets.

7. A method as defined in claim 4 in which the user'"'"'s request is fulfilled by making a list of the key data sets in inverted data set arrays that meeting the selection criteria, making a list of the key data sets in original data set arrays that meet the selection criteria, counting the number of key data sets in each of said lists, and searching the list with the smaller number of key data sets for key data sets that meet all of the selection criteria.

8. A method as defined in claim 7 in which the number of links between the data sets in each of those data set arrays in the list that is searched is counted, the data set array with the smallest link count is searched for key data sets which meet the selection criteria, the data set array with the next smallest link count is searched for data sets found in the preceding search of a data set array, and the search is continued through data set arrays with numbers of links in ascending order until a data set array with no data sets meeting all the selected criteria is found or until all of the data set arrays have been searched and any data sets meeting all of the selection criteria have been identified.

9. A method as defined in claim 7 in which the number of links between the data sets in each of those data set arrays in the list that is searched is counted and in which the data set arrays are then searched by ascending number of links for data sets meeting all of the selection criteria.

10. A method as defined in claim 4 in which the selection criteria encompass more than one data type, in which the data types are of at least two different kinds, in which the file is searched separately by kind of data type for data sets which meet all of the selection criteria, and in which the results of the separate searches are combined into a composite view of said file.

11. A method for managing data which comprises the steps of:

creating an 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, said array containing a key data set and data sets related to said key data set and the related data sets being linked to the key data set in a multiple level hierarchy in which each of the related data sets is in an indentured relationship to the key data set; and

providing a process via which data sets in said array and/or the data types and data elements making up said data sets can be exported to an external database.

12. A method as defined in claim 11 which includes the process that allows for export of data in said array comprises the steps of:

tracing a hierarchy path consisting of all directly related data sets in said array;

expanding the hierarchy path into a set of all paths between the key data set and the related data sets, each said path being a list of key and related data sets with only one data set at any level of the hierarchy;

creating a relational table with a column heading for each of the data types in said data set array;

decomposing the data sets in said set of paths path-by-path into a data type and a data value; and

entering the data values into the relation table under the appropriate heading.

13. A method as defined in claim 12 which includes the step of converting the entries in each row of the non-normalized table into a concatenated key of non-null values such that said values define a set of fully normalized tables corresponding to the columns in the non-normalized table.

14. A method as defined in claim 12 which includes the step of decomposing the non-normalized table into a set of normalized relational tables.

15. A method for managing data which comprises the steps of:

creating a file comprising one or more arrays 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, said array containing a key data set and data sets related to said key data set and the related data sets being linked to the key data set in a hierarchy in which each of the related data sets is in an indentured relationship to the key data set;

said data set array being created by importing data into said file from an external database.

16. A method as defined in claim 15 in which data is imported into said file by:

verifying that said data is of an allowed kind and that it has a permitted link hierarchy;

creating a set of ordered intermediate tables with headings corresponding to queries on the external data base;

combining said tables into a single table in which each of the column headings is prefixed to its column values to create data sets, each having a data type defined by the column value; and

reformatting said table as a data set array.

17. A method as defined in claim 16 in which the data sets are placed in the combined table in the order defined by the ordered intermediate tables and each column in the combined table is accordingly a linked data set level.

18. A method as defined in claim 16 in which the combined table is reformatted into a data set array by:

reading each row in said table and each data set in that row;

prefixing at least one hierarchy designator corresponding to the level of the data set in a row to each said data set;

inserting end-of-data-set delimiters at the end of each said data set; and

adding the thus delimited data sets in order to a user defined key data set to create a data set array as aforesaid.

19. A method as defined in claim 18 which includes the step of excluding from addition to the data set array being created any data set which is a duplicate of an already added data set in the same branch of the hierarchy of data sets in the array.

20. A method for managing data which comprises the steps of:

constructing a first data set array comprising;

a key data set which heads said array and characterizes said array by a data type element which differentiates one kind of subject matter from another and a data value element which differentiates data sets with the same data type element; and

a data set linked to said key data set, said linked data set also 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;

providing a data control module with the capability of replacing the data type element in the key data set with a different data type element to create a new key data set with a different characterization of the data value in said key data set; and

constructing a new data set array headed by said new key data set.

21. A method as defined in claim 20 which includes the step of providing a table containing data types for which the data type of the key data set heading the first data set array may be exchanged.

22. A method as defined in claim 20 which includes the step of configuring the data control module to include instructions governing the substituting of a different data type for the data type in the key data set heading the first data set array.

23. A method as defined in claim 20 in which said data type element is exchanged with a plurality of different data type elements.

24. A method for managing data which comprises the steps of:

constructing a database comprising an array of data sets, each 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

providing a data control module with a record for at least one data type, said record having at least one field in which a user can place instructions for performing an operation on or related to the data in said database in a manner designated by the user.

25. A method as defined in claim 24 in which the data control module contains default instructions for performing said operation in the absence of instructions placed in said module by the user.

26. 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 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 each of the related data sets is in an indentured relationship to the key data set;

so employing the computer to invert the relationship between an indentured data set in the 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

employing said computer to inhibit inversion of any data sets in said array which have a user-specified data type.

27. 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 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 each of the related data sets is in an indentured relationship to the key data set; and

employing said computer to limit the relationships among the data sets in said array.

28. A method for managing data which comprises the steps of:

creating a database comprising plural data set arrays, each said data set array 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, said array containing a key data set and data sets related to said key data set, and the related data sets being linked to the key data set in a hierarchy in which each related data set is in an indentured relationship to the key data set; and

employing said key data sets to access the data in said database hashed key data or by sort order.

29. A method for managing data which comprises the step of creating a database which comprises a plural 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;

each data set array containing a key data set and data sets related to said key data set;

the related data sets being linked to the key data set in a hierarchy in which each related data set is in an indentured relationship to the key data set; and

at least one of said data set arrays having a first related data set which is linked directly to said key data set and a second related data set which is linked to the key data set through one or more of the other related data sets in the hierarchy.

30. A method for managing data which comprises the steps of:

creating an 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, said array containing a key data set and data sets related to said key data set, and the related data sets being linked to the key data set in a hierarchy in which each related data set is in an indentured relationship to the key data set; and

processing each of the data sets in said array as an indivisible composite of a data type element and a data value element.