Traversal of empty regions in a searchable data structure
AssigneeInternational Business Machines Corporation
InventorsRonen Grosman, Gary Valentin
Life of this patent
Estimating the term…
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.
Claims24
A method for operating on a searchable data structure, comprising:
- allocating a plurality of elements in logical storage, wherein the plurality of elements correspond to entries of the searchable data structure;
- maintaining an indicator corresponding to contiguously allocated empty elements in the plurality of elements;
- and
- performing an operation on the searchable data structure by avoiding the contiguously allocated empty elements.
A system for operating on a searchable data structure, comprising:
- memory;
- and
- processor coupled to the memory, wherein the processor is operable to:
- (i) allocate a plurality of elements in logical storage, wherein the plurality of elements correspond to entries of the searchable data structure;
- (ii) maintain an indicator corresponding to contiguously allocated empty elements in the plurality of elements;
- and
- (iii) perform an operation on the searchable data structure by avoiding the contiguously allocated empty elements.
An article of manufacture having stored therein instructions capable of being executed by a machine to:
- allocate a plurality of elements in logical storage, wherein the plurality of elements correspond to entries of a searchable data structure;
- maintain an indicator corresponding to contiguously allocated empty elements in the plurality of elements;
- and
- perform an operation on the searchable data structure by avoiding the contiguously allocated empty elements.
Dependencies are inferred from the claim text.