CN111125447A - Metadata access method, device and equipment and readable storage medium - Google Patents
Metadata access method, device and equipment and readable storage medium Download PDFInfo
- Publication number
- CN111125447A CN111125447A CN201911332567.8A CN201911332567A CN111125447A CN 111125447 A CN111125447 A CN 111125447A CN 201911332567 A CN201911332567 A CN 201911332567A CN 111125447 A CN111125447 A CN 111125447A
- Authority
- CN
- China
- Prior art keywords
- target
- metadata access
- tree
- leaf node
- logical address
- 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.)
- Withdrawn
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/907—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
-
- 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/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0615—Address space extension
- G06F12/0623—Address space extension for memory modules
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9027—Trees
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Library & Information Science (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a metadata access method, a metadata access device, metadata access equipment and a readable storage medium. The method disclosed by the application comprises the following steps: if a metadata access request is received, extracting a logic address from the metadata access request; determining a target B + tree corresponding to the logic address; inquiring a target leaf node corresponding to the logical address in the target B + tree; and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk. The method and the device can relieve the problem of write amplification, reduce the loss of the disk, and improve the access performance and efficiency of the metadata, thereby improving the performance and efficiency of the whole storage system. Accordingly, the metadata access device, the equipment and the readable storage medium disclosed by the application also have the technical effects.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a metadata access method, apparatus, device, and readable storage medium.
Background
In a full flash storage system, metadata is managed using the data structure of the B + tree. Currently, 512 key-value pairs are stored in each Node (Node) in a B + tree, and when any key-value pair in a Node changes, all key-value pairs on the whole Node need to be written to the disk once. Since each key-value pair has a size of 16B (bytes), when any key-value pair in a node changes, it is necessary to write data of 16B × 512 — 8KB (kilobytes) to a disk. Therefore, a large write amplification is generated, repeated disk dropping increases disk loss, and the access performance and efficiency of metadata are low, thereby affecting the performance and efficiency of the whole storage system.
Therefore, how to improve the access performance and efficiency of metadata is a problem to be solved by those skilled in the art.
Disclosure of Invention
In view of the above, an object of the present application is to provide a metadata access method, apparatus, device and readable storage medium, so as to improve the metadata access performance and efficiency. The specific scheme is as follows:
in a first aspect, the present application provides a metadata access method, including:
if a metadata access request is received, extracting a logic address from the metadata access request;
determining a target B + tree corresponding to the logical address; the number of key value pairs stored on each node in the target B + tree is less than 512;
inquiring a target leaf node corresponding to the logic address in the target B + tree;
and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk.
Preferably, the determining the target B + tree corresponding to the logical address includes:
querying the first N bits of the logical address;
and inquiring the identification information of all B + trees, and determining the B + trees with the identification information consistent with the former N bits as the target B + trees.
Preferably, the querying the target leaf node corresponding to the logical address in the target B + tree includes:
and traversing the target B + tree to query the target leaf node.
Preferably, before querying the target leaf node corresponding to the logical address in the target B + tree, the method further includes:
judging whether the target leaf node exists in the target B + tree or not;
and if so, executing the step of inquiring the target leaf node corresponding to the logical address in the target B + tree.
Preferably, the method further comprises the following steps:
if the target leaf node does not exist in the target B + tree, judging the type of the metadata access request;
if the metadata access request is a write request, creating the target leaf node in the target B + tree, storing the key value pair to the target leaf node, and writing the target leaf node into a disk; the key-value pair comprises the logical address and a physical address corresponding to the logical address.
Preferably, the method further comprises the following steps:
and if the metadata access request is a read request, returning a prompt message that the data does not exist.
Preferably, after querying the target leaf node corresponding to the logical address in the target B + tree, the method further includes:
and if the metadata access request is a read request, reading the physical address in the key value pair and returning.
In a second aspect, the present application provides a metadata access apparatus, comprising:
the extraction module is used for extracting a logic address from the metadata access request if the metadata access request is received;
a determining module, configured to determine a target B + tree corresponding to the logical address; the number of key value pairs stored on each node in the target B + tree is less than 512;
the query module is used for querying a target leaf node corresponding to the logical address in the target B + tree;
and the modification module is used for modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request if the metadata access request is a write request, and writing the modified target leaf node into a disk.
In a third aspect, the present application provides a metadata access apparatus, comprising:
a memory for storing a computer program;
a processor for executing the computer program to implement the metadata access method disclosed in the foregoing.
In a fourth aspect, the present application provides a readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the metadata access method disclosed above.
According to the above scheme, the present application provides a metadata access method, including: if a metadata access request is received, extracting a logic address from the metadata access request; determining a target B + tree corresponding to the logical address; the number of key value pairs stored on each node in the target B + tree is less than 512; inquiring a target leaf node corresponding to the logic address in the target B + tree; and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk.
As can be seen, the method extracts a logical address from a metadata access request after receiving the metadata access request; then determining a target B + tree corresponding to the logic address; inquiring a target leaf node corresponding to the logic address in the target B + tree; and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk. And the number of the key value pairs stored on each node in the target B + tree is less than 512. Therefore, when the leaf nodes are written into the disk each time, the data volume needing to be written is reduced, so that the problem of write amplification can be relieved, the disk loss is reduced, the access performance and efficiency of metadata are improved, and the performance and efficiency of the whole storage system are improved.
Accordingly, the metadata access device, the equipment and the readable storage medium provided by the application also have the technical effects.
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, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flow chart of a metadata access method disclosed herein;
FIG. 2 is a flow chart of another metadata access method disclosed herein;
FIG. 3 is a schematic diagram of a B + tree according to the present disclosure;
FIG. 4 is a schematic diagram of a plurality of B + trees corresponding to a volume as disclosed herein;
FIG. 5 is a schematic diagram of a metadata access device disclosed herein;
fig. 6 is a schematic diagram of a metadata access device disclosed in the present application.
Detailed Description
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.
At present, the prior art can generate large write amplification, the repeated disk dropping can increase the disk loss, and the access performance and efficiency of metadata are low, thereby affecting the performance and efficiency of the whole storage system. Therefore, the metadata access scheme is provided, the write amplification problem can be relieved, the disc loss is reduced, and the metadata access performance and efficiency are improved, so that the performance and efficiency of the whole storage system are improved.
Referring to fig. 1, an embodiment of the present application discloses a metadata access method, including:
s101, if the metadata access request is received, extracting a logic address from the metadata access request.
And S102, determining a target B + tree corresponding to the logic address.
And the number of the key value pairs stored on each node in the target B + tree is less than 512.
It should be noted that the nodes in the B + tree are divided into leaf nodes and non-leaf nodes. The logical and physical addresses of the metadata are stored on the leaf nodes in the form of key-value pairs. The non-leaf node stores the index value of its lower node and the physical address of the lower node in the form of a key value pair. The key-value pair is a key-value pair.
In one embodiment, determining a target B + tree corresponding to a logical address includes: querying the first N bits of the logical address; and inquiring the identification information of all B + trees, and determining the B + trees with the identification information consistent with the first N bits as target B + trees.
In this embodiment, all the logical addresses in the storage system are divided into the first N bits (e.g. the first 4 bits), and the logical addresses with the same first N bits are divided into the same group, so that a plurality of groups are obtained, each group corresponds to a B + tree, and the identification information of the B + tree is represented by the first N bits. Therefore, if the identification information of the B + tree is consistent with the first N bits of a certain logical address, the B + tree is the B + tree corresponding to the logical address. Wherein, N is a positive integer and is less than the total number of bits of the logic address.
In this embodiment, the number of key-value pairs stored at each node in the target B + tree is less than 512, then the size of the data amount at each node in each B + tree is less than 8KB, and the number of layers in each B + tree does not exceed 4. Assuming that the data size on each node is 512B (bytes), 32 key-value pairs may be stored on each node since each key-value pair is 16B. Compared with the prior art, the data volume on each node in the B + tree is smaller than that in the prior art, and the data volume writing volume is reduced when a certain leaf node writes in a disk. And the access performance and efficiency of metadata can be improved due to the reduction of the data writing amount.
It should be noted that, the size of the data volume stored in the node is generally set according to the service requirement, so the size of the data volume stored in each node can be flexibly adjusted. The size of the data stored in each node can be flexibly adjusted between 512B and 8KB (including an endpoint value), and of course, the size can be larger. Writing leaf nodes to disk, which is essentially sectors of disk, with the minimum amount of data that a sector can write at a time being 512B, so setting the number of key-value pairs stored at each node in the target B + tree to 32, and making the amount of data at each node in the B + tree 512B, is the most preferred implementation, both to accommodate sector write size and to reduce write amplification. The number of layers of each B + tree is not more than 4, so that the data recording requirement can be met by enabling one volume to correspond to a plurality of B + trees.
S103, inquiring a target leaf node corresponding to the logical address in the target B + tree.
In one embodiment, querying a target leaf node corresponding to a logical address in a target B + tree includes: the target B + tree is traversed to query the target leaf nodes.
In a specific embodiment, before querying a target leaf node corresponding to a logical address in a target B + tree, the method further includes: judging whether a target leaf node exists in the target B + tree or not; and if so, executing a step of inquiring a target leaf node corresponding to the logical address in the target B + tree. If the target B + tree does not have the target leaf node, judging the type of the metadata access request; if the metadata access request is a write request, creating a target leaf node in a target B + tree, storing the key value pair to the target leaf node, and writing the target leaf node into a disk; the key-value pair includes a logical address and a physical address corresponding to the logical address. And if the metadata access request is a read request, returning a prompt message that the data does not exist.
In a specific embodiment, after querying a target leaf node corresponding to a logical address in a target B + tree, the method further includes: and if the metadata access request is a read request, reading the physical address in the key value pair and returning.
Specifically, before querying a physical address in a target B + tree, firstly, whether a target leaf node exists in the target B + tree is judged; if yes, the key value pair corresponding to the logic address can be inquired and obtained from the target leaf node, and then whether the metadata access request is a write request or a read request is determined; if the metadata access request is a write request, the current metadata access request is indicated to be used for modifying the key value pair, and therefore after the physical address in the key value pair is modified, the target leaf node is written into the disk. If the metadata access request is a read request, the purpose of the current metadata access request is to read the physical address in the key value pair, so that the physical address in the key value pair is read and returned, and then the corresponding metadata can be read from a disk according to the physical address.
And S104, if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk.
And modifying the key value pair corresponding to the logical address in the target leaf node, namely modifying the physical address in the key value pair.
It should be noted that if it is determined that there is no target leaf node in the target B + tree, it is further determined whether the metadata access request is a write request or a read request; and if the request is a write request, indicating that the current metadata access request aims at creating a new leaf node, creating a target leaf node in the target B + tree, storing the key value pair to the target leaf node, and writing the target leaf node into a disk. If the request is a read request, a prompt message that the data does not exist is returned because the current target B + tree does not have the target leaf node. Wherein storing the key-value pair to the target leaf node comprises: and storing the physical address and the logical address to the target leaf node in the form of a key-value pair. The physical address corresponds to the logical address.
Therefore, after receiving the metadata access request, the embodiment of the application extracts the logical address from the metadata access request; then determining a target B + tree corresponding to the logic address; inquiring a target leaf node corresponding to the logic address in the target B + tree; and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk. And the number of the key value pairs stored on each node in the target B + tree is less than 512. Therefore, when the leaf nodes are written into the disk each time, the data volume needing to be written is reduced, so that the problem of write amplification can be relieved, the disk loss is reduced, the access performance and efficiency of metadata are improved, and the performance and efficiency of the whole storage system are improved.
Referring to fig. 2, fig. 2 is a flowchart of another metadata access method provided in this embodiment. As shown in fig. 2, when a request is queried, the metadata cache is accessed; if the metadata is found, returning a query result after the metadata is checked; and if the metadata is not found, inquiring the metadata in the SDD disc, and returning an inquiry result after checking the metadata. And then reading data from the lower layer of the storage system according to the query result.
It should be noted that the B + tree structure can improve the access efficiency of metadata. When the B + tree is used for accessing the metadata, the B + tree is traversed step by step until the leaf nodes, the search efficiency is better, and the method is more suitable for managing and organizing the metadata.
According to the method provided by the present application, a B + tree as shown in fig. 3 can be constructed. In fig. 3, the 0 th and 1 st levels are non-leaf nodes, and the 2 nd level is a leaf node. Each number in a node represents a PBA. Taking the nodes in layer 0 as an example, 8 and 15 are two different PBAs.
It should be noted that, although the data amount on the nodes in the B + tree is reduced in the present application, since the total data amount corresponding to one volume is not changed, one volume needs to correspond to a plurality of B + trees, that is, a plurality of root nodes. As shown in fig. 4, fig. 4 is a schematic diagram of a plurality of B + trees corresponding to one volume according to this embodiment. In fig. 3, the ROOT Address is the Address corresponding to the ROOT node, and occupies 8B. If each volume corresponds to M B + trees, then M-1 8B's are needed to store the address of the root node.
In this embodiment, the size of the data stored on each node in the B + tree is 512B, and since each key-value pair is 16B, 32 key-value pairs can be stored on one node. When any key-value pair on any node in the B + tree is changed, 512B data on the node is only required to be written on a disk, so that write amplification can be reduced, and the performance and efficiency of metadata operation are improved.
The data amount on each node in the B + tree is reduced, and the data mapping relation carried by the B + tree is also reduced, that is, the data amount that can be represented by the B + tree is also reduced. Therefore, a volume needs a plurality of corresponding B + trees to represent the data on the volume completely.
After receiving a metadata access request, extracting a logical address from the metadata access request; then determining a target B + tree corresponding to the logic address; inquiring a target leaf node corresponding to the logic address in the target B + tree; and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk. It can be seen that the data volume on each node is modified to 512B, and only 512B is needed to be written each time a certain key-value pair (16B) on the node is changed, thereby reducing write amplification. Meanwhile, in order to solve the problem that all data cannot be completely represented when the nodes become small, one volume corresponds to a plurality of B + trees, and each B + tree bears data with a certain capacity, so that all records of the data are realized. According to the embodiment, the access performance and efficiency of the metadata are improved, and the performance and efficiency of the whole storage system are improved.
In the following, a metadata access apparatus provided by an embodiment of the present application is introduced, and a metadata access apparatus described below and a metadata access method described above may be referred to each other.
Referring to fig. 5, an embodiment of the present application discloses a metadata access apparatus, including:
an extracting module 501, configured to extract a logical address from a metadata access request if the metadata access request is received;
a determining module 502, configured to determine a target B + tree corresponding to the logical address; the number of key value pairs stored on each node in the target B + tree is less than 512;
a query module 503, configured to query a target leaf node corresponding to the logical address in the target B + tree;
a modifying module 504, configured to modify, if the metadata access request is a write request, a key value pair corresponding to a logical address in a target leaf node according to the metadata access request, and write the modified target leaf node into a disk.
In a specific embodiment, the determining module is specifically configured to:
querying the first N bits of the logical address; and inquiring the identification information of all B + trees, and determining the B + trees with the identification information consistent with the first N bits as target B + trees.
In one embodiment, the query module is specifically configured to:
the target B + tree is traversed to query the target leaf nodes.
In a specific embodiment, the method further comprises the following steps:
the first judgment module is used for judging whether a target leaf node exists in a target B + tree or not;
and the execution module is used for executing the steps in the query module if the target leaf node exists in the target B + tree.
In a specific embodiment, the method further comprises the following steps:
the second judgment module is used for judging the type of the metadata access request if the target leaf node does not exist in the target B + tree;
the write request execution module is used for creating a target leaf node in the target B + tree if the metadata access request is a write request, storing the key value pair to the target leaf node, and writing the target leaf node into a disk; the key-value pair includes a logical address and a physical address corresponding to the logical address.
In a specific embodiment, the method further comprises the following steps:
and the first read request execution module is used for returning a prompt message that the data does not exist if the metadata access request is a read request.
In a specific embodiment, the method further comprises the following steps:
and the second read request execution module is used for reading the physical address in the key value pair and returning the physical address if the metadata access request is a read request.
For more specific working processes of each module and unit in this embodiment, reference may be made to corresponding contents disclosed in the foregoing embodiments, and details are not described here again.
Therefore, the embodiment provides a metadata access device, which can alleviate the problem of write amplification, reduce the loss of a disk, and improve the access performance and efficiency of metadata, thereby improving the performance and efficiency of the whole storage system.
In the following, a metadata access device provided in an embodiment of the present application is introduced, and a metadata access device described below and a metadata access method and apparatus described above may be referred to each other.
Referring to fig. 6, an embodiment of the present application discloses a metadata access device, including:
a memory 601 for storing a computer program;
a processor 602 for executing the computer program to implement the method disclosed in any of the embodiments above.
In the following, a readable storage medium provided by an embodiment of the present application is introduced, and a readable storage medium described below and a metadata access method, apparatus, and device described above may be referred to each other.
A readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the metadata access method disclosed in the foregoing embodiments. For the specific steps of the method, reference may be made to the corresponding contents disclosed in the foregoing embodiments, which are not described herein again.
References in this application to "first," "second," "third," "fourth," etc., if any, are intended to distinguish between similar elements and not necessarily to describe a particular order or sequence. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises" and "comprising," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, 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, or apparatus.
It should be noted that the descriptions in this application referring to "first", "second", etc. are for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In addition, technical solutions between various embodiments may be combined with each other, but must be realized by a person skilled in the art, and when the technical solutions are contradictory or cannot be realized, such a combination should not be considered to exist, and is not within the protection scope of the present application.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, Read Only Memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of readable storage medium known in the art.
The principle and the implementation of the present application are explained herein by applying specific examples, and the above description of the embodiments is only used to help understand the method and the core idea of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (10)
1. A metadata access method, comprising:
if a metadata access request is received, extracting a logic address from the metadata access request;
determining a target B + tree corresponding to the logical address; the number of key value pairs stored on each node in the target B + tree is less than 512;
inquiring a target leaf node corresponding to the logic address in the target B + tree;
and if the metadata access request is a write request, modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request, and writing the modified target leaf node into a disk.
2. The metadata access method according to claim 1, wherein the determining the target B + tree corresponding to the logical address comprises:
querying the first N bits of the logical address;
and inquiring the identification information of all B + trees, and determining the B + trees with the identification information consistent with the former N bits as the target B + trees.
3. The metadata access method according to claim 1, wherein the querying the target B + tree for the target leaf node corresponding to the logical address comprises:
and traversing the target B + tree to query the target leaf node.
4. The metadata access method according to claim 1, wherein before querying the target B + tree for the target leaf node corresponding to the logical address, further comprising:
judging whether the target leaf node exists in the target B + tree or not;
and if so, executing the step of inquiring the target leaf node corresponding to the logical address in the target B + tree.
5. The metadata access method of claim 4, further comprising:
if the target leaf node does not exist in the target B + tree, judging the type of the metadata access request;
if the metadata access request is a write request, creating the target leaf node in the target B + tree, storing the key value pair to the target leaf node, and writing the target leaf node into a disk; the key-value pair comprises the logical address and a physical address corresponding to the logical address.
6. The metadata access method of claim 5, further comprising:
and if the metadata access request is a read request, returning a prompt message that the data does not exist.
7. The metadata access method according to claim 1, wherein after querying the target B + tree for the target leaf node corresponding to the logical address, further comprising:
and if the metadata access request is a read request, reading the physical address in the key value pair and returning.
8. A metadata access apparatus, comprising:
the extraction module is used for extracting a logic address from the metadata access request if the metadata access request is received;
a determining module, configured to determine a target B + tree corresponding to the logical address; the number of key value pairs stored on each node in the target B + tree is less than 512;
the query module is used for querying a target leaf node corresponding to the logical address in the target B + tree;
and the modification module is used for modifying the key value pair corresponding to the logical address in the target leaf node according to the metadata access request if the metadata access request is a write request, and writing the modified target leaf node into a disk.
9. A metadata access device, comprising:
a memory for storing a computer program;
a processor for executing the computer program to implement the metadata access method of any of claims 1 to 7.
10. A readable storage medium for storing a computer program, wherein the computer program when executed by a processor implements the metadata access method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911332567.8A CN111125447A (en) | 2019-12-22 | 2019-12-22 | Metadata access method, device and equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911332567.8A CN111125447A (en) | 2019-12-22 | 2019-12-22 | Metadata access method, device and equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111125447A true CN111125447A (en) | 2020-05-08 |
Family
ID=70501336
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911332567.8A Withdrawn CN111125447A (en) | 2019-12-22 | 2019-12-22 | Metadata access method, device and equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111125447A (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111625192A (en) * | 2020-05-22 | 2020-09-04 | 浪潮电子信息产业股份有限公司 | Metadata object access method, device, equipment and medium |
| CN111625198A (en) * | 2020-05-28 | 2020-09-04 | 深圳佰维存储科技股份有限公司 | Metadata caching method and metadata caching device |
| CN111651424A (en) * | 2020-06-10 | 2020-09-11 | 中国科学院深圳先进技术研究院 | Data processing method and device, data node and storage medium |
| CN111858590A (en) * | 2020-07-16 | 2020-10-30 | 苏州浪潮智能科技有限公司 | Storage system metadata organization method, system, terminal and storage medium |
| CN111857600A (en) * | 2020-07-30 | 2020-10-30 | 江苏金恒信息科技股份有限公司 | Data reading and writing method and device |
| CN111881064A (en) * | 2020-07-24 | 2020-11-03 | 北京浪潮数据技术有限公司 | Method, device and equipment for processing access request in full flash memory storage system |
| CN112035380A (en) * | 2020-09-25 | 2020-12-04 | 苏州浪潮智能科技有限公司 | Data processing method, device and equipment and readable storage medium |
| CN113392040A (en) * | 2021-06-23 | 2021-09-14 | 锐捷网络股份有限公司 | Address mapping method, device and equipment |
| CN113867622A (en) * | 2021-08-20 | 2021-12-31 | 苏州浪潮智能科技有限公司 | Method, device and equipment for improving snapshot read-write speed and readable medium |
| CN113885789A (en) * | 2021-08-20 | 2022-01-04 | 苏州浪潮智能科技有限公司 | Method, system, device and medium for verifying data consistency after metadata repair |
| CN113901276A (en) * | 2021-09-30 | 2022-01-07 | 苏州浪潮智能科技有限公司 | Data management method, B + tree loading method, device and electronic equipment |
| CN114020525A (en) * | 2021-10-21 | 2022-02-08 | 苏州浪潮智能科技有限公司 | Fault isolation method, device, equipment and storage medium |
| CN114327270A (en) * | 2021-12-23 | 2022-04-12 | 郑州云海信息技术有限公司 | Request processing method, device, equipment and readable storage medium |
| CN114942963A (en) * | 2022-04-24 | 2022-08-26 | 阿里巴巴（中国）有限公司 | Data storage method, device, equipment and storage medium |
| CN115576956A (en) * | 2022-12-07 | 2023-01-06 | 苏州浪潮智能科技有限公司 | Data processing method, system, equipment and storage medium |
| CN115599704A (en) * | 2022-11-30 | 2023-01-13 | 湖南国科亿存信息科技有限公司（Cn） | File system metadata separate storage method and device and storage medium |
| CN116662019A (en) * | 2023-07-31 | 2023-08-29 | 苏州浪潮智能科技有限公司 | Request distribution method and device, storage medium and electronic device |
| CN116880780A (en) * | 2023-09-08 | 2023-10-13 | 合肥康芯威存储技术有限公司 | Tree data writing method, device, machine-readable medium and memory |
| WO2024152614A1 (en) * | 2023-01-19 | 2024-07-25 | 苏州元脑智能科技有限公司 | Data request method and apparatus, and device and non-volatile readable storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110022819A1 (en) * | 2009-07-24 | 2011-01-27 | Daniel Jeffrey Post | Index cache tree |
| CN103049390A (en) * | 2012-12-14 | 2013-04-17 | 华为技术有限公司 | Applied metadata processing method and storing system |
| CN109213445A (en) * | 2018-08-23 | 2019-01-15 | 郑州云海信息技术有限公司 | A kind of management method, management system and the relevant apparatus of storage system metadata |
| CN110532201A (en) * | 2019-08-23 | 2019-12-03 | 北京浪潮数据技术有限公司 | A kind of metadata processing method and device |
-
2019
- 2019-12-22 CN CN201911332567.8A patent/CN111125447A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110022819A1 (en) * | 2009-07-24 | 2011-01-27 | Daniel Jeffrey Post | Index cache tree |
| CN103049390A (en) * | 2012-12-14 | 2013-04-17 | 华为技术有限公司 | Applied metadata processing method and storing system |
| CN109213445A (en) * | 2018-08-23 | 2019-01-15 | 郑州云海信息技术有限公司 | A kind of management method, management system and the relevant apparatus of storage system metadata |
| CN110532201A (en) * | 2019-08-23 | 2019-12-03 | 北京浪潮数据技术有限公司 | A kind of metadata processing method and device |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111625192B (en) * | 2020-05-22 | 2022-07-05 | 浪潮电子信息产业股份有限公司 | Metadata object access method, device, equipment and medium |
| CN111625192A (en) * | 2020-05-22 | 2020-09-04 | 浪潮电子信息产业股份有限公司 | Metadata object access method, device, equipment and medium |
| CN111625198A (en) * | 2020-05-28 | 2020-09-04 | 深圳佰维存储科技股份有限公司 | Metadata caching method and metadata caching device |
| CN111651424A (en) * | 2020-06-10 | 2020-09-11 | 中国科学院深圳先进技术研究院 | Data processing method and device, data node and storage medium |
| CN111651424B (en) * | 2020-06-10 | 2024-05-03 | 中国科学院深圳先进技术研究院 | Data processing method, device, data node and storage medium |
| CN111858590A (en) * | 2020-07-16 | 2020-10-30 | 苏州浪潮智能科技有限公司 | Storage system metadata organization method, system, terminal and storage medium |
| CN111881064A (en) * | 2020-07-24 | 2020-11-03 | 北京浪潮数据技术有限公司 | Method, device and equipment for processing access request in full flash memory storage system |
| CN111857600A (en) * | 2020-07-30 | 2020-10-30 | 江苏金恒信息科技股份有限公司 | Data reading and writing method and device |
| CN111857600B (en) * | 2020-07-30 | 2024-04-16 | 江苏金恒信息科技股份有限公司 | Data reading and writing method and device |
| CN112035380A (en) * | 2020-09-25 | 2020-12-04 | 苏州浪潮智能科技有限公司 | Data processing method, device and equipment and readable storage medium |
| CN113392040A (en) * | 2021-06-23 | 2021-09-14 | 锐捷网络股份有限公司 | Address mapping method, device and equipment |
| CN113867622A (en) * | 2021-08-20 | 2021-12-31 | 苏州浪潮智能科技有限公司 | Method, device and equipment for improving snapshot read-write speed and readable medium |
| CN113885789A (en) * | 2021-08-20 | 2022-01-04 | 苏州浪潮智能科技有限公司 | Method, system, device and medium for verifying data consistency after metadata repair |
| CN113867622B (en) * | 2021-08-20 | 2023-08-18 | 苏州浪潮智能科技有限公司 | Method, device and equipment for improving snapshot read-write speed and readable medium |
| CN113885789B (en) * | 2021-08-20 | 2023-08-18 | 苏州浪潮智能科技有限公司 | Method, system, equipment and medium for checking data consistency after metadata repair |
| CN113901276A (en) * | 2021-09-30 | 2022-01-07 | 苏州浪潮智能科技有限公司 | Data management method, B + tree loading method, device and electronic equipment |
| CN114020525B (en) * | 2021-10-21 | 2024-04-19 | 苏州浪潮智能科技有限公司 | Fault isolation method, device, equipment and storage medium |
| CN114020525A (en) * | 2021-10-21 | 2022-02-08 | 苏州浪潮智能科技有限公司 | Fault isolation method, device, equipment and storage medium |
| CN114327270B (en) * | 2021-12-23 | 2023-09-15 | 郑州云海信息技术有限公司 | Request processing method, device, equipment and readable storage medium |
| WO2023116109A1 (en) * | 2021-12-23 | 2023-06-29 | 郑州云海信息技术有限公司 | Request processing method and apparatus, and device and non-volatile readable storage medium |
| CN114327270A (en) * | 2021-12-23 | 2022-04-12 | 郑州云海信息技术有限公司 | Request processing method, device, equipment and readable storage medium |
| CN114942963A (en) * | 2022-04-24 | 2022-08-26 | 阿里巴巴（中国）有限公司 | Data storage method, device, equipment and storage medium |
| CN114942963B (en) * | 2022-04-24 | 2024-08-09 | 阿里巴巴（中国）有限公司 | Data storage method, device, equipment and storage medium |
| CN115599704A (en) * | 2022-11-30 | 2023-01-13 | 湖南国科亿存信息科技有限公司（Cn） | File system metadata separate storage method and device and storage medium |
| CN115576956B (en) * | 2022-12-07 | 2023-03-10 | 苏州浪潮智能科技有限公司 | Data processing method, system, equipment and storage medium |
| CN115576956A (en) * | 2022-12-07 | 2023-01-06 | 苏州浪潮智能科技有限公司 | Data processing method, system, equipment and storage medium |
| WO2024119797A1 (en) * | 2022-12-07 | 2024-06-13 | 苏州元脑智能科技有限公司 | Data processing method and system, device, and storage medium |
| WO2024152614A1 (en) * | 2023-01-19 | 2024-07-25 | 苏州元脑智能科技有限公司 | Data request method and apparatus, and device and non-volatile readable storage medium |
| CN116662019A (en) * | 2023-07-31 | 2023-08-29 | 苏州浪潮智能科技有限公司 | Request distribution method and device, storage medium and electronic device |
| CN116662019B (en) * | 2023-07-31 | 2023-11-03 | 苏州浪潮智能科技有限公司 | Request distribution method and device, storage medium and electronic device |
| CN116880780A (en) * | 2023-09-08 | 2023-10-13 | 合肥康芯威存储技术有限公司 | Tree data writing method, device, machine-readable medium and memory |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111125447A (en) | Metadata access method, device and equipment and readable storage medium | |
| US11068455B2 (en) | Mapper tree with super leaf nodes | |
| US7761648B2 (en) | Caching method for NAND flash translation layer | |
| US9298384B2 (en) | Method and device for storing data in a flash memory using address mapping for supporting various block sizes | |
| KR101077904B1 (en) | Apparatus and method for managing flash memory using page level mapping algorithm | |
| CN111309258B (en) | B + tree access method and device and computer readable storage medium | |
| US20070094440A1 (en) | Enhanced data access in a storage device | |
| JP2015515047A5 (en) | ||
| WO2015096698A1 (en) | Data writing and reading methods for flash | |
| US10552335B2 (en) | Method and electronic device for a mapping table in a solid-state memory | |
| CN109976669B (en) | Edge storage method, device and storage medium | |
| CN113641629A (en) | File writing and reading method of FLASH memory | |
| CN113835639B (en) | I/O request processing method, device, equipment and readable storage medium | |
| CN115712500A (en) | Memory release method, memory recovery method, memory release device, memory recovery device, computer equipment and storage medium | |
| KR20230026946A (en) | Key value storage device with hashing | |
| TW201826125A (en) | Memory control scheme for flash memory device | |
| CN111190835B (en) | Data writing method, device, equipment and medium | |
| US7185020B2 (en) | Generating one or more block addresses based on an identifier of a hierarchical data structure | |
| CN115437579B (en) | Metadata management method and device, computer equipment and readable storage medium | |
| KR100977709B1 (en) | A flash memory storage device and a manage method using the same | |
| CN108304331B (en) | NorFlash-based circular queue type data storage method and device | |
| CN112015672A (en) | Data processing method, device, equipment and storage medium in storage system | |
| CN111881064A (en) | Method, device and equipment for processing access request in full flash memory storage system | |
| CN107329903B (en) | Memory garbage recycling method and system | |
| CN113703671B (en) | Data block erasing method and related device |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200508 |
|
| WW01 | Invention patent application withdrawn after publication |