Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Distributed data redundancy storage method based on consistent Hash algorithm

A technology of distributed data and hash algorithm, which is applied in the direction of electric digital data processing, input/output process of data processing, encryption device with shift register/memory, etc. and other issues to achieve the effect of improving node selection efficiency and satisfying massive data storage

Active Publication Date: 2019-08-23
HERE DATA TECH
View PDF4 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] This application discloses a distributed data redundancy storage method based on a consistent hash algorithm, which solves the problem that traditional storage technologies in the background technology cannot or are difficult to meet the requirements of massive data storage

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
  • Distributed data redundancy storage method based on consistent Hash algorithm
  • Distributed data redundancy storage method based on consistent Hash algorithm
  • Distributed data redundancy storage method based on consistent Hash algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0020] A distributed data redundancy storage method based on a consistent hash algorithm disclosed in this application includes:

[0021] Step 1. Define equipment and node attributes, and establish a cluster organization structure so that the entire node selection process can be implemented in a structured cluster organization diagram. The execution process specifically includes:

[0022] 1). Abstract the device and node attributes, and the device represents the storage device that actually joins the cluster. Nodes are defined based on the location of physical storage devices in the cluster organization. like figure 1 As shown, it is a schematic diagram of the cluster organization structure based on physical storage devices. The storage (Device is a special node, located at the lowest layer of the cluster architecture, and is the final storage location of data, which is distinguished from ordinary nodes) generally has a unique identifier. The location information in the clus...

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

A distributed data redundancy storage method based on consistent Hash algorithm is used for selecting distribution positions of prestored data in a storage cluster. The method includes firstly establishing a topology logical structure of each storage node in a distributed storage system; determining a location of each node in a storage node sequence corresponding to each Hash subspace through a consistent Hash algorithm; then according to a pre-stored data redundancy storage manner, determining the number of copies of the data and stored data of each copy; and storing the stored data of each copy into different storage nodes according to a storage rule. The method quickly establishes the cluster organization structure of the distributed storage system, and uses the supervised weight randomselection algorithm to achieve the purpose of efficiently selecting the storage nodes when selecting the target storage node sequence for the pre-stored data in the cluster, thereby satisfying the storage requirements of massive data.

Description

technical field [0001] The invention relates to the field of distributed storage, in particular to a distributed data redundancy storage method based on a consistent hash algorithm. Background technique [0002] At present, it is in a new stage of widespread popularization and prosperous application of cloud computing. The data scale is growing explosively. The safe and efficient storage of massive data has become a key technology of cloud computing. Traditional storage technologies, such as NFS and SAN, have been unable or difficult to meet the storage requirements of massive data (PB or EB level) in terms of scalability, fault tolerance, availability, and deployment costs. Contents of the invention [0003] The present application discloses a distributed data redundancy storage method based on a consistent hash algorithm, which solves the problem in the background that traditional storage technologies cannot or are difficult to meet the requirements for massive data stor...

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
IPC IPC(8): H04L9/06H04L29/08
CPCH04L9/0643H04L67/1097G06F3/0607G06F3/061G06F3/064G06F3/067G06F3/0614G06F3/0629G06F3/0659G06F3/0685
Inventor 郝斌
Owner HERE DATA TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com