Association metadata deletion method, device and device based on flash memory array

Abstract

The invention discloses a method for deleting associated metadata based on a flash memory array, after the first metadata is inserted into memory, in response to an instruction to insert the second metadata,depending on whether the first metadata is in memory, or the associated metadata is marked as an item to be deleted, or the first metadata is deleted when the metadata is brushed to the flash memory array, when the associated metadata is brushed to the flash memory array, if the associated metadata is marked as an item to be deleted, or the metadata corresponding to the associated metadatahas been deleted, the associated metadata is deleted. Therefore, the method can determine whether to delete the associated metadata only according to whether the associated metadata is marked as deleted items or whether the corresponding metadata is deleted when the associated metadata is brushed under the flash memory array, thereby avoiding occupying a large amount of memory space and improvingthe deletion efficiency. The invention also provides an associated metadata deleting device, a device and a computer-readable storage medium based on a flash memory array, the functions of which correspond to the method.

Description

technical field [0001] The present invention relates to the field of computers, in particular to a method, device, equipment and computer-readable storage medium for deleting associated metadata based on a flash memory array. Background technique [0002] In the era of big data, the storage of massive data requires the support of the file system, and the metadata performance of the file system becomes the key to affecting the performance of file access. [0003] The B+ tree is a balanced search tree designed for disks or other direct access auxiliary devices, and is usually used in databases and file systems of operating systems. Generally, metadata is organized in the form of a B+ tree in the memory disk, and the B+ tree in the memory is used as an increment of the disk B+ tree. When the B+ tree in the memory reaches a certain threshold, it needs to be flushed to the disk. If there is metadata on the disk, the metadata in the memory and the metadata on the disk will be mer...

AI Technical Summary

Problems solved by technology

[0006] The object of the present invention is to provide a method, device, device and computer-readable storage medium for deleting associated metadata based on a flash memory array, so as to solve the problem that a large amount of memory space will be occupied according to the traditional B+ tree insertion and deletion method, resulting in Remove less efficient issues

Images