Data updating method and server of distributed storage system

Abstract

An embodiment of the present invention provides a data update method for a distributed key value pair Key-Value storage system. A node that needs to be updated, a father node, an ascending node, a root node are duplicated to a buffer layer of the Key-Value storage system, and key values and content of the node that needs to be updated, the father node, and the ascending node are modified, and content of the root node is modified, so that these nodes are different from original nodes in a storage layer. According to the method in the present invention, the node that needs to be updated, the father node, and the ascending node are first stored into the storage layer, and then, the root node is stored to a key value pair system. Because the node that needs to be updated in the buffer layer is stored into the storage layer prior to the root node in the buffer layer, the node that needs to be updated cannot be read in a read operation generated in the storage process of the node that needs to be updated, thereby avoiding reading of dirty data. The present invention further provides a corresponding method and server for reading an index node.

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