Abstract: A request is received to perform a management action for a domain of a name service, wherein the name service is implemented using at least both a first blockchain network and a second blockchain network different from the first blockchain network. A determination is made whether the domain is currently managed on the first blockchain network or the second blockchain network. The management action for the domain is caused to be performed based on the determination of whether the domain is currently managed on the first blockchain network or the second blockchain network.

Abstract: A request to resolve at least a name of a domain of a name identifier is received. It is automatically determined that the name of the domain is to be resolved using a blockchain. The identifier of the non-fungible token is used to send a request to a smart contract associated with the blockchain to obtain one or more resolution records for the domain. The blockchain stores the non-fungible token associating the domain to an account address of an owner of the domain. The one or more resolution records of the domain are received. The received one or more resolution records are used to resolve at least the name of the domain.

Abstract: A request to resolve a name of a domain of an identifier of web content is received. It is automatically determined that the name of the domain is to be resolved using a blockchain. A request is sent to a smart contract of the blockchain to obtain one or more resolution records for the domain. The one or more resolution records of the domain are received. The received one or more resolution records are utilized to resolve the name of the domain.

Abstract: Transmitting or storing subsegments is disclosed. A data stream or a data block is received and broken into a plurality of segments. For at least one segment, the segment is broken into a plurality of subsegments. A previously stored or transmitted segment similar to the at least one segment is identified. A fingerprint is computed for at least one subsegment. And, using the fingerprint for the at least one subsegment, determining whether the at least one subsegment is identical to a subsegment of the previously stored or transmitted segment without directly comparing the content of the at least one subsegment with the content of the subsegment of the previously stored or transmitted segment.

Abstract: A method and apparatus for different embodiments of probabilistic summary data structure based encoding for garbage collection are described. In one embodiment, a method comprises generating a probabilistic summary data structure that represents active blocks of data within a storage device based on identifications of the active blocks or the data within the active blocks. The method also includes performing garbage collection of at least a portion of the storage device based on the probabilistic summary data structure.

Abstract: A network file system-based data storage system that converts random I/O requests into a piecewise sequential data structure to facilitate variable length data segment redundancy identification and elimination. For one embodiment of the invention a stateless network file system is employed. For one such embodiment, that provides multiple-client access to stored data, multiple Writes are buffered and then broken into variable length data segments. Redundant segment elimination is then effected. One embodiment of the invention allows sharing of the variable length data segments among files.

Abstract: Verifying a file in a system with duplicate segment elimination is disclosed. A data file is segmented into a plurality of distinct data segments, and a checksum is computed for each of the plurality of distinct data segments. A constructed data file checksum is constructed from the checksums of each of the plurality of distinct data segments, and, it is determined if a checksum of the data file is the same as the constructed data file checksum.

Abstract: A system and method are disclosed for processing a data stream. A data segment is received. It is determined whether the data segment has been previously stored. In the event that the data segment is determined not to have been previously stored, a unique identifier for specifying the data segment in a representation of the data stream is generated.

Abstract: A method of replicating a deduplicated storage system is disclosed. The method comprises requesting the state of a replica system. The method further comprises sending a container to the replica system and sending a file system log record to the replica system.

Abstract: A method and apparatus for storing composite data streams. According to one embodiment of the invention, a composite data stream is stored so that it may be restored. The storing of the composite data stream includes decomposing the composite data stream into a plurality of constituent data streams, segmenting at least one of the plurality of constituent data streams, and discarding those of the segments resulting from the segmenting which are determined to have been stored previously.

Abstract: Storage using resemblance of data segments is disclosed. It is determined that a new segment resembles a prior stored segment. The prior stored segment comprises a segment stored previously from any location in an input data stream. A delta between the new segment and the prior stored segment is determined. A representation of the new segment based at least in part on the delta is stored.

Abstract: Selecting a segment boundary comprises determining a segmentation window is determined and computing a plurality of values associated with candidate boundaries within the segmentation window. Selecting a segment boundary further comprises selecting one of the candidate boundaries based at least in part on a comparison between two or more of the computed values and determining a boundary within the segmentation window.

Abstract: A method and apparatus for different embodiments of incremental garbage collection of data in a secondary storage. In one embodiment, a method comprises locating blocks of data in a log that are referenced and within a range at a tail of the log. The method also includes copying the blocks of data that are referenced and within the range to an unallocated segment of the log.

Abstract: A method and apparatus for different embodiments of probabilistic summary data structure based encoding for garbage collection are described. In one embodiment, a method comprises generating a probabilistic summary data structure that represents active blocks of data within a storage device based on identifications of the active blocks or the data within the active blocks. The method also includes performing garbage collection of at least a portion of the storage device based on the probabilistic summary data structure.

Abstract: A method for storing data comprising is disclosed. The method comprises receiving a data stream comprising a plurality of data segments wherein each data segment is associated with an identifier. The method further determining using a subset of identifiers that are stored in a low latency memory whether a data segments has been previously stored and returning the identifier for the data segment in the event the data segment is determined to have been stored previously.

Abstract: A system and method are disclosed for providing efficient data storage. A data stream comprising a plurality of data segments is received. The system determines whether one of the plurality of data segments has been stored previously using a summary in a low latency memory; in the event that the data segment is determined not to have been stored previously, assigning an identifier to the data segment.

Abstract: A system and method are disclosed for processing a data stream. A data segment is received. It is determined whether the data segment has been previously stored. In the event that the data segment is determined not to have been previously stored, a unique identifier for specifying the data segment in a representation of the data stream is generated.

Abstract: A system and method are disclosed for providing efficient data storage. A data stream comprising a plurality of data segments is received. The system determines whether one of the plurality of data segments has been stored previously using a summary in a low latency memory; in the event that the data segment is determined not to have been stored previously, assigning an identifier to the data segment.

Abstract: A disk-based archival storage system including a storage unit configured to store archival data, the storage unit including at least one spindle of disks configured to magnetically store archival data, an interconnect; and a control unit configured to process requests over the interconnect to either archive to or retrieve data from the storage unit. In one embodiment, the system includes a plurality of the storage units, each including at least one spindle of disks. The control unit controls the storage unit(s) in a master-slave relationship. Specifically the control unit is capable of issuing commands to selectively cause the storage unit(s) to shut down or power up, enter a running mode or a standby mode, cause the spindle of disk(s) to either spin up or spin down, and to perform a data integrity check of all the archival data stored in the storage system.

Abstract: Weight gain rates of calves are surprisingly increased when the calves are fed a milk replacer containing brewers yeast and dextrose, the mixture providing from 0.25 to 5 pounds of dextrose per pound of brewers yeast. Brewers yeast preferably is provided in the form of co-dried brewers yeast and brewers grains.