A data arrangement method, device, product, equipment and medium

Abstract

The application discloses a data arrangement method, device, product, equipment and medium, comprising: determining the storage space after the data allocation position in the storage space corresponding to the target volume as a first storage space, and determining the storage space before the data allocation position as a second storage space; traversing the file data in the target volume to obtain a target file data set; determining the space in the first storage space that does not belong to the data in the target file data set to obtain a target space; determining the data stored in the second storage space and belonging to the target file data set to obtain target data; constructing a first moving set based on the target data; moving the data in the first moving set to make the target data and the original data in the first storage space 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 algorithm complexity can be reduced, and the storage access performance of the elastic file system can be improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of storage, in particular to a data arrangement method, device, product, equipment and medium. BACKGROUND

[0002] After frequent file operations, the data required to be managed and the algorithm overhead gradually increase due to the increasing cache data of the file system, and the increase of other loads, which leads to the gradual decline of storage access performance. In this case, the optimization of storage access performance naturally arises. The current storage managed by the elastic file system is much larger than the previous storage, and the data complexity and algorithm complexity are significantly increased. Therefore, how to improve the storage access performance of the elastic file system is a problem to be solved at present. SUMMARY

[0003] Therefore, the purpose of the present application is to provide a data arrangement 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 arrangement method, comprising:

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

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

[0007] determining the space in the first storage space that does not belong to the data occupied by the target file data set to obtain a target space;

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

[0009] constructing a first moving set based on the target data, wherein the first moving 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 moving set to make the target data and the original data in the first storage space form continuous data;

[0011] describing the continuously used space in the first storage space in a VDL description manner.

[0012] Optionally, further comprising:

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

[0014] if there is discontinuous data in the first storage space, determining a second moving set based on the discontinuous data, wherein the second moving set comprises 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] performing data movement on the second moving set to make the data in the first storage space continuous.

[0016] Optionally, further comprising:

[0017] obtaining the data allocation position from the middle allocation table of the elastic file system;

[0018] Correspondingly, the first storage space is described in the VDL description manner, comprising:

[0019] modifying the middle allocation table to describe the continuous used space in the first storage space in the VDL description manner.

[0020] Optionally, before the data allocation position is obtained from the middle allocation table of the elastic file system, further comprising:

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

[0022] locking the target volume to perform exclusive access to the target volume.

[0023] Optionally, further comprising:

[0024] describing the continuous unused space in the first storage space in the VDL description manner.

[0025] Optionally, the first moving set is constructed based on the target data, comprising:

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

[0027] constructing a first moving set based on the target data and the first destination address.

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

[0029] The storage space determination module 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 the volume corresponding to the elastic file system;

[0030] The file data traversal module is used to traverse the file data in the target volume to obtain the target file data set;

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

[0032] The target data determination module is used to determine the data stored in the second storage space that belongs to the target file data set, and obtain the target data;

[0033] A first mobility set construction module is configured to construct a first mobility set based on the target data, wherein the first mobility 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] The first data movement module is used to move data in the first movement 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 the VDL description method.

[0036] Thirdly, this application discloses a computer program product that, when executed, implements the aforementioned data processing method.

[0037] Fourthly, this application discloses an electronic device, including a memory and a processor, wherein:

[0038] The memory is used to store computer programs;

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

[0040] Fifthly, this application discloses a computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the aforementioned data processing method.

[0041] As can be seen from the above scheme, this application provides a data processing 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 data in the first storage space that does not belong to the target file data set to obtain a target space; determining the data stored in the second storage space that belongs to the target file data set to obtain target data; 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, the first destination address being an address in the target space; moving data in the first movement set so that the target data and the original data in the first storage space constitute continuous data; and describing the continuously used space in the first storage space using VDL description method.

[0042] As can be seen, the beneficial effects of this application are as follows: In a resilient file system, the space after the data allocation location is prioritized for storing file data, while the space before the data allocation location is prioritized for storing metadata. The embodiments of this application organize the data according to this priority storage principle, reorganizing the file data stored in the space corresponding to the metadata into the space for storing file data, and making the data contiguous. The contiguous space is described using VDL (Virtual Data Language) description. This reduces the data complexity and algorithmic complexity of resilient file system operations, thereby improving operational efficiency and enhancing the storage access performance of the resilient file system.

[0043] Accordingly, the data processing device, product, equipment, and readable storage medium provided in this application also have the above-mentioned technical effects. Attached Figure Description

[0044] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of this application. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0045] Figure 1 A flowchart of a data processing method provided in this application embodiment;

[0046] Figure 2 A data processing flowchart provided for an embodiment of this application;

[0047] Figure 3 This is a schematic diagram of a data processing device provided in an embodiment of this application;

[0048] Figure 4 This is a structural diagram of an electronic device provided in an embodiment of this application. Detailed Implementation

[0049] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0050] After frequent file operations, the data and algorithm overhead required for file system cache data increases as the file system cache data grows larger. Coupled with the increase in other loads, storage access performance gradually declines. Under such circumstances, storage access performance optimization naturally arises. The more common optimization methods are: (1) System reset. After system reset, the data that the file system needs to manage is cleared, and the requests for storage access are also reset. However, for the server, the cost of system reset is relatively high. In addition, system reset only temporarily reduces the frequency of system access to storage. As the system runs, the corresponding access will still occur. (2) File system defragmentation. By defragmenting the file data run as much as possible into a continuous state, the efficiency of file access is improved. For defragmentation, it only partially reduces the response to file access. It has no impact on the already complex and large amount of file system management data. Moreover, the defragmentation tool that comes with the Windows operating system cannot defragment refs (i.e., Resilient File System) volumes.

[0051] Because resilient file systems require continuous operation on the storage they manage, existing file system defragmentation features cannot be applied to that storage. While defragmentation can optimize non-resilient file systems, it leads to significant space wastage for resilient file systems managing large volumes of storage. Therefore, more effective methods are needed to improve server storage performance.

[0052] See Figure 1 As shown in the figure, this application discloses a data processing method, including:

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

[0054] In this embodiment, the data allocation position can be obtained from the allocation table in the elastic file system. The allocation table in the elastic file system is a data structure used to record the data storage status of files. It records the data allocation position, and the storage space after the data allocation position is preferentially used for storing file data, while the storage space before the data allocation position is preferentially used for storing metadata.

[0055] In this embodiment of the application, before obtaining the data allocation location from the allocation table of the elastic file system, an unmounting operation is performed on the target volume mounted on the elastic file system; the target volume is then locked to enable exclusive access to it. Thus, unmounting the target volume and then locking it allows for exclusive access to the target volume.

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

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

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

[0059] In this embodiment of the application, the space occupied by data that does not belong to the target file data set in the storage space for priority storage of file data is determined as the target space, and 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 that belongs to the target file data set, and obtain the target data.

[0061] In other words, in this embodiment of the application, the data stored in the storage space of priority storage metadata is retrieved and used as the target data.

[0062] Step S15: Construct 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] This application embodiment can utilize a storage space allocator to allocate a destination address for the target data in the unused space of the first storage space, obtaining a first destination address; and construct a first move set 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 remains continuous with the original data after being moved.

[0064] Step S16: Move the first moving set of data so that the target data and the original data in the first storage space form continuous data.

[0065] Furthermore, in this embodiment, it can also be determined whether there is still discontinuous data in the first storage space based on the target file data set and the first movement set; if there is still discontinuous data in the first storage space, a second movement set is determined based on the discontinuous data, wherein the second movement 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 movement set to make the data in the first storage space continuous.

[0066] In other words, if there is still discontinuous data after the first set of moves is completed, the discontinuous data can be organized into continuous data.

[0067] Step S17: Describe the contiguous space in the first storage space using the VDL (Valid Data Length) description method.

[0068] The contiguous space in this context refers to the space where contiguous data is stored. VDL (Virtual Data Link) is a storage format used in elastic file systems. Furthermore, in this embodiment, the contiguous unused space in the first storage space can also be described using VDL. VDL describes a linear space with similar attributes using a data structure consisting of a position and a length, and is often used to represent large contiguous spaces. Further, the allocation table is modified to describe the contiguous used space in the first storage space using VDL. That is, the allocation table can record the usage of storage space, and both contiguous used space and contiguous unused space can be described using VDL.

[0069] In an optional implementation, this embodiment of the application may further traverse all metadata in the target volume to obtain a metadata set; determine the data stored in the first storage space that belongs to the metadata set to obtain target metadata; allocate a destination address for the target metadata in the second storage space to obtain the target address corresponding to the target metadata; establish a third movement set based on the target metadata and the target address corresponding to the target metadata; move data in the third movement 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 usage space in the second storage space using VDL description. The target address corresponding to the target metadata is an address in the space of the second storage space that does not belong to the space occupied by data in the metadata set.

[0070] In another optional implementation, 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, then a fourth move set is determined based on the discontinuous data. 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. Data is moved to the fourth move set.

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

[0072] As can be seen, in a resilient file system, the space after the data allocation location is prioritized for storing file data, while the space before the data allocation location is prioritized for storing metadata. This embodiment of the application organizes the data according to this priority storage principle, moving the file data stored in the space corresponding to the metadata to the space storing the file data, and making the data contiguous. The contiguous space is described using VDL (Virtual Data Language) description. This reduces the data complexity and algorithmic complexity of resilient file system operations, thereby improving operational efficiency and enhancing the storage access performance of the resilient file system.

[0073] In this embodiment, the characteristics of the elastic file system used are described as follows: Known file systems divide storage into clusters and use bitmaps to describe and manage the usage of specific clusters. If the target storage is a large space, conventional management methods obviously require significant data and algorithmic overhead. Therefore, the elastic file system performs some simple optimizations. For consecutively used and unused clusters, the elastic file system does not use bitmaps but a simple description. Clearly, even if the target storage contains a large amount of file data, if the storage is in a consecutively used state, the management data and algorithmic overhead required for subsequent operations is very small, thus achieving optimized storage access. The elastic file system sets its own priority allocation start points for metadata allocation and file data allocation, aiming to ensure fast response times for file operations and directory expansion operations. Reallocating the target storage according to the above principles can also achieve the best results in conjunction with the elastic file system.

[0074] Further, see Figure 2 As shown, Figure 2 A data processing flowchart provided for embodiments of this application may specifically include the following steps:

[0075] For a volume (i.e., a specified volume) that is mounted on an elastic file system, the disMount operation is performed first.

[0076] Immediately after completing the disMount operation, a Lock operation is executed, so that the volume can be exclusively used and subsequent analysis and rewriting operations can be performed.

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

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

[0079] Extract the data that excludes T1 from the Data set and record the corresponding space to the A allocator (i.e., the storage space allocator).

[0080] Extract the data from the Meta set that contains the T1 set, and use the A allocator to allocate destination addresses to form the a mobile set (i.e., the first mobile set).

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

[0082] Complete the data movement between sets a and b, and modify the data run record.

[0083] Update the contents of the medium allocator table, converting the contiguous space in the corresponding data area into VDL (Valid Data Length) representations. Perform the same operation for contiguous unused space.

[0084] The destination storage operation is now complete. The overall optimization is now finished. Once the file system is mounted on Mount, subsequent file operations will be performed in a more efficient manner.

[0085] This allows for exclusive access to the Mount volume to perform data organization operations, establish metadata, and organize file data locations to achieve efficient subsequent file system access.

[0086] Because the storage managed by elastic file systems is now much larger than previous storage systems, typically exceeding 1TB, using bits to describe the temporary usage of a specific cluster would require excessively large amounts of management metadata. Assuming a current storage capacity of 10TB and a standard cluster size of 4KB, the bitmap data would be approximately 900MB. Adding the metadata to accommodate the bitmap, over 1GB of data would be used to represent bitmap usage, significantly increasing both data and algorithm complexity. While elastic file systems can use VDL to represent continuously used bitmap data, this can greatly mitigate the aforementioned situation. However, achieving continuous space usage after a period of use is unpredictable, leading to the same issue after a while. This application's embodiments utilize the characteristics of elastic file systems and consider the specific usage of volumes to restore volumes to a more unified state after prolonged use. This minimizes data and algorithm complexity during subsequent file system operations, thereby improving operational efficiency. This application proposes a performance optimization method for storage access by leveraging the characteristics of elastic file systems. By significantly reducing the bitmap information representing temporary storage that the file system needs to manage for large storage mounts, the management data overhead and algorithmic overhead required for subsequent file operations are reduced, ultimately optimizing storage access efficiency. Furthermore, this method can be combined with other optimization methods to achieve even better results.

[0087] See Figure 4 As shown in the figure, this application discloses a data processing 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 the volume corresponding to the elastic file system;

[0089] File data traversal module 12 is 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 occupied by data in the first storage space that does not belong to the target file data set, and obtain the target space;

[0091] Target data determination module 14 is used to determine the data stored in the second storage space that belongs to the target file data set, and obtain the target data;

[0092] The first mobile set construction module 15 is used to construct a first mobile set based on the target data, wherein the first mobile 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] The first data movement module 16 is used to move data in the first movement 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 the VDL description method.

[0095] In one alternative embodiment, the device may further include

[0096] The judgment module is used to determine whether there is still discontinuous data in the first storage space based on the target file data set and the first movement set;

[0097] The 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. The second move set includes the discontinuous data to be moved and the second destination address corresponding to the discontinuous data to be moved. The second destination address is an address in the target space.

[0098] The second data movement module is used to move data in the second movement set so that the data in the first storage space is continuous.

[0099] Furthermore, the device also includes:

[0100] A data allocation location acquisition module is used to obtain the data allocation location from the allocation table in the elastic file system;

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

[0102] Furthermore, the device also includes:

[0103] The volume unloading module is used to unload the target volume mounted by the elastic file system.

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

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

[0106] In one optional implementation, the first mobile set construction module 15 is specifically used to allocate a destination address for the target data in the unused space of the first storage space using a storage space allocator to obtain a first destination address; and to construct a first mobile set based on the target data and the first destination address.

[0107] As can be seen, in a resilient file system, the space after the data allocation location is prioritized for storing file data, while the space before the data allocation location is prioritized for storing metadata. This embodiment of the application organizes the data according to this priority storage principle, moving the file data stored in the space corresponding to the metadata to the space storing the file data, and making the data contiguous. The contiguous space is described using VDL (Virtual Data Language) description. This reduces the data complexity and algorithmic complexity of resilient file system operations, thereby improving operational efficiency and enhancing the storage access performance of the resilient file system.

[0108] Furthermore, this application discloses a computer program product that, when executed, implements the data processing method disclosed in the foregoing embodiments.

[0109] See Figure 4 As shown in the figure, this 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, the data processing method disclosed in the foregoing embodiments.

[0110] For details regarding the specific process of the above data processing method, please refer to the relevant content disclosed in the foregoing embodiments, which will not be repeated here.

[0111] Furthermore, the memory 22, as a carrier for resource storage, can be a read-only memory, random access memory, disk, or optical disk, and the storage method can 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 operating voltage for the various hardware devices on the electronic device 20; the communication interface 24 can create a data transmission channel between the electronic device 20 and external devices, and the communication protocol it follows can be any communication protocol applicable to the technical solution of this application, and is not specifically limited here; the input / output interface 25 is used to acquire 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, embodiments of this application also disclose a computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the data processing method disclosed in the foregoing embodiments.

[0114] For details regarding the specific process of the above data processing method, please refer to the relevant content disclosed in the foregoing embodiments, which will not be repeated here.

[0115] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the apparatus disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple; relevant parts can be referred to in the method section.

[0116] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be implemented directly by hardware, a software module executed by a processor, or a combination of both. The software module can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0117] The above provides a detailed description of a data processing method, apparatus, product, equipment, and medium provided in this application. Specific examples have been used to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the method and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A data processing method, characterized in that, include: The storage space after the data allocation position in the storage space corresponding to the target volume is determined as the first storage space, and the storage space before the data allocation position is determined as the second storage space, wherein the target volume is the volume corresponding to the elastic file system; Traverse the file data in the target volume to obtain the target file data set; The target space is obtained by determining the space occupied by data in the first storage space that does not belong to the target file data set; The target data is obtained by identifying the data belonging to the target file data set stored in the second storage space; A first mobility set is constructed based on the target data, wherein the first mobility 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; The first moving set is moved so that the target data and the original data in the first storage space form continuous data. The contiguous space in the first storage space is described using VDL (Virtual Domain Description).

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

3. The data processing method according to claim 1, characterized in that, Also includes: The data allocation location is obtained from the allocation table in the elastic file system; Accordingly, describing the contiguous space in the first storage space using VDL description includes: Modify the allocation table to describe the contiguous space in the first storage space using VDL description.

4. The data processing method according to claim 3, characterized in that, Before retrieving the data allocation location from the allocation table in the elastic file system, the method further includes: Perform an unmount operation on the target volume mounted by the elastic file system; Lock the target volume to grant exclusive access to it.

5. The data processing method according to claim 1, characterized in that, Also includes: The contiguous unused space in the first storage space is described using VDL (Virtual Domain Description).

6. The data processing method according to any one of claims 1 to 5, characterized in that, The construction of the first mobile set based on the target data includes: The first destination address is obtained by allocating a destination address for the target data in the unused space of the first storage space using a storage space allocator; A first mobility set is constructed based on the target data and the first destination address.

7. A data processing device, characterized in that, include: The storage space determination module 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 the volume corresponding to the elastic file system; The file data traversal module is used to traverse the file data in the target volume to obtain the target file data set; The target space determination module is used to determine the space occupied by data in the first storage space that does not belong to the target file data set, and obtain the target space; The target data determination module is used to determine the data stored in the second storage space that belongs to the target file data set, and obtain the target data; A first mobility set construction module is configured to construct a first mobility set based on the target data, wherein the first mobility 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; The first data movement module is used to move data in the first movement 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 the VDL description method.

8. A computer program product, characterized in that, When the computer program product is executed, it implements the data processing method as described in any one of claims 1 to 6.

9. An electronic device, characterized in that, Includes memory and processor, wherein: The memory is used to store computer programs; The processor is configured to execute the computer program to implement the data processing method as described in any one of claims 1 to 6.

10. A computer-readable storage medium, characterized in that, Used to store a computer program, wherein the computer program, when executed by a processor, implements the data processing method as described in any one of claims 1 to 6.

Images