Linked data structure integrity verification system which verifies actual node information with expected node information stored in a table
US6185569A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jun 29, 1998 |
| Grant date | Feb 6, 2001 |
| Priority date | — |
| Expiry date | Jun 29, 2018 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99942
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A linked data structure verification system to verify the integrity of at least one linked data structure simultaneously by way of a verification setup phase and an integrity verification phase. Individual nodes are retrieved from a memory device and examined seriatim in optimal memory device location order. Nodes are retrieved and examined in optimal memory device location order for maximum memory device retrieval performance. Expected and/or actual node information about nodes in a given linked data structure are temporarily stored as records in an integrity verification table for only as much time as is necessary to verify any part of the node information prior to excising one or more unnecessary records from the integrity verification table.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.