Accessing data in an interlocking trees data structure using an application programming interface

• US 7,499,932 B2
• Filed: 10/24/2005
• Issued: 03/03/2009
• Est. Priority Date: 11/08/2004
• Status: Expired due to Fees

• Current Assignee: Unisys Corporation
• Original Assignee: Unisys Corporation
• Inventors: Claar, Jane Van Keuren, Mazzagatti, Jane Campbell
• Primary Examiner(s): Pham; Khanh B
• Application Number:
  US11/258,292
• Publication Number:
  US 20070038654A1
• Time in Patent Office: 1,226 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G06F 9/54 Interprogram communication

Abstract

A method for transmitting information in a KStore system having a KStore, an application programming interface and an application layer wherein the information is transmitted between the KStore and the application layer includes transmitting the information between the KStore and the application layer by way of the application programming interface. The KStore is constrained by way of the application programming interface with at least one constraint to provide at least one selected K path. The KStore is focused to provide a further selected K path. At least one KStore parameter is determined in accordance with the selected K path to provide at least one determined K parameter. The constraining of the KStore includes traversing the at least one selected K path.

Claims

1. A method for transmitting information in a KStore system having a KStore, the method comprising:

transmitting information between said KStore and an application layer by way of an application programming interface;

processing said information within said KStore; and

returning result information between said KStore and said application by way of said application programming interface;

wherein the KStore comprising;

an interlocking trees datastore situated within memory accessible to an application programming interface running in a computer comprising root nodes and non-root nodes organized into a plurality of connected trees, each node in the interlocking trees datastore comprising a Case pointer pointing to a first portion of a non-root node, a Result pointer pointing to a second portion of the non-root node, a pointer to an asCase list;

an asCase tree comprising a first root and at least one of a plurality of non-root nodes,

at least one asResult tree comprising a second root node and at least one of a plurality of non-root nodes common with the nodes of the asCase tree;

at least one K path;

an application layer;

the application programming interface coupled to said KStore and said application layer wherein information is transmitted between said KStore and said application layer by way of said application programming interface;

the asCase list comprising a linked list of nodes for which the node is a first portion and a pointer to an asResult list;

the asResult list comprising a linked list of non-root nodes for which the node is a second portion;

the at least one non-root node comprising a first Case node and at least one of a plurality of asResult trees;

the at least one non-root node common with the nodes of the asCase tree comprising a first Result node, the nodes of the interlocking trees datastore including at least one elemental node representing a dataset element, at least one non-root node; and

the at least one non-root node comprising a first subcomponent node and at least one end product node; and

the at least one K path comprising a portion of a tree of the interlocking trees datastore, said portion determined by at least one of said Case pointer, said Result pointer, said asCase list pointer and said asResult list pointer.

2. The method for transmitting information in a KStore system of claim 1, wherein said KStore includes a plurality of K paths further comprising constraining said KStore by way of said application programming interface with at least one constraint to provide at least one selected K path of said plurality of K paths.

3. The method for transmitting information in a Kstore system of claim 2, wherein said constraining provides a set of selected K paths further comprising focusing said KStore to provide a further set of selected K paths in accordance with said set of selected K paths.

4. The method for transmitting information in a KStore system of claim 2, further comprising determining at least one constraint in accordance with said selected K path to provide at least one determined K parameter via said application programming interface.

5. The method for transmitting information in a KStore system of claim 2, wherein said constraining of said KStore further comprises traversing said at least one selected K path.

6. The method for transmitting information in a KStore system of claim 1, wherein said application programming interface further comprises a learn engine.

7. The method for transmitting information in a KStore system of claim 1, wherein said application programming interface further comprises a learn utility.

8. The method for transmitting information in a KStore system of claim 1, further comprising calling for information from said application layer by way of said application programming interface.

9. The method for transmitting information in a KStore system of claim 8, further comprising querying said KStore in accordance with said information.

10. The method for transmitting information in a KStore system of claim 1, further comprising receiving a query by said application programming interface.

11. The method for transmitting information in a KStore system of claim 10, further comprising breaking said query into query components.

12. The method for transmitting information in a KStore system of claim 1, wherein said application programming interface further comprises an administrative application programming interface component.

13. The method for transmitting information in a KStore system of claim 12, wherein said KStore includes a K Engine, wherein said K Engine provides access by said application programming interface to said KStore further comprising starting said K Engine by said administrative application programming interface utility component.

14. The method for transmitting information in a KStore system of claim 1, wherein said application programming interface further comprises an analytic calculation application programming interface component.

15. The method for transmitting information in a KStore system of claim 14, further comprising performing an analytical process by said analytic calculation application programming interface component.

16. The method for transmitting information in a KStore system of claim 14, further comprising performing a DecisionTree process by said analytic calculation application programming interface component.

17. The method for transmitting information in a KStore system of claim 14, further comprising performing a Bayes classification process by said analytic calculation application programming interface component.

18. The method for transmitting information in a KStore system of claim 1, wherein said application programming interface further comprises memory coordinated by a memory coordinator within said application programming interface.

19. The method for transmitting information in a KStore system of claim 1, wherein said application layer further comprises a graphical user interface.

20. The method for transmitting information in a KStore system of claim 1, wherein said application layer further comprises an information source.

21. The method for transmitting information in a KStore system of claim 1, further comprising:

calling said application programming interface by said application layer application; and

generating a call processing thread by said application programming interface in accordance with said call of said application layer.

22. The method for transmitting information in a KStore system of claim 21, further comprising allocating an information storage area by said application programming interface for use by said call processing thread.

23. The method for transmitting information in a KStore system of claim 22, further comprising controlling transmission of particle-related information through said information storage area.

24. The method for transmitting information in a KStore system of claim 1, further comprising preventing internal KStore information from being transmitted from said KStore to said application layer.

25. The method for transmitting information in a KStore system of claim 24, wherein said internal KStore information comprises pointer information.

26. The method for transmitting information in a KStore system of claim 24, wherein said internal KStore information comprises a node location.

27. The method for transmitting information in a KStore system of claim 1, further comprising processing error information.

28. The method for transmitting information in a KStore system of claim 1, further comprising validating access to said KStore for an application.

29. The method for transmitting information in a KStore system of claim 28, further comprising validating access to a portion of said KStore for said application.

30. The method for transmitting information in a KStore system of claim 1, further comprising validating a query request.

31. The method for transmitting information in a KStore system of claim 1, further comprising validating a data source definition.

32. The method for transmitting information in a KStore system of claim 1, wherein said KStore further comprises a static KStore.

33. The method for transmitting information in a KStore system of claim 1, wherein said KStore further comprises a dynamic KStore.

34. A KStore system having a KStore with at least one K path, the KStore system comprising:

an interlocking trees datastore situated within memory accessible to an application programming interface running in a computer comprising root nodes and non-root nodes organized into a plurality of connected trees, each node in the interlocking trees datastore comprising a Case pointer pointing to a first portion of a non-root node, a Result pointer pointing to a second portion of the non-root node, a pointer to an asCase list;

an asCase tree comprising a first root and at least one of a plurality of non-root nodes,

at least one asResult tree comprising a second root node and at least one of a plurality of non-root nodes common with the nodes of the asCase tree;

at least one K path;

an application layer; and

the application programming interface coupled to said KStore and said application layer wherein information is transmitted between said KStore and said application layer by way of said application programming interface;

wherein;

the asCase list comprising a linked list of nodes for which the node is a first portion and a pointer to an asResult list;

the asResult list comprising a linked list of non-root nodes for which the node is a second portion;

the at least one non-root node comprising a first Case node and at least one of a plurality of asResult trees;

the at least one non-root node common with the nodes of the asCase tree comprising a first Result node, the nodes of the interlocking trees datastore including at least one elemental node representing a dataset element, at least one non-root node; and

the at least one non-root node comprising a first subcomponent node and at least one end product node; and

the at least one K path comprising a portion of a tree of the interlocking trees datastore, said portion determined by at least one of said Case pointer, said Result pointer, said asCase list pointer and said asResult list pointer.

35. The KStore system of claim 34, wherein said application programming interface further comprises a learn engine.

36. The KStore system of claim 35, wherein said application programming interface further comprises a learn utility.

37. The KStore system of claim 34, wherein said application programming interface further comprises an administrative application programming interface component.

38. The KStore system of claim 34, wherein said application programming interface further comprises an analytic calculation application programming interface component.