Method for allowing weak searchers to access pointer-connected data structures without locking
US5089952A · kind A · utility
52Cited by
11References
11Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Oct 7, 1988 |
| Grant date | Feb 18, 1992 |
| Priority date | — |
| Expiry date | Oct 7, 2008 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/13
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for allowing weak-searchers of a B+-tree avoid locks that serialize access to the B+-tree structure. The update technique used to achieve this ensures that the B+-tree is always in a correct state on secondary storage so that repair is not necessary after a system failure. The assumption is made that the readers will complete their reading within a specified period but sometimes will need to be restarted because they have not completed their reading within a predetermined time period.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.