Method for aging table entries in a table supporting multi-key searches
1. Field of the Invention A method is provided herein for use with a table containing a plurality of data entries, wherein each of the data entries consists of a string of data. Each data entry has a first address addressable by a first pointer from an upstream data entry and a second address addres...
Saved in:
| Main Author | |
|---|---|
| Format | Patent |
| Language | English |
| Published |
09.11.2004
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | 1. Field of the Invention
A method is provided herein for use with a table containing a plurality of data entries, wherein each of the data entries consists of a string of data. Each data entry has a first address addressable by a first pointer from an upstream data entry and a second address addressable by a second pointer from an upstream data entry. Each data entry further includes a third pointer for addressing the address of a downstream data entry and a fourth pointer for addressing the address of a downstream data entry. In the present method, when it is detected, after a chosen interval of time, that a specified data entry has not been addressed by either of its addresses, the first and second pointers to that specified data entry are redirected to the destinations of the third and fourth pointers respectively. That specified data entry may then be deleted without compromise of the function of the table. |
|---|