Hash-based multi-tenancy in a deduplication system

US2016004716A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2016004716-A1
Application numberUS-201414322079-A
CountryUS
Kind codeA1
Filing dateJul 2, 2014
Priority dateJul 2, 2014
Publication dateJan 7, 2016
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

In a hash-based multi-tenancy in a deduplication system, incorporating, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system.

First claim

Opening claim text (preview).

What is claimed is: 1 . A method for hash-based multi-tenancy in a deduplication system by a processor device in a computing environment, the method comprising: incorporating, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system. 2 . The method of claim 1 , further including generating a hash value based upon incorporating the tenant ID. 3 . The method of claim 1 , further including performing the hash value calculation on a concatenation of a data segment along with using the tenant ID to create an artificial, extended data segment. 4 . The method of claim 1 , further including assigning different hash values to each one of a plurality of tenants for requiring the plurality of tenants to point to different data segments even if the different data segments are identical. 5 . The method of claim 1 , further including separating and storing each one of a plurality of tenants in a repository, wherein the repository is at least one of a virtual storage pool and a physical storage pool, and the repository is at least one of a dedicated storage pool and a shared storage pool. 6 . The method of claim 5 , further including associating the tenant ID with the repository. 7 . The method of claim 1 , further including performing at least one of: using an encryption key for encrypting the data segments for each one of a plurality of tenants, and encrypting each tenant ID for each one of a plurality of tenants for data segment security. 8 . A system for hash-based multi-tenancy in a deduplication system in a computing environment, the system comprising: a deduplication engine; and at least one processor device operable in the computing environment and controlling the deduplication engine, wherein processor device: incorporates, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system. 9 . The system of claim 8 , wherein the at least one processor device generates a hash value based upon incorporating the tenant ID. 10 . The system of claim 8 , wherein the at least one processor device performs the hash value calculation on a concatenation of a data segment along with using the tenant ID to create an artificial, extended data segment. 11 . The system of claim 8 , wherein the at least one processor device assigns different hash values to each one of a plurality of tenants for requiring the plurality of tenants to point to different data segments even if the different data segments are identical. 12 . The system of claim 8 , wherein the at least one processor device separates and stores each one of a plurality of tenants in a repository, wherein the repository is at least one of a virtual storage pool and a physical storage pool, and the repository is at least one of a dedicated storage pool and a shared storage pool. 13 . The system of claim 12 , wherein the at least one processor device associates the tenant ID with the repository. 14 . The system of claim 8 , wherein the at least one processor device performs at least one of: using an encryption key for encrypting the data segments for each one of a plurality of tenants, and encrypting each tenant ID for each one of a plurality of tenants for data segment security. 15 . A computer program product for hash-based multi-tenancy in a deduplication system in a computing environment by a processor device, the computer program product comprising a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: a first executable portion that incorporates, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system. 16 . The computer program product of claim 15 , further including a second executable portion that generates a hash value based upon incorporating the tenant ID. 17 . The computer program product of claim 15 , further including a second executable portion that performs the hash value calculation on a concatenation of a data segment along with using the tenant ID to create an artificial, extended data segment. 18 . The computer program product of claim 15 , further including a second executable portion that performs at least one of: assigning different hash values to each one of a plurality of tenants for requiring the plurality of tenants to point to different data segments even if the different data segments are identical, and separating and storing each one of a plurality of tenants in a repository, wherein the repository is at least one of a virtual storage pool and a physical storage pool, and the repository is at least one of a dedicated storage pool and a shared storage pool. 19 . The computer program product of claim 18 , further including a third executable portion that associates the tenant ID with the repository. 20 . The computer program product of claim 15 , further including a second executable portion that performs at least one of: using an encryption key for encrypting the data segments for each one of a plurality of tenants, and encrypting each tenant ID for each one of a plurality of tenants for data segment security.

Assignees

Inventors

Classifications

  • Hash tables · CPC title

  • De-duplication implemented within the file system, e.g. based on file segments (de-duplication techniques in storage systems for the management of data blocks G06F3/0641) · CPC title

  • Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system (cryptographic typewriters G09C3/00) · CPC title

  • Physics · mapped topic

  • Physics · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2016004716A1 cover?
In a hash-based multi-tenancy in a deduplication system, incorporating, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system.
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F16/1748. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Jan 07 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).