IP Library Patent Application 12319056
Patent Application
App. No. 12/319,056

Updating values of elemental root nodes in kstore

Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US None
App. No.
12/319,056
Abstract

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.

Claims (31)

1 . A system that alters a root node of a datastore comprising:

a utility that changes an elemental root node of a plurality of elemental root nodes of a multi-level KStore, the multi-level KStore comprising an interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end product nodes linked by asCase and asResult bi-directional links that create asCase and asResult paths within the interlocking trees datastore, wherein an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree, wherein the KStore utility updates the elemental root node of the multi-level KStore to represent a new value.

2 . The system of claim 1 , wherein the utility determines that the elemental root node comprises a field, the field comprising a value of the elemental root node.

3 . The system of claim 1 , wherein the utility determines that the elemental root node comprises a field, the field comprising a pointer to the value of the elemental root node.

4 . The system of claim 2 , wherein the utility changes the value of the field to an updated value.

5 . The system of claim 3 , wherein the utility changes the pointer pointing to the value of the field to a pointer pointing to an updated value.

6 . The system of claim 1 , wherein the utility identifies the elemental root node to be changed.

7 . The system of claim 1 , wherein the elemental root node represents an end of record indicator.

8 . A method for updating an elemental root node of a KStore comprising:

identifying the elemental root node of the KStore resident on a KStore computer;

identifying that the elemental root node of the KStore comprises a field of a plurality of fields, wherein the field comprises a value or a pointer to a value, the value comprising a dataset element represented by the elemental root node, wherein a KStore comprises an interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end product nodes linked by asCase and asResult bi-directional links that create asCase and asResult paths within the interlocking trees datastore, wherein an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree.

9 . The method of claim 8 , wherein the field comprising the pointer to the value is updated to a new value.

10 . The method of claim 8 , wherein the field comprising the value is updated to a new value.

11 . The method of claim 8 , wherein the elemental root node comprises an element of an input dataset.

12 . The method of claim 8 , further comprising:

wherein the elemental root node comprises an end of record indicator.

13 . The method of claim 8 , further comprising instantiating and populating the KStore before changing the value represented by the elemental root node.

14 . A computer-readable medium comprising computer-executable instructions that when executed, cause a computing environment to:

update a value of an elemental root node of a KStore, wherein the KStore comprises an interlocking trees datastore comprising elemental root nodes, subcomponent nodes and end product nodes linked by asCase and asResult bi-directional links that create asCase and asResult paths within the interlocking trees datastore, wherein an asCase path comprises a sequence of subcomponent nodes linked with bi-directional asCase links ending with an end product node and where each subcomponent node in the asCase path has a bi-directional asResult link to an elemental root node or end product node comprising an asResult tree.

15 . The computer-readable medium of claim 14 , comprising further computer-executable instructions that when executed cause the computing environment to:

identifying the elemental root node of the KStore to be updated.

16 . The computer-readable medium of claim 14 , comprising further computer-executable instructions that when executed cause the computing environment to:

identify that the elemental root node of the KStore comprises a field of a plurality of fields, wherein the field comprises a value or a pointer to a value, the value comprising the dataset element represented by the elemental root node.

17 . The computer-readable medium of claim 14 , comprising further computer-executable instructions that when executed cause the computing environment to:

update a field of the elemental root node to a different value.

18 . The computer-readable medium of claim 14 , comprising further computer-executable instructions that when executed cause the computing environment to:

update a field of the elemental root node to point to a different value.

19 . The computer-readable medium of claim 14 , comprising further computer-executable instructions that when executed cause the computing environment to:

update a field of the elemental root node to a different value or to point to a different value, wherein the elemental root node represents a dataset element of an input dataset.

20 . The computer-readable medium of claim 14 , comprising further computer-executable instructions that when executed cause the computing environment to:

update a field of the elemental root node to a different value or to point to a different value, wherein the elemental root node represents a delimiter of an input dataset.

Assignments (5)
RELEASE OF SECURITY INTEREST Recorded Nov 9, 2017
From: WELLS FARGO BANK, NATIONAL ASSOCIATION (SUCCESSOR TO GENERAL ELECTRIC CAPITAL CORPORATION)
To: UNISYS CORPORATION
Reel/Frame 044416/0358 →
SECURITY AGREEMENT Recorded Jun 27, 2011
From: UNISYS CORPORATION
To: GENERAL ELECTRIC CAPITAL CORPORATION, AS AGENT
Reel/Frame 026509/0001 →
RELEASE BY SECURED PARTY Recorded Sep 14, 2009
From: CITIBANK, N.A.
To: UNISYS CORPORATION; UNISYS HOLDING CORPORATION
Reel/Frame 023263/0631 →
RELEASE BY SECURED PARTY Recorded Jul 31, 2009
From: CITIBANK, N.A.
To: UNISYS CORPORATION; UNISYS HOLDING CORPORATION
Reel/Frame 023312/0044 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT SUPPLEMENT Recorded Feb 10, 2009
From: UNISYS CORPORATION
To: CITIBANK, N.A.
Reel/Frame 022237/0172 →