# US 2026/0064635 A1 · Control method of storage system

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

- Number: US 2026/0064635 A1
- Document ID: US20260064635A1
- Status: Published application
- Kind: A1
- Application number: 19/058,306
- Filed: 2025-02-20
- Published: 2026-03-05
- Earliest claimed: 2024-09-04
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Myoungwon OH; Sungmin LEE
- Web page: https://patentgrep.com/patent/US20260064635A1

## CPC

- G06F 16/1752: {based on file chunks}
- G06F 16/137: {Hash-based (content-based indexing of textual data G06F16/31)}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A control method includes dividing a source data unit among a plurality of source data units received from a host into a plurality of source chunks; generating a unique value for each of the plurality of source chunks; inserting the unique values into a source bloom filter of the source data unit; calculating a Hamming similarity with a storage bloom filter of each of the plurality of active storage data units for the source bloom filter; selecting an active storage data unit based on the highest Hamming similarity as a target data unit; classifying each of the plurality of source chunks as a first deduplicated chunk, an already deduplicated chunk, or a unique chunk using the unique values; and storing at least one of the first deduplicated chunks in the target data unit, such that spatial locality of each chunk may improve and fragmentation may be alleviated.

## Claims

### Claim 1

A control method of a storage system, the control method comprising:
dividing a source data unit into a plurality of source chunks, the source data among a plurality of source data units received from a host, the source data a target of deduplication;
generating a unique value for each of the plurality of source chunks;
inserting the unique values into a source bloom filter of the source data unit and updating the source bloom filter;
calculating a Hamming similarity with a storage bloom filter of each of a plurality of active storage data units for the source bloom filter;
selecting an active storage data unit based on a highest Hamming similarity among the plurality of active storage data units as a target data unit;
classifying each of the plurality of source chunks as one of a first deduplicated chunk, an already deduplicated chunk, or a unique chunk using the unique values; and
storing at least one of the first deduplicated chunks in the target data unit.

### Claim 2 (depends on 1)

The control method of claim 1, further comprising:
inserting the first deduplicated chunk into a target bloom filter of the target data unit and updating a bit of the target bloom filter.

### Claim 3 (depends on 1)

The control method of claim 1, wherein each of the unique values has a fixed size, and each of the unique values is generated by a hash function.

### Claim 4 (depends on 1)

The control method of claim 1, wherein a size of the source bloom filter and a size of the storage bloom filter are the same.

### Claim 5 (depends on 4)

The control method of claim 4, wherein a size of the source bloom filter and a size of the storage bloom filter are greater than a number of chunks allowed for each of the plurality of active storage data units.

### Claim 6 (depends on 1)

The control method of claim 1, wherein allowable sizes of the plurality of active storage data units are the same.

### Claim 7 (depends on 6)

The control method of claim 6, further comprising:
changing the target data unit to a storage data unit and excluding the changed unit from the plurality of active storage data units when the first deduplicated chunk is added to the target data unit and a size of the target data unit becomes greater than an allowable size.

### Claim 8 (depends on 7)

The control method of claim 7, wherein the classifying each of the plurality of source chunks includes:
classifying a source chunk corresponding to a same unique value as the first deduplicated chunk in response to the source data unit including a unique value the same as an already deduplicated source data unit among the plurality of source data units;
classifying a source chunk corresponding to a same unique value as the already deduplicated chunk in response to the source data unit including a unique value the same as the plurality of active storage data units or the storage data unit; and
classifying chunks other than the first deduplicated chunk and the already deduplicated chunk among the plurality of source chunks as the unique chunk.

### Claim 9 (depends on 8)

The control method of claim 8, further comprising:
accessing the first deduplicated chunk and the already deduplicated chunk by referencing a position of a stored chunk corresponding to the same unique value.

### Claim 10 (depends on 1)

The control method of claim 1, wherein the Hamming similarity indicates a number of positions in which each of bits in the same position has a value of logical ‘1’ in the source bloom filter and the storage bloom filter.

### Claim 11 (depends on 10)

The control method of claim 10, wherein the higher the Hamming similarity, the greater the number of chunks having the same unique value in the source data unit and the active storage data unit.

### Claim 12

A control method of a storage system, the control method comprising:
dividing a source data unit into a plurality of source chunks, the source unit a target of deduplication, the source unit among a plurality of source data units received from a host;
generating a unique value for each of the plurality of source chunks;
inserting the unique values into a source bloom filter of the source data unit and updating the source bloom filter;
calculating a Hamming similarity with a storage bloom filter of each of a plurality of active storage data units in which a deduplicated chunk is stored for the source bloom filter;
selecting a target data unit among the plurality of active storage data units using the Hamming similarities; and
adding at least one first deduplicated chunk among the plurality of source chunks to the target data unit.

### Claim 13 (depends on 12)

The control method of claim 12, wherein the selecting the target data unit includes selecting an active storage data unit based on the highest Hamming similarity among the plurality of active storage data units as the target data unit in response to one Hamming similarity among the Hamming similarities is the highest.

### Claim 14 (depends on 12)

The control method of claim 12, wherein the selecting the target data unit includes selecting the target data unit using a number of the plurality of active storage data units in response to the plurality of Hamming similarities being the highest among the Hamming similarities or in response to the Hamming similarities being lower than a threshold value.

### Claim 15 (depends on 14)

The control method of claim 14, wherein the selecting the target data unit includes selecting an active storage data unit based on the smallest size among the plurality of active storage data units as the target data unit in response to the number of the plurality of active storage data units is a maximum allowable number.

### Claim 16 (depends on 14)

The control method of claim 14, wherein the selecting the target data unit includes generating a new active storage data unit and selecting the new active storage data unit as the target data unit in response to the number of the plurality of active storage data units is equal to or less than a maximum allowable number.

### Claim 17 (depends on 14)

The control method of claim 14, wherein the threshold value is varied depending on the number of the plurality of active storage data units.

### Claim 18 (depends on 14)

The control method of claim 14, wherein the threshold value is varied depending on distribution of the Hamming similarities.

### Claim 19

A control method of a storage system, the control method comprising:
dividing a source data unit, the source data unit being a target of deduplication, into a plurality of source chunks, and generating a unique value of each of the plurality of source chunks;
inserting the unique values into a source bloom filter of the source data unit and updating the source bloom filter;
calculating a Hamming similarity with a storage bloom filter of each of a plurality of active storage data units in which the deduplicated chunks are stored for the source bloom filter;
selecting a target data unit from among the plurality of active storage data units using the Hamming similarities;
classifying each of the plurality of source chunks as one of a first deduplicated chunk, an already deduplicated chunk, or a unique chunk using the unique values;
adding the first deduplicated chunk to the target data unit and referencing a position of the target data unit to access the first deduplicated chunk; and
inserting the first deduplicated chunk into a target bloom filter of the target data unit and updating a bit of the target bloom filter.

### Claim 20 (depends on 19)

The control method of claim 19, wherein the selecting the target data unit includes:
selecting an active storage data unit based on the highest Hamming similarity calculated among the plurality of active storage data units as the target data unit in response to one Hamming similarity among the Hamming similarities being the highest;
selecting an active storage data unit based on the smallest size among the plurality of active storage data units as the target data unit in response to a plurality of Hamming similarities among the Hamming similarities are being highest and the number of the plurality of active storage data units being a maximum allowable number; and
generating a new storage data unit and selecting the new storage data unit as the target data unit in response to a plurality of Hamming similarities among the Hamming similarities being the highest and the number of the plurality of active storage data units being equal to or less than a maximum allowable number.
