Key_Value data storage system

Patent metadata

Field	Value
Publication number	US-10740308-B2
Application number	US-201715491417-A
Country	US
Kind code	B2
Filing date	Apr 19, 2017
Priority date	Nov 6, 2013
Publication date	Aug 11, 2020
Grant date	Aug 11, 2020

Abstract

According to an aspect, a method for key-value storage includes determining whether a data size of a first set comprising data and a key stored in a first area or a second area of a first storage unit is larger than a threshold determined for the first area or the second area in which the first set is stored, as a first execution condition. The method further includes determining whether a degree of collisions of a hash value indicating a storage location of the first set in the first area of the first storage unit is greater than a predetermined threshold, as a second execution condition. When the set satisfies either of the first or second execution conditions, the method includes the first set in the second area.

First claim

What is claimed is:

1. A method of managing data by a computer, comprising:
determining whether a data size of a first set comprising data and a key stored in a first area or a second area of a first storage unit is larger than a threshold determined for the first area or the second area in which the first set is stored, as a first execution condition;
determining whether a degree of collisions of a hash value indicating a storage location of the first set in the first area of the first storage unit is greater than a predetermined threshold, as a second execution condition;
relocating, when the first set satisfies at least one of the first execution condition and the second execution condition, the first set in the second area;
acquiring the data and a second key that in response to an access request, wherein the second key is uniquely associated with the first key, and the second key is specified in the access request when accessing the data associated with the first key;
identifying the storage location of the data in the first area of the storage unit;
generating the first key including the information on the storage location;
storing the first set at the storage location;
generating a second set comprising the second key and the generated first key; and
storing the second set in the second storage unit.

2. The method according to claim 1 , further comprising:
determining, prior to the relocating, that the second area does not contain a record having a record size suitable for the first set to be relocated;
adding a new area having the record size suitable for the data size of the first set to be relocated to the first storage unit as the second area; and
storing the first set in the record in the second area.

3. The method according to claim 1 , further comprising:
updating, in response to the first set being relocated, the first key by:
replacing the information on the storage location of the first set included in the first key with information on the storage location of the first set after relocation; and
updating the second set with the first key having information on the storage location of the first set after relocation.

4. A computer program product managing data on a computer system the computer program product including a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the computer system to execute a method comprising:
determining whether a data size of a first set comprising data and a key stored in a first area or a second area of a first storage unit is larger than a threshold determined for the first area or the second area in which the first set is stored, as a first execution condition;
determining whether a degree of collisions of a hash value indicating a storage location of the first set in the first area of the first storage unit is greater than a predetermined threshold, as a second execution condition;
relocating, when the first set satisfies at least one of the first execution condition and the second execution condition, the first set in the second area;
acquiring the data and a second key that in response to an access request, wherein the second key is uniquely associated with the first key, and the second key is specified in the access request when accessing the data associated with the first key;
identifying the storage location of the data in the first area of the storage unit;
generating the first key including the information on the storage location;
storing the first set at the storage location;
generating a second set comprising the second key and the generated first key; and
storing the second set in the second storage unit.

5. The computer program product according to claim 4 , wherein the method further comprises:
determining, prior to the relocating, that the second area does not contain a record having a record size suitable for the first set to be relocated;
adding a new area having the record size suitable for the data size of the first set to be relocated to the first storage unit as the second area; and
storing the first set in the record in the second area.

6. The computer program product according to claim 4 , wherein the method further comprises:
updating, in response to the first set being relocated, the first key by:
replacing the information on the storage location of the first set included in the first key with information on the storage location of the first set after relocation; and
updating second set with the first key having information on the storage location of the first set after relocation.

Assignees

• IBM

Inventors

• Ding Jie
• Shiomi Tatsuyuki
• Yaegashi Yoshiko
• Yoshifuji Nobuyuki

Classifications

• G06F16/28 Primary

  Databases characterised by their database models, e.g. relational or object models · CPC title

• G06F16/2272

  Management thereof · CPC title

• G06F16/325

  Hash tables · CPC title

• G06F16/2255 Primary

  Hash tables · CPC title