Unlock instant, AI-driven research and patent intelligence for your innovation.

A computer implemented method for dynamic sharding

An implementation method and computer technology, applied in the directions of computing, database distribution/replication, database design/maintenance, etc., can solve the problem of reducing the proportion of single shard operations, achieve the effect of ensuring maximum availability and consistency, and effectively realizing mobile operations

Active Publication Date: 2016-03-30
WESTERN DIGITAL TECH INC
View PDF10 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In addition, hash-based sharding needs to produce an appropriate hash for each key, such as a file identifier, which, as explained above, will result in the execution of standard requests such as data objects in containers, folders in The proportion of individual shard operations is reduced when alphabetizing columns of files, customers in tables, etc.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A computer implemented method for dynamic sharding
  • A computer implemented method for dynamic sharding
  • A computer implemented method for dynamic sharding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0082] figure 1 shown for implementation will refer to example figure 2 A suitable system for the computer-implemented method of dynamically partitioning a database 10 explained. The database 10 comprises data 11 identifiable by keys 12 contained within a global predetermined range 14 . The database can be, for example, a suitable key-value store for storing metadata of a storage system for large-scale distributed objects, such as known for example from EP2469411 or EP2672387, where for each key 12 of a data object, the storage refers to, for example, on which the Retrieving the data object can obtain the data 11 of the storage node of the redundant coded sub-block. As such massively distributed object storage systems expand beyond existing boundaries, there is an ever-increasing demand for higher performance and robustness of these systems. Even when high-capacity, dedicated, high-performance storage devices are used to store this database, such as, for example, flash st...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a computer implemented method for dynamic sharding. When handling a request (13) for data (11) of at least one key (12): - providing this request (13) to a predetermined shard store (20); - this predetermined shard store (20) verifying, by means of its local subrange collection (42), whether this at least one key (12) is present in a local subrange (40) of a shard (30) stored on this predetermined shard store (20); and - when at least one key (12) is not present in a local subrange (40) of a shard (30) stored on this predetermined shard store (20), returning a message (60) comprising the local subrange collection (42) of this predetermined shard store (20).

Description

technical field [0001] The present invention generally relates to a computer-implemented method for dynamically partitioning a database comprising data identifiable by keys contained within a global sort. Background technique [0002] A database shard is a horizontal partition of a database. Each of these individual partitions is called a shard or database shard. Horizontal partitioning is a database design principle whereby different subsets of a multi-row database are kept in separate horizontal partitions. Thus, each such horizontal partition forms a shard. When a database is partitioned horizontally into multiple shards, this offers a potential advantage in scalability, as it is possible to arrange the shards on different shard stores such as the database server, thus allowing the database to grow beyond a single database server performance and storage capacity limitations. [0003] Various methods of sharding databases can be used to accommodate this scaling, and pa...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
CPCG06F16/21G06F16/23G06F16/27G06F16/278G06F16/2255
Inventor 简·多姆斯卡尔·雷涅·达吕安罗曼·雷蒙德·阿格尼丝·斯洛滕梅克斯尼古拉斯·特朗热雷德里克·德·斯赫雷弗约亨·梅斯
Owner WESTERN DIGITAL TECH INC