Abstract: Techniques for efficient restoration of granular application data are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for restoring one or more portions of application data comprising virtualizing one or more backup files of the application data into a specified staging area, running a recovery process for the one or more backup files, virtualizing the one or more backup files and the one or more recovery files, instantiating an instance of an application utilizing the virtualized one or more backup files and the virtualized one or more recovery files, and recovering one or more portions of the application data.

Abstract: Embodiments consistent with the present invention relate to methods and computer systems for displaying customizing parameters of an application program, the customizing parameters being stored in database tables. In one embodiment, a method is provided that comprises: executing an application program, and acquiring trace data during execution of the application program, the trace data comprising a path for each of the results provided by the application program, each path being descriptive of a sequence of database table entries of the database tables holding a sub-set of the customizing parameters used for a calculation of the corresponding result. The method may further comprise displaying the results, interactively selecting one of the results for further analysis, and displaying the database table entries identified by the path of the selected one of the results.

Abstract: A method and system for restoring a version of the data object from a continuous data protection (CDP) engine without being required to access the CDP engine via a separate CDP-specific interface. A data access request includes a data identifier and a metadata portion and is sent to a system layer, where the data identifier identifies a current version of a data object, and the metadata portion identifies a prior version of the data object to be retrieved specifically from the CDP engine. The prior version of the data object is retrieved from the CDP engine and returned for efficiently restoring the prior version of the data object.

Abstract: The present invention provides a mechanism to selectively restore portions of a monolithically backed up database, while maintaining hierarchical relationships and other metadata relationships of the restored portions of the database. Embodiments of the present invention provide a method, system and computer-readable storage medium that provides for receiving a request to restore a selected object from among a plurality of backed up objects in a database backup, locating information associated with the selected object in the database backup, and restoring the object-to-restore using the information associated with the selected object in a target area. Database table metadata is gathered from the backed up database at the time the backup was created in order to locate the information associated with the selected object.

Abstract: A method and apparatus for efficiently logging changes to a file system are disclosed. A file system filter driver intercepts I/O requests directed to a file system, and analyzes the I/O requests to determine whether the requests are write or modify requests directed to a file included in a list of files to be monitored for changes. If the I/O request is directed to such a file, the file system filter driver logs the I/O request to a b-tree structured change log file. Furthermore, in one embodiment, the file system filter driver is configured to log file system changes to multiple log files to coincide with snapshot operations, such that the file system changes to be included in each snapshot are included in separate log files.

Abstract: Embodiments of the invention detect inadvertent or malicious data corruption and for recovering data including receiving a query specifying corrupted application data; analyzing transaction logs to find update operations related to the data; determining where the data are stored, by mapping the table data to locations within the file system and mapping the file system locations to volume logical blocks; and analyzing snapshot volume bitmaps to determine if the bitmaps show changes to the table data stored in the volume logical blocks. Changes which are reflected in the bitmaps for the data, but which do not have corresponding entries in the transaction logs are flagged as unauthorized changes. Snapshots of the data, from a time prior to the time at which a flagged snapshot was taken, are identified for use in restoring data to its status prior to the unauthorized change.

Abstract: One embodiment is a method for providing incremental backups for a source computing machine, the method including: (a) creating a first backup snapshot including a virtual machine (VM) snapshot of an initial copy of a source computing machine volume, wherein said VM snapshot includes a timestamp and a first redo log file; (b) reconfiguring and customizing said first backup snapshot to create a first bootable VM, writing changes associated with said reconfiguring and customizing into said first redo log file, then creating a first bootable snapshot including a VM snapshot of said first bootable VM, wherein said VM snapshot of said first bootable VM includes a timestamp for said first bootable VM and a redo log file; (c) performing an incremental update of said first backup snapshot or a subsequent backup snapshot, then creating a subsequent backup snapshot including a VM snapshot of said incremental update, wherein said VM snapshot of said incremental update includes a timestamp for said incremental update and

Abstract: Disclosed are algorithms, mechanisms, processes, mechanisms, and systems to implement a query upon past versions. In one approach, the version query can be defined as either “rowid”-based access or non-rowid based access. With rowid based access, a given rowid is used to identify the data for which past versions are desired. Also disclosed is a mechanism, system, interface, and process to allow specification of a new table decoration clause to obtain one or more past version of one or more data items. The version query provides for a direct interface to get multiple versions of the row(s). In addition, information about the past versions can be retrieved and displayed along with the past versions.

Abstract: Disclosed is a mechanism, system, interface, and process to determine one or more life intervals when given a key. In addition, one or more life intervals can be determined for each key within a range of keys. This type of process is useful for auditing purposes or if it is desire to implement a query upon past versions when a key or range of keys is specified for the data for which past versions is desired. This facilitates algorithms, mechanisms, and processes to implement a query upon past versions.

Abstract: Log file amnesia detection is accomplished by associating a unique identifier with each record in a log file, where each record receives a unique log sequence number. Multiple time intervals are associated with the log file with different events triggering the beginning of a new time interval. The log file implementation marks the beginnings of these multiple time intervals with a unique identifier. Every time an event occurs that triggers a new time interval a new unique identifier is generated. This unique identifier will be associated with the records in the log file that are created thereafter until the next unique identifier gets generated, marking the beginning of a next time interval. Log file amnesia can be identified when a log client requests information about a record and then comparing the unique identifier and log sequence number of the record with all records in the log file.

Abstract: A method, apparatus, and system for accessing units of storage that depends at least in part on an address of the unit of storage and the time that data was written to the unit of storage. A virtual data store can be created that reflects the state of an original data store at a specified time, where the specified time is selected, for example, from a substantially continuous time interval.

Abstract: Disclosed is a mechanism, system, interface, and process to allow specification of a new table decoration clause to obtain one or more past version of one or more data items. The version query provides for a direct interface to get multiple versions of the row(s). In addition, information about the past versions can be retrieved and displayed along with the past versions. Also disclosed are algorithms, mechanisms, and processes that are employed to implement a query upon past versions. In one approach, the version query can be defined as either “rowid”-based access or non-rowid based access. With rowid based access, a given rowid is used to identify the data for which past versions are desired. Also disclosed is a process for determining one or more life intervals when given a key.

Abstract: In a DBMS, in response to a request from application programs, a base table update function updates a base table and a recovery start point, and a log recording function records update logs for the base table. Then, at predetermined timing, a backup function outputs the content of the base table to a backup file and copies the recovery start point associated with the base table to a recovery start point. Subsequently, when a user has specified a quiesce point and the base table, a copy generation function generates a target table that is a copy of the base table at the quiesce point by updating the backup file of the specified base table with ones of the update logs from the recovery start point to the quiesce point.

Abstract: A database system includes a plurality of access modules and corresponding persistent storage devices each having a pool of storage elements that can be allocated to store permanent files and temporary files. Each access module is associated with a non-persistent file management context and each storage device contains a persistent file management context. The persistent file management context indicates allocation of permanent files, while the non-persistent file management context indicates the allocation of both permanent and temporary files.

Abstract: Methods, systems, computer program products and methods for deploying computing infrastructure for managing metadata in a storage subsystem are provided. A first metadata track is staged from disk storage to a cache storage after which a journal entry is stored in a nonvolatile storage (NVS). The journal entry includes an opcode and update data for the track. The opcode identifies the type of update to be performed and the number of tracks to be updated in the operation. Each of the other metadata tracks is staged and a corresponding journal entry stored. The journaled updates are then applied to the respective metadata track in the cache storage and the tracks destaged from cache to the disk storage.

Abstract: Techniques used in an automatic failover configuration having a primary database system, a standby database system, and an observer. In the automatic failover configuration, the primary database system remains available even in the absence of both the standby and the observer as long as the standby and the observer become absent sequentially. The failover configuration may use asynchronous transfer modes to transfer redo to the standby and permits automatic failover only when the observer is present and the failover will not result in data loss due to the asynchronous transfer mode beyond a specified maximum. The database systems and the observer have copies of failover configuration state and the techniques include techniques for propagating the most recent version of the state among the databases and the observer and techniques for using carefully-ordered writes to ensure that state changes are propagated in a fashion which prevents divergence.

Abstract: A technique for maintaining a transaction history is described. This transaction history includes a sequence of commands or operations in an electronic-design-automation (EDA) environment. For subsets of one or more operations in the sequence of operations, the transaction history includes an associated transaction name, as well as a state of the of the subset, which is open after an initial EDA operation in the subset has been performed and is closed after a last EDA operation in the subset has been performed. This transaction history can be displayed in a window in a graphical user interface, and facilitates undoing and/or rolling back of changes to the data associated with one or more subsets. For example, if an error is detected, roll back of one or more subsets to a known software state or condition prior to the operations in the one or more subsets may be performed without user instructions using the transaction history.

Abstract: A method and apparatus for selective removal of user data changes is provided. In one embodiment, the methodology is implemented by a logical recovery mechanism. Upon receiving a request to selectively remove user data changes stored in a database, the mechanism creates an empty set of transactions to be populated for selective removal, identifies one or more transactions and places them in the causal set of transactions. The mechanism further identifies other transactions that logically depend on any transaction already in the causal set of transactions. Finally, either while the causal set of transactions is being identified or after the identification is completed, the mechanism also determines user data changes made by the causal set of transactions. One or more compensating transactions may be generated by the logical recovery mechanism, which when executed, reverse the user data changes.

Abstract: A remote copy system for copying data between a plurality of storage systems, including: a plurality of first storage systems to and from which data is inputted and outputted, and a plurality of second storage systems that are connected to each of the first storage systems; each of the first storage systems including a first logical volume that stores the data that is inputted and outputted; each of the second storage systems including a second logical volume that stores a copy of the data stored in the first logical volume; the remote copy system comprising a pre-update data storage unit that stores pre-update data that is stored before data to be stored in the second logical volume is updated and time stamps of the data to be stored in the second logical volume.

Abstract: A database processing system including a plurality of partitioned databases. Data processing is performed with pieces of information processing apparatus associated with each of the partitioned databases respectively. In response to a query, a status table indicating availability of each information processing apparatus is read from the storage. Of the pieces of information processing apparatus for processing the received query, at least a serviceable one is determined as a process request destination. A process request corresponding to the query is transmitted to the information processing apparatus determined as the process request destination. The process request is received through a communication unit, and data on the database are consequently processed. A processing result is transmitted to a transmitting source through the communication unit.

Abstract: A method and system for backup and recovery of data objects accessible to a computer system may identify data events associated with the data objects. Metadata providing a record of data events associated with a data object, including information identifying prior versions of a data object may be stored in a central index. An indication of a plurality of data objects may be displayed on a single panel display object, along with a revision history for each displayed data object. The revision history may include an indication of previous versions of the data object, which may be selectable and accessible from the single panel display object. The single panel display object may further display a timeline with a selectable timescale. The timescale may be associated with a color scale, which may also be used in the display of the data objects and their respective revision histories.

Abstract: Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Releasing a duplicate write lock for rollback is supported. During rollback processing of a parallel nested transaction, a write log entry is encountered that represents a write lock. If the write lock is a duplicate, a global lock is used to synchronize access to a global versioned write lock map. Optimistic read validation is supported. During validation, if a versioned write lock indicates a sibling conflict, consult information to determine if a parallel nested transaction should be doomed. Write lock acquisition is supported. Upon attempting to acquire a write lock for a parallel nested transaction, a transactional memory word is analyzed to determine if the write lock can be obtained. If the transactional memory word indicates a versioned write lock, retrieve a write log entry pointer from a global versioned write lock map.

Abstract: A system is provided to improve storage server performance. The system comprises a receiving component of a storage server to receive a partner server's file system metadata while the partner server operates in a normal mode. The partner server's file system metadata is stored in the storage servers metadata cache and is used to mount the partner server's file system when the first server transitions into a takeover mode of operation.

Abstract: Techniques for efficient restoration of granular application data are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method for restoring one or more portions of application data comprising virtualizing one or more backup files of the application data into a specified staging area, running a recovery process for the one or more backup files, virtualizing the one or more backup files and the one or more recovery files, instantiating an instance of an application utilizing the virtualized one or more backup files and the virtualized one or more recovery files, and recovering one or more portions of the application data.

Abstract: Provided are a method, system, and program for restoring a source file referenced by multiple file names to a restore file. An operation is processed to restore a source file having a first file name to a restore file, wherein the source file is in a state of being accessed by a process. A determination is made as to whether a second file name references the source file. A first temporary file name and a second temporary file name are created that both reference the restore file in response to determining that the second file name references the source file. The first temporary file name is renamed to the first file name and the second temporary file name is renamed to the second file name. After the renaming of the first and second temporary file names, the first and second file names reference the restore file.

Abstract: Various systems and methods are disclosed for applying incremental changes prior to initialization of a point-in-time copy. For example, one method involves identifying an incremental change to information stored on a primary device. The incremental change is identified subsequent to a first point in time. The incremental change is applied to a first target device, prior to completing initialization of a second target device. The initialization of the second target device initializes the second target device as a point-in-time copy of the primary device. The point-in-time copy of the primary device is a copy of the primary device at the first point in time.

Abstract: The present invention provides a computer implemented method for truncating a file in a file system. The file system receives a request to truncate a file to a target size, the file having a first inode. The file system creates a second inode to a transient directory, wherein the second inode holds a plurality of in-progress entries. The file system sets a target size in the first inode. The file system writes a truncate entry to a journal, the truncate entry comprising a predetermined size. The file system truncates the file by up to the predetermined size. The file system determines that the file is above the target size. Responsive to a determination that the file is above the target size, the file system repeats the truncating step and the determining step. Responsive to a determination that the file is not above the target size, the file system applies the in-progress entries from the transient directory.

Abstract: A system and method provides continuous data protection using checkpoints in a write anywhere file system. During a consistency point of a write anywhere file system, freed blocks are identified and are appended to a delete log for retention. A consistency point log is updated with a new entry associated with the consistency point. If the file system needs to retrieve its state at a particular point in time, the stored blocks of the delete log may be recovered.

Abstract: A data storage server is programmed for management, version control, and scheduling of replication of multiple types of data storage objects including iSCSI LUNs and file systems. The version control determines if two data storage objects are the same or have a common base so that only a difference needs to be transmitted for replication or restoration. A replication job may specify a “one-to-many” replication or a cascaded replication, and any snapshot retention policy is propagated during a cascaded replication. Concurrent replication sessions to the same destination are paced in accordance with respective allocation shares of the reception bandwidth. File handle information is replicated so that a file handle issued by a primary data storage server can be used for accessing a replicated file in a secondary data storage server.

Abstract: Clients are permitted to directly attach to a client server system. An oplog management system tracks changes as clients make the changes to control structures of the direct connection client server system. The Oplogging system stores changes in oplogs. Then, if a client fails, the Oplogging system can repair the control structures, either by undoing the changes made by the client, or else completing the changes in place of the client; depending upon principles defined.