2011•Unpublished venueRequires access

DBLK: Deduplication for primary block storage

Yoshihiro Tsuchiya, Takashi Watanabe

Open publisher page 47 citations

Abstract

The deduplication block-device (DBLK) is a deduplication and compression system with a block device interface. It is used as a primary storage and block-wise deduplication is done inline. Since deduplication for primary storage requires low latency and detecting block-wise deduplication creates a large amount of metadata, it is necessary to efficiently use the memory of the system. We solved this problem by developing a multilayer Bloom filter (MBF) to reduce the size of the data structure in the memory for indexing duplicate data.

About this research paper

What this paper is about

The deduplication block-device (DBLK) is a deduplication and compression system with a block device interface. It is used as a primary storage and block-wise deduplication is done inline. Since deduplication for primary storage requires low latency and detecting block-wise deduplication creates a large amount of metadata, it is necessary to efficiently use the memory of the system. We solved this problem by developing a multilayer Bloom filter (MBF) to reduce the size of the data structure in the memory for indexing duplicate data.

Why it matters

OpenAlex reports 47 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The deduplication block-device (DBLK) is a deduplication and compression system with a block device interface. It is used as a primary storage and block-wise deduplication is done inline. Since deduplication for primary storage requires low latency and detecting block-wise deduplication creates a large amount of metadata, it is necessary to efficiently use the memory of the system. We solved this problem by developing a multilayer Bloom filter (MBF) to reduce the size of the data structure in the memory for indexing duplicate data.

Key concepts: Data deduplication, Computer science, Bloom filter, Block (permutation group theory), Metadata, Database, Computer data storage, Operating system

Related papers

Back to paper searchBrowse research topicsOriginal source
DBLK: Deduplication for primary block storage — Research Paper | ScholarLens