Abstract: A continuously running application may be dynamically recovered. A database replica server may be directed to temporarily spool data changes in a database master server that stores application data associated with an application running on a web front-end master server. A specified rewind point may be obtained from among a plurality of existing rewind points of the application data stored in the database replica server. The database replica server may be directed to rewind the application data to a specified rewind point. An indication of data to be recovered in the rewound application data may be obtained. The web front-end master server may be directed to restore the data corresponding to the indication. The database replica server may be directed to resume replication of data changes in the database master server.

Abstract: Methods and systems for validating ingested data are disclosed. In accordance with the methods and systems, data elements can be received for storage in slots of an individual descriptor in a storage medium. In addition, at least one validation test can be selected based on a weighting of the data elements that indicates a respective degree of importance of the data elements. The selected validation test or tests can be applied to the data elements stored in the slots to generate respective validation results. Further, a validation score indicating a sufficiency of the stored data elements can be generated based on the validation results.

Abstract: The present invention discloses a method and a system for monitoring and tracing transmission of multimedia resources, wherein, said method comprises: capturing data packets in a network link, reassembling the captured data packets to complete the restoration of data streams, and storing the restored data streams into a data stream database; and extracting data fragments from a multimedia file as file DNA fragments to construct a file DNA, and storing the file DNA into a file DNA database; and invoking the file DNA from the file DNA database, and identifying the file DNA fragments of the file DNA in the data streams to get identification results.

Abstract: A problem is that if one of the recording mediums is media formatted and management information is deleted, etc. when left-eye image (ex. first data) and right-eye image (ex. second data) constituting 3D data are recorded to different recording mediums, then 3D image cannot be properly reproduced.

Abstract: Presented is a method of protecting data. The method includes recognizing a newly created data file, providing at least one data protection policy for selection by a user, obtaining a user input for selecting at least one data protection policy, applying the selected data protection policy to the newly created data file, creating a backup copy of the newly created data file based on the applied data protection policy, and storing the backup copy of the newly created data file based on the applied data protection policy.

Abstract: In one embodiment, a service mediator provides a service that is a composite of atomic services and executes a recovery pattern in the event that a service is not available. More particularly, in an initial phase of operation, the service mediator determines one or more recovery patterns for each atomic service offered in the composite service and stores in a database an identity of each such recovery pattern for each atomic service. In subsequent operation, the service mediator monitors the availability of each atomic service. When a user inquires of a composite service, the service mediator determines if any of its atomic services is unavailable. If an atomic service is unavailable, the service mediator selects a recovery pattern and executes it.

Abstract: A mechanism for efficient collection of data is described for runtime middleware environments. Two frequencies are used, a collection frequency (CF) to collect the data and an aggregation frequency (AF) to aggregate and persist the data in a repository. The collection cycle is a shorter time interval than the aggregation cycle. An agent residing in the container periodically collects a set of data upon every collection cycle from the components of the middleware system and caches the set of data locally. Upon every aggregation cycle, the agent applies an aggregation function to the collected set of data and persists the set of data into a repository after the aggregation function has been applied. The aggregation function is such that it resulting data represents the behavior of the runtime environment in the total duration of the aggregation cycle.

Abstract: A system, method and computer program product for identifying identical files using content signatures are provided. A content signature is generated within an indexed archive system for a file received at an information source client in a network. The generated content signature is compared with content signatures associated with files that already exist within the network. It is then determined whether the content signature for the received file matches that of an existing file in the network. Where there is a match, the metadata for the received file is examined to determine if the received file was independently created from the existing file with matching content signature. If the metadata confirms the independent creation, a control action is taken.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing data. In one aspect, a method includes receiving a user input to present a visual representation of a first prior state of a file system; generating the first visual representation of a first prior state of the file system at a first time in the past according to a first virtual file system corresponding to that first time; presenting the first visual representation, where the first virtual file system is a reduced representation of the file system at that first time; receiving a user input to present a second visual representation of a second prior state of the file system at a second time in the past according to a second virtual file system corresponding to that second time; and presenting the second visual representation.

Abstract: Systems, methods, and computer-readable and executable instructions are provided for computing system reliability. A method for computing system reliability can include storing, on one of a plurality of devices, a checkpoint of a current state associated with the one of the plurality of devices. The method may further include storing the checkpoint in an erasure-code group across the plurality of devices.

Abstract: A clustered storage system includes a machine arranged to check, using its own clock as a current time reference, for expiry of a retention period set for a dataset stored in the system. In order to monitor for any interference with its clock, the expiry-checking machine obtains from other machines of the system, the current times of their clocks, and then derives a value from these times which it compares with a current time value from its own clock; where the difference between these values exceeds a predetermined amount, the expiry-checking machine generates an alert. This monitoring process is carried out repeatedly.

Abstract: According to one embodiment of the present invention, a system controls cleansing of data within a database system, and comprises a computer system including at least one processor. The system receives a data set from the database system, and one or more features of the data set are selected for determining values for one or more characteristics of the selected features. The determined values are applied to a data quality estimation model to determine data quality estimates for the data set. Problematic data within the data set are identified based on the data quality estimates, where the cleansing is adjusted to accommodate the identified problematic data. Embodiments of the present invention further include a method and computer program product for controlling cleansing of data within a database system in substantially the same manner described above.

Abstract: Systems and methods for managing data with respect to tape storage are provided. The system includes a data manager for receiving metadata related to content and for generating a proxy file system which mirrors the data structure of the content data. The system further includes a server coupled to a tape device, the server receiving the content data directly from a data source and providing the content data the tape device for storage on a formatted tape media.

Abstract: Systems and methods system for managing data objects that support the personalization of mobile communications services are provided. The system includes one or more databases that contain subscriber data, such as, for example profile, usage or state information related to the subscriber. For one or more of the databases within the system, a database federator and a distributed object repository having multiple nodes is provided. The nodes are used to store data objects and duplicate data objects. Data objects may be distributed to the nodes based on, for example, a hashing algorithm. Additionally, a method for graceful redundancy degradation of stored duplicate objects is provided. In another embodiment, a method for time-based triggering of duplicate objects stored within separate nodes is provided.

Abstract: A snapshot of an application executing on a processor is taken in response to detecting an assertion in a running application. The assertion is evaluated based on the snapshot asynchronously while allowing the application to continue executing. The results of the assertion evaluation are returned to the application.

Abstract: A system and method of creating archive copies of data sets is described. In some examples, the system creates an archive copy from an original data set. In some examples, the system creates an archive copy when creating a recovery copy for a data set. In some examples, the system creates a copy without redundant data, and then encrypts the data set.

Abstract: A method of recovering a database includes providing a computer having a processor and providing a backup database including a last change marker. The method also includes extracting, using the processor, the last change marker from the backup database and providing transaction logs. Each transaction of the transaction logs includes input data, processed data, and a change marker. The method further includes sorting, using the processor, the transactions of the transaction logs using the change markers, replaying, using the processor, one or more of the transactions of the transaction logs, and generating a recovered database.

Abstract: A computer implemented method for inferring a probability of a first inference absent from a database at which a query regarding the inference is received. Each datum of the database is conformed to the dimensions of the database. Each datum of the plurality of data has associated metadata and an associated key. The associated metadata includes data regarding cohorts associated with the corresponding datum, data regarding hierarchies associated with the corresponding datum, data regarding a corresponding source of the datum, and data regarding probabilities associated with integrity, reliability, and importance of each associated datum. The query is used as a frame of reference for the search. The database returns a probability of the correctness of the first inference based on the query and on the data.

Abstract: Various embodiments of systems and method automated role clean-up are described herein. In various embodiments, an automated role clean-up agent can connect to a role repository system that may be configured to implement an automated role clean-up workflow. A method of an embodiment ensures that roles that are not being used or outdated are safe to delete. One or more deletion buffers may be configured to determine whether roles need to be deleted from the role repository system. Assigning conditions to a deletion buffer lets roles to be incubated in these deletion buffers for a desired period of time before deletion if the conditions are met. A re-affirmation can be sent out to role owners for deletion approval before roles are deleted. Deletion of the roles is performed by the role repository system.

Abstract: A storage system maintains a journal and a snapshot of one or more data volumes. Two journal entry types are maintained, an AFTER journal entry and a BEFORE journal entry. Two modes of data recovery are provided: “fast” recovery and “undo-able” recovery. A combination of both recovery modes allows the user to quickly recover a targeted data state.

Abstract: Provided are systems and methods for managing asynchronous replication in a distributed database environment, wherein a cluster of nodes are assigned roles for processing database requests. In one embodiment, the system provides a node with a primary role to process write operations against its database, generate an operation log reflecting the processed operations, and permit asynchronous replication of the operations to at least one secondary node. In another embodiment, the primary node is the only node configured to accept write operations. Both primary and secondary nodes can process read operations. Although in some to settings read requests can be restricted to secondary nodes or the primary node. In one embodiment, the systems and methods provide for automatic failover of the primary node role, can include a consensus election protocol for identifying the next primary node. Further, the systems and methods can be configured to automatically reintegrate a failed primary node.

Abstract: The subject disclosure is directed towards an object (e.g., an aspected vector, queue, map, stack and so forth) container having an exclusive interface, a shared-read-only interface and a shared-write (and read) interface to a common set of data. Use cases during runtime determine the appropriate interface to use. No locking is needed with methods of the exclusive interface or the read-only interface. The shared-write interface is configured to have only concurrency safe methods. Also described is blocking the use of other interfaces while one interface is in use, and the use of reference counter tracking to know when no concurrent readers and/or writers remain, to allow transitioning to use a different interface.

Abstract: The present invention extends to methods, systems, and computer program products for sharing volumes between clustered nodes. Embodiments of the invention include a Clustered Shared Volume File System (CsvFs) that appears to clients as a local file system. The CsvFs communicates to a node where a disk is mounted to coordinate access to files on the disks. CsvFs uses Opportunistic Locks (oplocks) to decide when direct access to a volume is safe. CsvFs can be extended with oplock upgrade mechanisms that allow a coordinating node to tell CsvFs when it is safe to attempt to upgrade oplock. CsvFs also uses a transitivity property of oplocks to be able to grant (delegate) oplocks to clients that are on top of CsvFs.

Abstract: Disclosed is a method of reading and writing data to and from a transactional database using a scatter-gather routine that minimizes the time in which the database is subject to a transaction lock. Data is placed in a scatter-gather list in RAM, which speeds the process of reading and writing data to the database. Further, a process is disclosed for restoring data in a transactional database that is accessed by more than one controller. An alternate controller is held in reset mode and placed offline, so that data in the transactional database cannot be changed during the restoration process. In addition, the database is placed offline and the host is notified that the database is invalid, so that the host cannot access the transactional database.

Abstract: Some embodiments of the invention provide components and/or techniques that may assist in choosing a snapshot to which to roll back to address a system malfunction. For example, some embodiments of the invention may record various metrics describing the system's performance, reliability and/or functionality at the points at which various snapshots are taken, along any of numerous dimensions. When a user later indicates a desire to restore the system to a previous point, these metrics may be analyzed to choose a snapshot to which to roll back.

Abstract: A storage server is coupled to a storage device that stores blocks of data, and generates a fingerprint for each data block stored on the storage device. The storage server creates a fingerprints datastore that is divided into a primary datastore and a secondary datastore. The primary datastore comprises a single entry for each unique fingerprint and the secondary datastore comprises an entry having an identical fingerprint as an entry in the primary datastore. The storage server merges entries in a changelog with the entries in the primary datastore to identify duplicate data blocks in the storage device and frees the identified duplicate data blocks in the storage device. The storage server stores the entries that correspond to the freed data blocks to a third datastore and overwrites the primary datastore with the entries from the merged data that correspond to the unique fingerprints to create an updated primary datastore.

Abstract: A mechanism for inode event notification for cluster file systems is disclosed. A method of the invention includes implementing a lock scheme for a cache manager associated with an inode of a cluster file system, wherein the lock scheme includes a null lock (NL) used as a reference count for a lock value block (LVB) and an exclusive (EX) lock used for setting up inode event notifications, and associating a first global counter and a second global counter with the cache manager for the inode, wherein the first global counter is configured to track one or more processes that have the inode open in read-only mode and the second global counter is configured to track processes that have the inode open in read-write mode.

Abstract: The present invention relates to a system that includes one or more logical volumes for storing data; a snapshot producing section for producing snapshots for the logical volumes based on a pre-scheduled snapshot acquisition time; a remote copy section for remote copying difference data for the snapshots based on pre-scheduled remote copy start times; and a scheduling section for re-scheduling the time of one or more of an Nth snapshot acquisition time, an Nth remote copy start time, and an (N+1)th remote copy start time, in such a manner that remote copying starting at the Nth remote copy start time finishes by the (N+1)th remote copy start time.

Abstract: Provided are a computer program product, system, and method for restoring a restore set of files from backup objects stored in sequential backup devices. Backup objects are stored in at least one sequential backup device. A client initiates a restore request to restore a restore set of data in a volume as of a restore point-in-time. A determination is made of backup objects stored in at least one sequential backup device including the restore set of data for the restore point-in-time, wherein the determined backup objects are determined from a set of backup objects including a full volume backup and delta backups providing data in the volume at different points-in-time, and wherein extents in different backup objects providing data for blocks in the volume at different points-in-time are not stored contiguously in the sequential backup device. A determination is made of extents stored in the at least one sequential backup device for the determined backup objects.

Abstract: Managing a concurrency based system. A method includes determining a defined number of concurrent operations for a concurrency based management system. An operation queue is accessed. The operation queue stores or has therein zero or more asynchronous operations. An asynchronous operation is an operation that returns an object representing the asynchronous completion of the operation. The method further includes, as long as the queue is not empty, scheduling asynchronous operations from the queue until a number of asynchronous operations equal to the defined number has been reached.

Abstract: A method enables cluster-level backup and restore functionality of all Virtual Input/Output Server (VIOS) configuration data within a VIOS cluster and the data of a shared VIOS cluster database. The method comprises: performing, via a backup/restore utility of a VIOS partition, a cluster level backup, which creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from the shared VIOS database of the VIOS cluster; storing the VIOS cluster configuration backup file within a storage location; and responsive to receipt of a VIOS restore command at a VIOS partition: retrieving the configuration backup file from the storage location; restoring a configuration of the hardware, logical and virtual devices of each VIOS within the VIOS cluster to prior state; and restoring the shared VIOS database with the backed-up cluster data.

Abstract: In a Virtual Input/Output (I/O) Server (VIOS) partition within a data processing system that comprises cluster-aware VIOSes, a method includes: performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the VIOS partition; storing the configuration backup file within local storage; and responsive to receipt of a VIOS restore command: retrieving the configuration backup file from the local storage; and restoring the configuration of the hardware, logical and virtual devices of the first VIOS to a state that existed at a time at which the backup operation creating the configuration backup file was performed.

Abstract: A distributed, deduplicated storage system according to certain embodiments is arranged in a parallel configuration including multiple deduplication nodes. Deduplicated data is distributed across the deduplication nodes. The deduplication nodes can be networked together and communicate with one another according using a light-weight, customized communication scheme (e.g., a scheme based on FTP or HTTP). In some cases, deduplication management information including deduplication signatures and/or other metadata is stored separately from the deduplicated data in deduplication management nodes, improving performance and scalability.

Abstract: Maintaining a generation value for each fileset that is distinct from a corresponding fileset manager preserves the independence of nodes while also allowing distributed fileset management. A fileset manager can maintain a value that reflects consistency snapshots for that node (“node generation”) separately from a value that reflects consistency snapshots for a particular fileset (“fileset generation”).

Abstract: System, method, computer program product embodiments and combinations and sub-combinations thereof for replication resynchronization are provided. An embodiment includes providing a mode of operation in a replication control system for repopulating a replicated version of a primary database that does not affect an ability to continue activity in the primary database. Further included is managing the repopulating of the replicated version with attention to at least a resynchronization marker.

Abstract: Techniques for normalizing a database as part of a database restore. Embodiments may receive a database restore request indicating a previous state to restore a database to. Responsive to the request, embodiments may restore the database to the previous state using backup data associated with the previous state, and normalize the restored database using historical database usage data based on one or more previous database operations.

Abstract: A storage system according to certain embodiments includes a client-side repository (CSR). The CSR may communicate with a client at a higher data transfer rate than the rate used for communication between the client and secondary storage. During copy operations, for instance, some or all of the data being backed up or otherwise copied to secondary storage is stored in the CSR. During restore operations, copies of the data stored in the CSR is accessed from the CSR instead of from secondary storage, improving performance. Remaining data blocks not stored in the CSR can be restored from secondary storage.

Abstract: A storage system according to certain embodiments includes a client-side repository (CSR). The CSR may communicate with a client at a higher data transfer rate than the rate used for communication between the client and secondary storage. During copy operations, for instance, some or all of the data being backed up or otherwise copied to secondary storage is stored in the CSR. During restore operations, copies of the data stored in the CSR is accessed from the CSR instead of from secondary storage, improving performance. Remaining data blocks not stored in the CSR can be restored from secondary storage.

Abstract: In a Virtual Input/Output (I/O) Server (VIOS) partition, a method comprises a cluster aware (CA) operating system (OS) of a VIOS partition performing the functions of: responsive to a restore command: retrieving a configuration backup file from storage; comparing a DRC name from the retrieved file with a DRC name of the current VIOS partition performing the restore operation; in response to an occurrence of a DRC name mismatch: retrieving an initial UUID of the VIOS from the configuration backup file; accessing a UUID table within a management tool; locating a matching UUID to the initial UUID within the UUID table; and in response to locating the matching UUID: verifying that the configuration data file belongs to the current VIOS initiating the restore operation; and performing the restore operation to restore the configurations of the hardware, logical and virtual devices of the first VIOS to an earlier configuration state.

Abstract: A system and method for server recovery and migration is presented. The method comprises backing up data and device drivers on a server to a central location, logging-in to the central location, obtaining the backed up data and device drivers from the central location, copying the obtained data to a computer medium and booting the server using the computer medium. In one aspect, the method can further comprise determining whether recovery is needed and performing logging-in, obtaining, copying, and booting when the recovery is needed. In one aspect, the method can further comprise determining whether the server has new device drivers and backing up the device drivers when the server has new device drivers. In one aspect, the backing up is performed periodically. In one aspect, the computer medium is a CD. In one aspect, the obtained backed up data is an ISO file.

Abstract: A computer system architecture and process transforms the organizing principles of business data management seen in traditional or common place settings across disparate data stores into an object-semantic model. The transformation is implemented in a transitory, managed risk implementation approach for data access migration. This approach will enable data agility and will move data storage closer to information storage, while supporting the rapid development of business capabilities. This approach will bridge the gaps between relational database/file based storage (less expressive) and object-semantic representation (more expressive). This process/method will connect information residing in legacy data structures such as relational database/file based storage on disk drives to instances populating an expressive object-semantic model in persistent grid based memory.

Abstract: A processor chip may have a built-in hardware lock and deterministic exclusive locking of the hardware lock by execution units executing in parallel on the chip. A set of software locks may be maintained, where the execution units set and release the software locks only by first acquiring a lock of the hardware lock. A first execution unit sets a software lock after acquiring a lock of the hardware lock, and other execution units, even if exclusively locking the hardware lock, are unable to lock the software lock until after the first execution unit has reacquired a lock of the hardware lock and possibly released the software lock while exclusively locking the hardware lock. An execution unit may release a software lock after and while holding a lock of the hardware lock. The hardware lock is released when a software lock has been set or released.

Abstract: According to a method of access to a shared data record subject to contemporaneous read and write access by multiple requesters, a requester reads a shared data record including a payload and a first checksum. The requester calculates a second checksum of the payload of the data record. If the first and second checksums are not equal, the requester again reads the shared data record, including a third checksum, and calculates a fourth checksum of the payload of the shared data record. If the third and fourth checksums are equal, the requester processes the shared data record as valid, and if the second and fourth checksums are equal, the requester handles the shared data record as corrupt.

Abstract: Various embodiments are provided for facilitating construction of a synthetic backup in a deduplication storage system. In one embodiment, a deduplication storage system enables new input data to be deduplicated with data of synthetic backups already constructed, and for this purpose efficiently calculates deduplication digests for synthetic backups being constructed, based on already existing digests of data referenced by the synthetic backups. For each input data segment of the plurality of input data segments of a synthetic backup being constructed, a plurality of deduplication digests of stored data segments, referenced by the input data segment, is retrieved from an index. Each input data segment is partitioned into each of a plurality of fixed-sized data sub-segments.

Abstract: A system and method for application aware de-duplication (de-dup) of data blocks in a virtualized storage array is disclosed. In one embodiment, in a method of application aware de-dup of data blocks on virtualized storage arrays in a storage area network, a de-dup agent is enabled on each of one or more components of the storage area network. A master list of metadata associated with indexed data is then created and stored in the virtualized storage arrays. One or more sublists of metadata are then created from the masterlist and are stored. Upon receiving a write request from an application residing in the host device, it is determined whether data block being written has an entry in a sublist stored in a host device, and if so, the data block is then replaced with a pointer indicating where the data block is residing in the virtualized storage arrays.

Abstract: The present application relates to cloud storage technology and especially relates to a cloud storage data store and retrieval method, apparatus and system. The data storing method comprise grouping source data to be stored according to a predetermined grouping rule; reorganizing the content of the grouped source data to form new data; transmitting the new data to a cloud storage data center for storage. The data retrieval method comprises, as requested, retrieving the data from a cloud storage data center; acquiring data recovery information corresponding to the data; restoring the data to source data according to the data recovery information. This application also provides a cloud storage data storing and retrieving apparatus and system. This invention can improve the data security of cloud storage and mitigate the risk of user data illegal leak and decryption.

Abstract: Data duplication may be reduced in cloud storage. First snapshots of one or more remote volumes may be received via a network. The first snapshots may be copies of the one or more remote volumes at a first instant in time. Responsive to and/or based on the first snapshots, unique clusters and duplicate clusters may be identified among the valid clusters of the remote volumes. The unique clusters and single instances of the duplicate clusters may be stored in a backup file, such that the backup file is devoid of duplicate clusters. Second snapshots of the one or more remote volumes may be received via the network. The second snapshots may be copies of the one or more remote volumes at a second instant in time, wherein the second instant in time is after the first instant in time. Responsive to the second snapshots, the clusters in the backup file that are no longer valid may be utilized to store the valid clusters in the one or more remote volumes not yet stored in the backup file.

Abstract: A method includes quiescing a file system of source storage system through a backup engine associated with the source storage system and a destination storage system and capturing, at the source storage system, a point-in-time image of the file system thereof through the backup engine. The method also includes sharing the captured point-in-time image of the file system of the source storage system with the destination storage system to enable the storage systems to have a common base data and negotiating between the storage systems for the common base data. Further, the method includes applying, to the common base data at the source storage system, a differential change corresponding to a difference between the common base data and a point-in-time image of the file system of the source storage system backed up at the destination storage system.

Abstract: An operating system or virtual machine of an information handling system (IHS) initializes a garbage collector to provide object memory compaction during application execution. The operating system or virtual machine performs move and fixup management within heap or object memory stores. The garbage collector identifies holes or unused portions of heap memory and moves one or more objects during compaction operations. After the garbage collector moves the object, a fixup cache tool fixes up the object pointers within the object. The fixup cache tool maintains a fixup cache that includes pointer information corresponding to the objects that the garbage collector moves. The fixup cache tool employs the pointer information within the fixup cache to update or otherwise fixup the objects within the heap that the garbage collector moves during compaction operations. The fixup cache may provide predictive pointer update information during fixup operations for each object move within the heap.

Abstract: Aspects of the present invention provide a solution for implementing disaster recovery for an application. A subscription backup site for the application is selected from among a plurality of sites. The site that is selected will have a virtual space that is able to accommodate the workload requirements for the application. The application is deflated on the site in such as way as to operate in a dormant state. In the dormant state, the application has a small fraction of its required resources allocated to it. Thereafter, when disaster recovery is needed, the application can be inflated on the subscription backup site by allocating resources to enable the application to execute on the subscription backup site.