CN111459848B - File fragment sorting method and device, storage medium and electronic equipment - Google Patents
File fragment sorting method and device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN111459848B CN111459848B CN202010246716.5A CN202010246716A CN111459848B CN 111459848 B CN111459848 B CN 111459848B CN 202010246716 A CN202010246716 A CN 202010246716A CN 111459848 B CN111459848 B CN 111459848B
- Authority
- CN
- China
- Prior art keywords
- fragment data
- file
- file fragment
- memory
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 239000012634 fragment Substances 0.000 title claims abstract description 579
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000004590 computer program Methods 0.000 claims description 14
- 230000006870 function Effects 0.000 description 14
- 238000010586 diagram Methods 0.000 description 11
- 101100226364 Arabidopsis thaliana EXT1 gene Proteins 0.000 description 7
- 230000003287 optical effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000013467 fragmentation Methods 0.000 description 2
- 238000006062 fragmentation reaction Methods 0.000 description 2
- 239000004973 liquid crystal related substance Substances 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/0223—User address space allocation, e.g. contiguous or non contiguous base addressing
- G06F12/023—Free address space management
- G06F12/0253—Garbage collection, i.e. reclamation of unreferenced memory
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
According to the file defragmentation method, the device, the storage medium and the electronic equipment provided by the embodiment of the application, the memory information of each file defragmentation data of the target file is determined by acquiring the target file to be defragmented; determining file fragment data with memory information smaller than a preset threshold value as first file fragment data; acquiring memory information of second file fragment data adjacent to the first file fragment data; and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted. Therefore, partial target file fragment data to be arranged is determined from the plurality of file fragment data, and the partial target file fragment data is arranged without arranging all the file fragment data, so that the arrangement efficiency of the file fragments is improved.
Description
Technical Field
The embodiment of the application relates to a memory management technology, in particular to a method and a device for sorting file fragments, a storage medium and electronic equipment.
Technical Field
At present, after a Linux operating system runs for a period of time and frequent page exchanges, the distribution of empty page frames in a physical memory becomes very scattered and fragmented, namely a large number of file fragments appear.
Where a file fragment refers to each portion of the same file being stored in a different location in memory, respectively, resulting in a discontinuity in the memory space occupied by the file. In addition, since the random reading capability of the memory device is far smaller than the continuous reading capability, the presence of a large amount of fragments of the document can reduce the reading and writing efficiency, resulting in an excessively long reading time of the document. Therefore, defragmentation of fragmented files is required to increase the overall read-write speed.
Disclosure of Invention
The embodiment of the application provides a method and a device for sorting file fragments, a storage medium and electronic equipment, which can improve the sorting efficiency of the file fragments.
In a first aspect, an embodiment of the present application provides a method for defragmenting a file, including:
acquiring a target file to be sorted, and determining memory information of each file fragment data of the target file;
determining file fragment data with memory information smaller than a preset threshold value as first file fragment data;
Acquiring memory information of second file fragment data adjacent to the first file fragment data;
and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
In a second aspect, an embodiment of the present application provides a defragmenter for defragmenting a file, including:
the first acquisition module is used for acquiring a target file to be tidied and determining memory information of each file fragment data of the target file;
the first determining module is used for determining file fragment data with memory information smaller than a preset threshold value as first file fragment data;
the second acquisition module is used for acquiring memory information of second file fragment data adjacent to the first file fragment data;
and the second determining module is used for determining the first file fragment data as target file fragment data to be sorted when detecting that the memory information of any one of the second file fragment data is smaller than a preset threshold value.
In a third aspect, an embodiment of the present application provides a storage medium having stored thereon a computer program which, when run on a computer, causes the computer to perform a defragmentation method of file fragments as provided by any embodiment of the present application.
In a fourth aspect, an electronic device includes a processor and a memory, the memory having a computer program, the processor being configured to execute a defragmentation method according to any embodiment of the application by invoking the computer program.
As can be seen from the above, in the embodiment of the present application, a target file to be sorted is obtained, and the memory information of each file fragment data of the target file is determined; determining file fragment data with memory information smaller than a preset threshold value as first file fragment data; acquiring memory information of second file fragment data adjacent to the first file fragment data; and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted. Therefore, partial target file fragment data to be arranged is determined from the plurality of file fragment data, and the partial target file fragment data is arranged without arranging all the file fragment data, so that the arrangement efficiency of the file fragments is improved.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for defragmenting a file according to an embodiment of the present application.
Fig. 2 is a schematic diagram of distribution of file fragments of a target file according to an embodiment of the present application.
FIG. 3 is a first schematic diagram of the defragmentation of the target file shown in FIG. 2.
FIG. 4 is a second schematic diagram of the defragmentation of the target file shown in FIG. 2.
Fig. 5 is another flow chart of a method for defragmenting a file according to an embodiment of the present application.
Fig. 6 is a schematic structural diagram of a defragmentation device for file fragments according to an embodiment of the present application.
Fig. 7 is a schematic diagram of a first structure of an electronic device according to an embodiment of the present application.
Fig. 8 is a second schematic structural diagram of an electronic device according to an embodiment of the present application.
DETAILED DESCRIPTION OF EMBODIMENT (S) OF INVENTION
Referring to the drawings, wherein like reference numbers refer to like elements throughout, the principles of the present application are illustrated in an appropriate computing environment. The following description is based on illustrative embodiments of the application and should not be taken as limiting other embodiments of the application not described in detail herein.
The term "module" as used herein may be considered as a software object executing on the computing system. The various components, modules, engines, and services described herein may be viewed as implementing objects on the computing system. The apparatus and method described herein are preferably implemented in software, but may of course also be implemented in hardware, all within the scope of the application.
Referring to fig. 1, fig. 1 is a first flow chart of a method for defragmentation of files according to an embodiment of the application. The method for defragmentation of the file according to the embodiment of the application is to defragment the file defragmentation based on a fourth generation extended file system (Fourth extended filesystem, EXT 4), wherein the embodiment of the application performs online defragmentation on the file defragmentation through an online file defragmentation tool of the EXT4 file system, and the online file defragmentation tool can be e4defrag, and the e4 defragmentation can realize marking and defragmentation of the file defragmentation.
Specifically, the method for sorting the file fragments can comprise the following steps:
in step S101, a target file to be sorted is acquired, and memory information of each file fragment data of the target file is determined.
Traversing all files of the electronic device to obtain target files to be sorted, and obtaining file fragment information of each target file through a preset function such as an FS_IOC_FIEMAP IOTCL function. The file fragment information may include memory location information and memory information for each file fragment data in the target file. It should be noted that, the memory location information of the file fragment data is the physical address of the file fragment data.
Further, referring to fig. 2, fig. 2 is a schematic diagram illustrating distribution of file fragments of a target file according to an embodiment of the present application. After the target file is acquired, file fragment data of the target file needs to be determined. For example, the file fragment data of the target file shown in fig. 2 are respectively file fragment data 1, file fragment data 2, file fragment data 3, and the like, and total 11 file fragment data. Each piece of file fragment data has physical address information corresponding to the memory space and corresponding memory information. Such as 512KB for memory information for file fragment data 1, 4KB for memory information for file fragment data 2, 4KB for memory information for file fragment data 3, etc.
In some embodiments, all files in the memory space of the electronic device may be traversed by e4defrag to obtain the target file to be consolidated. It should be noted that, the unit of defragmentation performed by e4defrag is a regular file, so that e4defrag traverses all regular files in the memory space of the electronic device. The regular file may include a binary file, an extensible markup language (Extensible Markup Language, XML) file, a database (db) file, and the like, among others.
In step S102, the file fragment data with the memory information smaller than the preset threshold is determined as the first file fragment data.
And sequentially detecting whether the memory information of each piece of file fragment data is smaller than a preset threshold value according to the sequence from small to large of the physical addresses of the piece of file fragment data. As for the fragment data of the target file shown in fig. 2, whether the memory information of each fragment data is smaller than the preset threshold value is detected in order of the physical addresses of the fragment data from small to large, that is, in order from the fragment data 1 to the fragment data 11.
And if the memory information of the file fragment data is smaller than a preset threshold value, determining the file fragment data as first file fragment data. If the memory information of the file fragment data is greater than or equal to a preset threshold value, determining that the file fragment data is file fragment data which does not need to be sorted.
For example, if the preset threshold is 128KB, in the target file shown in fig. 2, the first file fragment data is file fragment data 2, file fragment data 3, file fragment data 4, file fragment data 5, file fragment data 6, file fragment data 7, file fragment data 8, file fragment data 9, and file fragment data 11. Since the memory information of the defragment data 1, the defragment data 8 and the defragment data 10 is larger than the preset threshold value, the defragment data 1, the defragment data 8 and the defragment data 10 are considered as the defragment data which do not need to be sorted.
In step S103, memory information of second file fragment data adjacent to the first file fragment data is acquired.
And acquiring second file fragment data adjacent to each first file fragment data according to the physical address of the file fragment data, wherein the second file fragment data adjacent to the first file fragment data is the second file fragment data of the previous memory location information of the first file fragment data and the second file fragment data of the next memory location information, and determining the memory information of each second file fragment data. For example, when the first file fragment data is the file fragment data 2, the second file fragment data adjacent to the file fragment data 2 may be determined according to the physical address of the file fragment data, that is, the file fragment data 1 in the previous memory location and the file fragment data 3 in the subsequent memory location of the file fragment data 2 are obtained as the second file fragment data. And acquires the memory information of the file fragment data 1 and the file fragment data 3.
In step S104, when it is detected that the memory information of any one of the second file fragment data is smaller than the preset threshold, the first file fragment data is determined as target file fragment data to be sorted.
And when the memory information of any one of the second file fragment data is detected to be smaller than the preset threshold value, determining the first file fragment data as target file fragment data to be sorted. And when the second file fragment data are detected to be greater than or equal to a preset threshold value, determining the first file fragment data as file fragment data which do not need to be sorted.
For example, when the first defragment data is the defragment data 2, since the memory information of the defragment data 3 is smaller than the preset threshold value in the adjacent second defragment data, namely the defragment data 1 and the defragment data 3, the defragment data 2 is determined as the target defragment data.
For another example, when the first defragmentation data is the defragmentation data 9, since the memory information of the adjacent second defragmentation data, i.e. the defragmentation data 8 and the defragmentation data 10, is larger than the preset threshold value, the defragmentation data 9 is determined as the defragmentation data which does not need to be arranged.
It can be understood that, since the memory information of the second file fragment data, i.e. the file fragment data 8 and the file fragment data 10, adjacent to the file fragment data 9 is greater than the preset threshold, for the file fragment data 9, since the target file fragment data adjacent to the physical address of the file fragment data 9 does not exist in the target file, when the target file fragment data is sorted, the memory spaces corresponding to the file fragment data 9 and other target file data cannot be spliced to form a continuous memory space with a larger memory. In addition, the processing amount of the file defragmentation is increased when the file defragmentation data 9 is arranged, the target file defragmentation time is increased, and the file defragmentation efficiency is affected. The defragmentation data 9 is determined as defragmentation data that does not need to be defragmented to improve the defragmentation efficiency of the defragmentation.
It should be noted that, when the memory information of each piece of file fragment data is sequentially detected according to the order from small to large of the physical addresses of the piece of file fragment data, if the memory information of the first piece of file fragment data of the target file is smaller than the preset threshold value, since the piece of file fragment data of the previous memory location does not exist in the first piece of file fragment data, only the second piece of file fragment data of the next memory location of the first piece of file fragment data needs to be acquired, and whether the second piece of file fragment data is smaller than the preset threshold value is detected. And if the second file fragment data is smaller than the preset threshold value, determining the first file fragment data as the target file fragment to be sorted. And if the second file fragment data is greater than or equal to the preset threshold value, determining the target file fragments which do not need to be sorted according to the first file fragment data.
Or if the memory information of the last file fragment data of the target file is smaller than the preset threshold, only the second file fragment data of the previous memory position of the first file fragment data is required to be obtained because the first file fragment data does not have the file fragment data of the next memory position, and whether the second file fragment data is smaller than the preset threshold is detected. And if the second file fragment data is smaller than the preset threshold value, determining the first file fragment data as the target file fragment to be sorted. And if the second file fragment data is greater than or equal to the preset threshold value, determining the target file fragments which do not need to be sorted according to the first file fragment data.
Further, referring to fig. 3, fig. 3 is a first schematic diagram of the defragmentation of the target file shown in fig. 2. As shown in fig. 3, the target file fragment data to be sorted according to the embodiment of the present application is file fragment data 2, file fragment data 3, file fragment data 4, file fragment data 5, file fragment data 6, and file fragment data 7. In addition, after the file fragment data 2, the file fragment data 3, the file fragment data 4, the file fragment data 5, the file fragment data 6 and the file fragment data 7 are arranged, the memory spaces corresponding to the file fragment data 2, the file fragment data 3, the file fragment data 4, the file fragment data 5, the file fragment data 6 and the file fragment data 7 can be spliced to form a continuous memory space, so that the number of the file fragment data of the target file can be reduced to a certain extent, and the read-write speed of the target file can be improved.
The e4defrag also has a function of scoring the file fragment data of the target file. The step of scoring the file fragment data of the target file is as follows:
acquiring the number of file fragment data and the number of idle data blocks of the target file, and calculating the number of file fragment data and the number of idle data blocks to obtain a file fragment ratio of the target file;
The calculation formula of the file fragment ratio is as follows:
ratio＝(now_extents-best_extents)*100/block_counts；
the ratio is the file fragment ratio of the target file, no_extensions are the number of file fragment data, best_extensions are the optimal number of file fragment data, best_extensions=1, block_counts are the number of idle data blocks, wherein block is the minimum storage and processing unit, and block in the EXT4 file system is 4kb;
judging whether the file fragment ratio is larger than a first numerical value or not;
when the file fragment ratio is larger than the first numerical value, converting the file fragment ratio into a fragment value according to a first formula;
and when the file fragment ratio is smaller than or equal to the first numerical value, converting the file fragment ratio into a fragment score according to a second formula.
Wherein, the first formula is: score=80+20 x (ratio)/100;
the second formula is: score=8 x (ratio);
where score is the fragment score and ratio is the file fragment ratio.
As can be seen from fig. 3, the number of file fragment data of the target file before sorting is 11, if the number of free data blocks a is 100, the file fragment ratio of the target file before sorting is 10, and if the first value is 10, the fragment value of the target file can be calculated according to the first formula to be 80.
It should be noted that when the fragment score of a file is between 0 and 30, the EXT4 file system generates suggestions that do not require the sorting of the file; when the fragment score of the file is 31-55, the EXT4 file system generates a suggestion that the file has some fragments and can be arranged; when the fragment score of the file is greater than 56, the EXT4 file system suggests to sort.
Therefore, for the target file shown in fig. 3, the fragment score of the file is 80, and the file needs to be sorted. After partial object file defragmentation is obtained and defragmented, namely, defragmentation data 2, defragmentation data 3, defragmentation data 4, defragmentation data 5, defragmentation data 6 and defragmentation data 7 are defragmented, the number of defragmentation data of the defragmented object file is 5, and the number of idle data blocks A is 100, so that the defragmentation ratio of the defragmented object file is 4, and the defragmentation value of the object file is 32 according to a second formula. At this time, the memory information of the defragmented fragment data of the file is 52KB. Therefore, after the partial file fragment data are sorted, the fragment score of the target file can be greatly reduced.
Referring to fig. 4, fig. 4 is a second schematic diagram of defragmentation of the target file shown in fig. 2. Wherein, the target file fragment data shown in fig. 4 is obtained by another file fragment sorting method, namely, all the file fragment data in the target file are obtained as target file fragment data, namely file fragment data 1, file fragment data 2. File fragment data 10 the file fragment data 11 are sorted as target file fragment data.
As shown in fig. 4, the number of file fragment data of the target file before sorting is 11, if the number of free data blocks a is 100, so the file fragment ratio of the target file before sorting is 10, and if the first value is 10, the fragment value of the target file can be calculated according to the first formula to be 80.
The file fragment data 1, the file fragment data 2 ······ the file fragment data 10 after the defragmentation of the file fragment data 11, the number of the defragmentation data of the sorted target file is 1, the number A of the idle data blocks is 100, so that the file fragment ratio of the sorted target file is 0, and the fragment value of the target file is calculated according to a second formula to be 0. Therefore, after the partial file fragment data are sorted, the fragment score of the target file can be greatly reduced. At this time, the memory information of the defragmented fragment data of the file is 1216KB.
For the file defragmentation methods of the two target files shown in fig. 3 and 4, the defragmentation method of the target file shown in fig. 3 reduces the defragmentation score of the target file from 80 to 32, greatly reduces the defragmentation degree of the target file, and further can improve the reading and writing speed of the target file. The method for defragmentation of the target file shown in fig. 4 reduces the defragmentation score of the target file from 80 to 0, and can also improve the reading and writing speed of the target file.
However, in the defragmentation method of fig. 3, the data size of the defragmentation data is only 52KB, while in fig. 4, the defragmentation of the defragmentation data is 1216KB. Therefore, the method for defragmentation of the target file shown in fig. 3 can effectively reduce the defragmentation score of the target file, i.e. effectively reduce the defragmentation degree of the target file, with a minimum data arrangement amount.
Therefore, the method for defragmentation of the file in which partial defragmentation data is acquired from the defragmentation data in fig. 3 can reduce the processing amount of defragmentation of the file and the defragmentation time of defragmentation of the file, thereby improving the defragmentation efficiency of the file.
In addition, for the target file containing the file fragment data, the method for sorting the file fragments shown in fig. 4 carries out complete file fragment data movement each time to solve the problem of file fragmentation, and can have a great influence on the service life of the storage device, thereby influencing the service life of the mobile phone. In addition, for the fragmented target file, the whole file fragment data is moved every time, so that the moved data volume is larger, the file fragment arranging time length is prolonged, and the file fragment arranging efficiency is low. The embodiment of the application acquires part of target file data from the file fragment data for arrangement, and can reduce the influence of arrangement of a large amount of file fragment data on the storage device, thereby prolonging the service life of the storage device.
Therefore, according to the file defragmentation method provided by the embodiment of the application, the memory information of each file defragmentation data of the target file is determined by acquiring the target file to be defragmented; determining file fragment data with memory information smaller than a preset threshold value as first file fragment data; acquiring memory information of second file fragment data adjacent to the first file fragment data; and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted. Therefore, partial target file fragment data to be arranged is determined from the plurality of file fragment data, and the partial target file fragment data is arranged without arranging all the file fragment data, so that the arrangement efficiency of the file fragments is improved.
Referring to fig. 5, fig. 5 is another flow chart of a method for defragmenting a file according to an embodiment of the present application. The method for defragmentation of the file according to the embodiment of the application is to defragment the file defragmentation based on a fourth generation extended file system (Fourth extended filesystem, EXT 4), wherein the embodiment of the application performs online defragmentation on the file defragmentation through an online file defragmentation tool of the EXT4 file system, and the online file defragmentation tool can be e4defrag, and the e4 defragmentation can realize marking and defragmentation of the file defragmentation.
Specifically, the method for sorting the file fragments can comprise the following steps:
in step S201, a target file to be sorted is acquired, and memory information of each file fragment data of the target file is determined.
The e4defrag traverses all files of the electronic device to obtain target files to be sorted, and obtains file fragment information of each target file through a preset function such as an FS_IOC_FIEMAP IOTCL function. The file fragment information may include memory location information and memory information for each file fragment data in the target file. It should be noted that the memory location information of the file fragment data is the physical address information of the file fragment data.
In step S202, whether the memory information of each piece of file fragment data is smaller than a preset threshold value is sequentially detected according to the memory location information of the piece of file fragment data.
And if the memory information of the file fragment data is smaller than the preset threshold, executing step S203. If the memory information of the file fragment data is greater than or equal to a preset threshold value, determining that the file fragment data is file fragment data which does not need to be sorted.
In step S203, the file fragment data whose memory information is smaller than the preset threshold is determined as the first file fragment data.
And determining the file fragment data with the memory information smaller than a preset threshold value as first file fragment data. For example, referring to fig. 3, if the preset threshold is 128KB, the first file fragment data in the target file before sorting in fig. 3 is file fragment data 2, file fragment data 3, file fragment data 4, file fragment data 5, file fragment data 6, file fragment data 7, file fragment data 8, file fragment data 9, and file fragment data 11.
In step S204, third file fragment data of a previous memory location and fourth file fragment data of a subsequent memory location of the first file fragment data are obtained.
The method further comprises the step of further detecting the first file fragment data after the first file fragment data are obtained, so that target file fragment data which are required to be finished finally are obtained. Specifically, third file fragment data of a previous memory location of the first file fragment data and fourth file fragment data of a subsequent memory location are obtained according to the memory location information of each file fragment data.
For example, when the first file fragment data is the file fragment data 2, the file fragment data 1 in the previous memory location of the file fragment data 2 may be obtained as the third file fragment data, and the file fragment data 3 in the subsequent memory location may be obtained as the fourth file fragment data according to the memory location information of the file fragment data.
In step S205, when it is detected that the memory information of the third file fragment data and/or the fourth file fragment data is smaller than the preset threshold, the first file fragment data is determined as target file fragment data to be sorted.
And when the memory information of the third file fragment data or the fourth file fragment data is smaller than the preset threshold, determining the first file fragment data as target file fragment data to be sorted. Or when the memory information of the third file fragment data and the memory information of the fourth file fragment data are smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
For example, when the first defragment data is the defragment data 2, the defragment data 2 is determined as the target defragment data because the memory information of the corresponding fourth defragment data, i.e. the defragment data 3, is smaller than a preset threshold value, such as 128 KB.
However, when it is detected that the memory information of the three-file fragment data and the fourth-file fragment data is greater than or equal to the preset threshold, the first-file fragment data is determined as file fragment data which does not need to be sorted.
For example, when the first file fragment data is the file fragment data 9, the corresponding fourth file fragment data is the file fragment data 8, and the corresponding fourth file fragment data is the file fragment data 10. Since the memory information of the defragmentation data 8 and the defragmentation data 10 is larger than a preset threshold value, such as 128KB, the defragmentation data 9 is determined as defragmentation data which does not need to be defragmented.
It can be understood that, since the memory information of the second file fragment data, i.e. the file fragment data 8 and the file fragment data 10, adjacent to the file fragment data 9 is greater than the preset threshold, for the file fragment data 9, since the target file fragment data adjacent to the physical address of the file fragment data 9 does not exist in the target file, when the target file fragment data is sorted, the memory spaces corresponding to the file fragment data 9 and other target file data cannot be spliced to form a continuous memory space with a larger memory. In addition, the processing amount of the file defragmentation is increased when the file defragmentation data 9 is arranged, the target file defragmentation time is increased, and the file defragmentation efficiency is affected. The defragmentation data 9 is determined as defragmentation data that does not need to be defragmented to improve the defragmentation efficiency of the defragmentation.
In some embodiments, after determining that the first file fragment data is the target file fragment data, the target file data may be sequentially inserted into the preset linked list, so that after sequentially detecting whether each first file fragment data is the target file fragment data, all target file fragment data of the target file may be directly obtained from the preset linked list.
In some embodiments, when the memory information of the third file fragment data and/or the fourth file fragment data is detected to be smaller than the preset threshold value, a first mark is further added to the first file fragment data, and the first file fragment data with the first mark is determined to be target file fragment data; after detecting whether each piece of first file fragment data is the target file fragment data in sequence, the piece of file fragment data with the first mark can be obtained from the piece of file fragment data of the target file to obtain each piece of target file fragment data of the target file.
In step S206, each piece of target file fragment data in the target file is acquired, and the total memory information of the piece of target file fragment data is calculated.
And acquiring all target file fragment data of the target file, and calculating the total memory information of the target file fragment data. For example, the target file fragment data of the target file shown in fig. 3 includes file fragment data 2, file fragment data 3, file fragment data 4, file fragment data 5, file fragment data 6, and file fragment data 7. The total memory information of the file fragment data 2, the file fragment data 3, the file fragment data 4, the file fragment data 5, the file fragment data 6 and the file fragment data 7 is calculated to be 52KB.
In step S207, a first file having the same memory capacity as the total memory information is created.
The method comprises the steps of creating a first file with the same memory capacity as the total memory information of target file fragment data, wherein the first file is a donor file, and e4defrag can apply for a memory space with the memory capacity being the total memory information in a memory space corresponding to the target file through the donor file.
In some embodiments, a continuous memory space with a memory capacity being the total memory information may be applied from a memory space corresponding to the target file, so as to create a first file with the same memory capacity as the total memory information, where the continuous memory space is a memory space corresponding to the first file. So that step 210 can move the target file fragment data to the continuous memory space for storage, to complete the sorting of the target file fragment data.
In step S208, the target file fragment data is moved to the memory space corresponding to the first file for storage, so as to finish the arrangement of the target file fragment data.
The EXT4_IOC_MOVE_EXT IOCTL function can be called to exchange data between the target file fragment data and the memory space corresponding to the first file, so that the target file fragment data is moved into the memory space corresponding to the first file to be stored. As shown in FIG. 3, after the movement of the target file fragment data is completed, the file fragment data of the target file can be reduced from 11 to 5, so that the fragmentation degree of the target file is greatly reduced, and the read-write capability of the target file is further improved.
Therefore, according to the file defragmentation method provided by the embodiment of the application, the memory information of each file defragmentation data of the target file is determined by acquiring the target file to be defragmented; determining file fragment data with memory information smaller than a preset threshold value as first file fragment data; acquiring memory information of second file fragment data adjacent to the first file fragment data; and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted. Therefore, partial target file fragment data to be arranged is determined from the plurality of file fragment data, and the partial target file fragment data is arranged without arranging all the file fragment data, so that the arrangement efficiency of the file fragments is improved.
Referring to fig. 6, fig. 6 is a schematic structural diagram of a defragmentation device according to an embodiment of the application. The file defragmentation device is used for carrying out file defragmentation based on a fourth generation extended file system (Fourth extended filesystem, EXT 4), wherein the file defragmentation device carries out online defragmentation through an online file defragmentation tool of the EXT4 file system, the online file defragmentation tool can be e4defrag, and the e4defrag can realize scoring and defragmentation of file defragmentation.
Specifically, the arrangement device of the file fragments comprises: a first acquisition module 31, a first determination module 32, a second acquisition module 33, and a second determination module 34.
The first obtaining module 31 is configured to obtain the target file to be sorted, and determine the memory information of each piece of file fragment data of the target file.
The first obtaining module 31 is configured to call the e4defrag to traverse all files of the electronic device to obtain target files to be sorted, and obtain file fragment information of each target file through a preset function, such as an fs_ioc_fiemap IOTCL function. The file fragment information may include physical address information and memory information of each file fragment data in the target file.
The first determining module 32 is configured to determine the file fragment data with the memory information smaller than the preset threshold value as the first file fragment data.
The first determining module 32 is configured to sequentially detect, according to the order of the physical addresses of the file fragment data from small to large, whether the memory information of each file fragment data is smaller than a preset threshold, and determine the file fragment data as first file fragment data if the memory information of the file fragment data is smaller than the preset threshold. If the memory information of the file fragment data is greater than or equal to a preset threshold value, determining that the file fragment data is file fragment data which does not need to be sorted.
The second obtaining module 33 is configured to obtain memory information of second file fragment data adjacent to the first file fragment data.
The second obtaining module 33 is configured to obtain second file fragment data adjacent to each first file fragment data according to a physical address of the file fragment data, where the second file fragment is second file fragment data of previous memory location information and second file fragment data of next memory location information of the first file fragment data, and determine memory information of each second file fragment data.
The second determining module 34 is configured to determine the first file fragment data as target file fragment data to be sorted when it is detected that the memory information of any one of the second file fragment data is smaller than a preset threshold.
The second determining module 34 is configured to detect whether the memory information of the second file fragment data is smaller than a preset threshold, and determine the first file fragment data as target file fragment data to be sorted when detecting that the memory information of any one of the second file fragment data is smaller than the preset threshold. And when the second file fragment data are detected to be greater than or equal to a preset threshold value, determining the first file fragment data as file fragment data which do not need to be sorted.
In some implementations, the second determination module 34 is further to: when the memory information of each piece of second file fragment data is detected to be greater than or equal to a preset threshold value, the first piece of file fragment data is determined not to be arranged.
In some embodiments, the second acquisition module 33 is further configured to: acquiring third file fragment data of a previous memory position of the first file fragment data and fourth file fragment data of a subsequent memory position; the second determination module 34 is further configured to: and when the memory information of the third file fragment data and/or the fourth file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
In some implementations, the first determination module 32 is further to: detecting whether the memory information of each piece of file fragment data is smaller than a preset threshold value according to the memory position information of the piece of file fragment data; and determining the file fragment data with the memory information smaller than a preset threshold value as first file fragment data.
In some embodiments, the defragmenter 300 further comprises a defragmentation module for: obtaining fragment data of each target file in the target file, and calculating total memory information of the fragment data of the target file; creating a first file with the same memory capacity as the total memory information; and moving the target file fragment data into a memory space corresponding to the first file for storage so as to finish the arrangement of the target file fragment data.
In some embodiments, the collation module is further to: applying a continuous memory space with the memory capacity being the total memory information from the memory space corresponding to the target file to create a first file with the same memory capacity as the total memory information, wherein the continuous memory space is the memory space corresponding to the first file; and moving the target file fragment data to a continuous memory space for storage.
In some embodiments, when it is detected that the memory information of any one of the second file fragment data is smaller than the preset threshold, the second determining module 33 is further configured to: adding a first mark to the first file fragment data, and determining the first file fragment data with the first mark as target file fragment data; the arrangement module is also for: and acquiring the file fragment data with the first mark from the file fragment data of the target file to obtain each target file fragment data.
Therefore, the sorting device for file fragments provided by the embodiment of the application obtains the target file to be sorted through the first obtaining module 31, and determines the memory information of each file fragment data of the target file; the first determining module 32 determines file fragment data with memory information smaller than a preset threshold value as first file fragment data; the second obtaining module 33 obtains memory information of second file fragment data adjacent to the first file fragment data; the second determining module 34 determines the first file fragment data as target file fragment data to be sorted when detecting that the memory information of any one of the second file fragment data is smaller than a preset threshold. Therefore, partial target file fragment data to be arranged is determined from the plurality of file fragment data, and the partial target file fragment data is arranged without arranging all the file fragment data, so that the arrangement efficiency of the file fragments is improved.
The embodiment of the application also provides electronic equipment. Referring to fig. 7, fig. 7 is a schematic diagram of a first structure of an electronic device according to an embodiment of the application. Wherein the electronic device 500 comprises a processor 501 and a memory 502. The processor 501 is electrically connected to the memory 502.
The processor 500 is a control center of the electronic device 500, connects various parts of the entire electronic device using various interfaces and lines, and performs various functions of the electronic device 500 and processes data by running or loading computer programs stored in the memory 502 and calling data stored in the memory 502, thereby performing overall monitoring of the electronic device 500.
The memory 502 may be used to store software programs and modules, and the processor 501 may execute various functional applications and data processing by executing the computer programs and modules stored in the memory 502. The memory 502 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, a computer program (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like; the storage data area may store data created according to the use of the electronic device, etc. In addition, memory 502 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device. Accordingly, the memory 502 may also include a memory controller to provide access to the memory 502 by the processor 501.
In the embodiment of the present application, the processor 501 in the electronic device 500 loads the instructions corresponding to the processes of one or more computer programs into the memory 502 according to the following steps, and the processor 501 executes the computer programs stored in the memory 502, so as to implement various functions, as follows:
acquiring a target file to be sorted, and determining memory information of each file fragment data of the target file;
determining file fragment data with memory information smaller than a preset threshold value as first file fragment data;
acquiring memory information of second file fragment data adjacent to the first file fragment data;
and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
In some embodiments, after acquiring the memory information of the second file fragment data adjacent to the first file fragment data, the processor 501 may specifically perform the following steps:
when the memory information of each piece of second file fragment data is detected to be greater than or equal to a preset threshold value, the first piece of file fragment data is determined not to be arranged.
In some embodiments, when acquiring the memory information of the second file fragment data adjacent to the first file fragment data, the processor 501 may specifically perform the following steps:
acquiring third file fragment data of a previous memory position of the first file fragment data and fourth file fragment data of a subsequent memory position;
when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted, wherein the step comprises the following steps:
and when the memory information of the third file fragment data and/or the fourth file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
In some embodiments, when determining the file fragment data with the memory information smaller than the preset threshold value as the first file fragment data, the processor 501 may specifically perform the following steps:
detecting whether the memory information of each piece of file fragment data is smaller than a preset threshold value according to the memory position information of the piece of file fragment data;
and determining the file fragment data with the memory information smaller than a preset threshold value as first file fragment data.
In some embodiments, after determining the first file fragment data as the target file fragment data to be defragmented, the processor 501 may specifically perform the steps of:
obtaining fragment data of each target file in the target file, and calculating total memory information of the fragment data of the target file;
creating a first file with the same memory capacity as the total memory information;
and moving the target file fragment data into a memory space corresponding to the first file for storage so as to finish the arrangement of the target file fragment data.
In some embodiments, when creating the first file with the same memory capacity as the total memory information, the processor 501 may specifically perform the following steps:
applying a continuous memory space with the memory capacity being the total memory information from the memory space corresponding to the target file to create a first file with the same memory capacity as the total memory information, wherein the continuous memory space is the memory space corresponding to the first file;
when the target file fragment data is moved to the memory space corresponding to the first file for storage, the processor 501 may specifically execute the following steps:
and moving the target file fragment data to a continuous memory space for storage.
In some embodiments, when determining the first file fragment data as the target file fragment data to be defragmented, the processor 501 may specifically perform the following steps:
adding a first mark to the first file fragment data, and determining the first file fragment data with the first mark as target file fragment data;
in acquiring the fragment data of each target file in the target file, the processor 501 may specifically perform the following steps:
and acquiring the file fragment data with the first mark from the file fragment data of the target file to obtain each target file fragment data.
As can be seen from the above, the electronic device provided by the embodiment of the present application determines the memory information of each file fragment data of the target file by acquiring the target file to be sorted; determining file fragment data with memory information smaller than a preset threshold value as first file fragment data; acquiring memory information of second file fragment data adjacent to the first file fragment data; and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted. Therefore, partial target file fragment data to be arranged is determined from the plurality of file fragment data, and the partial target file fragment data is arranged without arranging all the file fragment data, so that the arrangement efficiency of the file fragments is improved.
Referring to fig. 8, in some embodiments, the electronic device 500 may further include: a display 503, radio frequency circuitry 504, audio circuitry 505, and a power supply 506. Wherein, the display 503, the radio frequency circuit 504, the audio circuit 505 and the power supply 506 are electrically connected to the processor 501 respectively.
The display 503 may be used to display information entered by a user or provided to a user as well as various graphical user interfaces that may be composed of graphics, text, icons, video, and any combination thereof. The display 503 may include a display panel, which in some embodiments may be configured in the form of a liquid crystal display (Liquid Crystal Display, LCD), or an Organic Light-Emitting Diode (OLED), or the like.
The rf circuitry 504 may be configured to receive and transmit rf signals to and from a network device or other electronic device via wireless communication to establish wireless communication with the network device or other electronic device.
The audio circuit 505 may be used to provide an audio interface between a user and an electronic device through a speaker, microphone.
The power supply 506 may be used to power the various components of the electronic device 500. In some embodiments, the power supply 506 may be logically connected to the processor 501 through a power management system, so as to perform functions of managing charging, discharging, and power consumption management through the power management system.
Although not shown in fig. 8, the electronic device 500 may further include a camera, a bluetooth module, etc., which will not be described herein.
The embodiment of the present application also provides a storage medium storing a computer program, which when executed on a computer, causes the computer to perform the method for defragmentation of files in any of the above embodiments, for example: acquiring a target file to be sorted, and determining memory information of each file fragment data of the target file; determining file fragment data with memory information smaller than a preset threshold value as first file fragment data; acquiring memory information of second file fragment data adjacent to the first file fragment data; and when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
In an embodiment of the present application, the storage medium may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a random access Memory (Random Access Memory, RAM), or the like.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
It should be noted that, for the method for defragmentation of files according to the embodiments of the present application, those skilled in the art will understand that all or part of the flow of the method for defragmentation of files according to the embodiments of the present application can be implemented by controlling related hardware through a computer program, where the computer program can be stored in a computer readable storage medium, such as a memory of an electronic device, and executed by at least one processor in the electronic device, and the execution process can include the flow of the embodiment of the defragmentation method, such as file defragmentation. The storage medium may be a magnetic disk, an optical disk, a read-only memory, a random access memory, etc.
For the file defragmentation device according to the embodiment of the application, each functional module can be integrated in one processing chip, each module can exist alone physically, and two or more modules can be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated module, if implemented as a software functional module and sold or used as a stand-alone product, may also be stored on a computer readable storage medium such as read-only memory, magnetic or optical disk, etc.
The above description of the method, the device, the storage medium and the electronic equipment for sorting file fragments provided by the embodiment of the present application is provided in detail, and specific examples are applied to describe the principles and embodiments of the present application, and the description of the above embodiment is only used to help understand the method and the core idea of the present application; meanwhile, as those skilled in the art will vary in the specific embodiments and application scope according to the ideas of the present application, the present description should not be construed as limiting the present application in summary.
Claims (8)
1. A method for defragmenting a file, comprising:
acquiring a target file to be sorted, and determining memory information of each file fragment data of the target file; wherein, the file fragments refer to different positions of each part of the same file stored in a memory respectively;
determining file fragment data with memory information smaller than a preset threshold value as first file fragment data;
acquiring memory information of second file fragment data adjacent to the first file fragment data;
when the memory information of any one second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted;
Obtaining fragment data of each target file in the target file, and calculating total memory information of the fragment data of the target file;
applying a continuous memory space with the memory capacity being the total memory information from the memory space corresponding to the target file to create a first file with the same memory capacity as the total memory information, wherein the continuous memory space is the memory space corresponding to the first file;
and moving the target file fragment data to the continuous memory space for storage so as to finish the arrangement of the target file fragment data.
2. The method according to claim 1, wherein after the step of obtaining the memory information of the second file fragment data adjacent to the first file fragment data, the method further comprises:
when the memory information of each piece of second file fragment data is detected to be greater than or equal to a preset threshold value, determining that the first piece of file fragment data does not need to be sorted.
3. The arranging method according to claim 1, wherein the step of acquiring the memory information of the second file fragment data adjacent to the first file fragment data includes:
acquiring third file fragment data of a previous memory position and fourth file fragment data of a subsequent memory position of the first file fragment data;
And when the memory information of any one of the second file fragment data is detected to be smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted, wherein the step comprises the following steps:
and when detecting that the memory information of the third file fragment data and/or the fourth file fragment data is smaller than a preset threshold value, determining the first file fragment data as target file fragment data to be sorted.
4. The arranging method according to claim 1, wherein the step of determining the file fragment data whose memory information is smaller than the preset threshold value as the first file fragment data includes:
detecting whether the memory information of each piece of file fragment data is smaller than a preset threshold value according to the memory position information of the piece of file fragment data;
and determining the file fragment data with the memory information smaller than a preset threshold value as first file fragment data.
5. The defragmentation method according to claim 1, characterized in that the step of determining the first file fragment data as target file fragment data to be defragmented comprises:
adding a first mark to the first file fragment data, and determining the first file fragment data with the first mark as target file fragment data;
The step of obtaining the fragment data of each target file in the target file comprises the following steps:
and acquiring the file fragment data with the first mark from the file fragment data of the target file to obtain each target file fragment data.
6. A document defragmentation device, comprising:
the first acquisition module is used for acquiring a target file to be tidied and determining memory information of each file fragment data of the target file; wherein, the file fragments refer to different positions of each part of the same file stored in a memory respectively;
the first determining module is used for determining file fragment data with memory information smaller than a preset threshold value as first file fragment data;
the second acquisition module is used for acquiring memory information of second file fragment data adjacent to the first file fragment data;
the second determining module is used for determining the first file fragment data as target file fragment data to be sorted when detecting that the memory information of any one of the second file fragment data is smaller than a preset threshold value;
the defragmentation data arrangement module is used for acquiring defragmentation data of each target file in the target file and calculating total memory information of the defragmentation data of the target file; applying a continuous memory space with the memory capacity being the total memory information from the memory space corresponding to the target file to create a first file with the same memory capacity as the total memory information, wherein the continuous memory space is the memory space corresponding to the first file; and moving the target file fragment data to the continuous memory space for storage so as to finish the arrangement of the target file fragment data.
7. A storage medium having stored thereon a computer program which, when run on a computer, causes the computer to perform the defragmentation method of file fragments according to claim 1.
8. An electronic device comprising a processor and a memory, the memory having a computer program, the processor being configured to perform the defragmentation method of the file system according to claim 1 by invoking the computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010246716.5A CN111459848B (en) | 2020-03-31 | 2020-03-31 | File fragment sorting method and device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010246716.5A CN111459848B (en) | 2020-03-31 | 2020-03-31 | File fragment sorting method and device, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111459848A CN111459848A (en) | 2020-07-28 |
| CN111459848B true CN111459848B (en) | 2023-10-31 |
Family
ID=71680720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010246716.5A Active CN111459848B (en) | 2020-03-31 | 2020-03-31 | File fragment sorting method and device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111459848B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114327296A (en) * | 2021-12-31 | 2022-04-12 | 珠海豹好玩科技有限公司 | Intelligent disk fragment analysis method and device and electronic equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102567522A (en) * | 2011-12-28 | 2012-07-11 | 北京握奇数据系统有限公司 | Method and device for managing file system of intelligent card |
| CN104272263A (en) * | 2012-02-29 | 2015-01-07 | 网络装置公司 | Fragmentation control for performing deduplication operations |
| US9646014B1 (en) * | 2009-08-28 | 2017-05-09 | Veritas Technologies | Systems and methods for selective defragmentation |
| CN107766370A (en) * | 2016-08-19 | 2018-03-06 | 华为技术有限公司 | A kind of file fragmentation appraisal procedure and terminal |
-
2020
- 2020-03-31 CN CN202010246716.5A patent/CN111459848B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9646014B1 (en) * | 2009-08-28 | 2017-05-09 | Veritas Technologies | Systems and methods for selective defragmentation |
| CN102567522A (en) * | 2011-12-28 | 2012-07-11 | 北京握奇数据系统有限公司 | Method and device for managing file system of intelligent card |
| CN104272263A (en) * | 2012-02-29 | 2015-01-07 | 网络装置公司 | Fragmentation control for performing deduplication operations |
| CN107766370A (en) * | 2016-08-19 | 2018-03-06 | 华为技术有限公司 | A kind of file fragmentation appraisal procedure and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111459848A (en) | 2020-07-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2665065A2 (en) | Electronic device employing flash memory | |
| WO2017185579A1 (en) | Method and apparatus for data storage | |
| US11138034B2 (en) | Method and apparatus for collecting information, and method and apparatus for releasing memory | |
| CN110554999B (en) | Cold and hot attribute identification and separation method and device based on log file system and flash memory device and related products | |
| CN103345469B (en) | The storage of set of numbers, querying method and device thereof | |
| KR20140006299A (en) | Method and apparatus for controlling writing data in storage unit based on nand flash memory | |
| CN111309267B (en) | Storage space allocation method and device, storage equipment and storage medium | |
| CN113625973B (en) | Data writing method, device, electronic equipment and computer readable storage medium | |
| CN104134027B (en) | A kind of sequential flow knows method for distinguishing and device | |
| WO2020192710A1 (en) | Method for processing garbage based on lsm database, solid state hard disk, and storage apparatus | |
| CN113127382A (en) | Data reading method, device, equipment and medium for additional writing | |
| CN111459848B (en) | File fragment sorting method and device, storage medium and electronic equipment | |
| CN101957729A (en) | Logical block transformation method and method and device compatible with reading and writing of user based on same | |
| CN115934002B (en) | Solid state disk access method, solid state disk, storage system and cloud server | |
| CN111061429B (en) | Data access method, device, equipment and medium | |
| CN103176753A (en) | Storage device and data management method of storage device | |
| US11803469B2 (en) | Storing data in a log-structured format in a two-tier storage system | |
| CN110658999B (en) | Information updating method, device, equipment and computer readable storage medium | |
| CN114327296A (en) | Intelligent disk fragment analysis method and device and electronic equipment | |
| CN111796757B (en) | Solid state disk cache region management method and device | |
| CN113485642A (en) | Data caching method and device | |
| CN112148486A (en) | Memory page management method, device and equipment and readable storage medium | |
| CN112015672A (en) | Data processing method, device, equipment and storage medium in storage system | |
| WO2012050416A1 (en) | A method of caching application | |
| CN109408475B (en) | Data processing method and system during data de-duplication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |