Abstract: The invention discloses an integrated detection method of electromagnetic searching, locating and tracking for subsea cables. After being launched into water, the cable-tracking AUV carries out primary Z-shaped reciprocating sailing to search the electromagnetic signal of the target subsea cable, when the electromagnetic signal reaches a preset threshold value, the AUV executes the cable-tracking detection. In the tracking process, if the target electromagnetic signal intensity is lower than the preset threshold, it is determined that subsea cable tracking is lost. At this time, the secondary Z-shaped cable-researching route planning and tracking are performed based on the lost point. In the process that the AUV autonomously tracks and detects the subsea cable, relative locating between AUV and subsea cable is performed based on the electromagnetic signal radiated by the subsea cable, and autonomous tracking control under the guidance of the electromagnetic locating signal is performed.

Abstract: The present disclosure provides a herbicide composition and a preparation method and an application method thereof, and relates to the technical field of herbicides. The herbicide composition includes pinoxaden and a cyclic lactone compound. The cyclic lactone compound is five-membered cyclic lactone and/or six-membered cyclic lactone. The herbicide composition solves the technical problems of poor chemical stability and precipitation due to crystallization at low temperature of existing pinoxaden emulsifiable concentrate formulations. In the herbicide composition, the cyclic lactone compound is used in combination with the pinoxaden, such that not only the solubility of the pinoxaden is improved, but also a chemical stabilization effect of the pinoxaden is effectively improved, and the problems of precipitation due to crystallization at low temperature and chemical stability of the pinoxaden emulsifiable concentrate formulations are solved.

Abstract: A method includes creating a deduplicated universal share (US) of data objects, which in turn includes receiving a US of the data objects, deduplicating the US, wherein deduplicating the US includes: hashing segments of the US to generate respective US segment fingerprints; comparing US segment fingerprints to fingerprints for respective segments held in deduplication storage in order to identify segments in the deduplication storage that equate to the US segments, respectively, of the US; storing identifiers that directly or indirectly identify locations, respectively, of the segments, respectively, in the deduplication storage that equate to the US segments, respectively, of the US. After creating the deduplicated universal share, a deduplicated backup of the US is created without reassembling the US from segments held in the deduplication storage, the creating the deduplicated backup including: creating a list that comprises copies of the stored identifiers, and storing the list.

Abstract: Disclosed are techniques that provide for deduplication in an efficient and effective manner. For example, such methods, computer program products, and computer systems can include generating new feature information for one or more portions of a new backup image, generating first container range information by performing a container range calculation using the new feature information, generating existing feature information for one or more portions of an existing backup image, generating second container range information by performing the container range calculation using the existing feature information, determining a container range affinity between the first container range information and the second container range information, identifying at least one portion of the one or more portions of the existing backup image using a result of the determining, and prefetching the one or more fingerprints corresponding to the at least one portion of the one or more portions of the existing backup image.

Abstract: Methods, computer program products, computer systems, and the like for efficient metadata management are disclosed, which can include determining whether a change in a status of data has occurred. In response to a determination that the change has occurred, such methods, computer program products, and computer systems can include determining whether a move condition has been met, and, in response to a determination that the move condition has been met, moving the metadata from the first storage unit to a second storage unit.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for scalable deduplication. Such methods, computer program products, and computer systems can include, in response to receiving a request to perform a lookup operation, performing the lookup operation and, in response to the signature not being found, forwarding the request to a remote node. Further, in response to receiving an indication that the signature was not found at the remote node, processing the subunit of data as a unique subunit of data.

Abstract: Disclosed are techniques that provide for deduplication in an efficient and effective manner. For example, such methods, computer program products, and computer systems can include retrieving container information for a first one or more containers of a plurality of containers of one or more backup images (where the one or more backup images were produced under an existing backup policy), generating pre-processed container information (where the generating the pre-processed container information comprises performing data pre-processing on the container information), determining a plurality of container ranges for the first one or more containers, generating container range affinity information for the one or more backup images (where the generating the container range affinity information comprises performing a container range operation using the plurality of container ranges, and storing the container range affinity information in a container range data structure.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for scalable deduplication in an efficient and effective manner. For example, such methods, computer program products, and computer systems can include receiving a data object at an assigned node, determining whether the data object includes a sub-data object, and processing the sub-data object. The assigned node is a node of a plurality of nodes of a cluster, where the data object includes a data segment, and a signature. The signature is generated based, at least in part, on data of the data segment. The processing includes sending the sub-data object to a remote node. The remote node is another node of the plurality of nodes of the cluster.

Abstract: Methods, computer program products, and computer systems for the management of data references in an efficient and effective manner are disclosed. Such methods, computer program products, and computer systems include receiving a change tracking stream at the computer system, identifying a data object group, and performing a deduplication management operation on the data object group. The change tracking stream is received from a client computing system. The change tracking stream identifies one or more changes made to a plurality of data objects of the client computing system. The identifying is based, at least in part, on at least a portion of the change tracking stream. The data object group represents the plurality of data objects.

Abstract: Methods, computer program products, and computer systems for the management of data references in an efficient and effective manner are disclosed. Such methods, computer program products, and computer systems include receiving a change tracking stream at the computer system, identifying a data object group, and performing a deduplication management operation on the data object group. The change tracking stream is received from a client computing system. The change tracking stream identifies one or more changes made to a plurality of data objects of the client computing system. The identifying is based, at least in part, on at least a portion of the change tracking stream. The data object group represents the plurality of data objects.

Abstract: Methods, computer program products, computer systems, and the like for efficient metadata management are disclosed, which can include receiving a subunit of storage, storing a first metadata portion of the subunit of storage in a first unit of storage, and storing a second metadata portion of the subunit of storage in a second unit of storage.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for improved write performance in erasure-coded storage systems in an efficient and effective manner. These can include identifying a data segment, identifying metadata, persisting the data segment to a storage system, storing the metadata in the journal, and persisting the metadata to the storage system. In such embodiments, the metadata is associated with the data segment by virtue of the metadata comprising a fingerprint of the data segment. Further, in such embodiments, the persisting the data segment to the storage system is performed without storing the data segment in a journal, and the storage system is an erasure-coded storage system.

Abstract: Systems and methods for processing data segments are disclosed. In one embodiment, such functionality includes buffering data received from a node (where the data is stored in a buffer as buffered data, an offset value is associated with the data, and a segment size is associated with the buffer), and determining whether the offset value is an integer multiple of the segment size. In response to determination that the offset value is an integer multiple of the segment size, processing the data in the buffer as a segment. Such functionality also includes determining whether the segment is a duplicate of data stored in a deduplicated data store and, in response to a determination that the segment is not a duplicate of data stored in the deduplicated data store, storing the segment in the deduplicated data store.

Abstract: Disclosed herein are systems, methods, and processes to perform replication between heterogeneous storage systems. In one embodiment, a request to perform a replication operation is sent by a target server to a source server, where the target server and the source server use different protocols to store data. A plurality of instructions, which are associated with a replication stream, are received from the source server by the target server, where the plurality of instructions comprise an include instruction to include existing data and a write instruction to write new data. A replication stream, which is associated with a backup stream stored on the source server, is also received from the source server, where the replication stream and the backup stream share a common format. The target server synthesizes a new replicated backup image, where the synthesizing comprises performing the include instruction and the write instruction on the replication stream.

Abstract: A method, computer program product, computer system, and the like that provide for the efficient reclamation of storage space in a deduplication system are disclosed. The method, for example, includes identifying one or more storage constructs of a number of storage constructs and generating an indication that a reclamation operation is to be performed with respect to the one or more storage constructs. In an embodiment, each of the plurality of storage constructs includes metadata and a number of units of data. The one or more storage constructs are identified, at least in part, by determining that a portion of the number of units of data of each of the one or more storage constructs is in a state, wherein the determining is based, at least in part, on at least a portion of the metadata.

Abstract: Disclosed herein are methods, systems, and processes to optimize and manage fingerprint backward compatibility in deduplication backup computing systems. A new fingerprint is generated for a segment object stored in a data container based on a new fingerprinting process. A header file is modified by replacing an old fingerprint for the segment object based on an old fingerprinting process with the new fingerprint. An entry including information indicating an association between the old fingerprint and the new fingerprint is created in a fingerprint map file.

Abstract: A method and apparatus is disclosed for optimized backups. In one embodiment, the method includes creating a deduplicated universal share of data objects, which in turn includes receiving a universal share of the data objects, deduplicating the universal share, wherein deduplicating the universal share includes: hashing segments of the universal share to generate respective universal share segment fingerprints; comparing the universal share segment fingerprints to fingerprints for respective segments held in deduplication storage in order to identify segments in the deduplication storage that equate to the universal share segments, respectively, of the universal share; storing identifiers that directly or indirectly identify locations, respectively, of the segments, respectively, in the deduplication storage that equate to the universal share segments, respectively, of the universal share.

Abstract: Disclosed herein are methods, systems, and processes to share data storage-related services between multiple deduplication systems. In one embodiment, the method comprises receiving an indication that a local file corresponds to a shared file; virtually segmenting the shared file into a plurality of data segments, where virtually segmenting the shared file generates data segment fingerprints and library virtual mapping metadata, and the library virtual mapping metadata comprises fingerprint information corresponding to each of the plurality of data segments, and at least one of a unique file identifier, an offset of each data segment, and a size of each data segment; and transmitting the library virtual mapping metadata, where the library virtual mapping metadata is configured to be used in a subsequent deduplication operation.

Abstract: The disclosed computer-implemented method for data placement in container-based storage systems may include (i) identifying a file stored within a container-based storage system, where the container-based storage system stores the file as data segments within containers, (ii) receiving, in response to a write operation directed to the file, a request to store within the container-based storage system a new data segment generated by the write operation, (iii) describing the file in terms of a plurality of consecutive slabs, (iv) determining that the new data segment falls within a specified slab, and (v) fulfilling the request to store the new data segment within the container-based storage system by storing the new data segment in a designated container that corresponds to the specified slab in response to determining that the new data segment falls within the specified slab. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Methods, computer program products, computer systems, and the like are disclosed that provide for scalable deduplication in an efficient and effective manner. For example, such methods, computer program products, and computer systems can include receiving a data object at an assigned node, determining whether the data object includes a sub-data object, and processing the sub-data object. The assigned node is a node of a plurality of nodes of a cluster, where the data object includes a data segment, and a signature. The signature is generated based, at least in part, on data of the data segment. The processing includes sending the sub-data object to a remote node. The remote node is another node of the plurality of nodes of the cluster.