Data update method for distributed storage system and server

Abstract

An embodiment of the invention provides a data update method for a Key-Value storage system via distributed key values. Through replication of nodes requiring update, father nodes, ancestor nodes, and root nodes to a buffer layer of the Key-Value storage system, modification of key values and contents of the nodes requiring update, the father nodes, and the ancestor nodes, and modification of the contents of the root nodes, the nodes are made different from original nodes in the storage layer. The method is characterized in that, the nodes requiring update, the father nodes, and the ancestor nodes are first stored in the storage layer, and then the root nodes are stored in a key value pair system. Since the nodes requiring update in the buffer layer are stored in the storage layer prior to storage of the root nodes in the buffer layer in the storage layer, reading operation in the storage process of the nodes requiring update does not enable reading of the nodes requiring update, thereby preventing reading of dirty data. The invention also provides a corresponding method for reading index nodes and a server.

Description

technical field [0001] The invention relates to the field of data processing, in particular to a method and server for processing index nodes. Background technique [0002] With the development of electronic communication technology, the storage capacity of electronic data is continuously increasing, and the user's requirements for the capacity of the data storage system are also continuously increasing. As a distributed key-value pair Key-Value storage system featuring high availability, high scalability, and large capacity, it is welcomed by users. [0003] The distributed key-value pair Key-Value storage system uses the key-value pair Key-Value as the data organization method, and distributes these Key-Values ​​on a large number of nodes according to a certain hash algorithm. For the processing of node data in the distributed Key-Value storage system, operations such as query, addition, modification, and deletion can be implemented through the distributed simple database...

AI Technical Summary

Problems solved by technology

However, although the above method can avoid reading dirty data, it has poor concurrency and cannot perform read and write operations at the same time, which weakens the availability of the distributed Key-Value storage system

For example, when a write operation is performed through a distributed index, the write operation may take several seconds or even several minutes, which causes the read operation to be greatly delayed and seriously affects the availability of the distributed Key-Value storage system

Images