# US 2021/0342293 A1 · Pointer-based dynamic data structures in key-value stores

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0342293 A1
- Document ID: US20210342293A1
- Status: Published application
- Kind: A1
- Application number: 16/866,234
- Filed: 2020-05-04
- Published: 2021-11-04
- Earliest claimed: 2020-05-04
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Daniel Waddington; Luna Xu; Clement Lambert Dickey
- Web page: https://patentgrep.com/patent/US20210342293A1

## CPC

- G06F 16/119: {Details of migration of file systems (migration mechanisms in storage systems G06F3/0647)}
- G06F 9/5016: {the resource being the memory}
- G06F 12/023: {Free address space management}
- G06F 12/0238: {Memory management in non-volatile memory, e.g. resistive RAM or ferroelectric memory}
- G06F 12/1081: for peripheral access to main memory, e.g. direct memory access [DMA]
- G06F 12/109: for multiple virtual address spaces, e.g. segmentation (G06F12/1036 takes precedence)
- G06F 16/164: {File meta data generation}
- G06F 16/182: Distributed file systems
- G06F 16/2246: {Trees, e.g. B+trees}
- G06F 12/0284: {Multiple user address space allocation, e.g. using different base addresses (interprocessor communication G06F15/163)}
- G06F 16/214: {Database migration support}
- G06F 2212/1024: Latency reduction
- G06F 2212/1032: Reliability improvement, data loss prevention, degraded operation etc
- G06F 2212/657: Virtual address space management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer-implemented method includes receiving data structures in memory space and creating micro-heaps on a per-data structure basis. Each data structure is associated with a micro-heap allocator. The method also includes storing the data structures in a key-value store. Values of the key-value store are associated with the data structures. A computer program product includes one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media. The program instructions include program instructions to perform the foregoing method. A system includes a processor and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor. The logic is configured to perform the foregoing method.

## Claims

### Claim 1

A computer-implemented method, comprising:
receiving data structures in memory space;
creating micro-heaps on a per-data structure basis, wherein each data structure is associated with a micro-heap allocator; and
storing the data structures in a key-value store, wherein values of the key-value store are associated with the data structures.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, comprising creating secondary micro-heaps on a per logical group basis, wherein a logical group comprises a plurality of data structures.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, comprising relocating the data structures, wherein the relocating does not include serializing.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, comprising copying the data structures, wherein the copying does not include serializing.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein each micro-heap is associated with a micro-heap allocator configured for memory management.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, comprising maintaining the memory space, wherein the memory space includes metadata memory space and allocated data memory space in a contiguous region of the memory space.

### Claim 7 (depends on 6)

The computer-implemented method of claim 6, comprising expanding the maintained memory space by linking a plurality of micro-heap allocators together.

### Claim 8 (depends on 6)

The computer-implemented method of claim 6, wherein the contiguous region of the memory space uses data transfers selected from the group consisting of: direct memory access (DMA) and remote direct memory access (RDMA).

### Claim 9

A computer program product, the computer program product comprising:
one or more computer readable storage media, and program instructions collectively stored on the one or more computer readable storage media, the program instructions comprising:
program instructions to receive data structures in memory space;
program instructions to create micro-heaps on a per-data structure basis, wherein each data structure is associated with a micro-heap allocator; and
program instructions to store the data structures in a key-value store, wherein values of the key-value store are associated with the data structures.

### Claim 10 (depends on 9)

The computer program product of claim 9, comprising program instructions to create secondary micro-heaps on a per logical group basis, wherein a logical group comprises a plurality of data structures.

### Claim 11 (depends on 9)

The computer program product of claim 9, comprising program instructions to relocate the data structures, wherein the relocating does not include serializing.

### Claim 12 (depends on 9)

The computer program product of claim 9, comprising program instructions to copy the data structures, wherein the copying does not include serializing.

### Claim 13 (depends on 9)

The computer program product of claim 9, wherein each micro-heap is associated with a micro-heap allocator configured for memory management.

### Claim 14 (depends on 9)

The computer program product of claim 9, comprising program instructions to maintain the memory space, wherein the memory space includes metadata memory space and allocated data memory space in a contiguous region of the memory space.

### Claim 15 (depends on 14)

The computer program product of claim 14, comprising program instructions to expand the maintained memory space by linking a plurality of micro-heap allocators together.

### Claim 16 (depends on 14)

The computer program product of claim 14, wherein the contiguous region of the memory space uses data transfers selected from the group consisting of: direct memory access (DMA) and remote direct memory access (RDMA).

### Claim 17

A system, comprising:
a processor; and
logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to:
receive data structures in memory space;
create micro-heaps on a per-data structure basis, wherein each data structure is associated with a micro-heap allocator; and
store the data structures in a key-value store, wherein values of the key-value store are associated with the data structures.

### Claim 18 (depends on 17)

The system of claim 17, comprising logic configured to create secondary micro-heaps on a per logical group basis, wherein a logical group comprises a plurality of data structures.

### Claim 19 (depends on 17)

The system of claim 17, comprising logic configured to relocate the data structures, wherein the relocating does not include serializing.

### Claim 20 (depends on 17)

The system of claim 17, comprising logic configured to copy the data structures, wherein the copying does not include serializing.
