Primenet data management system

• US 7,606,817 B2
• Filed: 08/02/2006
• Issued: 10/20/2009
• Est. Priority Date: 08/02/2006
• Status: Active Grant

• Current Assignee: Entity Labs (Stichting Barentz Beheer)
• Original Assignee: Entity Labs Limited
• Inventors: Carter, Joe K.
• Primary Examiner(s): Cottingham; John R.
• Assistant Examiner(s): Richardson; James E
• Application Number:
  US11/461,981
• Publication Number:
  US 20080033987A1
• Time in Patent Office: 1,175 Days
• Field of Search: None
• 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
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A data structure includes a plurality of records that are mapped to the nodes of a primenet structure, where each node is uniquely identified by an integer node identifier. In the primenet structure, each node is associated with an integer node identifier and an information item. Each particular node having a node identifier N is related to one or more other nodes that have a node identifier of which the Nth prime number is a factor. Information items in any complex problem domain can be stored in this type of data structure, and management algorithms can then be used to reveal relationships among the items in the data structure.

Claims

1. A data management system comprising:

a data structure comprising;

a plurality of records, each record associating an information item with a node in the data structure, each node identified by a unique integer node identifier, and

a set of directed links, each directed link linking a parent node to a child node and identified by a prime number link identifier, wherein for each link the corresponding link identifier is the Nth prime number, where N is the node identifier of the parent node, and the link identifier is a prime factor of the node identifier of the child node, whereby the node identifier for each child node is the product of at least the link identifiers of the directed links from each parent node that is linked to the child node; and

a computer-readable medium containing computer program code that comprises a plurality of management modules, each management module adapted to perform one or more operations on the data structure.

2. The system of claim 1, wherein at least one of the directed links indicates a membership relationship between the information item associated with the child node and the information item associated with the parent node, where the information item associated with the child node is a member of a set defined by the information item associated with the parent node.

3. The system of claim 1, wherein at least one of the directed links indicates a causation relationship between the information item associated with the child node and the information item associated with the parent node.

4. The system of claim 1, wherein the data structure further comprises one or more voided link identifiers through which a link from a parent node to a child node is disallowed.

5. The system of claim 4, wherein one or more of the records are associated with axiomatic nodes, wherein each axiomatic node has a node identifier for which every prime factor corresponds to a voided link identifier, whereby the axiomatic node has no parent nodes.

6. The system of claim 1, wherein the data structure further comprises a global node having a node identifier of 0, wherein the global node is linked to all other nodes in the data structure.

7. The system of claim 1, wherein the records are stored on a computer-Readable medium as a dataset of information items and corresponding node identifiers, and the links are stored on a computer-readable medium as a dataset of link identifiers.

8. The system of claim 4, wherein the records are stored on a computer-Readable medium as a dataset of information items and corresponding node identifiers, the links are stored on a computer-readable medium as a dataset of link identifiers, and the voided link identifiers are stored on a computer-readable medium as a dataset of voided link identifiers.

9. The system of claim 7, wherein the links are further stored on a computer-readable medium as a bitmap dataset of used link identifiers.

10. The system of claim 1, wherein the management modules include a first set of modules adapted to modify the data structure and a second set of modules adapted to obtain information from the data structure in response to a query.

11. The system of claim 1, wherein the management modules include a module for adding a record to the data structure.

12. The system of claim 11, wherein the management module for adding a record to the data structure is adapted to associate the record to be added with a node having an unused node identifier.

13. The system of claim 1, wherein the management modules include a module for deleting a record from the data structure.

14. The system of claim 1, wherein the management modules include a module for adding a directed link from a first node to a second node in the data structure.

15. The system of claim 14, wherein the management module for adding a directed link is adapted to add the directed link by multiplying the node identifier of the second node by the link identifier of the first node.

16. The system of claim 15, wherein the management module for adding a directed link is farther adapted to propagate the change for any nodes directly or indirectly linked to from the second node to maintain the other directed links in the data structure.

17. The system of claim 1, wherein the management modules include a module for removing a directed link from a first node to a second node in the data structure.

18. The system of claim 17, wherein the management module for removing a directed link is adapted to remove the directed link by dividing the node identifier of the second node by the link identifier of the first node.

19. The system of claim 1, wherein the management modules include a module for identifying all child nodes of a parent node.

20. The system of claim 1, wherein the management modules include a module for identifying all parent nodes of a child node.

21. The system of claim 20, wherein the management module for identifying all parent nodes of a child node is adapted to determine the link identifiers for each parent node by factoring the node identifier of the child node, and then translate the link identifiers of the parent nodes into corresponding node identifiers of the parent nodes.

22. The system of claim 21, wherein the link identifiers of the parent nodes are translated into corresponding node identifiers using a mathematical calculation.

23. The system of claim 21, wherein the link identifiers of the parent nodes are translated into corresponding node identifiers using a search assisted by a mathematical calculation.

24. The system of claim 1, wherein the management modules include a module for identifying an intersection of the child nodes for a plurality of parent nodes.

25. The system of claim 24, wherein the management module for identifying the intersection is adapted to determine a product of the link identifiers associated with the parent nodes and identify the intersection as any nodes having a node identifier that is a multiple of the product.

26. The system of claim 1, wherein the management modules include a module for determining a backward chain from a selected node, where the backward chain includes the nodes that link into the selected node and, recursively, any nodes that link into a node in the backward chain.

27. The system of claim 1, wherein the management modules include a module for determining a forward chain from a selected node, where the forward chain includes the nodes that link from the selected node and, recursively, any nodes that link from a node in the forward chain.

28. The system of claim 1, wherein the management modules include a module for determining a relationship from an ancestor node to a descendant node.

29. The system of claim 28, wherein the management module for determining a relationship from an ancestor node to a descendant node is adapted to determine a backward chain from the descendant node, where the backward chain includes the nodes that link into the descendant node and, recursively, any nodes that link into a node in the backward chain, and further adapted to determine a forward chain from the ancestor node, where the forward chain includes the nodes that link from the ancestor node and, recursively, any nodes that link from a node in the forward chain, wherein the relationship between the ancestor node and the descendant node is a map that includes any nodes that are in both the backward and forward chains.

30. A computer program product for managing a plurality of information items in a problem domain, the computer program product comprising a computer-readable medium containing computer program code comprising:

a data structure comprising a plurality of nodes, each node associated with an integer node identifier and an information item, where each node having a node identifier N is a parent of any children nodes that have a node identifier of which the Nth prime number is a factor, and where each child node has a node identifier that is the product of at least the Nth prime numbers where N is the node identifier of each of the parent nodes of the child node;

a plurality of records, each record associated with an information item and a node in the data structure; and

a plurality of management modules, each management module adapted to perform one or more functions on the data structure.

31. The computer program product of claim 30, wherein the functions performed by one or more of the management modules include:

a step for adding a record to the data structure; and

a step for deleting a record from the data structure.

32. The computer program product of claim 30, wherein the functions performed by one or more of the management modules include:

a step for adding a directed link from a first node to a second node in the data structure; and

a step for removing a directed link from a first node to a second node in the data structure.

33. The computer program product of claim 30, wherein the functions performed by one or more of the management modules include:

a step for identifying all child nodes of a parent node; and

a step for identifying all parent nodes of a child node.

34. The computer program product of claim 30, wherein the functions performed by one or more of the management modules include:

a step for identifying an intersection of the child nodes for a plurality of parent nodes.

35. The computer program product of claim 30, wherein the functions performed by one or more of the management modules include:

a step for determining a backward chain from a selected node, where the backward chain includes the nodes that link into the selected node and, recursively, any nodes that link into a node in the backward chain; and

a step for determining a forward chain from a selected node, where the forward chain includes the nodes that link from the selected node and, recursively, any nodes that link from a node in the forward chain.

36. The computer program product of claim 30, wherein the functions performed by one or more of the management modules include:

a step for determining a relationship from an ancestor node to a descendant node.

37. A computer program product for modeling a problem domain using a plurality of information items associated by directed links, the computer program product comprising a computer-readable medium containing computer program code for performing the method comprising:

assigning each of the plurality of information items to a node identified by a unique integer node identifier;

directedly linking pairs of nodes, where each resulting directed link from a parent node to a child node is associated with a prime number link identifier, wherein for each child node identifier is the product of at least the link identifiers of the directed links from each parent node that is linked to the child node, and wherein for each link;

the corresponding link identifier is the Nth prime number, where N is the node identifier of the parent node, and

the link identifier is a prime factor of the node identifier of the child node; and

declaring one or more link identifiers to be void, where a link from a parent node to a child node is disallowed if its link identifier is void.

38. The computer program product of claim 37, wherein at least one of the directed links indicates that the information item associated with the child node is a member of a set in the problem domain defined by the information item associated with the parent node.

39. The computer program product of claim 37, wherein at least one of the directed links indicates causation in the problem domain between the information item associated with the child node and the information item associated with the parent node.

40. The computer program product of claim 37, wherein the computer-readable medium further contains computer program code for:

defining one or more axiomatic nodes by declaring to be void each link identifier that corresponds to a prime factor of every axiomatic node to be defined.

41. A computer implemented method for modeling a problem domain using a plurality of information items associated by directed links, the method comprising:

assigning each of the plurality of information items to a node identified by a unique integer node identifier;

directedly linking pairs of nodes, where each resulting directed link from a parent node to a child node is associated with a prime number link identifier, wherein for each child node the node identifier is the product of at least the link identifiers of the directed links from each parent node that is linked to the child node, and wherein for each link;

the corresponding link identifier is the Nth prime number, where N is the node identifier of the parent node, and

the link identifier is a prime factor of the node identifier of the child node; and

declaring one or more link identifiers to be void, where a link from a parent node to a child node is disallowed if its link identifier is void.

42. The method of claim 41, wherein at least one of the directed links indicates that the information item associated with the child node is a member of a set in the problem domain defined by the information item associated with the parent node.

43. The method of claim 41, wherein at least one of the directed links indicates causation in the problem domain between the information item associated with the child node and the information item associated with the parent node.

44. The method of claim 41, further comprising:

defining one or more axiomatic nodes by declaring to be void each link identifier that corresponds to a prime factor of every axiomatic node to be defined.