1 / 12

S CALABLE D ECENTRALIZED D E-DUPLICATION S TORE

S CALABLE D ECENTRALIZED D E-DUPLICATION S TORE. Prakash Chandrasekaran – Anand Gupta Gautham Narayanasamy – Vijayaraghavan Subbaiah. Motivation. Importance of storage space Finding enough space to meet the demands of the customers has been a huge challenge for cloud providers.

sharis
Télécharger la présentation

S CALABLE D ECENTRALIZED D E-DUPLICATION S TORE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. SCALABLE DECENTRALIZED DE-DUPLICATION STORE Prakash Chandrasekaran – Anand Gupta Gautham Narayanasamy – Vijayaraghavan Subbaiah

  2. Motivation • Importance of storage space • Finding enough space to meet the demands of the customers has been a huge challenge for cloud providers. • Saving significant resources during web crawling, indexing, and search. • Backup Strategies • To backup the data and replicate them across many geographical locations. • Need for devising ingenious techniques to use the storage space more efficiently.

  3. Deduplication • Removing duplicate copies of files and storing only the pointers to the original copy. • Block-level deduplication • Allows more granularity and hence offers a greater reduction in storage space. • Requires more processing power when compared to file-level deduplication. • Use case • Storage of snapshots of virtual machine (VM) images in a virtualized cloud environment. • Detecting exact duplicates and near duplicates in web pages.

  4. Architecture

  5. Cassandra Schema • create keyspaceminhash; • create column family minhash_chunks with column_type=Super; • create column family minhash_filerecipewith column_type=Super; • create column family minhash_fullhash; • create keyspacefiles; • create column family files_minhash;

  6. Data Distribution Client / Application Cassandra Cluster Load Balancing Cassandra Nodes

  7. Data Flow in Cassandra OS Snapshot file / Web page Start Chunking Process Chunks Compute minhash and fullhash Full hash MinHash Cassandra Cluster Check full hash already exists File input to Client File Name Match Check file already exists Insert <fileid , minhash> Insert <minhash,filerecipe> Insert <minhash, chunkData> Insert <minhash, fullhash> Client

  8. System Implementation

  9. Sequence - put

  10. Sequence – get

  11. System Efficiency • Calculating the total amount of space saved. • Demonstrate the extent of similarity in various snapshots and web pages. • The overhead associated with file storage and retrieval in our system.

  12. Questions ?

More Related