# US 2024/0004834 A1 · Directory structure for a distributed storage system

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

- Number: US 2024/0004834 A1
- Document ID: US20240004834A1
- Status: Published application
- Kind: A1
- Application number: 18/469,653
- Filed: 2023-09-19
- Published: 2024-01-04
- 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/US20240004834A1

## CPC

- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 16/13: File access structures, e.g. distributed indices (arrangements of input from, or output to, record carriers G06F3/06)
- G06F 3/0604: {Improving or facilitating administration, e.g. storage management}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0643: {Management of files}
- G06F 3/0667: {at data level, e.g. file, record or object virtualisation}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]}
- G06F 12/0246: {in block erasable memory, e.g. flash memory}
- G06F 16/1847: {specifically adapted to static storage, e.g. adapted to flash memory or SSD}
- G06F 2212/7201: Logical to physical mapping or translation of blocks or pages
- 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 flash storage devices. Each computing device is operable to access one or more memory blocks within the flash storage devices and maintain a directory structure for managing access to the memory. The directory structure may be adaptively resized according to the addition or removal of one or more associated files stored in memory.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A system comprising:
a non-transitory, computer-readable, recording medium storing instructions executable by a computing device to:
communicate with to a storage network comprising a plurality of memory blocks,
maintain a directory structure, comprising a hash set, for managing access to one or more memory blocks of the plurality of memory blocks,
adaptively resize the directory structure according to the access of the one or more memory blocks, and
redistribute a portion of the directory structure to another computing device to enlarge the hash set.

### 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 access comprises adding or deleting files associated with the directory structure.

### Claim 25 (depends on 21)

The system of claim 21, wherein the directory structure comprises one or more registry blocks, and wherein each registry block comprises one or more key-value entries, and wherein each key-value entries correspond to one or more files.

### Claim 26 (depends on 25)

The system of claim 25, wherein key-value entries are added to a registry block of the one or more registry blocks until the number of 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 27 (depends on 26)

The system of claim 26, wherein the new registry block is relocated to another computing device.

### Claim 28 (depends on 25)

The system of claim 25, wherein key-value entries are removed from a registry block of the one or more registry blocks until the number of 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 one or more adaptive indices.

### Claim 31

A method comprising:
communicatively coupling a computing device to a storage network comprising a plurality of memory blocks;
maintaining a directory structure for managing access to one or more memory blocks of the plurality of memory blocks, wherein the directory structure comprises a hash set;
adaptively resizing the directory structure according to the access of the one or more memory blocks of the plurality of memory blocks; and
redistributing a portion of the directory structure to another computing device to enlarge the hash set.

### Claim 32 (depends on 31)

The method of claim 31, wherein the storage network comprises non-volatile memory.

### Claim 33 (depends on 31)

The method of claim 31, wherein the storage network comprises flash memory.

### Claim 34 (depends on 31)

The method of claim 31, wherein accessing one or more memory blocks comprises adding or deleting files associated with the directory structure.

### Claim 35 (depends on 31)

The method of claim 31, wherein the directory structure comprises one or more registry blocks, and wherein each registry block comprises one or more key value entries, and wherein each key-value entries correspond to one or more files.

### Claim 36 (depends on 35)

The method of claim 35, wherein the method comprises:
adding key-value entries to a registry block of the one or more registry blocks; and
if the number of 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 37 (depends on 36)

The method of claim 36, wherein the method comprises relocating the new registry block to another computing device.

### Claim 38 (depends on 36)

The method of claim 36, wherein the method comprises:
removing key-value entries from a registry block of the one or more registry blocks; and
if the number of 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 one or more adaptive indices.
