# US 2024/0201906 A1 · Flash registry with on-disk hashing

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

- Number: US 2024/0201906 A1
- Document ID: US20240201906A1
- Status: Published application
- Kind: A1
- Application number: 18/540,244
- Filed: 2023-12-14
- Published: 2024-06-20
- Earliest claimed: 2017-11-13
- Assignees: Weka.IO Ltd.
- Applicants: Weka.IO Ltd.
- Inventors: Maor Ben Dayan; Omri Palmon; Liran Zvibel; Kanael Arditti
- Web page: https://patentgrep.com/patent/US20240201906A1

## CPC

- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/064: {Management of blocks}
- G06F 3/0664: {at device level, e.g. emulation of a storage device or system}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 13/1668: {Details of memory controller}
- G06F 13/4027: {using bus bridges (G06F13/4022 takes precedence)}
- G06F 13/4282: {on a serial bus, e.g. I2C bus, SPI bus (on daisy chain buses G06F13/4247)}
- G06F 2213/0026: PCI express
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices is operably coupled to one or more of a plurality of storage devices. Each computing device is operable to access one or more memory blocks within the storage devices and maintain a registry over the same one or more memory blocks. The registry may be adaptively resized according to the access of the one or more memory blocks.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A system comprising:
a registry of a plurality of memory blocks, wherein:
the registry is adaptively resized,
the registry comprises one or more registry blocks,
each registry block comprises a split level and one or more keys,
each of the one or more keys comprises an identical number of bits,
an index, in each of the one or more keys, is indicated by a specified number of bits, and
the specified number is the split level.

### Claim 22 (depends on 21)

The system of claim 21, wherein the plurality of memory blocks comprises non-volatile memory.

### Claim 23 (depends on 21)

The system of claim 21, wherein the plurality of memory blocks comprises flash memory.

### Claim 24 (depends on 21)

The system of claim 21, wherein the registry is resized as the one or more memory blocks are written.

### Claim 25 (depends on 21)

The system of claim 21, wherein the registry is resized as the one or more memory blocks are read.

### Claim 26 (depends on 21)

The system of claim 21, wherein each of the one or more keys in each of the one or more registry blocks is associated with a key-value entry of one or more key-value entries.

### Claim 27 (depends on 26)

The system of claim 26, wherein the one or more key-value entries are added to a registry block of the one or more registry blocks until a number of the one or more key-value entries exceeds a predetermined capacity, at which time the registry block is split and a new registry block is added to the one or more registry blocks.

### Claim 28 (depends on 26)

The system of claim 26, wherein the one or more key-value entries are removed from a registry block of the one or more registry blocks until a number of the one or more key-value entries is at or below a predetermined level, at which time the registry block is merged with another registry block of the one or more registry blocks.

### Claim 29 (depends on 21)

The system of claim 21, wherein the storage network comprises a failure resilient address space distributed across a plurality of storage devices.

### Claim 30 (depends on 28)

The system of claim 28, wherein each registry block is identified by the index and the split level.

### Claim 31

A method comprising:
maintaining a registry of one or more memory blocks; and
adaptively resizing the registry, wherein:
the registry comprises one or more registry blocks,
each registry block comprises a split level and one or more keys,
each of the one or more keys comprises an identical number of bits,
an index, in each of the one or more keys, is indicated by a specified number of bits, and
the specified number is the split level.

### Claim 32 (depends on 31)

The method of claim 31, wherein the plurality of memory blocks comprises non-volatile memory.

### Claim 33 (depends on 31)

The method of claim 31, wherein the plurality of memory blocks comprises flash memory.

### Claim 34 (depends on 31)

The method of claim 31, wherein the registry is resized as the one or more memory blocks are written.

### Claim 35 (depends on 31)

The method of claim 31, wherein the registry is resized as the one or more memory blocks are read.

### Claim 36 (depends on 31)

The method of claim 31, wherein each of the one or more keys in each of the one or more registry blocks is associated with a key-value entry of one or more key-value entries.

### Claim 37 (depends on 36)

The method of claim 36, wherein the method comprises:
adding the one or more key-value entries to a registry block of the one or more registry blocks; and
if a number of the one or more key-value entries exceeds a predetermined capacity, splitting the registry block and adding a new registry block to the one or more registry blocks.

### Claim 38 (depends on 36)

The method of claim 36, wherein the method comprises:
removing the one or more key-value entries from a registry block of the one or more registry blocks; and
if a number of the one or more key-value entries is at or below a predetermined level, merging the registry block with another registry block of the one or more registry blocks.

### Claim 39 (depends on 31)

The method of claim 31, wherein the storage network comprises a failure resilient address space distributed across a plurality of storage devices.

### Claim 40 (depends on 38)

The method of claim 38, wherein each registry block is identified by the index and the split level.
