Managing multiple locks for data set members in a data set index
US9262463B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 5, 2013 |
| Grant date | Feb 16, 2016 |
| Priority date | — |
| Expiry date | Mar 31, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/2343
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.