Data base and knowledge operating system

• US 8,051,102 B2
• Filed: 07/16/2003
• Issued: 11/01/2011
• Est. Priority Date: 07/26/2002
• Status: Active Grant

• Current Assignee: Philip A. Templeton, M.D., P.A., Relavance Software S.A.
• Original Assignee: Levitronics Inc.
• Inventors: Everett, Ron
• Primary Examiner(s): Breene; John E
• Assistant Examiner(s): MYINT, DENNIS Y
• Application Number:
  US10/620,988
• Publication Number:
  US 20040024790A1
• Time in Patent Office: 3,030 Days
• Field of Search: 707/103, 707/4, 707/10, 707/3, 395/613
• US Class Current: 707/793
• CPC Class Codes: G06F 16/284 Relational databases

Abstract

Associative Data Management and Knowledge Operating System using a Data Instance centric architecture, where Data Instances are typically atomic. Each Data Instance can be at the center with all its associations. The base structures encapsulate the Data Instances and can generally be identical in form and function, and application independent. Encapsulate references can include references to all other directly related independently encapsulated Data Instances. The encapsulated references can be both unique identifiers for each and every associated Data Instance and also logical indexes that encode the abstracted location of each Data Instance, making it possible to both identify and locate any Data Instance using the same reference key.

Claims

1. A data management system comprising:

a. a plurality of independent data structures having a common form, each of said data structures encapsulating a single data instance;

b. each of said data structures also encapsulating references to other of said independent data structures encapsulating associated data instances; and

c. wherein said plurality of data structures are stored on a computer-readable media in non-tabular form and further wherein said data instances encapsulated in said data structures can be added, removed and searched.

2. The data management system of claim 1 wherein each of said independent data structures also encapsulates a reference indicating the location of itself within a multi-dimensional organization of said data structures.

3. The data management system of claim 1 wherein a first data instance is encapsulated with references to associated data instances and each of said associated data instances are separately encapsulated with a reference to said first encapsulated data instance.

4. The data management system of claim 3 wherein said data structures are application independent and generally the same for all of said data instances.

5. The data management system of claim 1 wherein:

a first data instance is encapsulated with references to associated data instances and each of said associated data instances are separately encapsulated with a reference to said first encapsulated data instance;

wherein each of said encapsulated references is a logical index which uniquely identifies each of said associated encapsulated data instances and also encodes the location of each of said associated encapsulated data instances on said computer-readable media; and

wherein said logical index is ‘

m’

dimensional, and has ‘

n’

bits per dimension.

6. The data management system of claim 5 wherein said data structures are application independent and generally the same for all of said data instances.

7. The data management system of claim 1 wherein:

said encapsulated references are in at least one dimensions; and

each of said at least one dimensions corresponds to a type of association.

8. The data management system of claim 7 wherein each of said at least one dimensions has a plurality of said encapsulated references.

9. The data management system of claim 8 wherein said data structures are application independent and generally the same for all of said data instances.

10. The data management system of claim 7 wherein said data structures are application independent and generally the same for all of said data instances.

11. The data management system of claim 1 wherein said data structures are application independent and generally the same for all of said data instances.

12. The data management system of claim 1 wherein at least one of said encapsulated references is a reference to an encapsulated data instance in another computing environment.

13. The data management system of claim 1 wherein the encapsulated references of at least one of said encapsulated data instances are unique and the encapsulated references of at least two of said encapsulated data instances are generally identical.

14. The data management system of claim 1 including a plurality of pre-existing encapsulated data instances having established associations, wherein at least one new encapsulated data instance is associated with at least one of said preexisting encapsulated data instates.

15. The data management system of claim 1 including a plurality of pre-existing encapsulated data instances having established associations, wherein any of said pre-existing encapsulated data instances can be removed and disassociated from other pre-existing associated encapsulated data instances.

16. The data management system of claim 1 including a plurality of pre-existing encapsulated data instances having established associations, wherein new associations between at least two pre-existing encapsulated data instances can be added.

17. The data management system of claim 1 including a plurality of pre-existing encapsulated data instances having established associations, wherein any of said pre-existing associations between said pre-existing encapsulated data instances can be removed.

18. The data management system of claim 1 further comprising a search capability for finding specific unknown encapsulated data instances from a selection criteria of known encapsulated data instances by accessing said known encapsulated data instances representing said selection criteria comprising the steps of:

accessing references encapsulated with said known encapsulated data instances representing said selection criteria;

using Boolean operations to compare said accessed encapsulated references to find references to said specific unknown encapsulated data instances; and

retrieving said specific unknown encapsulated data instances.

19. The data management system of claim 18 wherein said encapsulated references are embodied as logical indexes in a plurality of dimensions, each of said dimensions corresponding to a type of association, wherein said accessing further comprises accessing said encapsulated references from said dimensions specified in said selection criteria.

20. The data management system of claim 19 wherein said encapsulated references are ‘

m’

dimensional logical indexes, each of which uniquely identifies and encodes the location of said associated encapsulated data instances on said computer readable media, wherein said encapsulated references are filtered by Boolean operations on at least one of said ‘

m’

dimensional logical indexes.

21. The data management system of claim 20 wherein said Boolean operations further comprise:

a basic mathematical operator which results in the direct exclusion of at least one encapsulated reference from the result of said comparing in a single operation.

22. The data management system of claim 19 wherein said Boolean operations further comprise:

a basic mathematical operator which results in the direct exclusion of at least one encapsulated reference from the result of said comparing in a single operation.

23. The data management system of claim 18 wherein said encapsulated references are ‘

m’

dimensional logical indexes, each of which uniquely identifies and encodes the location of said associated encapsulated data instances on said computer readable media, wherein said encapsulated references are filtered by Boolean operations on at least one of said ‘

m’

dimensional logical indexes.

24. The data management system of claim 23 wherein said Boolean operations further comprise:

a basic mathematical operator which results in the direct exclusion of at least one encapsulated reference from the result of said comparing in a single operation.

25. The data management system of claim 18 wherein said Boolean operations further comprise:

basic mathematical operators which result in the direct exclusion of at least one encapsulated reference from the result of said comparing in a single operation.

26. The system of claim 1 wherein said encapsulated data instances have attributes of a user interface.

27. The system of claim 26 wherein said attributes of a user interface are selected from a group of user views, display elements, and data access methods.

28. The system of claim 1 further comprising searching said system wherein the encapsulated references of two or more different encapsulated data instances are used to derive desired results.

29. The system of claim 28 wherein said encapsulated references of two or more different encapsulated data instances are compared for at least one of commonality, similarity and difference to derive sets of references corresponding to said desired results.

30. The system of claim 29 wherein said encapsulated references of two or more different encapsulated data instances are stored in an order based on value and are compared for at least one of commonality, similarity and difference to derive sets of references corresponding to said desired results.

31. The system of claim 28 wherein:

a first data instance is encapsulated with references to associated data instances and each of said associated data instances are separately encapsulated with a reference to said first encapsulated data instance;

wherein each of said encapsulated references is a logical index which uniquely identifies each of said associated encapsulated data instances and also encodes the location of each of said associated encapsulated data instances on said computer readable media; and

wherein said logical index is ‘

m’

dimensional, and has ‘

n’

bits per dimension;

the encapsulated references of two or more different encapsulated data instances are compared for at least one of commonality, similarity and difference to derive sets of references corresponding to said desired results.

32. The system of claim 28 wherein:

each of said at least one dimensions has a plurality of said encapsulated references; and

said encapsulated references of two or more different encapsulated data instances are stored in an order based on value and are compared for at least one of commonality, similarity and difference to derive sets of references corresponding to said desired results.

33. The system of claim 1 further comprising:

a plurality of encapsulated data instances representing ASCII characters;

said data structures containing said encapsulated data instances representing ASCII characters also containing encapsulated references to encapsulated data instances using one or more of said corresponding ASCII characters; and

said data structures containing encapsulated data instances using one or more of said ASCII characters also containing encapsulated references to said encapsulated data instances representing said used ASCII characters.

34. The system of claim 33 wherein said encapsulated references with a given ASCII character data instance refer to other encapsulated data instances using said ASCII characters based on the position of said given ASCII character in the sequence of said ASCII characters in said encapsulated data instances.

35. The system of claim 1 further comprising:

a plurality of encapsulated data instances representing Unicode characters;

said data structures containing said encapsulated data instances representing Unicode characters also containing encapsulated references to encapsulated data instances using one or more said Unicode characters; and

said data structures encapsulated data instances using one or more of said Unicode characters also contains encapsulated references to said data instances representing said used Unicode characters.

36. The system of claim 35 wherein said encapsulated references with a given Unicode character data instance refer to other data instances using said Unicode characters based on the position of said given Unicode characters in the sequence of said Unicode characters in said encapsulated data instances.

37. The system of claim 1 further comprising:

a plurality of encapsulated data instances representing the tokens of a token set of any data type;

said data structures containing said data instances representing said tokens also containing encapsulated references to encapsulated data instances using one or more of said tokens; and

said data structures containing encapsulated data instances using one or more of said tokens also containing encapsulated references to said encapsulated data instances representing said used tokens.

38. The system of claim 37 wherein said encapsulated references for a given token data instance refer to other encapsulated data instances using said token based on the position of said given token in the sequence of said tokens in said encapsulated data instance.

39. The system claim 38 wherein:

said token set is selected from a group consisting of a set of graphic descriptors, a set of colors, a set of shapes, a set of glyphs, a set of waveforms, a set of frequency values, a set of audio frequency values, a defined set of symbols, and real numbers.

40. The data management system of claim 1 wherein:

said data structure is application independent and is generally the same for all of said data instances;

finding specific unknown encapsulated data instances from a selection criteria of known encapsulated data instances by accessing known encapsulated data instances representing said selection criteria;

accessing references encapsulated with said known encapsulated data instances representing said selection criteria;

using Boolean operations to compare said accessed encapsulated references to find references to said specific unknown encapsulated data instances; and

retrieving said specific unknown encapsulated data instances.

41. The system of claim 40 further comprising searching said system wherein said encapsulated references of different said encapsulated data instances are used to derive desired results.

42. The data management system of claim 1 wherein:

at least one of said encapsulated references is a reference to an encapsulated data instance in another computing environment; and

a first data instance is encapsulated with references to associated data instances and each of said associated data instances are separately encapsulated with a reference to an encapsulated data instance.

43. The data management system of claim 1 wherein:

said encapsulated references of at least one of said encapsulated data instances is unique and said encapsulated references of at least two of said encapsulated data instance are generally identical;

finding specific unknown encapsulated data instances from a selection criteria of known encapsulated data instances by accessing known encapsulated data instances representing said selection criteria;

accessing references encapsulated with said known encapsulated data instances representing said selection criteria;

using Boolean operations to compare said accessed encapsulated references to find references to said specific unknown encapsulated data instances; and

retrieving said specific unknown encapsulated data instances.

44. The data management system of claim 1 wherein:

said encapsulated references of at least one of said encapsulated data instances is unique and said encapsulated references of at least two of said encapsulated data instance are generally identical; and

searching said system wherein said encapsulated references of different said encapsulated data instances are used to derive desired results.

45. A data management system in a computing environment comprising:

a plurality of independent data structures having a common form, each encapsulating a single data instance;

wherein said plurality of data structures are stored on a computer-readable media in non-tabular form;

wherein each of said encapsulated references is a logical index which uniquely identifies each of said associated encapsulated data instances and also encodes the location of each of said associated encapsulated data instances on said computer-readable media; and

wherein said logical index is ‘

m’

dimensional, and has ‘

n’

bits per dimension, said encapsulated references are in at least one dimensions, and each of said at least one dimensions corresponds to a type of association.

46. The data management system of claim 45 wherein each of said data structures are application independent and generally the same for all of said data instances.

47. The data management system of claim 46 further comprising a search capability for finding specific unknown encapsulated data instances from a selection criteria of known encapsulated data instances by accessing known encapsulated data instances representing said selection criteria comprising the steps of:

accessing references encapsulated with said known encapsulated data instances representing said selection criteria;

using Boolean operations to compare said accessed encapsulated references to find references to said specific unknown encapsulated data instances; and

retrieving said specific unknown encapsulated data instances.

48. The system of claim 47 wherein said encapsulated references of two or more different said encapsulated data instances are used to find said specific unknown encapsulated data instances.

49. The data management system of claim 48 wherein at least one of said encapsulated references is a reference to a encapsulated data instance in another computing environment.

50. The data management system of claim 49 wherein said encapsulated references of at least one of said encapsulated data instances is unique and said encapsulated references of at least two of said encapsulated data instances are generally identical.

51. The system of claim 50 further comprising searching said system wherein said encapsulated references of different said encapsulated data instances are used to derive desired results.

52. The data management system of claim 45 further comprising a search capability for finding specific unknown encapsulated data instances from a selection criteria of known encapsulated data instances by accessing known encapsulated data instances representing said selection criteria comprising the steps of:

accessing references encapsulated with said known encapsulated data instances representing said selection criteria;

using Boolean operations to compare said accessed encapsulated references to find references to said specific unknown encapsulated data instances; and

retrieving said specific unknown encapsulated data instances.

53. The system of claim 52 wherein said encapsulated references of two or more different said encapsulated data instances are used to find said specific unknown encapsulated data instances.

54. The data management system of claim 45 wherein at least one of said encapsulated references is a reference to a encapsulated data instance in another computing environment.

55. The data management system of claim 45 wherein said encapsulated references of at least one of said encapsulated data instances is unique and said encapsulated references of at least two of said encapsulated data instance are generally identical.

56. A method to convert a non-data instance centric database to a data instance centric database comprising:

creating encapsulated data instances in said data instance centric database representing elements of said non-data-instance centric database schema and data elements of said non-data-instance centric database;

creating associations amongst the said data instances in said data instance centric database representing the relationships between said data elements and said schema elements of the non-data-instance centric database; and

storing said associations as a reference to each associated data instance stored within a independent data structure having a common form encapsulating the associated data instances, which are stored in non-tabular form on a computer-readable media.

57. The method of claim 56 wherein said converting is through a software agent which is a data instance in said data instance centric database.

58. The method of claim 56 wherein said non-data instance centric database includes a flat file.

59. A data management system comprising:

one or more items;

wherein each of said items encapsulates a data instance;

wherein items which are associated with each other encapsulate mutual references to each other;

wherein said items may be added, removed and searched; and

wherein said items are stored in non-tabular form on a computer-readable media.

60. The data management system of claim 59 wherein each of said items is represented in a fundamental data structure.

61. The data management system of claim 59 wherein each of said items has a unique reference associated therewith.

62. The data management system of claim 61 wherein said unique reference also serves as an index to physically locate said data instance associated with each of said items on said computer-readable media.

63. The data management system of claim 61 wherein each of said references is an “

m”

dimensional index, each of said dimensions being “

n”

bits in length.

64. The data management system of claim 63 wherein “

m”

is 4 and “

n”

is 30.

65. The data management system of claim 59 wherein said references to associated items are arranged in sets defining the type of association between said item and each of said other items referenced in said set.

66. The data management system of claim 59 wherein said items may act as containers for one or more other member items.

67. The data management system of claim 66 wherein membership of an item within a container item is indicated by an identity in one or more of said “

m”

dimensions in said logical index of said container item and each of said member items.

68. The data management system of claim 59 wherein each of said items may encapsulate embedded elements.

69. The data management system of claim 68 wherein said embedded elements are references to other items.

70. The data management system of claim 59 wherein said data instances may contain data of any type.