Abstract: Described herein are systems and methods for replicating an original sequential data volume to a copied sequential data volume. The two sequential data volumes comprise corresponding data blocks with associated write session identifiers. The write session identifiers may correspond to an applicable write operation. When the original sequential data volume is modified, the copied sequential data volume may also be modified for consistency. The write session identifiers of the two data volumes may be sequentially compared to find a mismatch at a modified data block. The data blocks of the copied sequential data volume are replaced, beginning with the modified data block. Instead of replicating the entire original sequential data volume, the modified data block and any subsequent data blocks are replicated in the copied sequential data volume.

Abstract: Described herein are systems and methods for replicating an original sequential data volume to a copied sequential data volume. The two sequential data volumes comprise corresponding data blocks with associated write session identifiers. The write session identifiers may correspond to an applicable write operation. When the original sequential data volume is modified, the copied sequential data volume may also be modified for consistency. The write session identifiers of the two data volumes may be sequentially compared to find a mismatch at a modified data block. The data blocks of the copied sequential data volume are replaced, beginning with the modified data block. Instead of replicating the entire original sequential data volume, the modified data block and any subsequent data blocks are replicated in the copied sequential data volume.

Abstract: Implementations of the present disclosure involve a system and/or method for storing one or more data files in an n-level directory tree of a data storage system. In general, the system and/or method computes an n-byte value from a data file name which is used to create a directory path in the data storage system, where parts of the n-byte value are used to form each directory name in the directory path. Storage and retrieval of a data file is performed by storing in or retrieving data files from the computed directory. In one embodiment, the calculated n-byte value is obtained by computing the value with a cyclic redundancy check (CRC) algorithm. Use of the CRC algorithm to compute the directory path provides a balanced set of directories and number of data files that is repeatable such that location and retrieval of the data file is accomplished without the need to search through each directory of the system.

Abstract: Implementations of the present disclosure involve a system and/or method for storing one or more data files in an n-level directory tree of a data storage system. In general, the system and/or method computes an n-byte value from a data file name which is used to create a directory path in the data storage system, where parts of the n-byte value are used to form each directory name in the directory path. Storage and retrieval of a data file is performed by storing in or retrieving data files from the computed directory. In one embodiment, the calculated n-byte value is obtained by computing the value with a cyclic redundancy check (CRC) algorithm. Use of the CRC algorithm to compute the directory path provides a balanced set of directories and number of data files that is repeatable such that location and retrieval of the data file is accomplished without the need to search through each directory of the system.