Abstract: A method of performing transactions in accordance with fairness criteria is provided wherein one of a plurality of entities initiates a transaction on an object at a database. The steps or operations of the initiated transaction are immediately processed up to the transaction ownership step. Propagation delays are determined between the database and at least some of the other entities that are capable of initiating transactions to the database. The propagation delays and a fairness criteria is used to determine the fair propagation delay period. Upon determining that the fair propagation delay period has been exceeded, it is detecting whether any of the other entities initiated a transaction on the same object during the fair propagation delay time period. If not, then the transaction initiating entity performs the transaction ownership step on the initiated transaction.

Abstract: A method includes identifying a buddy database projection that corresponds to a recovering database projection that is to be recovered to a recovering node of a database system. A source container containing data of the buddy database projection is identified on a source node of the database system, the source container being characterized by a range of epochs that includes an epoch for which data is to be recovered to the recovering node. Data is copied from the identified source container to the recovering node.

Abstract: Persistent data, such as disks associated with virtual machines, are migrated between and across data stores using mirrored input-output operations (IOs). The migration technique employs a data mover to copy selected regions of the virtual machine disk to a target data store while the virtual machine is executing. If the virtual machine issues a write IO, the write IO is selectively mirrored on the target data store depending on whether or not the write IO is in a region of the virtual machine disk that has already been copied.

Abstract: Techniques are described for managing relationships between entities in a content management system. Embodiments of the invention identify a relationship between a first entity and a second entity in the content management system. Embodiments monitor the first entity in the content management system to detect an occurrence of a triggering event specified in one or more management rules. One or more actions specified by the one or more management rules are then performed on the second entity in the content management system, responsive to the detected occurrence of the triggering event.

Abstract: A contents management system comprises a plurality of subsystems which include: a storage subsystem to store a plurality of objects; a contents gateway server configured to create snapshots of the objects and store the snapshots in a first snapshot layer; a system management control unit configured to determine whether the number of snapshots in the first snapshot layer exceeds a corresponding limit for the first snapshot layer and, if yes, to migrate the snapshots from the first snapshot layer to a second snapshot layer provided by another subsystem of the contents management system, and delete the migrated snapshots from the first snapshot layer; and a contents management server configured to track location changes of the snapshots of the objects during migration of the snapshots and to re-index an index data of the snapshots of the objects based on the tracked location changes.

Abstract: Each time the file access request is received, it is discriminated whether there is an ACL which corresponds with the file system of the type following the switching in the file designated by the file access request. In cases where the judgment result is that there is no such ACL, an ACL which corresponds with the file system of the type following the switching is generated on the basis of an ACL which corresponds with the file system of the type prior to the switching which is associated with the designated file, and the ACL thus generated is used to control access in accordance with the received file access request.

Abstract: Embodiments of the invention relate to dynamic application migration in a shared pool of configurable computer resources with disaster recovery support. Data from an application is replicated from local data storage to remote data storage. A consistency point of the data is created in both the local data storage and the remote data storage. The application may be migrated to a second data site with separate local data storage. The migration may be planned or unplanned. Based upon the created consistency point, a consistent set of application data may be requested to support a read operation from the migrated application.

Abstract: Techniques for replicating data in database systems are described. In an example embodiment, a set of changes is received at a destination database, where the set of changes has been applied at a source database and is being replicated from the source database to the destination database. The set of changes is analyzed and it is determined that the set of changes includes two or more of: a subset of row-level changes, a subset of statement-level changes, and a subset of procedure-level changes. A set of dependencies is determined at least between the changes that are included in the subsets of changes. The changes, in the subsets of changes, are assigned to two or more processing elements. The set of changes is applied to the destination database by executing the two or more processing elements in parallel to each other and based on the set of dependencies.

Abstract: Each file is assigned in advance with a WWUID, newly assigned to a file upon the creation or update of the file and inherited from a file to a copied file when it is copied. In a backup apparatus, a file name reception unit receives the file name of a backup target file. A WWUID reception unit receives a WWUID corresponding to the file name. A WWUID search unit searches for the same WWUID in backup management information of a previous day stored in a backup destination. Only if the search is failed, a file operation instruction unit instructs the storing of the backup target file into the backup destination. Then, an Rcnt update instruction unit instructs the updating of the number of references made to the WWUID within the backup destination. A second management information update instruction unit then instructs updating of backup management information of the current day.

Abstract: A method for using a reference volume for initial synchronization of a replicated volume group. The method includes initiating a replication and synchronization operation between a parent virtual machine and a child virtual machine, and specifying a parent virtual machine to be used for replication and a subsequent synchronization. The method further includes accessing a point in time snapshot of the parent virtual machine, coordinating with a secondary site to obtain an image of the parent reference volume at said point in time, and copying the common regions from a parent reference volume to a new volume. The differences between the parent reference volume and the new volume are transmitted and are applied to the new volume to synchronize the child virtual machine on the secondary site to the child virtual machine on the primary site, wherein the child and the parent may be in different virtual machine groups.

Abstract: Hierarchical recovery of failed computing nodes to operative computing nodes within a cluster of computing nodes is managed by initiating a recovery leader at an operative node that retrieves management information from the operative nodes and applies the management information to recover filesets of a meta-fileset in a hierarchical filesystem. The use of hierarchical filesets throughout the cluster provides more rapid failover by distributing recovery load across computing nodes and supporting recovery of nodes in parallel.

Abstract: Mechanisms, in a data processing system, are provided for performing a data management operation. These mechanisms identify one or more defined groups of data elements that are a target of the data management operation. One or more previously generated snapshot files associated with the one or more defined groups are identified and a determination is made as to whether at least one previously generated snapshot file of the one or more previously generated snapshot files associated with the one or more defined groups is able to be reused when performing the data management operation. The data management operation is performed based on the determination of whether at least one previously generated snapshot file of the one or more previously generated snapshot files associated with the one or more defined groups is able to be reused when performing the data management operation.

Abstract: A method for providing rolling continuous data protection of source data is disclosed. In one embodiment, such a method includes enabling a user to select source data and establish a first interval when point-in-time copies of the source data are generated. The method further enables the user to specify a first number of point-in-time copies to retain at the first interval. The method further enables the user to specify a second number of point-in-time copies to retain at a second interval, wherein the second interval is a (n?2) multiple of the first interval. The method further enables the user to specify a third number of point-in-time copies to retain at a third interval, wherein the third interval is a (n?2) multiple of the second interval. A corresponding apparatus and computer program product are also disclosed.

Abstract: A file system is disclosed that includes an application wide name space instantiated in a global index (Gindex) that is used for accessing objects related to an application. Using the Gindex, a method for cache coherency includes establishing one or more appliances, each defining a storage cluster; establishing one or more tenants spanning across appliances, wherein an application stores objects in file systems associated with the appliances and tenants; establishing a Gindex including metadata relating to objects stored in association with the application; replicating the Gindex to plurality of data centers supporting the tenants; storing an original object at a first data center; storing a cached copy of the object at a second data center; aligning the cached copy using metadata for the object from a local copy of the Gindex.

Abstract: A method and system for restoring a computing environment from a secondary data store, and facilitating such restoration, is described. In some examples, the system copies the configuration parameters of a computing environment, such as a file system, as well as the data within the file system, and transfers the copies to secondary storage for later restoration. For example, the system may generate an xml file of the configuration parameters of the computing environment when a backup operation of the computing environment is performed, and store the xml file along with copies of the data from the computing environment in secondary storage.

Abstract: In one embodiment, a computer program product for handling a point-in-time copy (PITC) command includes a computer readable storage medium having computer readable program code embodied therewith. The computer readable program code is configured to: receive a PITC command at a local site, create a data representation that represents updates to make to the at least one target volume of the local target storage location, wherein the updates correspond to changes made to at least one source volume of the local source storage location since execution of an earlier PITC command, create a source data sidefile entry for the at least one source volume, create a target data sidefile entry for the at least one target volume, execute the PITC command at the local site, and create a PITC sidefile entry for the PITC command, the PITC sidefile entry including a timestamp that indicates when the PITC command was executed.

Abstract: A method and system for creating secondary copies of data whose contents satisfy searches within data stores is described. In some cases, the system searches for data within a data store, identifies a set of data that satisfies the search, copies the identified set of data, and transfers the copy to secondary or other storage. In some cases, the system utilizes search-based secondary copies of days during restoration processes in order to restore data similar to and/or associated with data requested to be restored.

Abstract: Disclosed are an apparatus and methods of determining if at least one data file has been de-duplicated. One example method may include receiving a filekey based on at least a portion of the content of the at least one data file, checking a de-duplication registry in a database to determine whether a pre-stored filekey is present, decrypting at least a first data associated with the filekey and at least a second data associated with the pre-stored filekey, and comparing the decrypted at least first data with the decrypted at least second data to determine whether the at least one file has been de-duplicated.

Abstract: According to one embodiment, a request is received for obtaining a consistent point of data stored in a file system of a storage system having a plurality of storage units. In response to the request, retrieving a prime dependency list from a first prime segment stored in a first of the storage units, where the prime dependency list includes information identifying at least a second prime segment stored in a second of the storage units. The first and second prime segments collectively form a prime segment representing a consistent view of the file system. Each of the prime segments listed in the prime dependency list is ascertained in an attempt to generate the consistent point of data.

Abstract: A scalable computer arrangement and method enables the accessing of stored information by utilizing algorithms. The validity of the algorithms and/or retrieved data are determined by a validity management module. The algorithm and/or the retrieved data may be updated, whereby self correction occurs dynamically over time with changing stored information. In another embodiment, the computer arrangement and method enable networked computer systems each including hyper objects employing embedded algorithms or rules for accessing information across the network in a standardized manner, even though the networked computer system databases may employ different schema and formats.

Abstract: A method, apparatus and database system restore tenant data in a multi-tenant environment. The method comprises: logging a plurality of tenants' requests to the database; with respect to a particular tenant who requires restoring tenant data, acquiring a log of events which affect contents of the database and start from a particular backup point; and only restoring in the database data of the particular tenant to the particular backup point, according to the acquired log of events. When a tenant performs a wrong operation on the database and wishes to roll back to a backup point, only information of the particular tenant in the database is changed into the information at the backup point, without affecting other tenants.

Abstract: A method, system and computer program product for reducing garbage collection pause time. According to example embodiments, a garbage collection cycle is initiated on a set of objects that have been dynamically allocated in a memory. An identification is made of new persistent objects and reachable non-persistent objects while ignoring old persistent objects that have been identified as persistent in previous garbage collection cycles. The new persistent objects are associated as members of a set of persistent objects that includes the old persistent objects. The persistence information for the set of persistent objects is preserved for use during subsequent garbage collection cycles. All reachable non-persistent objects and all persistent objects in the set of persistent objects are marked for memory reclamation phase processing.

Abstract: Multiple service label types may be used in a given network element to optimize scalability of the data plane, minimize overhead associated with service label management, and allow new services to be offered. Service label management may be done in a dynamic manner so that service labels may be selected for routes in a dynamic fashion as the network changes. VPNs handled by the network element may have different types of service labels, and different routes within a particular VPN may be allocated different service label types. Service label requests may be stored on the data plane to allow a service label request database to be restored from the data plane upon a control plane failure, so that new service labels are not required to be allocated after a control plane failure.

Abstract: Backup and restoration of computer information. In one example embodiment, a method includes modifying a volume boot record of a restore volume to a first state in which at least a portion of the restore volume becomes inaccessible to a standard file system, writing restore data to the inaccessible portion of the restore volume while the volume boot record is in the first state, and restoring the volume boot record to a second state in which the inaccessible portion of the restore volume becomes accessible to the standard file system.

Abstract: A method and system for automatic backup of desktop items is described.

Abstract: Embodiments are directed to implementing a transitional redo phase to allow pre-redo phase data access and to determining which data pages including unprocessed transactions are to be processed during a transitional redo phase. In an embodiment, a computer system initiates an analysis phase of a database recovery that scans a database transaction log and builds a dirty page table that includes pages corresponding to unprocessed data transactions. The computer system determines from the dirty page table which pages are to be processed during the transitional redo phase, before the final redo phase. The computer system processes the determined pages during the transitional redo phase, before the final redo phase is reached and, upon completion of the system transaction undo phase, makes available those pages that were processed during the transitional redo phase, as well as those database pages that are not scheduled for processing during the final redo phase.

Abstract: A transaction creates a wait for dependency on a version in a main memory database implementing a multi-version concurrency control scheme. The wait for dependency allows the transaction to update the version while other transactions are reading the version. The multi-version concurrency control scheme also allows commit dependencies to be implementing concurrently with wait for dependencies. Commit dependencies allow a transaction to read an updated version before the updated version is committed.

Abstract: An improved scalable object storage system allows multiple clusters to work together. In one embodiment, a multi-cluster synchronization system synchronizes data between two or more clusters. Each cluster has a cluster-internal network, with object storage services and container services. The container services track and replicate metadata associated with the object storage service. An intercluster network connects the two clusters and performs a one-way synchronization of the objects and metadata associated with a particular container. In a further embodiment, multiple synchronization relationships can be set up, either in a cycle (with two or more participants), in a line, or in a tree. For example, the multi-cluster replication could be used to transparently synchronize objects in a CDN network.

Abstract: Provided are computer program product, system, and method for restoring deduplicated data objects from sequential backup devices. A server stores data objects of extents having deduplicated data in the at least one sequential backup device. The server receives from a client a request for data objects. The server determines extents stored in the at least one sequential backup device for the requested data objects. The server or client sorts the extents according to an order in which they are stored in the at least one sequential backup device to generate a sort list. The server retrieves the extents from the at least one sequential backup device according to the order in the sort list to access the extents sequentially from the sequential backup device in the order in which they were stored. The server returns the retrieved extents to the client and the client reconstructs the requested data objects from the received extents.

Abstract: The system and method for providing assured recovery and replication described herein may recover a master data source from a replica data source without impacting the master data source or the replica data source, and without having to install a standby version of an application associated with the master data source. In particular, a master snapshot may be created to copy application data stored in the master data source, wherein a replication server confirms that the replica data source can recover the master data source if the master snapshot and the replica data source are consistent. The replication server may create a replica snapshot to copy the replica data source and assign an identity associated with the master data source to the replica data source to recover the master data source. As such, replication may be resumed on a virtual machine disk file associated with the replica snapshot.

Abstract: Assigning a single master identifier to all related content assets. Memory is provided for storing content assets and metadata associated with each of the content assets, wherein the metadata includes a plurality of metadata field entries. A processor is coupled to the memory. The processor is configured for analyzing the metadata associated with each of the content assets to produce correlations between metadata field entries associated therewith, identifying related content assets by determining content assets having a predetermined correlation between metadata field entries and assigning a single, unique asset identifier to the related content assets.

Abstract: Embodiments of the invention provide, among other things, an improved system and method for building logical associations (links) between files and for assigning attributes to the files and/or links. In embodiments of the invention, such attribute data is indexed in a data store according to Universally Unique Identifiers (UUIDs) in each file header.

Abstract: Methods for presenting files upon switching between system states and portable terminals are provided. The portable terminal comprising a first system platform and a second system platform, a state in which the presentation of the file is controlled by the first system platform being a first state, and a state in which the presentation of the file is controlled by the second system platform being a second state. The method comprising: detecting, by the first system platform in the first state, that a status of the file satisfies a preset condition; backuping, by the first system platform, the file for the second system platform; and switching to the second state, and continuing, by the second system platform, the presentation of the file based on the backup file.

Abstract: A network-based method for managing locks in a shared file system (SFS) for a group of hosts that does not require any configuration to identify a server for managing locks for the SFS. Each host in the group carries out the steps of checking a predetermined storage location to determine whether there is a host ID written in the predetermined location. If there is no host ID written in the predetermined location, the first host to notice this condition writes its host ID in the predetermined location to identify itself as the server for managing locks. If there is a host ID written in the predetermined location, the host ID of the server for managing locks is maintained in local memory. When the host needs to perform IO operations on a file of the SFS, it communicates with the server for managing locks over the network using the host ID of the server for managing locks to obtain a lock to the file.

Abstract: A system and methods are provided for remotely recovering and purging data from a wireless device in a communications network. The system includes a wireless device capable of executing a data recovery/purge application program for receiving a message from a communications device in the network. The application program retrieves the data in the wireless device, purges the data from the wireless device, and sends a return message, including the data retrieved from the wireless device, to the communications device.

Abstract: According to some embodiments, a column-oriented in-memory database structure may be established. The database structure may, for example, include a main store and a dictionary compressed delta store. Moreover, the delta store may comprise a value identifier vector and a delta dictionary associated with a column of the database. A transaction associated with the column may then be received and recorded within the delta store. According to some embodiments, entries associated with the transaction may be added to a value log of the value identifier vector and, independently, to a dictionary log of the delta dictionary.

Abstract: Disclosed is a method and system for selectively restoring file-level data from a disk image backup. In embodiments, a virtual machine backup may be performed by dividing a virtual machine virtual disk file into a plurality of discrete fixed-sized data blocks sharing a common index file that is stored on a backup medium, such as a hard drive, to form a backup set. Upon restoration of data from the backup set, individual blocks of the data set are compared to corresponding blocks of the target virtual machine fide. Redundant data and unchanged blocks are skipped, and only those block which have changed are restored to the target file. In this manner network bandwidth and processor resources are conserved, and replication times decreased.

Abstract: Methods, systems and computer program products for concurrency control in a hierarchical arrangement of nodes of a data structure by traversing a single search path in a hierarchical arrangement of nodes of a data structure, recording a version number for each node in the search path, identifying at least one node in the search path to be updated, latching the at least one node, reading a version number of the latched at least one node and comparing the recorded version number of the latched at least one node to the read version number of the latched at least one node.

Abstract: According to one embodiment of the present disclosure, a method for multiplex backup using next relative addresses may be provided. The method may include receiving a first chunk and a second chunk that are each associated with a first file. A next relative address may be appended to the first chunk. The next relative address may indicate a position in a storage device. The first chunk with the next relative address may be written to the storage device at a first address. The method may further include writing the second chunk to the storage device at the position indicated by the next relative address of the first chunk.

Abstract: Methods, systems and computer program products for traversing a level in a search path in a tree data structure by recording a version number of a node on the search path, finding a child pointer in the node on the search path, recording a version number of a child node corresponding to the child pointer, reading a version number of the node on the search path, comparing the recorded version number of the node to the read version number of the node, reading at least one child pointer in the node and comparing the read child pointer to an address of the child node.

Abstract: A method for replicating I/O performance in data replication environments, such as PPRC environments, is described. In selected embodiments, such a method includes monitoring I/O workload at a primary storage device over a period of time, such as a period of hours, days, or months. The method then generates learning data at the primary storage device describing the I/O workload over the selected time period. The learning data is replicated from the primary storage device to a secondary storage device. The method uses the learning data to optimize the secondary storage device to handle the I/O workload of the primary storage device. This will enable the secondary storage device to provide substantially the same I/O performance as the primary storage device in the event a failover occurs. A corresponding system and computer program product are also disclosed and claimed herein.

Abstract: According to an embodiment of the present invention, a method for reorganizing a source index tree of a database table resulting in a target index tree of the database table is provided. A backup process reads source leaf pages of the source index tree in a logical order defined by a sequence of index keys. The logical order can be different from a physical order of the source leaf pages defined by a sequence of respective storage locations. The backup process constructs target leaf pages of the target index tree maintaining the logical order. A restore process constructs target non-leaf pages of the target index tree based on the distribution of the index keys among the constructed leaf pages and stores the target leaf and non-leaf pages.

Abstract: In one example, a method may include performance of a hash function on a digital sequence so as to generate a hash value that corresponds to the digital sequence. Next, the digital sequence may be broken into data pieces, and each data piece hashed to produce a corresponding hash value for each data piece. Then, a recipe may be produced that includes instructions which, when executed, may generate the digital sequence from the data pieces referenced by their corresponding hash values included in the recipe. Among other things, the hash values may enable reutilization of redundant data sequences by serving as pointers to the data pieces that the hash values respectively represent.

Abstract: A method of maintaining a data store is disclosed. The data store is distributed across a plurality of storage provider instances, including a master storage provider instance and a plurality of additional storage provider instances. A master data log is updated to reflect a change to the data store. The master data log is synchronized with a plurality of replicas of the master data log. The change is propagated across the plurality of additional storage provider instances based on an analysis of the replicas.

Abstract: In one example, a system that is operable to back up and restore data may include a high efficiency storage application configured to back up a chunk of data of a client system to a content addressed storage system by generating a recipe that includes instructions for generating the chunk of data from a plurality of data pieces. The system may further include a backup server communicably connected to the high efficiency storage application and configured to, among other things, in response to receipt of a restore request, recover the chunk of data by retrieving the recipe and appended storage addresses in one index seek without separately looking up a storage address for any of the plurality of data pieces in an index.

Abstract: A method for synchronizing a database server to a current status of a client database using data cache techniques is provided. Upon initiating synchronization, the database server receives an identification of a client connection, and creates a server-cache-table having a structure that is compatible with the client database. Database records from a corresponding client-cache-table are received through the client connection and inserted into the server-cache-table. The server-cache-table is merged into the database server. Similar cache-tables can be utilized to synchronize data from the database server to the client. Optionally, a parent-cache-table can be created on the server and populated with records associated with the identified client. Queries and other database operations during synchronization can be performed over the parent-cache-table to further optimize performance.

Abstract: Techniques for providing content management services are described. Managing content services includes determining a value of content and determining storage actions of the content based on the value. The value of the content is determined by weighting factors, such as access frequency, a rating, a size of the content, a type of the content, and a security level of the content. Based on the value of the content, one or more storage actions may be determined for the content to optimize storage. The storage actions may include identifying a version of the content to be saved, compressing the content, determining a back up of the content to store, identifying a location to store the content, performing erasure encoding of the content, and/or removing the content.

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: One embodiment is for using a sparse file as a clone. The method includes creating, by an application associated with a computer system, a snapshot of a file, such as an individual file, a collection of files, file system, directories, and so forth. Further, the method includes requesting, by the application, a clone of that created snapshot. Further still, the method includes generating, by the application, an empty sparse having at least one inode identifying the empty sparse file as the clone and pointing to the snapshot associated with the clone. Thereby, the requested clone is created using the created sparse file, which begins as an empty sparse file.

Abstract: The present invention discloses a method and an apparatus for data disaster tolerance preprocessing and a Service Control Point (SCP), the method and the apparatus are used in each SCP of a plurality of SCPs with databases, the method comprises: setting a first database in a first SCP, wherein the first database is used to perform disaster tolerance backup for a second database in a second SCP. Through the present invention, the cost of the construction of the system is reduced, and the stability and feasibility of a disaster tolerance system are enhanced.