Method, device, equipment and computer-readable storage medium for positioning reconstructed data
By storing the downgraded data of the data object to be stored in a distributed storage system to the storage medium and memory that is not offline, and using linked list marks to determine the data object that needs to be reconstructed when the target storage medium is re-on, the problem of rapid positioning and reconstructing data after storage medium failure recovery is solved, and the efficiency of data consistency recovery is improved.
Patent Information
- Application Number
- CN202311693319.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-12-08
- Publication Date
- 2025-03-21
- Estimated Expiration
- 2043-12-08
AI Technical Summary
In distributed storage systems, after the storage medium fails to recover, how to quickly locate the data that needs to be reconstructed and ensure the consistency of data between each replica is an urgent problem.
By determining that any storage medium corresponding to the data object to be stored is offline, the data object is determined to be a downgraded data object, and it is stored in a storage medium that is not offline and stored in memory in the form of a linked list. When the target storage medium is re-on and the linked list is marked as valid, it is determined that the data object that has a corresponding relationship with the target storage medium among the degraded data objects stored in the memory is the data object that needs to be reconstructed.
This method avoids the time-consuming scanning of data objects and calculating reconstruction information when the number of non-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-re-
Smart Images

Figure CN117591032B_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of distributed storage, and in particular to a method, device, equipment and computer-readable storage medium for locating reconstructed data. Background Art
[0002] At present, distributed storage systems usually use replicas to ensure the reliability of user data and the availability of storage systems. In actual production, storage media will inevitably experience temporary failures due to online upgrades, disk plugging and unplugging, network interruptions, or temporary power outages. Therefore, after the storage medium fails, how to quickly locate the data that needs to be reconstructed and ensure the consistency of data between replicas is a technical problem that needs to be solved urgently.
[0003] In the related art, after the storage medium fails and is restored and reconnected to the system, all data objects on the current non-reconnected replica are scanned, and each data object is indiscriminately calculated to determine whether it is mapped to the reconnected storage medium, thereby determining whether the data object needs reconstruction information. However, when the number of non-reconnected replicas is huge, it takes a long time to scan the data objects and calculate the reconstruction information, resulting in an inability to quickly determine the data objects that need to be reconstructed. Summary of the invention
[0004] The present application provides a method, device, equipment and computer-readable storage medium for locating reconstructed data, which can solve the technical problem in the prior art that it is impossible to quickly determine the data objects that need to be reconstructed.
[0005] In a first aspect, an embodiment of the present application provides a method for locating reconstructed data, the method for locating reconstructed data comprising:
[0006] When any storage medium corresponding to the data object to be stored is offline, determining the data object to be stored is a degraded data object, and determining the offline storage medium as a target storage medium;
[0007] Storing the degraded data object in a storage medium that is not offline and in a memory in a linked list form;
[0008] When the target storage medium is back online and the mark of the linked list is valid, it is determined that the degraded data objects in the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are data objects that need to be reconstructed.
[0009] In combination with the first aspect, in one implementation, the method for locating reconstructed data includes:
[0010] When the target storage medium comes back online, if the number of the degraded data objects stored in the memory is less than a preset number, the mark of the linked list is determined to be valid.
[0011] In combination with the first aspect, in one implementation, the method for locating reconstructed data includes:
[0012] When the target storage medium is back online, determining whether there is a target degraded data object in the storage medium that has not been offline, the storage time of the target degraded data object is after the second moment, the time difference between the second moment and the first moment is a preset time difference, and the first moment is the moment when the degraded data object is first stored in the memory;
[0013] If not, the mark of the linked list is determined to be valid.
[0014] In combination with the first aspect, in one implementation, the step of determining that the degraded data objects stored in the memory and having a corresponding relationship with the target storage medium are data objects that need to be reconstructed includes:
[0015] Determine, by a routing algorithm, whether there is a degraded data object having a corresponding relationship with the target storage medium among the degraded data objects stored in the memory;
[0016] If so, the degraded data object having a corresponding relationship with the target storage medium is determined as the data object that needs to be reconstructed.
[0017] In combination with the first aspect, in one implementation, the method for locating reconstructed data includes:
[0018] When the data reconstruction is completed, the degraded data objects in the memory are cleared.
[0019] In a second aspect, an embodiment of the present application provides a device for locating reconstructed data, the device for locating reconstructed data comprising:
[0020] A first determination module, configured to determine, when any storage medium corresponding to the data object to be stored is offline, that the data object to be stored is a degraded data object, and to determine the offline storage medium as a target storage medium;
[0021] A storage module, used for storing the degraded data object in a non-offline storage medium and in a memory in a linked list form;
[0022] The second determination module is used to determine that the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are data objects that need to be reconstructed when the target storage medium is back online and the mark of the linked list is valid.
[0023] In conjunction with the second aspect, in one implementation, the second determining module is further configured to:
[0024] When the target storage medium comes back online, if the number of the degraded data objects stored in the memory is less than a preset number, the mark of the linked list is determined to be valid.
[0025] In conjunction with the second aspect, in one implementation, the second determining module is further configured to:
[0026] When the target storage medium is back online, determining whether there is a target degraded data object in the storage medium that has not been offline, the storage time of the target degraded data object is after the second moment, the time difference between the second moment and the first moment is a preset time difference, and the first moment is the moment when the degraded data object is first stored in the memory;
[0027] If not, the mark of the linked list is determined to be valid.
[0028] In a third aspect, an embodiment of the present application provides a device for locating reconstructed data, the device for locating reconstructed data comprising a processor, a memory, and a reconstructed data locating program stored in the memory and executable by the processor, wherein when the reconstructed data locating program is executed by the processor, the steps of the reconstructed data locating method as described above are implemented.
[0029] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a program for locating reconstructed data is stored, wherein when the program for locating reconstructed data is executed by a processor, the steps of the method for locating reconstructed data as described above are implemented.
[0030] The beneficial effects brought by the technical solution provided in the embodiments of the present application include:
[0031] When any storage medium corresponding to the data object to be stored is offline, determining that the data object to be stored is a degraded data object and determining the offline storage medium as the target storage medium; storing the degraded data object in a storage medium that is not offline and in a memory in the form of a linked list; when the target storage medium is back online and the mark of the linked list is valid, determining that the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are data objects that need to be reconstructed, and there is no need to scan all data objects on the current non-re-online replica, which solves the problem in the related art that when the number of non-re-online replicas is huge, it takes a long time to scan the data objects and calculate the reconstruction information, resulting in the inability to quickly determine the data objects that need to be reconstructed. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Figure 1 A schematic diagram of the flow chart of the first embodiment of the positioning method for reconstructing data of the present application;
[0033] Figure 2 A schematic diagram of a flow chart of a second embodiment of a method for positioning reconstructed data of the present application;
[0034] Figure 3 A schematic diagram of a flow chart of a third embodiment of a method for positioning reconstructed data of the present application;
[0035] Figure 4 A schematic diagram of functional modules of an embodiment of a positioning device for reconstructing data according to the present application;
[0036] Figure 5 This is a schematic diagram of the hardware structure of a positioning device for reconstructing data involved in an embodiment of the present application. DETAILED DESCRIPTION
[0037] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0038] In order to make the objectives, technical solutions and advantages of the present application clearer, the implementation methods of the present application will be described in detail below with reference to the accompanying drawings.
[0039] In a first aspect, an embodiment of the present application provides a method for locating reconstructed data.
[0040] In one embodiment, referring to Figure 1 , Figure 1 This is a flow chart of the first embodiment of the method for reconstructing data positioning in this application. Figure 1 As shown, the positioning method of reconstructing data includes:
[0041] Step S10, when any storage medium corresponding to the data object to be stored is offline, determining the data object to be stored is a degraded data object, and determining the offline storage medium as the target storage medium;
[0042] In this embodiment, the storage medium corresponding to the data object to be stored is obtained through a routing algorithm, and it is detected whether there is an offline storage medium in the storage medium corresponding to the data object to be stored. When any storage medium corresponding to the data object to be stored is offline, the data object to be stored is determined to be a degraded data object, and the offline storage medium is determined to be the target storage medium. Specifically, taking object1 and object2 as examples of the data to be stored, if the storage media corresponding to the data object1 to be stored are storage medium A, storage medium B, and storage medium C, respectively, and storage medium A is offline, if the storage media corresponding to the data object2 to be stored are storage medium B and storage medium D, respectively, then the data object1 to be stored is determined to be a degraded data object, and the offline storage medium A is determined to be the target storage medium.
[0043] Step S20, storing the degraded data object in a storage medium that is not offline and in a memory in a linked list form;
[0044] In this embodiment, the degraded data object object1 is stored in the storage medium that is not offline, that is, the storage medium B and the storage medium C, and the degraded data object object1 is also stored in the memory in the form of a linked list. Further, it is easy to think that the storage medium corresponding to the data object2 to be stored is not offline, so the data object2 to be stored will be stored in the corresponding storage medium B and storage medium D. And the data object2 to be stored will not be stored in the memory as a degraded data object in the form of a linked list.
[0045] Step S30: When the target storage medium is back online and the mark of the linked list is valid, it is determined that the degraded data objects in the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are data objects that need to be reconstructed.
[0046] In this embodiment, when the target storage medium is back online and the mark of the linked list is valid, the degraded data objects that have a corresponding relationship with the target storage medium can be screened from the degraded data objects stored in the memory, and the degraded data objects that have a corresponding relationship with the target storage medium are determined to be data objects that need to be reconstructed. It is not necessary to scan all data objects on the current non-re-online replica, which solves the problem that when the number of non-re-online replicas is huge, it will take a long time to scan the data objects and calculate the reconstruction information, resulting in the inability to quickly determine the data objects that need to be reconstructed.
[0047] Furthermore, when the target storage medium is back online but the linked list is marked as invalid, all objects on the current storage medium that has not been offline are scanned, and the degraded data object is calculated indiscriminately based on the current linked list structure to see whether it is mapped to the reconnected storage medium, that is, the reconstruction information required by the object, and then the degraded data object mapped to the reconnected storage medium is used for data reconstruction.
[0048] In the present embodiment, when any storage medium corresponding to the data object to be stored is offline, it is determined that the data object to be stored is a degraded data object, and the offline storage medium is determined to be the target storage medium; the degraded data object is stored in a storage medium that is not offline and in a memory in the form of a linked list; when the target storage medium is back online and the mark of the linked list is valid, the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are determined to be data objects that need to be reconstructed, and there is no need to scan all data objects on the current non-re-online replica, which solves the problem in the related art that when the number of non-re-online replicas is huge, it takes a long time to scan the data objects and calculate the reconstruction information, resulting in an inability to quickly determine the data objects that need to be reconstructed.
[0049] Further, in one embodiment, referring to Figure 2 , Figure 2 This is a flow chart of the second embodiment of the method for positioning reconstructed data of the present application. Figure 2 As shown, the positioning method of the reconstructed data includes:
[0050] Step S40, when the target storage medium is back online, if the number of the degraded data objects stored in the memory is less than a preset number, then determining that the mark of the linked list is valid.
[0051] In this embodiment, when the target storage medium comes back online, if the number of degraded data objects stored in the memory is less than the preset number, it means that before the target storage medium comes online, the linked list in the memory will not be unable to store degraded data objects because the stored degraded data objects are equal to the preset number, resulting in missing degraded data objects stored in the linked list. That is, during the period when the target storage medium is offline, all degraded data objects are stored in the memory in the form of a linked list. Therefore, the mark of the linked list that determines the storage of degraded data objects in the memory is valid.
[0052] Further, in one embodiment, referring to Figure 3 , Figure 3 This is a flow chart of the third embodiment of the method for reconstructing data positioning in this application. Figure 3 As shown, the positioning method of the reconstructed data includes:
[0053] Step S50, when the target storage medium is back online, determining whether there is a target degraded data object in the storage medium that has not been offline, the storage time of the target degraded data object is after the second moment, the time difference between the second moment and the first moment is a preset time difference, and the first moment is the moment when the degraded data object is first stored in the memory;
[0054] Step S60: If not, determine that the mark of the linked list is valid.
[0055] In this embodiment, when the target storage medium is back online, it is determined whether there is a target degraded data object in the storage medium that has not been offline. Specifically, taking the target storage medium as storage medium A, and the storage mediums that have not been offline as storage medium B and storage medium C as an example, if the first time when the degraded data object is first stored in the memory is 8:00, the preset time difference is 10 minutes, and the second time is 8:10, it is determined whether there is a target degraded data object stored after 8:10 in storage medium B and storage medium C.
[0056] If it does not exist, it means that during the period when the target storage medium is offline, all degraded data objects are stored in the memory in the form of a linked list. Therefore, it is determined that the mark of the linked list storing the degraded data objects in the memory is valid.
[0057] If there is a target degraded data object stored after 8:10 in the storage medium that has not been offline, since the linked list can no longer store degraded data objects after 8:10, the target degraded data objects stored in the storage medium that has not been offline after 8:10 are not stored in the linked list, that is, the degraded data objects stored in the linked list are missing. Therefore, if there is a target degraded data object stored after 8:10 in the storage medium that has not been offline, the mark of the linked list is determined to be invalid.
[0058] Furthermore, in one embodiment, the step of determining that the degraded data objects stored in the memory and having a corresponding relationship with the target storage medium are data objects that need to be reconstructed includes:
[0059] Determine, by a routing algorithm, whether there is a degraded data object having a corresponding relationship with the target storage medium among the degraded data objects stored in the memory;
[0060] If so, the degraded data object having a corresponding relationship with the target storage medium is determined as the data object that needs to be reconstructed.
[0061] In this embodiment, a routing algorithm is used to determine whether there is a degraded data object with a corresponding relationship with the target storage medium among the degraded data objects stored in the memory. Specifically, taking the degraded data objects stored in the memory including object1 and object3, and the target storage medium being storage medium A as an example, since the storage media corresponding to the degraded data object object1 are storage medium A, storage medium B and storage medium C, and the storage media corresponding to the degraded data object object3 are storage medium X and storage medium Y, it is determined that there is a degraded data object with a corresponding relationship with the target storage medium among the degraded data objects stored in the memory, that is, the degraded object object1, and then the degraded data object object1 with a corresponding relationship with the target storage medium is determined to be the data object that needs to be reconstructed. It is easy to think that if the mark of the linked list is valid, then the target storage medium must be one or more of storage medium A, storage medium B, storage medium C, storage medium X and storage medium Y. It should be noted that the step numbers of the steps in the embodiment of the present application do not limit the order of the operations in the technical solution of the present application.
[0062] Furthermore, in one embodiment, the method for locating the reconstructed data includes:
[0063] When the data reconstruction is completed, the degraded data objects in the memory are cleared.
[0064] In this embodiment, after the data reconstruction is completed, it is necessary to clear the degraded data objects in the memory to reduce the memory usage. It is easy to imagine that the degraded data objects to be cleared are the data objects after the data reconstruction is completed.
[0065] In a second aspect, an embodiment of the present application also provides a positioning device for reconstructing data.
[0066] In one embodiment, referring to Figure 4 , Figure 4 This is a functional module diagram of an embodiment of a positioning device for reconstructing data in the present application. Figure 4 As shown, the positioning device for reconstructing data includes:
[0067] A first determination module 10 is used to determine that the data object to be stored is a degraded data object and determine the offline storage medium as a target storage medium when any storage medium corresponding to the data object to be stored is offline;
[0068] A storage module 20, used to store the degraded data object in a non-offline storage medium and in a memory in a linked list form;
[0069] The second determination module 30 is used to determine that the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are data objects that need to be reconstructed when the target storage medium is back online and the mark of the linked list is valid.
[0070] Furthermore, in one embodiment, the positioning device for reconstructing data further includes a new module for:
[0071] When the target storage medium comes back online, if the number of the degraded data objects stored in the memory is less than a preset number, the mark of the linked list is determined to be valid.
[0072] Furthermore, in one embodiment, the positioning device for reconstructing data further includes a new module for:
[0073] When the target storage medium is back online, determining whether there is a target degraded data object in the storage medium that has not been offline, the storage time of the target degraded data object is after the second moment, the time difference between the second moment and the first moment is a preset time difference, and the first moment is the moment when the degraded data object is first stored in the memory;
[0074] If not, the mark of the linked list is determined to be valid.
[0075] Furthermore, in one embodiment, the second determining module 30 is configured to:
[0076] Determine, by a routing algorithm, whether there is a degraded data object having a corresponding relationship with the target storage medium among the degraded data objects stored in the memory;
[0077] If so, the degraded data object having a corresponding relationship with the target storage medium is determined as the data object that needs to be reconstructed.
[0078] Furthermore, in one embodiment, the positioning device for reconstructing data further includes a new module for:
[0079] When the data reconstruction is completed, the degraded data objects in the memory are cleared.
[0080] The functional implementation of each module in the above-mentioned data reconstructing positioning device corresponds to each step in the above-mentioned data reconstructing positioning method embodiment, and its functions and implementation processes are not described one by one here.
[0081] In a third aspect, an embodiment of the present application provides a data reconstructing positioning device, which may be a personal computer (PC), a laptop computer, a server, or other device having a data processing function.
[0082] Reference Figure 5, Figure 5 Schematic diagram of the hardware structure of the data reconstructing positioning device involved in the embodiment of the present application. In the embodiment of the present application, the data reconstructing positioning device may include a processor, a memory, a communication interface and a communication bus.
[0083] The communication bus may be of any type and is used to interconnect the processor, the memory, and the communication interface.
[0084] The communication interface includes input / output (I / O) interface, physical interface and logical interface, etc., which are used to realize the interconnection of devices inside the positioning device for reconstructing data, and the interface used to realize the interconnection between the positioning device for reconstructing data and other devices (such as other computing devices or user devices). The physical interface can be an Ethernet interface, a fiber optic interface, an ATM interface, etc.; the user device can be a display, a keyboard, etc.
[0085] The memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), etc.
[0086] The processor may be a general-purpose processor, and the general-purpose processor may call the positioning program of the reconstructed data stored in the memory, and execute the positioning method of the reconstructed data provided in the embodiment of the present application. For example, the general-purpose processor may be a central processing unit (CPU). The method executed when the positioning program of the reconstructed data is called may refer to the various embodiments of the positioning method of the reconstructed data of the present application, and will not be repeated here.
[0087] Those skilled in the art will understand that Figure 5 The hardware structure shown in the figure does not constitute a limitation on the present application, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.
[0088] In a fourth aspect, an embodiment of the present application also provides a computer-readable storage medium.
[0089] The computer-readable storage medium of the present application stores a reconstructed data positioning program, wherein when the reconstructed data positioning program is executed by a processor, the steps of the reconstructed data positioning method as described above are implemented.
[0090] Among them, the method implemented when the reconstructed data positioning program is executed can refer to the various embodiments of the reconstructed data positioning method of the present application, and will not be repeated here.
[0091] It should be noted that the serial numbers of the above-mentioned embodiments of the present application are only for description and do not represent the advantages or disadvantages of the embodiments.
[0092] The terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned drawings are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices. The terms "first", "second" and "third" are used to distinguish different objects, etc., and do not represent a sequence, nor do they limit "first", "second" and "third" to different types.
[0093] In the description of the embodiments of the present application, "exemplary", "for example" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary", "for example" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary", "for example" or "for example" is intended to present related concepts in a specific way.
[0094] In the description of the embodiments of the present application, unless otherwise specified, “ / ” means or, for example, A / B can mean A or B; the “and / or” in the text is merely a description of the association relationship of associated objects, indicating that three relationships may exist, for example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. In addition, in the description of the embodiments of the present application, “multiple” refers to two or more than two.
[0095] In some processes described in the embodiments of the present application, multiple operations or steps that appear in a specific order are included, but it should be understood that these operations or steps may not be executed in the order in which they appear in the embodiments of the present application or in parallel, and the sequence number of the operation is only used to distinguish the different operations, and the sequence number itself does not represent any execution order. In addition, these processes may include more or fewer operations, and these operations or steps may be executed in sequence or in parallel, and these operations or steps may be combined.
[0096] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, disk, CD) as described above, and includes a number of instructions for a terminal device to execute the methods described in each embodiment of the present application.
[0097] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.
Claims
1. A method for positioning reconstructed data, characterized in that: The method for locating the reconstructed data includes: When any storage medium corresponding to the data object to be stored is offline, determining the data object to be stored is a degraded data object, and determining the offline storage medium as a target storage medium; Storing the degraded data object in a storage medium that is not offline and in a memory in a linked list form; When the target storage medium is back online and the mark of the linked list is valid, determining that the degraded data objects in the degraded data objects stored in the memory and having a corresponding relationship with the target storage medium are data objects that need to be reconstructed; The method for locating the reconstructed data includes: When the target storage medium is back online, determining whether there is a target degraded data object in the storage medium that has not been offline, the storage time of the target degraded data object is after the second moment, the time difference between the second moment and the first moment is a preset time difference, and the first moment is the moment when the degraded data object is first stored in the memory; If not, the mark of the linked list is determined to be valid.
2. The method for locating reconstructed data according to claim 1, characterized in that: The method for locating the reconstructed data includes: When the target storage medium comes back online, if the number of the degraded data objects stored in the memory is less than a preset number, the mark of the linked list is determined to be valid.
3. The method for locating reconstructed data according to claim 1, characterized in that: The step of determining that the degraded data objects stored in the memory and having a corresponding relationship with the target storage medium are data objects that need to be reconstructed includes: Determine, by a routing algorithm, whether there is a degraded data object having a corresponding relationship with the target storage medium among the degraded data objects stored in the memory; If so, the degraded data object having a corresponding relationship with the target storage medium is determined as the data object that needs to be reconstructed.
4. The method for locating reconstructed data according to claim 1, characterized in that: The method for locating the reconstructed data includes: When the data reconstruction is completed, the degraded data objects in the memory are cleared.
5. A positioning device for reconstructing data, characterized in that: The positioning device for reconstructing data comprises: A first determination module, configured to determine, when any storage medium corresponding to the data object to be stored is offline, that the data object to be stored is a degraded data object, and to determine the offline storage medium as a target storage medium; A storage module, used for storing the degraded data object in a non-offline storage medium and in a memory in a linked list form; A second determination module is used to determine, when the target storage medium is back online and the mark of the linked list is valid, that the degraded data objects stored in the memory that have a corresponding relationship with the target storage medium are data objects that need to be reconstructed; The second determining module is further used for: When the target storage medium is back online, determining whether there is a target degraded data object in the storage medium that has not been offline, the storage time of the target degraded data object is after the second moment, the time difference between the second moment and the first moment is a preset time difference, and the first moment is the moment when the degraded data object is first stored in the memory; If not, the mark of the linked list is determined to be valid.
6. The positioning device for reconstructing data according to claim 5, characterized in that: The second determining module is further used for: When the target storage medium comes back online, if the number of the degraded data objects stored in the memory is less than a preset number, the mark of the linked list is determined to be valid.
7. A positioning device for reconstructing data, characterized in that: The reconstructed data positioning device includes a processor, a memory, and a reconstructed data positioning program stored in the memory and executable by the processor, wherein when the reconstructed data positioning program is executed by the processor, the steps of the reconstructed data positioning method as described in any one of claims 1 to 4 are implemented.
8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a reconstructed data positioning program, wherein when the reconstructed data positioning program is executed by a processor, the steps of the reconstructed data positioning method according to any one of claims 1 to 4 are implemented.
Citation Information
Patent Citations
Transferring data of a dispersed storage network
US20140019579A1