Updating information in an interlocking trees datastore

• US 20070162508A1
• Filed: 10/24/2005
• Published: 07/12/2007
• Est. Priority Date: 11/08/2004
• Status: Abandoned Application

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Claar, Jane, Mazzagatti, Jane
• Application Number:
  US11/258,296
• Publication Number:
  US 20070162508A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/2343 Locking methods, e.g. distributed locking or locking implementation details

Abstract

A method for updating a KStore including a K path having a subcomponent node and a root node wherein the subcomponent node has a pointer pointing to a root node and the root node has a pointer pointing to a subcomponent node includes determining a K path representing a sequence to be altered to provide a determined K path and altering at least one of (i) a subcomponent node of the determined K path, or (ii) a root node having a pointer pointing to a subcomponent node of the determined K path. Altering can include maintaining K structure for a history or completely removing a K path. Altering can include altering a subcomponent node of the determined K path. Memory allocated for storing the altered subcomponent node can be deallocated if the node is completely removed.

Claims

1. A method for updating a KStore including at least one K path having at least one subcomponent node and at least one root node said at least one subcomponent node and said at least one root node containing bidirectional pointers, comprising:

(a) determining a K path representing a sequence to be altered to provide a determined K path; and

(b) altering said determined K path.

2. The method for updating a KStore of claim 1, wherein said altering comprises altering a node of said determined K path.

3. The method for updating a KStore of claim 2, wherein said altering comprises altering a root node of said determined K path.

4. The method for updating a KStore of claim 2, wherein said altering comprises altering subcomponent node of said determined K path.

5. The method for updating a KStore of claim 1, wherein said altering comprises deleting.

6. The method for updating a KStore of claim 5, wherein said deleting comprises altering a node of said determined K path to provide an altered node.

7. The method for updating a KStore of claim 6, wherein said altered node is provided with memory allocated for storing said altered node further comprising deallocating said memory allocated for storing said altered node.

8. The method for updating a KStore of claim 7, wherein said altered node is provided with a node count further comprising altering said node count to provide an altered node count.

9. The method for updating a KStore of claim 8, wherein said altered node is provided with memory allocated for storing said altered node, further comprising:

comparing said altered node count with a predetermined value; and

deallocating said memory of said altered node in accordance with said comparing of said altered node count.

10. The method for updating a KStore of claim 2, wherein said altered node is provided with a bidirectional link further comprising altering said bidirectional link to provide an altered bidirectional link.

11. The method for updating a KStore of claim 10, wherein said altered subcomponent node is provided with a bidirectional Result link further comprising altering said bidirectional Result link to provide an altered bidirectional Result link.

12. The method for updating a KStore of claim 11, wherein said altered bidirectional Result link links said altered subcomponent node with a selected root node further comprising altering an asResult pointer list of said selected root node.

13. The method for updating a KStore of claim 11, further comprising maintaining an asResult pointer within said altered bidirectional Result link wherein said maintained asResult pointer points to said altered subcomponent node to provide a maintained asResult pointer.

14. The method for updating a KStore of claim 13, further comprising determining a history in accordance with said maintained asResult pointer.

15. The method for updating a KStore of claim 2, wherein said altered node is provided with a node count further comprising altering said node count to provide an altered node count.

16. The method for updating a KStore of claim 15, further comprising altering said node count in accordance with an intensity value to provide said altered node count.

17. The method for updating a KStore of claim 16, further comprising determining a history in accordance with said altered node count.

18. The method for updating a KStore of claim 16, further comprising determining whether said altered node count is below a predetermined value to provide an altered node count determination.

19. The method for updating a KStore of claim 18, wherein said altered node is provided with memory allocated for storing said altered node further comprising deallocating said memory in accordance with said altered node count determination.

20. The method for updating a KStore of claim 16, further comprising decrementing said node count in accordance with said intensity value.

21. The method for updating a KStore of claim 16, wherein said intensity value further comprises the value one.

22. The method for updating a KStore of claim 1, further comprising:

(a) obtaining said sequence to be altered; and

(b) particlizing said sequence to be altered to provide a particlized sequence; and

(c) determining a K location.

23. The method for updating a KStore of claim 22, further comprising determining said K path in accordance with said K location.

24. The method for updating a KStore of claim 23, wherein one of said at least one subcomponent node and said at least one root node is provided with at least one bidirectional link and said determining of said K path in accordance with said K location further comprises traversing said KStore in accordance with said at least one bidirectional link.

25. The method for updating a KStore of claim 24, wherein said bidirectional link is a bidirectional Result link further comprising traversing said KStore in accordance with said bidirectional Result link.

26. The method for updating a KStore of claim 24, wherein said bidirectional link includes a bidirectional Case link further comprising traversing said K in accordance with said bidirectional Case link.

27. The method for updating a KStore of claim 22, wherein said particlized sequence further comprises a sequence forming a portion of a K path.

28. The method for updating a KStore of claim 22, wherein said particlized sequence further determines an entire K path.

29. The method for updating a KStore of claim 28, wherein said entire K path further comprises a complete thought.

30. The method for updating a KStore of claim 1, wherein said KStore represents a plurality of paths each path of said plurality of paths having a path identification number further comprising determining said K path in accordance with a selected path identification number.

31. The method for updating a KStore of claim 30, further comprising altering in accordance with said selected path identification number.

32. The method for updating a KStore of claim 1, further comprising:

(a) obtaining a root node search value; and

(b) determining said root node in accordance with said search value.

33. The method for updating a KStore of claim 32 wherein said K includes a plurality of paths each having at least one root node further comprising:

(a) determining said root node search value within a specified root node to provide a root node specific search determination; and

(b) determining said K path in accordance with said root node specific search determination.

34. The method for updating a KStore of claim 33, further comprising altering a node of said KStore in accordance with said root node specific search determination.

35. The method for updating a KStore of claim 33, wherein said specified path has values associated the corresponding root nodes of the specified path including at least one valid value associated with the root node and at least one invalid value associated with the root node and said search value further comprises said at least one invalid value of said specified path.

36. The method for updating a KStore of claim 35, further comprising determining a number of times said invalid root node value is determined in order to provide an invalid root node value count.

37. The method for updating a KStore of claim 36, further comprising deleting said determined K path in accordance with said invalid root node value count.

38. The method for updating a KStore of claim 32, further comprising counting a number of times said K paths are determined in accordance with said search value.

39. The method for updating a KStore of claim 32, wherein said search value further comprises a sequence forming a portion of a path.

40. The method for updating a KStore of claim 1, further comprising determining a misspelling in accordance with said determined K path to provide a misspelling determination.

41. The method for updating a KStore of claim 40, further comprising correcting said misspelling.

42. The method for updating a KStore of claim 40, further comprising determining the number of times a misspelling occurs to provide a misspelling count.

43. The method for updating a KStore of claim 42, further comprising correcting said misspelling conditionally dependent upon said misspelling count.

44. The method for updating a KStore of claim 5, wherein said altering further comprises learning an updated sequence.

45. The method for updating a KStore of claim 44, further comprising said deleting prior to said learning an updated sequence.

46. The method for updating a KStore of claim-44, further comprising said learning an updated sequence prior to said deleting.

47. The method for updating a KStore of claim 1, further comprising updating a sequence wherein said altering comprises deleting a portion of said determined K path, learning an updated portion of the K path, and altering nodes of said determined K path.

48. The method for updating a KStore of claim 1, further comprising determining a history in accordance with said altering.

49. The method for updating a KStore of claim 48, further comprising indicating said history using node count values.

50. The method for updating a KStore of claim 48, further comprising storing said history external to said KStore.