Abstract: Systems and methods for backing up data are disclosed. Changes made to a file system are tracked in a change log. When a backup operation is initiated, the changes identified in the change log are applied to the backup save sets. When a file associated with an event in the change log cannot be identified, the file is identified using the inode or other identifier. The event in the change log is then applied once the file is identified. The backup so achieved has eventual name space consistency and can be achieved without taking a snapshot of the file system.

Abstract: Systems and methods for migrating backups are disclosed. A backup can be transferred from a standalone backup system and incorporated into the backups maintained by a centralized backup system.

Abstract: Enabling separation of database administrator and backup administrator roles is described. A backup catalog and a database schema are queried to identify backup information associated with a backup file stored on a disk. A clone copy of the backup file is created. The clone copy is stored on an external destination node including an external disk and/or a tape, based on the backup information. The clone copy may be recovered from the external destination node based on the backup information and restored to a database in response to a determination that the backup file is at least one of corrupted and absent from the disk.

Abstract: Systems and methods for backing up data are disclosed. Changes made to a file system are tracked in a change log. When a backup operation is initiated, the changes identified in the change log are applied to the backup save sets. When a file associated with an event in the change log cannot be identified, the file is identified using the inode or other identifier. The event in the change log is then applied once the file is identified. The backup so achieved has eventual name space consistency and can be achieved without taking a snapshot of the file system.

Abstract: Systems and methods for backing up data are disclosed. Changes made to a file system are tracked in a change log. When a backup operation is initiated, the changes identified in the change log are applied to the backup save sets. When a file associated with an event in the change log cannot be identified, the file is identified using the inode or other identifier. The event in the change log is then applied once the file is identified. The backup so achieved has eventual name space consistency and can be achieved without taking a snapshot of the file system.

Abstract: Systems and methods for backing up a client or a client's data are disclosed. A client is configured with an agent that enables data of the client to be backed up to a device without a backup server. Indexing information is also stored with the backup.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, setting the corresponding bits in a bitmap, and storing the bitmap as a hint in an index. The size of the bitmap is determined by the space available for storing the hint, and the range of hash values is determined by the size of the bitmap. The range may be determined by choosing a prime number smaller than the space available for storing the bitmap. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, setting the corresponding bits in a bitmap, and storing the bitmap as a hint in an index. The size of the bitmap is determined by the space available for storing the hint, and the range of hash values is determined by the size of the bitmap. The range may be determined by choosing a prime number smaller than the space available for storing the bitmap. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises concatenating at least a portion of the name of each object being stored into a hint; and storing the hint in an index. The portion of the name is the entire name, the first n characters, the last n characters, or every nth character, and this may be selected based on the application associated with the objects. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, concatenating the hashed values into a hint, and storing the hint in an index. The size of the hash values is determined by dividing the number of objects into the space available for storing the concatenation, and the range of the hash values may be determined by choosing a prime number smaller than the number that can be represented by the space available for storing the concatenation. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises determining an application associated with the objects being stored, selecting a hint or longest pathname containing the plurality of objects, and storing the selection in the index. The hint may be generated by concatenating at least a portion of a name of each object being stored into the hint, concatenating hash values of the names of the objects, or producing a bitmap of hash values of the names of the objects, depending on available space. In an embodiment, each hint generation may be tried in succession based on determining whether the previous hint fits into the space available for storing the hint.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, transforming the hash value into a plurality of bytes such that none of the bytes has the value of a flag used by the system, concatenating the transformed hashed values into a hint, and storing the hint in an index. In an embodiment, bytes having the flag value are mapped to an unused value during the transformation. In an embodiment, the hint is retrieved from the index and hashed values are transformed back. Mapped values are restored to the flag values. This allows use of the hint with a system that uses a flag in the index as an indicator; for example, to indicate that an endpoint has been reached.

Abstract: A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, transforming the hash value into a plurality of bytes such that none of the bytes has the value of a flag used by the system, concatenating the transformed hashed values into a hint, and storing the hint in an index. In an embodiment, bytes having the flag value are mapped to an unused value during the transformation. In an embodiment, the hint is retrieved from the index and hashed values are transformed back. Mapped values are restored to the flag values. This allows use of the hint with a system that uses a flag in the index as an indicator; for example, to indicate that an endpoint has been reached.