Updating information in an interlocking trees datastore
A memory and redistribution technology, applied in digital data information retrieval, electronic digital data processing, special data processing applications, etc., can solve problems such as modification, update and correction of wrong or outdated information without teaching
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0029] Methods and systems are designed to remove, correct, modify or replace events that have been recorded in an interlocking tree network data store. As with any data structure, it may be necessary to remove or in some way modify the information contained within the KStore. In some implementations, a history of removals or other modifications may be preserved. In other implementations, history may not be preserved. The determination that an alteration is desired can be achieved using any detection technique widely known to those skilled in the art. During such a step, an administrator, an authorized user, or some automated process may determine that the information recorded within the K-structure is incorrect, out of date, or otherwise needs to be changed.
[0030] Any such operation performed on an interlocking tree network data store may be broadly referred to as an interlocking tree network data store alteration. The modification of the interlocking tree data storage ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 