CN109521963B - Metadata dropping method and device - Google Patents
Metadata dropping method and device Download PDFInfo
- Publication number
- CN109521963B CN109521963B CN201811354082.4A CN201811354082A CN109521963B CN 109521963 B CN109521963 B CN 109521963B CN 201811354082 A CN201811354082 A CN 201811354082A CN 109521963 B CN109521963 B CN 109521963B
- Authority
- CN
- China
- Prior art keywords
- tree
- metadata
- memory
- disk
- level
- 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
- 238000000034 method Methods 0.000 title claims abstract description 44
- 230000001680 brushing effect Effects 0.000 claims abstract description 44
- 238000011010 flushing procedure Methods 0.000 claims abstract description 12
- 238000010586 diagram Methods 0.000 description 2
- 230000002085 persistent effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0674—Disk device
- G06F3/0676—Magnetic disk device
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the application discloses a metadata disk-dropping method, which comprises the following steps: reading a first-level tree in a disk into the memory when metadata in the memory reaches a first lower brushing threshold value; then, merging the metadata in the memory to the first-level tree, and then flushing the merged first-level tree to a disk; when the first-level tree in the disk reaches the second lower brushing threshold value, the first-level tree is marked as a second-level tree which is fixedly stored in the disk, namely when the metadata in the memory reaches the first lower brushing threshold value, the second-level tree cannot be read into the memory. In the metadata disk-dropping method, the size of the primary tree which can be read into the memory is limited, so that the metadata and the overlarge primary tree are effectively prevented from being combined in the memory with limited capacity, the cost of combining the metadata and the primary tree is further reduced, and the stability of the performance of the storage system is ensured.
Description
Technical Field
The application relates to the technical field of storage systems, in particular to a metadata disk-dropping method and device.
Background
Metadata landing refers to writing data onto a disk in a persistent form so that when a host performs data query, the location of the data in the disk can be quickly located. Typically, the data of the landing disk is stored in a data structure of a B + tree or other similar data structure, so as to improve the efficiency of data retrieval.
When the host issues an IO request, metadata is stored in the memory in a data structure of a B + tree, and when the data volume of the metadata reaches a preset threshold value in the memory, the metadata is triggered to be landed, that is, the metadata in the memory is flushed down to a disk.
The existing metadata disk-dropping method mainly comprises the following two methods: the first method is that the metadata in the memory is directly brushed down to the disk, and then the metadata brushed down to the disk is merged with the existing B + tree on the disk. And secondly, reading the B + tree in the disk into the memory when the data volume of the metadata in the memory reaches a preset threshold value, merging the metadata in the memory and the B + tree in the disk read from the memory, and then flushing the merged B + tree to the disk.
Although the first metadata dropping method can ensure that the metadata in the memory is quickly flushed to the disk, if the host queries the data in the disk in the metadata flushing process, the host needs to query the B + trees in the disk one by one to determine the position of the data to be queried, so the query efficiency is extremely low. For the second metadata disk-dropping method, when the B + tree in the disk is large, the B + tree in the disk is read into the memory and merged with the metadata, so that a large merging cost is required, and due to limited memory capacity, a situation of insufficient memory may occur when the large B + tree is read into the memory, which may greatly affect the performance of the system.
Disclosure of Invention
In order to solve the technical problem, the application provides a metadata disk-dropping method, which can improve the query efficiency of metadata in a storage system and ensure the reliability of the storage system.
The embodiment of the application discloses the following technical scheme:
in a first aspect, an embodiment of the present application provides a metadata disk-dropping method, where the method includes:
reading a first-level tree in a disk into a memory when metadata in the memory reaches a first lower brushing threshold value;
merging the metadata in the memory to the primary tree, and flushing the primary tree to a disk;
when the first-level tree reaches a second lower brushing threshold value, marking the first-level tree as a second-level tree; the secondary tree is fixedly stored in a disk.
Optionally, when the first level tree reaches the second lower brushing threshold, the method further includes:
reconstructing a first-level tree in the disk;
and merging the metadata in the memory with the reconstructed first-level tree when the metadata in the memory reaches the first lower brushing threshold.
Optionally, the method further includes:
merging the reconstructed primary tree with the secondary tree when the reconstructed primary tree reaches the second lower-brushing threshold.
Optionally, the metadata, the primary tree, and the secondary tree are all B + tree structures.
In a second aspect, an embodiment of the present application provides a metadata dropping device, where the device includes:
the reading module is used for reading the primary tree in the disk into the memory when the metadata in the memory reaches a first lower brushing threshold value;
the lower brushing module is used for merging the metadata in the memory into the first-level tree and brushing the first-level tree to a disk;
a marking module for marking the primary tree as a secondary tree when the primary tree reaches a second lower brushing threshold; the secondary tree is fixedly stored in a disk.
Optionally, the apparatus further comprises:
the building module is used for rebuilding the primary tree in the magnetic disk when the primary tree reaches a second lower brushing threshold value;
the lower-brushing module is further configured to merge the metadata in the memory with the reconstructed first-level tree when the metadata in the memory reaches the first lower-brushing threshold.
Optionally, the apparatus further comprises:
a merging module to merge the reconstructed first-level tree with the second-level tree when the reconstructed first-level tree reaches the second lower-brushing threshold.
Optionally, the metadata, the primary tree, and the secondary tree are all B + tree structures.
It can be seen from the foregoing technical solutions that, an embodiment of the present application provides a metadata destaging method, including: reading a first-level tree in a disk into the memory when metadata in the memory reaches a first lower brushing threshold value; then, merging the metadata in the memory to the first-level tree, and then flushing the merged first-level tree to a disk; when the first-level tree in the disk reaches the second lower brushing threshold value, the first-level tree is marked as a second-level tree which is fixedly stored in the disk, namely when the metadata in the memory reaches the first lower brushing threshold value, the second-level tree cannot be read into the memory. In the metadata disk-dropping method, the size of the primary tree which can be read into the memory is limited, so that the metadata and the overlarge primary tree are effectively prevented from being combined in the memory with limited capacity, the cost of combining the metadata and the primary tree is further reduced, and the stability of the performance of the storage system is ensured.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
Fig. 1 is a schematic flowchart of a metadata destaging method according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of a metadata dropping apparatus according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the drawings described above, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The existing metadata disk-dropping method generally has the problems of low query efficiency, large influence on the performance of a storage system and the like, and in order to solve the technical problems existing in the prior art, the embodiment of the application provides the metadata disk-dropping method which can improve the query efficiency of metadata in the storage system and ensure the reliability of the storage system.
The following first introduces a core technical idea of the metadata disk-dropping method provided in the embodiment of the present application:
the embodiment of the application provides a metadata disk-dropping method, which comprises the following steps: reading a first-level tree in a disk into the memory when metadata in the memory reaches a first lower brushing threshold value; then, merging the metadata in the memory to the first-level tree, and then flushing the merged first-level tree to a disk; when the first-level tree in the disk reaches the second lower brushing threshold value, the first-level tree is marked as a second-level tree which is fixedly stored in the disk, namely when the metadata in the memory reaches the first lower brushing threshold value, the second-level tree cannot be read into the memory. In the metadata disk-dropping method, the size of the primary tree which can be read into the memory is limited, so that the metadata and the overlarge primary tree are effectively prevented from being combined in the memory with limited capacity, the cost of combining the metadata and the primary tree is further reduced, and the stability of the performance of the storage system is ensured.
The metadata landing method provided by the present application is described as follows by way of example:
referring to fig. 1, fig. 1 is a schematic flowchart of a metadata landing method provided in an embodiment of the present application. As shown in fig. 1, the metadata landing method includes:
step 101: and when the metadata in the memory reaches a first lower brushing threshold value, reading the first-level tree in the disk into the memory.
Step 102: and merging the metadata in the memory into the primary tree, and flushing the primary tree to a disk.
After the storage system is started, in response to an IO request issued by a host, metadata is stored in a memory, the metadata stored in the memory is increased with the increase of the IO request issued by the host, and when the metadata in the memory reaches a first lower-flushing threshold value, the metadata in the memory needs to be flushed down to a disk.
Specifically, when the metadata in the memory is flushed to the disk, a first-level tree in the disk is read into the memory, the first-level tree is formed by combining the metadata flushed to the disk, the metadata in the memory is combined with the first-level tree, and after the combination is completed, the first-level tree combined with the metadata is flushed to the disk.
The first lower brushing threshold may be set according to actual conditions, and the first lower brushing threshold is not limited in any way.
Step 103: when the first-level tree reaches a second lower brushing threshold value, marking the first-level tree as a second-level tree; the secondary tree is fixedly stored in a disk.
Judging whether the capacity of the primary tree reaches a second lower brushing threshold value in real time, if the capacity of the primary tree does not reach the second lower brushing threshold value, reading the primary tree into a memory when metadata in the memory reaches the first lower brushing threshold value, combining the metadata in the memory with the primary tree, and brushing the metadata in a disk; on the contrary, if the capacity of the primary tree reaches the second lower-brushing threshold, it indicates that the capacity of the primary tree is too large, the primary tree is read into the memory and merged with the metadata, a large merging cost is paid, and there is a possibility that the stability of the storage system is affected.
The second lower brushing threshold may be set according to actual conditions, and the second lower brushing threshold is not limited at all.
When the first-level tree which is constructed firstly is marked as a second-level tree, the first-level tree is reconstructed, when the metadata in the memory reaches a first lower brushing threshold value, the reconstructed first-level tree is read into the memory, the first-level tree is combined with the metadata in the memory by utilizing the first-level tree, and the combined first-level tree is brushed down to a disk.
It should be noted that, when the capacity of the reconstructed primary tree also reaches the second lower-brushing threshold, the reconstructed primary tree is merged with the existing secondary tree in the disk, and a merged secondary tree is generated. Similarly, the first level tree is built again in disk, the above process is repeated, and so on.
It should be noted that the metadata stored in the memory and the primary tree and the secondary tree stored in the disk may both have a B + tree structure, and these data may also have other tree structures similar to the B + tree structure, and are not limited herein.
In the metadata destaging method provided by the embodiment of the application, when the metadata in the memory reaches the first destaging threshold, the first-level tree in the disk is read into the memory; then, merging the metadata in the memory to the first-level tree, and then flushing the merged first-level tree to a disk; when the first-level tree in the disk reaches the second lower brushing threshold value, the first-level tree is marked as a second-level tree which is fixedly stored in the disk, namely when the metadata in the memory reaches the first lower brushing threshold value, the second-level tree cannot be read into the memory. In the metadata disk-dropping method, the size of the primary tree which can be read into the memory is limited, so that the metadata and the overlarge primary tree are effectively prevented from being combined in the memory with limited capacity, the cost of combining the metadata and the primary tree is further reduced, and the stability of the performance of the storage system is ensured.
Aiming at the metadata disk-dropping method provided above, the embodiment of the present application further provides a metadata disk-dropping device, so that the metadata disk-dropping method above is implemented in practical application.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a metadata dropping apparatus according to an embodiment of the present application. As shown in fig. 2, the apparatus includes:
a reading module 201, configured to read a first-level tree in a disk into a memory when metadata in the memory reaches a first lower-brushing threshold;
a flushing module 202, configured to merge the metadata in the memory into the first-level tree, and flush the first-level tree to a disk;
a marking module 203, configured to mark the primary tree as a secondary tree when the primary tree reaches a second lower brushing threshold; the secondary tree is fixedly stored in a disk.
Optionally, the apparatus further comprises:
the building module is used for rebuilding the primary tree in the magnetic disk when the primary tree reaches a second lower brushing threshold value;
the lower-brushing module is further configured to merge the metadata in the memory with the reconstructed first-level tree when the metadata in the memory reaches the first lower-brushing threshold.
Optionally, the apparatus further comprises:
a merging module to merge the reconstructed first-level tree with the second-level tree when the reconstructed first-level tree reaches the second lower-brushing threshold.
Optionally, the metadata, the primary tree, and the secondary tree are all B + tree structures.
In the metadata dropping device provided in the embodiment of the present application, when the metadata in the memory reaches the first brushing threshold, the first-level tree in the disk is read into the memory; then, merging the metadata in the memory to the first-level tree, and then flushing the merged first-level tree to a disk; when the first-level tree in the disk reaches the second lower brushing threshold value, the first-level tree is marked as a second-level tree which is fixedly stored in the disk, namely when the metadata in the memory reaches the first lower brushing threshold value, the second-level tree cannot be read into the memory. In the metadata disk dropping device, the size of the primary tree which can be read into the memory is limited, so that the metadata and the overlarge primary tree are effectively prevented from being combined in the memory with limited capacity, the cost of combining the metadata and the primary tree is further reduced, and the stability of the performance of the storage system is ensured.
It should be noted that, in the present specification, all the embodiments are described in a progressive manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus and system embodiments, since they are substantially similar to the method embodiments, they are described in a relatively simple manner, and reference may be made to some of the descriptions of the method embodiments for related points. The above-described embodiments of the apparatus and system are merely illustrative, and the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
The above description is only one specific embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present application should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (8)
1. A metadata destaging method, the method comprising:
reading a first-level tree in a disk into a memory when metadata in the memory reaches a first lower brushing threshold value;
merging the metadata in the memory to the primary tree, and flushing the primary tree to a disk;
when the first-level tree reaches a second lower brushing threshold value, marking the first-level tree as a second-level tree; the secondary tree is fixedly stored in a disk.
2. The method of claim 1, wherein when the level one tree reaches a second lower-brushing threshold, the method further comprises:
reconstructing a first-level tree in the disk;
and merging the metadata in the memory with the reconstructed first-level tree when the metadata in the memory reaches the first lower brushing threshold.
3. The method of claim 2, further comprising:
merging the reconstructed primary tree with the secondary tree when the reconstructed primary tree reaches the second lower-brushing threshold.
4. The method of any of claims 1 to 3, wherein the metadata, the primary tree, and the secondary tree are all B + tree structures.
5. A metadata dropoff apparatus, the apparatus comprising:
the reading module is used for reading the primary tree in the disk into the memory when the metadata in the memory reaches a first lower brushing threshold value;
the lower brushing module is used for merging the metadata in the memory into the first-level tree and brushing the first-level tree to a disk;
a marking module for marking the primary tree as a secondary tree when the primary tree reaches a second lower brushing threshold; the secondary tree is fixedly stored in a disk.
6. The apparatus of claim 5, further comprising:
the building module is used for rebuilding the primary tree in the magnetic disk when the primary tree reaches a second lower brushing threshold value;
the lower-brushing module is further configured to merge the metadata in the memory with the reconstructed first-level tree when the metadata in the memory reaches the first lower-brushing threshold.
7. The apparatus of claim 6, further comprising:
a merging module to merge the reconstructed first-level tree with the second-level tree when the reconstructed first-level tree reaches the second lower-brushing threshold.
8. The apparatus of any of claims 5 to 7, wherein the metadata, the primary tree, and the secondary tree are all B + tree structures.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811354082.4A CN109521963B (en) | 2018-11-14 | 2018-11-14 | Metadata dropping method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811354082.4A CN109521963B (en) | 2018-11-14 | 2018-11-14 | Metadata dropping method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109521963A CN109521963A (en) | 2019-03-26 |
| CN109521963B true CN109521963B (en) | 2021-08-10 |
Family
ID=65777578
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811354082.4A Active CN109521963B (en) | 2018-11-14 | 2018-11-14 | Metadata dropping method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109521963B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104809237A (en) * | 2015-05-12 | 2015-07-29 | 百度在线网络技术（北京）有限公司 | LSM-tree (The Log-Structured Merge-Tree) index optimization method and LSM-tree index optimization system |
| CN105612491A (en) * | 2013-09-16 | 2016-05-25 | 网络装置公司 | Management of extent based metadata with dense tree structures within a distributed storage architecture |
| CN107402870A (en) * | 2017-07-31 | 2017-11-28 | 郑州云海信息技术有限公司 | The processing method and processing device of daily record section in a kind of meta data server |
| CN108121670A (en) * | 2017-08-07 | 2018-06-05 | 鸿秦（北京）科技有限公司 | A kind of mapping method for reducing solid state disk metadata backwash frequency |
| CN108427728A (en) * | 2018-02-13 | 2018-08-21 | 百度在线网络技术（北京）有限公司 | Management method, equipment and the computer-readable medium of metadata |
| CN108647151A (en) * | 2018-04-26 | 2018-10-12 | 郑州云海信息技术有限公司 | It is a kind of to dodge system metadata rule method, apparatus, equipment and storage medium entirely |
-
2018
- 2018-11-14 CN CN201811354082.4A patent/CN109521963B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105612491A (en) * | 2013-09-16 | 2016-05-25 | 网络装置公司 | Management of extent based metadata with dense tree structures within a distributed storage architecture |
| CN104809237A (en) * | 2015-05-12 | 2015-07-29 | 百度在线网络技术（北京）有限公司 | LSM-tree (The Log-Structured Merge-Tree) index optimization method and LSM-tree index optimization system |
| CN107402870A (en) * | 2017-07-31 | 2017-11-28 | 郑州云海信息技术有限公司 | The processing method and processing device of daily record section in a kind of meta data server |
| CN108121670A (en) * | 2017-08-07 | 2018-06-05 | 鸿秦（北京）科技有限公司 | A kind of mapping method for reducing solid state disk metadata backwash frequency |
| CN108427728A (en) * | 2018-02-13 | 2018-08-21 | 百度在线网络技术（北京）有限公司 | Management method, equipment and the computer-readable medium of metadata |
| CN108647151A (en) * | 2018-04-26 | 2018-10-12 | 郑州云海信息技术有限公司 | It is a kind of to dodge system metadata rule method, apparatus, equipment and storage medium entirely |
Non-Patent Citations (1)
| Title |
|---|
| 罗圣美;陆游游;秦雄军;杨洪章;张佳程.《 一种结合SSD特征的分布式文件系统元数据优化技术》.《小型微型计算机系统》.2018, * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109521963A (en) | 2019-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108647151B (en) | Full flash system metadata disk-dropping method, device, equipment and storage medium | |
| US20170220614A1 (en) | Consistent ring namespaces facilitating data storage and organization in network infrastructures | |
| JP2005301976A5 (en) | ||
| CN107967122B (en) | Data writing method, device and medium for block device | |
| CN104461390A (en) | Method and device for writing data into imbricate magnetic recording SMR hard disk | |
| CN106844089B (en) | Method and equipment for recovering tree data storage | |
| CN107608826A (en) | A kind of fault recovery method, device and the medium of the node of storage cluster | |
| CN109918234B (en) | Metadata recovery method, device, equipment and medium based on SSD | |
| CN107402870B (en) | Method and device for processing log segment in metadata server | |
| CN109388346B (en) | Data dropping method and related device | |
| CN108885724A (en) | Information processing unit, information processing method and message handling program | |
| CN102722443A (en) | Bad block management method for flash memory | |
| WO2018006721A1 (en) | Method and apparatus for storing log file | |
| CN104375784A (en) | Method and device for lowering complexity of virtual disk management | |
| CN103747276A (en) | CDN data deletion method and CDN server | |
| CN104035925A (en) | Data storage method and device and storage system | |
| US10642508B2 (en) | Method to limit impact of partial media failure of disk drive and detect/report the loss of data for objects due to partial failure of media | |
| CN103049508A (en) | Method and device for processing data | |
| CN103645984A (en) | Method and device for optimizing logs | |
| CN104636218B (en) | Data reconstruction method and device | |
| CN106201851A (en) | The detection method of heap memory operation and device | |
| CN109521963B (en) | Metadata dropping method and device | |
| CN106294842A (en) | A kind of data interactive method, platform and distributed file system | |
| CN105045891A (en) | Method and system for improving performance of sequence list, architecture, optimization method and storage apparatus | |
| CN115543871B (en) | Data storage method and related equipment |
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 |