Traversal of empty regions in a searchable data structure
US7565217B2 · kind B2 · utility
3Cited by
37References
15Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Apr 1, 2005 |
| Grant date | Jul 21, 2009 |
| Priority date | — |
| Expiry date | Feb 25, 2026 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99944
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Provided are a method, system, and article of manufacture for the traversal of empty regions in a searchable data structure such as a table. A plurality of elements are allocated in logical storage, wherein the plurality of elements correspond to entries of the searchable data structure. An indicator is maintained corresponding to contiguously allocated empty elements in the plurality of elements. An operation is performed on the searchable data structure by avoiding the contiguously allocated empty elements.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.