# US 2026/0010475 A1 · Persistent key-value store and journaling system

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

- Number: US 2026/0010475 A1
- Document ID: US20260010475A1
- Status: Published application
- Kind: A1
- Application number: 19/329,258
- Filed: 2025-09-15
- Published: 2026-01-08
- Earliest claimed: 2021-12-17
- Assignees: NetApp, Inc.
- Applicants: NetApp, Inc.
- Inventors: Sudheer Kumar Vavilapalli; Asif Imtiyaz Pathan; Parag Sarfare; Nikhil Mattankot; Stephen Wu; Amit Borase
- Web page: https://patentgrep.com/patent/US20260010475A1

## CPC

- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 12/0802: Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F 3/0617: {in relation to availability}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0653: {Monitoring storage devices or systems}
- G06F 3/0656: {Data buffering arrangements}
- G06F 3/0673: {Single storage device}
- G06F 12/0855: Overlapped cache accessing, e.g. pipeline (G06F12/0846 takes precedence)
- G06F 12/0868: Data transfer between cache memory and other subsystems, e.g. storage devices or host systems
- G06F 12/0871: Allocation or management of cache space
- G06F 12/0842: for multiprocessing or multitasking
- G06F 12/126: with special data handling, e.g. priority of data or instructions, handling errors or pinning
- G06F 2212/1032: Reliability improvement, data loss prevention, degraded operation etc
- G06F 2212/154: Networked environment
- G06F 2212/222: Non-volatile memory
- G06F 2212/262: configured as RAID
- G06F 2212/263: Network storage, e.g. SAN or NAS
- G06F 2212/311: In host system
- G06F 2212/465: Structured object, e.g. database record
- G06F 2212/466: Metadata, control data
- G06F 2212/60: Details of cache memory
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Techniques are provided for implementing a persistent key-value store for caching client data, journaling, and/or crash recovery. The persistent key-value store may be hosted as a primary cache that provides read and write access to key-value record pairs stored within the persistent key-value store. The key-value record pairs are stored within multiple chains in the persistent key-value store. Journaling is provided for the persistent key-value store such that incoming key-value record pairs are stored within active chains, and data within frozen chains is written in a distributed manner across distributed storage of a distributed cluster of nodes. If there is a failure within the distributed cluster of nodes, then the persistent key-value store may be reconstructed and used for crash recovery.

## Claims

### Claim 1

A method, comprising:
providing client access to key-value records cached within chains in a primary cache hosted by a node of a distributed cluster of nodes until content of the primary cache is written in a distributed manner across distributed storage of the distributed cluster of nodes; and
processing the chains to determine whether to write data of the chains from the primary cache to the distributed storage, wherein for a chain, the processing includes:
in response to determining that the chain is assigned an active indicator indicating that the chain is an active chain, retaining the chain within the primary cache for client access; and
in response to determining that the chain is assigned a frozen indicator, writing key-value records within the chain from the primary cache to the distributed storage.

### Claim 2 (depends on 1)

The method of claim 1, comprising:
assigning a prefix to a value entry and a key entry within the chain to represent a key-value record,
wherein the prefix includes at least one of a serial number of an operation that created the key-value record, a checksum, or a consistency point count of a consistency point that included the operation; and
validating the key-value record by determining whether prefixes of the value entry and the key entry match.

### Claim 3 (depends on 1)

The method of claim 1, comprising:
utilizing a key-value map data structure, associating keys and values with corresponding key-value metadata, to identify corresponding key-value metadata associated with a key-value record; and
using indexing information within the corresponding key-value metadata to identify virtual addresses for accessing the key record and the value record within storage.

### Claim 4 (depends on 1)

The method of claim 1, comprising:
in response to the active chain reaching a threshold size or a consistency point being reached, freezing the active chain as a frozen chain and persist data within the frozen chain across the distributed storage.

### Claim 5 (depends on 1)

The method of claim 1, comprising:
in response to the active chain reaching a threshold size, freezing the active chain as a frozen chain and persist data within the frozen chain across the distributed storage.

### Claim 6 (depends on 5)

The method of claim 5, comprising:
in response to the data being persisted across the distributed storage, freeing a frozen operation header bucket, a frozen meta bucket, and a frozen data bucket of the frozen chain.

### Claim 7 (depends on 1)

The method of claim 1, comprising:
assigning a prefix to a value entry and a key entry within the chain to represent a key-value record, wherein the prefix includes at least one of a serial number of an operation that created the key-value record, a checksum, or a consistency point count of a consistency point that included the operation.

### Claim 8 (depends on 1)

The method of claim 1, comprising:
assigning a prefix to a value entry and a key entry within the chain to represent a key-value record; and
validating the key-value record by determining whether prefixes of the value entry and the key entry match.

### Claim 9

A system, comprising:
a distributed cluster of nodes; and
a storage management system configured to:
cache key-value records within chains in a primary cache hosted by a node of the distributed cluster of nodes until content of the primary cache is written in a distributed manner across distributed storage of the distributed cluster of nodes; and
processing the chains to determine whether to write data of the chains from the primary cache to the distributed storage, wherein for a chain, the processing includes:
in response to determining that the chain is assigned an active indicator indicating that the chain is an active chain, retaining the chain within the primary cache for client access; and
in response to determining that the chain is assigned a frozen indicator, writing key-value records within the chain from the primary cache to the distributed storage.

### Claim 10 (depends on 9)

The system of claim 9, wherein the storage management system is further configured to:
assign a prefix to a value entry and a key entry within the chain to represent a key-value record, wherein the prefix includes a checksum; and
validate the key-value record by determining whether prefixes of the value entry and the key entry match.

### Claim 11 (depends on 9)

The system of claim 9, wherein the storage management system is further configured to:
assign a prefix to a value entry and a key entry within the chain to represent a key-value record, wherein the prefix includes a consistency point count of a consistency point; and
validate the key-value record by determining whether prefixes of the value entry and the key entry match.

### Claim 12 (depends on 9)

The system of claim 9, wherein the storage management system is further configured to:
utilize a key-value map data structure, associating keys and values with corresponding key-value metadata, to identify corresponding key-value metadata associated with a key-value record.

### Claim 13 (depends on 12)

The system of claim 12, wherein the storage management system is further configured to:
utilize indexing information within the corresponding key-value metadata to identify virtual addresses for accessing the key record and the value record within storage.

### Claim 14

A non-transitory machine readable medium comprising instructions, which when executed by a machine, causes the machine to:
store key-value records within chains in a primary cache hosted by a node of a distributed cluster of nodes until content of the primary cache is written in a distributed manner across distributed storage of the distributed cluster of nodes; and
process the chains to determine whether to write data of the chains from the primary cache to the distributed storage, wherein for a chain:
in response to determining that the chain is assigned an active indicator indicating that the chain is an active chain, retaining the chain within the primary cache for client access; and
in response to determining that the chain is assigned a frozen indicator, writing key-value records within the chain from the primary cache to the distributed storage.

### Claim 15 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the instructions cause the machine to:
assign a prefix to a value entry and a key entry within the chain to represent a key-value record; and
validate the key-value record by determining whether prefixes of the value entry and the key entry match.

### Claim 16 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the instructions cause the machine to:
assign a prefix to a value entry and a key entry within the chain to represent a key-value record,
wherein the prefix includes at least one of a serial number of an operation that created the key-value record, a checksum, or a consistency point count of a consistency point that included the operation; and
validate the key-value record by determining whether prefixes of the value entry and the key entry match.

### Claim 17 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the instructions cause the machine to:
utilize a key-value map data structure, associating keys and values with corresponding key-value metadata, to identify corresponding key-value metadata associated with a key-value record; and
use indexing information within the corresponding key-value metadata to identify virtual addresses for accessing the key record and the value record within storage.

### Claim 18 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the instructions cause the machine to:
in response to the active chain reaching a threshold size or a consistency point being reached, freeze the active chain as a frozen chain and persist data within the frozen chain across the distributed storage.

### Claim 19 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the instructions cause the machine to:
in response to the active chain reaching a threshold size, freeze the active chain as a frozen chain and persist data within the frozen chain across the distributed storage.

### Claim 20 (depends on 14)

The non-transitory machine readable medium of claim 14, wherein the instructions cause the machine to:
in response to the data being persisted across the distributed storage, free a frozen operation header bucket, a frozen meta bucket, and a frozen data bucket of the frozen chain.
