Data arrangement method and device, product, equipment and medium

Abstract

The invention discloses a data arrangement method and device, a product, equipment and a medium, and the method comprises the steps: determining a storage space after a data distribution position in a storage space corresponding to a target volume as a first storage space, and determining a storage space before the data distribution position as a second storage space; traversing file data in the target volume to obtain a target file data set; determining a space occupied by data not belonging to the target file data set in the first storage space to obtain a target space; determining data which is stored in the second storage space and belongs to the target file data set to obtain target data; constructing a first mobile set based on the target data; performing data movement on the first movement set to enable the target data and the original data in the first storage space to form continuous data; and describing the continuously used space in the first storage space in a VDL description mode. In this way, the data complexity and the algorithm complexity can be reduced, and the storage access performance of the elastic file system is improved.

Description

Technical Field

[0001] The present application relates to the field of storage technology, and in particular to a data organization method, device, product, equipment and medium. Background Art

[0002] After frequent file operations on the server, the data and algorithm overhead required to manage the file system cache data is increasing, and the increase in other loads leads to a gradual decline in storage access performance. In this case, the optimization of storage access performance is naturally generated. The storage currently managed by the elastic file system is much larger than the previous storage, and the data complexity and algorithm complexity have increased significantly. Therefore, how to improve the storage access performance of the elastic file system is a problem that needs to be solved at present. Summary of the invention

[0003] In view of this, the purpose of this application is to provide a data sorting method, device, product, equipment and medium, which can reduce data complexity and algorithm complexity, thereby improving the storage access performance of the elastic file system. The specific scheme is as follows:

[0004] In a first aspect, the present application discloses a data sorting method, comprising:

[0005] Determine the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and determine the storage space before the data allocation position as the second storage space, wherein the target volume is a volume corresponding to the elastic file system;

[0006] Traversing the file data in the target volume to obtain a target file data set;

[0007] Determine the space in the first storage space that is not occupied by the data in the target file data set, and obtain the target space;

[0008] Determine the data stored in the second storage space and belonging to the target file data set to obtain target data;

[0009] Constructing a first move set based on the target data, wherein the first move set includes the target data and a first destination address corresponding to the target data, and the first destination address is an address in the target space;

[0010] Performing data movement on the first movement set so that the target data and the original data in the first storage space form continuous data;

[0011] The continuously used space in the first storage space is described using a VDL description method.

[0012] Optionally, also include:

[0013] Determining whether there is still discontinuous data in the first storage space based on the target file data set and the first move set;

[0014] If there is still discontinuous data in the first storage space, a second move set will be determined based on the discontinuous data, wherein the second move set includes the discontinuous data to be moved and a second destination address corresponding to the discontinuous data to be moved, and the second destination address is an address in the target space.

[0015] Data is moved on the second move set to make the data in the first storage space continuous.

[0016] Optionally, also include:

[0017] Acquire the data allocation location from the allocation table of the elastic file system;

[0018] Correspondingly, describing the continuous used space in the first storage space using a VDL description method includes:

[0019] The allocation table is modified to describe the continuous used space in the first storage space using a VDL description method.

[0020] Optionally, before acquiring the data allocation position from the allocation table in the elastic file system, the method further includes:

[0021] Performing an unmounting operation on the target volume mounted by the elastic file system;

[0022] The target volume is locked to obtain exclusive access to the target volume.

[0023] Optionally, also include:

[0024] The continuous unused space in the first storage space is described using a VDL description method.

[0025] Optionally, constructing a first move set based on the target data includes:

[0026] Allocating a destination address for the target data in unused space in the first storage space using a storage space allocator to obtain a first destination address;

[0027] A first move set is constructed based on the target data and the first target address.

[0028] In a second aspect, the present application discloses a data sorting device, comprising:

[0029] a storage space determination module, configured to determine the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and the storage space before the data allocation position as the second storage space, wherein the target volume is a volume corresponding to the elastic file system;

[0030] A file data traversal module, used for traversing the file data in the target volume to obtain a target file data set;

[0031] A target space determination module, used to determine the space in the first storage space that is not occupied by the data in the target file data set, and obtain the target space;

[0032] a target data determination module, configured to determine the data stored in the second storage space and belonging to the target file data set, and obtain the target data;

[0033] A first move set construction module, configured to construct a first move set based on the target data, wherein the first move set includes the target data and a first destination address corresponding to the target data, and the first destination address is an address in the target space;

[0034] A first data moving module, used for moving data of the first moving set so that the target data and the original data in the first storage space form continuous data;

[0035] The storage space description module is used to describe the continuously used space in the first storage space using a VDL description method.

[0036] In a third aspect, the present application discloses a computer program product, which implements the aforementioned data sorting method when executed.

[0037] In a fourth aspect, the present application discloses an electronic device, including a memory and a processor, wherein:

[0038] The memory is used to store the computer program;

[0039] The processor is used to execute the computer program to implement the aforementioned data sorting method.

[0040] In a fifth aspect, the present application discloses a computer-readable storage medium for storing a computer program, wherein the computer program implements the aforementioned data sorting method when executed by a processor.

[0041] It can be seen from the above scheme that the present application provides a data sorting method, including: determining the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and determining the storage space before the data allocation position as the second storage space, wherein the target volume is the volume corresponding to the elastic file system; traversing the file data in the target volume to obtain a target file data set; determining the space occupied by the data in the first storage space that does not belong to the target file data set to obtain the target space; determining the data stored in the second storage space that belongs to the target file data set to obtain the target data; constructing a first move set based on the target data, wherein the first move set includes the target data and a first destination address corresponding to the target data, and the first target address is an address in the target space; performing data movement on the first move set so that the target data and the original data in the first storage space constitute continuous data; describing the continuously used space in the first storage space using a VDL description method.

[0042] It can be seen that the beneficial effects of the present application are as follows: in the elastic file system, the space after the data allocation position is preferentially used to store file data, and the space before the data allocation position is preferentially used to store metadata. The present application embodiment organizes the data according to the priority storage principle, organizes the file data stored in the metadata corresponding space to the space for storing file data, and makes the data constitute continuous data, and uses the VDL description method to describe the continuous use space. In this way, the data complexity and algorithm complexity of the elastic file system operation can be reduced, thereby improving the operation efficiency and the storage access performance of the elastic file system.

[0043] Correspondingly, a data sorting device, product, equipment and readable storage medium provided by the present application also have the above-mentioned technical effects. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on the provided drawings without paying any creative work.

[0045] Figure 1 A flow chart of a data sorting method provided in an embodiment of the present application;

[0046] Figure 2 A data sorting flow chart provided for an embodiment of the present application;

[0047] Figure 3 A schematic diagram of the structure of a data sorting device provided in an embodiment of the present application;

[0048] Figure 4 A structural diagram of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0049] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0050] After frequent file operations on the server, the data and algorithm overhead required to be managed gradually increase due to the increasing size of the file system cache data. In addition, the increase in other loads leads to a gradual decline in storage access performance. In this case, the optimization of storage access performance is naturally generated. The more common optimization methods are: (1) System reset. After the system is reset, the data required to be managed by the file system is cleared, and the storage access request is also reset. However, for the server, the cost of system reset is relatively high. In addition, the system reset only temporarily reduces the system's access frequency to the storage. As the system runs, the corresponding access will come again. (2) File system defragmentation. By organizing the file data run (i.e., data run) into a continuous state as much as possible, the efficiency of file access is enhanced. For defragmentation, it only partially reduces the response to file access, but has no effect on the already complex and large file system management data. In addition, the defragmentation tool that comes with the Windows operating system cannot defragment refs (i.e., Resilient File System) volumes.

[0051] Since the elastic file system needs to continuously operate the storage it manages, the existing file system defragmentation function cannot operate on the corresponding storage. Traditionally, if it is a non-elastic file system, it can be optimized through file defragmentation, but for elastic file systems to manage large-capacity storage, there is a large waste of space. This shows that more effective methods are currently needed to improve server storage performance.

[0052] See also Figure 1 As shown, the embodiment of the present application discloses a data sorting method, including:

[0053] Step S11: determining the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and determining the storage space before the data allocation position as the second storage space, wherein the target volume is the volume corresponding to the elastic file system.

[0054] In the embodiment of the present application, the data allocation position can be obtained from the middle allocation table of the elastic file system. The middle allocation table of the elastic file system is a data structure used to record the file data storage situation in the elastic file system, and records the data allocation position. The storage space after the data allocation position is preferentially used to store file data, and the storage space before the data allocation position is preferentially used to store metadata.

[0055] In the embodiment of the present application, before obtaining the data allocation position from the allocation table in the elastic file system, the target volume mounted by the elastic file system is unmounted, and the target volume is locked to obtain exclusive access to the target volume. In this way, the target volume is unmounted and then locked to achieve exclusive access to the target volume.

[0056] Step S12: traverse the file data in the target volume to obtain a target file data set.

[0057] The embodiment of the present application can traverse all the file data in the target volume to form a target file data set.

[0058] Step S13: Determine the space in the first storage space that is not occupied by the data in the target file data set, and obtain the target space.

[0059] In an embodiment of the present application, the space occupied by data that does not belong to the target file data set in the storage space for preferentially storing file data is determined as the target space, which can be recorded in the storage space allocator, which is a functional component for allocating storage space.

[0060] Step S14: Determine the data stored in the second storage space and belonging to the target file data set to obtain target data.

[0061] That is, the embodiment of the present application searches out the data stored in the storage space that preferentially stores metadata as the target data.

[0062] Step S15: constructing a first movement set based on the target data, wherein the first movement set includes the target data and a first destination address corresponding to the target data, and the first destination address is an address in the target space.

[0063] In the embodiment of the present application, a storage space allocator can be used to allocate a destination address for the target data in an unused space in the first storage space to obtain a first destination address, and a first move set can be constructed based on the target data and the first destination address. That is, a destination address is allocated to the target data so that the data is continuous with the original data after being moved.

[0064] Step S16: performing data movement on the first movement set so that the target data and the original data in the first storage space constitute continuous data.

[0065] Furthermore, the embodiment of the present application can also determine whether there is still discontinuous data in the first storage space based on the target file data set and the first move set; if there is still discontinuous data in the first storage space, a second move set will be determined based on the discontinuous data, wherein the second move set includes the discontinuous data to be moved and the second destination address corresponding to the discontinuous data to be moved, and the second destination address is an address in the target space. Data is moved on the second move set to make the data in the first storage space continuous.

[0066] That is, if discontinuous data still exists after the first move set is moved, the discontinuous data can be sorted into continuous data.

[0067] Step S17: describing the continuously used space in the first storage space using a VDL (Valid Data Length) description method.

[0068] Among them, the continuously used space is the space for storing continuous data. The VDL description method is a storage format in the elastic file system. In addition, the embodiment of the present application can also describe the continuous unused space in the first storage space using the VDL description method. VDL uses a position plus length data structure to describe a linear space with similar properties, which is mostly used to express large continuous spaces. Further, the middle allocation table is modified to describe the continuously used space in the first storage space using the VDL description method. That is, the middle allocation table can record the usage of the storage space, and both the continuously used space and the continuous unused space can be described using the VDL description method.

[0069] In an optional implementation, the embodiment of the present application can also traverse all metadata in the target volume to obtain a metadata set; determine the data stored in the first storage space and belonging to the metadata set to obtain the target metadata; assign a destination address to the target metadata in the second storage space to obtain the target address corresponding to the target metadata, establish a third move set based on the target metadata and the target address corresponding to the target metadata, move data on the third move set to move the target metadata to the second storage space, and form continuous metadata with other metadata in the second storage space, and describe the continuous use space in the second storage space using a VDL description method. Among them, the target address corresponding to the target metadata is an address in the space in the second storage space that does not belong to the space occupied by the data in the metadata set.

[0070] In addition, in an optional embodiment, if it is determined based on the third move set that there is still discontinuous data in the second storage space after the third move set is moved, a fourth move set is determined based on the discontinuous data, and the fourth move set includes the discontinuous metadata to be moved and the destination address corresponding to the discontinuous metadata to be moved. The destination address is an unused address in the second storage space other than the destination address in the third move set, and is an address that can make the metadata continuous, and data is moved for the fourth move set.

[0071] In this embodiment, the second space allocator may be used to allocate space addresses in the second storage space.

[0072] It can be seen that in the elastic file system, the space after the data allocation position is used to store file data first, and the space before the data allocation position is used to store metadata first. The embodiment of the present application organizes the data according to the priority storage principle, organizes the file data stored in the space corresponding to the metadata to the space for storing file data, and makes the data constitute continuous data, and uses the VDL description method to describe the continuous use space. In this way, the data complexity and algorithm complexity of the elastic file system operation can be reduced, thereby improving the operation efficiency and the storage access performance of the elastic file system.

[0073] In the embodiment of the present application, the characteristics of the elastic file system used are described as follows: the known file system divides the storage into clusters as the basic unit, and then uses a bitmap to describe and manage the usage of specific clusters. If the target storage is a large space, it is obvious that the commonly used management method requires more data and algorithm costs, so the elastic file system performs some simple optimization processing on it. The elastic file system does not use a bitmap to describe the continuously used and continuously unused clusters, but a simple description. Obviously, even if there is a large amount of file data in the target storage, if the storage form is in a continuously used state, the management data and algorithm overhead required by the file system for subsequent operations are very small, thereby achieving the purpose of optimizing storage access. The elastic file system sets respective priority allocation starts for the allocation of metadata and the allocation of file data, with the purpose of quickly responding to both file operations and extended directory operations. Re-allocating the target storage according to the above principles can also cooperate with the elastic file system to achieve the best effect.

[0074] For further information, see Figure 2 As shown, Figure 2 A data sorting flow chart provided in an embodiment of the present application may specifically include the following steps:

[0075] First, perform the disMount operation on the volume (i.e., the specified volume) of the elastic file system Mount.

[0076] After completing the disMount operation, immediately perform the Lock operation so that the above volume can be used exclusively and subsequent analysis and rewrite operations can be performed.

[0077] The starting position of data allocation in the medium allocator table is recorded. The storage space after it (i.e. the first storage space) is the data set, which is recorded as the Data set. The storage space before it (i.e. the second storage space) stores metadata first, which is recorded as the Meta set.

[0078] All file data in the target volume are traversed and recorded as a T1 set (i.e., the target file data set).

[0079] Extract the data excluding T1 in the Data collection and record the corresponding space to the A allocator (i.e., the storage space allocator).

[0080] Extract the data of the T1 set contained in the Meta set, and use the A allocator to allocate the destination address to form a move set (i.e., the first move set).

[0081] Extract the data in the Data set that is still discontinuous after T1 is combined with the a move set, and use the A allocator to allocate the destination address to form the b move set (i.e., the second move set).

[0082] Move sets a and b to complete data movement and modify the data run record.

[0083] Update the medium allocator table content and convert the continuous used space in the corresponding data area into VDL (valid data length) expression. The same operation is performed for the continuous unused space.

[0084] The operation of the destination storage is completed. At this point, the overall optimization action is completed. After the file system is mounted, subsequent file operations will be performed in a more efficient manner.

[0085] In this way, exclusive access is made to the elastic file mount volume to perform data sorting operations, establish metadata, and sort out file data locations to achieve efficient subsequent file system access.

[0086] Since the storage currently managed by the elastic file system is much larger than the previous storage, it is basically a management space of more than 1T. If the temporary use of the specified cluster is still described in bits, the required management metadata is too large. Assuming that the current storage is 10T capacity and the standard cluster size is 4K, the bitmap data is about 900M. In addition to the metadata that contains the bitmap, more than 1G of data is used to express the use of the bitmap. Obviously, in this case, the data complexity and algorithm complexity are significantly increased. The elastic file system can express the continuously used bitmap data through VDL, which can greatly reduce the above scenario. However, after the file system has been used for a period of time, it is obviously unpredictable to achieve continuous use of space. In this way, after a period of use, the volume managed by the elastic file system will also have the above situation. The embodiment of the present application utilizes the characteristics of the elastic file system and combines the specific use of the volume to return the volume after a long period of use to an overall state as much as possible after the method, so that the data complexity and algorithm complexity can be reduced as much as possible in the subsequent file system operation process, thereby improving the subsequent operation efficiency. The embodiment of the present application utilizes the characteristics of the elastic file system and proposes a method for optimizing the performance of storage access. By greatly reducing the temporary bitmap information representing storage that the file system of the large storage mount needs to manage, the management data overhead and algorithm overhead required for subsequent file operations are reduced, and the purpose of optimizing storage access efficiency is finally achieved. In addition, this method can also be combined with other optimization methods to achieve better results.

[0087] See also Figure 4 As shown, the embodiment of the present application discloses a data sorting device, including:

[0088] The storage space determination module 11 is used to determine the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and the storage space before the data allocation position as the second storage space, wherein the target volume is a volume corresponding to the elastic file system;

[0089] A file data traversal module 12, used to traverse the file data in the target volume to obtain a target file data set;

[0090] The target space determination module 13 is used to determine the space in the first storage space that is not occupied by the data in the target file data set, and obtain the target space;

[0091] A target data determination module 14 is used to determine the data stored in the second storage space and belonging to the target file data set to obtain the target data;

[0092] A first move set construction module 15, configured to construct a first move set based on the target data, wherein the first move set includes the target data and a first destination address corresponding to the target data, and the first destination address is an address in the target space;

[0093] A first data moving module 16, configured to move data of the first moving set so that the target data and the original data in the first storage space form continuous data;

[0094] The storage space description module 17 is used to describe the continuously used space in the first storage space using a VDL description method.

[0095] In an optional embodiment, the device may also include

[0096] A determination module, configured to determine whether there is still discontinuous data in the first storage space based on the target file data set and the first move set;

[0097] A second move set determination module is used to determine a second move set based on the discontinuous data if there is still discontinuous data in the first storage space, wherein the second move set includes the discontinuous data to be moved and a second destination address corresponding to the discontinuous data to be moved, and the second destination address is an address in the target space.

[0098] The second data moving module is used to move data on the second moving set to make the data in the first storage space continuous.

[0099] Furthermore, the device also includes:

[0100] A data allocation position acquisition module, used to acquire the data allocation position from the allocation table of the elastic file system;

[0101] Correspondingly, the storage space description module 17 is specifically used to modify the allocation table to describe the continuously used space in the first storage space using the VDL description method.

[0102] Furthermore, the device also includes:

[0103] A volume unloading module, used for unloading the target volume mounted by the elastic file system;

[0104] The volume locking module is used to lock the target volume to obtain exclusive access to the target volume.

[0105] Furthermore, the storage space description module 17 is further configured to describe the continuous unused space in the first storage space using a VDL description method.

[0106] In an optional embodiment, the first move set construction module 15 is specifically used to use a storage space allocator to allocate a destination address for the target data in an unused space in the first storage space to obtain a first target address; and construct a first move set based on the target data and the first target address.

[0107] It can be seen that in the elastic file system, the space after the data allocation position is used to store file data first, and the space before the data allocation position is used to store metadata first. The embodiment of the present application organizes the data according to the priority storage principle, organizes the file data stored in the space corresponding to the metadata to the space for storing file data, and makes the data constitute continuous data, and uses the VDL description method to describe the continuous use space. In this way, the data complexity and algorithm complexity of the elastic file system operation can be reduced, thereby improving the operation efficiency and the storage access performance of the elastic file system.

[0108] Furthermore, an embodiment of the present application discloses a computer program product, which, when executed, implements the data sorting method disclosed in the aforementioned embodiment.

[0109] See also Figure 4 As shown, an embodiment of the present application discloses an electronic device 20, including a processor 21 and a memory 22; wherein the memory 22 is used to store a computer program; the processor 21 is used to execute the computer program, and the data sorting method disclosed in the above embodiment.

[0110] For the specific process of the above data sorting method, please refer to the corresponding content disclosed in the above embodiments, which will not be repeated here.

[0111] Furthermore, the memory 22 as a carrier for storing resources may be a read-only memory, a random access memory, a magnetic disk or an optical disk, etc., and the storage method may be temporary storage or permanent storage.

[0112] In addition, the electronic device 20 also includes a power supply 23, a communication interface 24, an input / output interface 25 and a communication bus 26; wherein the power supply 23 is used to provide working voltage for each hardware device on the electronic device 20; the communication interface 24 can create a data transmission channel between the electronic device 20 and an external device, and the communication protocol it follows is any communication protocol that can be applied to the technical solution of the present application, and is not specifically limited here; the input / output interface 25 is used to obtain external input data or output data to the outside world, and its specific interface type can be selected according to specific application needs, and is not specifically limited here.

[0113] Furthermore, an embodiment of the present application also discloses a computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the data organization method disclosed in the aforementioned embodiment.

[0114] For the specific process of the above data sorting method, please refer to the corresponding content disclosed in the above embodiments, which will not be repeated here.

[0115] In this specification, each embodiment is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. The same or similar parts between the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the method part.

[0116] The steps of the method or algorithm described in conjunction with the embodiments disclosed herein may be implemented directly using hardware, a software module executed by a processor, or a combination of the two. The software module may be placed in a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.

[0117] The above is a detailed introduction to a data organization method, device, product, equipment and medium provided by the present application. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea; at the same time, for general technical personnel in this field, according to the idea of ​​the present application, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A data sorting method, characterized in that: include: Determine the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and determine the storage space before the data allocation position as the second storage space, wherein the target volume is a volume corresponding to the elastic file system; Traversing the file data in the target volume to obtain a target file data set; Determine the space in the first storage space that is not occupied by the data in the target file data set, and obtain the target space; Determine the data stored in the second storage space and belonging to the target file data set to obtain target data; Constructing a first move set based on the target data, wherein the first move set includes the target data and a first destination address corresponding to the target data, and the first destination address is an address in the target space; Performing data movement on the first movement set so that the target data and the original data in the first storage space form continuous data; The continuously used space in the first storage space is described using a VDL description method.

2. The data sorting method according to claim 1, characterized in that: Also includes: Determining whether there is still discontinuous data in the first storage space based on the target file data set and the first move set; If there are still discontinuous data in the first storage space, a second move set is determined based on the discontinuous data, wherein the second move set includes the discontinuous data to be moved and a second destination address corresponding to the discontinuous data to be moved, and the second destination address is an address in the target space; Data is moved on the second move set to make the data in the first storage space continuous.

3. The data sorting method according to claim 1, characterized in that: Also includes: Acquire the data allocation location from the allocation table of the elastic file system; Correspondingly, describing the continuous used space in the first storage space using a VDL description method includes: The allocation table is modified to describe the continuous used space in the first storage space using a VDL description method.

4. The data sorting method according to claim 3, characterized in that: Before acquiring the data allocation position from the allocation table in the elastic file system, the method further includes: Performing an unmounting operation on the target volume mounted by the elastic file system; The target volume is locked to obtain exclusive access to the target volume.

5. The data sorting method according to claim 1, characterized in that: Also includes: The continuous unused space in the first storage space is described using a VDL description method.

6. The data sorting method according to any one of claims 1 to 5, characterized in that: The constructing a first movement set based on the target data includes: Allocating a destination address for the target data in unused space in the first storage space using a storage space allocator to obtain a first destination address; A first move set is constructed based on the target data and the first target address.

7. A data sorting device, characterized in that: include: a storage space determination module, configured to determine the storage space after the data allocation position in the storage space corresponding to the target volume as the first storage space, and the storage space before the data allocation position as the second storage space, wherein the target volume is a volume corresponding to the elastic file system; A file data traversal module, used for traversing the file data in the target volume to obtain a target file data set; A target space determination module, used to determine the space in the first storage space that is not occupied by the data in the target file data set, and obtain the target space; a target data determination module, configured to determine the data stored in the second storage space and belonging to the target file data set, and obtain the target data; A first move set construction module, configured to construct a first move set based on the target data, wherein the first move set includes the target data and a first destination address corresponding to the target data, and the first destination address is an address in the target space; A first data moving module, used for moving data of the first moving set so that the target data and the original data in the first storage space form continuous data; The storage space description module is used to describe the continuously used space in the first storage space using a VDL description method.

8. A computer program product, characterized in that When the computer program product is executed, the data sorting method according to any one of claims 1 to 7 is implemented.

9. An electronic device, characterized in that: comprising a memory and a processor, wherein: The memory is used to store the computer program; The processor is used to execute the computer program to implement the data sorting method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: Used to store a computer program, wherein when the computer program is executed by a processor, the data sorting method according to any one of claims 1 to 7 is implemented.

Images