Compact hash table
AssigneeInternational Business Machines Corporation
InventorIan Richard Finlay
Life of this patent
Estimating the term…
Abstract
A computer-implemented method includes assigning a bit of a segmented bitmap to at least one tuple. A buffer association to the bit is determined and a buffer is created when no buffer is associated with the bit. A key and payload of the at least one tuple is allocated to the buffer. The method determines if the buffer is full when the bit is associated with a buffer and responds to the buffer not being full by allocating the key and payload of the at least one tuple into the buffer.
Claims20
A computer-implemented method comprising:
- assigning a bit of a segmented bitmap to at least one tuple;
- determining a buffer association to the bit;
- creating a buffer when no buffer is associated with the bit and allocating a key and payload of the at least one tuple to the buffer;
- determining if the buffer is full when the bit is associated with a buffer and responding to the buffer not being full by allocating the key and payload of the at least one tuple into the buffer;
- and
- wherein movement of tuples from a first memory location to a second memory location is limited to movement within a segment of the segmented bitmap.
(canceled)
A computer program product comprising a non-transitory computer readable memory storing instructions for implementing a compact hash table by:
- assigning a bit of a segmented bitmap to at least one tuple;
- determining a buffer association to the bit;
- creating a buffer when no buffer is associated with the bit and allocating a key and payload of the at least one tuple to the buffer;
- and
- determining if the buffer is full when the bit is associated with a buffer and responding to the buffer not being full by allocating the key and payload of the at least one tuple into the buffer;
- and
- wherein movement of tuples from a first memory location to a second memory location is limited to movement within a segment of the segmented bitmap.
(canceled)
A system comprising:
- a processor set and a persistent storage, the persistent storage including code defining instructions for cause the processor to update a compact hash table by;
- assigning a bit of a segmented bitmap to at least one tuple;
- determining a buffer association to the bit;
- creating a buffer when no buffer is associated with the bit and allocating a key and payload of the at least one tuple to the buffer;
- determining if the buffer is full when the bit is associated with a buffer and responding to the buffer not being full by allocating the key and payload of the at least one tuple into the buffer;
- responding to the buffer being full by re-allocating or otherwise extending the buffer, creating a new buffer, and allocating the key and payload of the at least one tuple to the new buffer;
- and
- wherein movement of tuples from a first memory location to a second memory location is limited to movement within a segment of the segmented bitmap.
(canceled)
Dependencies are inferred from the claim text.