Patent application number | Description | Published |
20100169370 | Kstore event manager using triggers for K - The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. A KStore event manager monitors events and polls for KStore state. When triggered by user-defined conditions or receiving notification that a specified event has occurred, a specified response can be executed. An event/condition/response is defined through a KStore event wizard. When a triggering condition is detected or a notification of an event is received, a user-defined action or sequence of actions is performed automatically, without further user interaction. | 07-01-2010 |
20100169371 | Types of nodes in a kstore - The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Nodes in a KStore are typically comprised of at least four fields, including a pointer to an asCase node, a pointer to an asResult node, a pointer to an asCaseList and a pointer to an asResultList. Because either an asCaseList or an asResultList but not both will exist in any particular node, two new node types are created, one node comprising a node with an asCase pointer, an asResult pointer and asCaseList pointer but not including a pointer to an asResultList and one node with a pointer to an asCase node, and asResult node and an asResultList but not including a pointer to an asCaseList. Alternatively, a single node structure may exist with a pointer to a list in one field and an indicator stored in another field that indicates directly or indirectly whether the list pointed to is an asCaseList or an asResultList. | 07-01-2010 |
20100169372 | Adding and subtracting kstores - The KStore is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. One KStore can be added to an existing KStore to create an updated KStore by traversing the trees of the KStores and incrementing the count fields to reflect the added counts of analogous nodes. New KStore structure is added as needed. A KStore can be subtracted from an existing KStore to create an updated KStore by traversing trees KStores and decrementing the count fields in the updated KStore to reflect the subtracted counts of analogous nodes. KStore structure is removed as needed. Portions of a KStore can be added or subtracted from another KStore by isolating the paths to be used for updating. Instead of incrementing or decrementing counts, a dataset of individual records can be recreated from the KStore. | 07-01-2010 |
20100169373 | Updating values of elemental root nodes in kstore - The KStore or K is a datastore made up of a forest of interconnected, highly unconventional trees of one or more levels. Values of elemental root nodes within a KStore can be changed without requiring the KStore to be rebuilt. The elemental root node whose value is to be altered is identified, and the new value is inserted directly into the node or in the area identified by the pointer to the node value within the node. Values can include those needed to recognize user data and/or values for elemental root nodes used internally within the KStore structure. Values of the elemental root nodes can be updated after the instantiation of the KStore and the population of the KStore. | 07-01-2010 |
20100169384 | Kstore data simulator directives and values processor process and files - A data simulator receives a set of directives specified in a file and creates one or more datastreams from which a data structure may be built as specified by the directives. The directives may specify configuration settings, constants, changing fields, values and probabilities. | 07-01-2010 |