Abstract: A database spread over multiple nodes allows each node to store a journal recording changes made to the database and also allows a journaling component to manage the memory space available for journaling. Two threshold size values may be specified for the journal. The first threshold value specifies a journal size at which to being pruning the journal on a given node. A journal pruning algorithm may be used to identify journal entries that may be removed. For example, once a given transaction completes (i.e., commits) the journal entries related to that transaction may be pruned from the journal. The second threshold value specifies the maximum size of the journal. After reaching this size, journal entries may be written to disk instead of the in-memory journal.

Abstract: Techniques introduced herein allow writeable PPIs to be analyzed prior to deletion to determine whether or not the writeable PPIs have reached the end of their life cycle. Prior to deletion a writeable PPI manager can inspect the writeable PPI to determine whether or not the writeable PPI has reached the end of the writeable PPI life cycle. If various criteria are not met, then the writeable PPI can be determined to have not yet reached the end of its life cycle and the deletion can be prevented.

Abstract: A method and apparatus for protecting file data is provided that combines or merges revision based backup with backup based on time intervals. One embodiment is directed to a method for protecting data contained in a file of a computer system, wherein the computer system is useable to create multiple successive file versions. The method comprises the steps of specifying a maximum number of file versions that can be stored collectively at first and second storage locations, and apportioning the maximum number into a first number of file versions and a second number of file versions. The method further comprises storing the most recent of the multiple file versions, up to a number equal to the first number, at the first storage location. A number of file versions respectively created before the stored most recent versions, up to a number equal to the second number, are stored at the second storage location, over a pre-specified time period and in accordance with a pre-specified strategy.

Abstract: The embodiments of the invention provide methods, computer program products, etc. for autonomic retention classes when retaining data within storage devices. More specifically, a method of determining whether to retain data within at least one storage device begins by storing data items in at least one storage device. Furthermore, the method maintains access statistics for each of the data items, an age of each of the data items, and an administrator-defined importance value of each of the data items. Following this, a retention value is calculated for each of the data items based on the access statistics for each of the data items, the age of each of the data items, and the administrator-defined importance value of each of the data items.

Abstract: A content platform (or “cluster”) that comprises a redundant array of independent nodes is logically partitioned. Using a web-based interface, an administrator defines one or more “tenants” within the cluster, wherein a tenant has a set of attributes: namespaces, administrative accounts, data access accounts, and a permission mask. A namespace is a logical partition of the cluster that serves as a collection of objects typically associated with at least one defined application. Each namespace has a private file system with respect to other namespaces. This approach enables a user to segregate cluster data into logical partitions. Using the administrative interface, a namespace associated with a given tenant is selectively configured without affecting a configuration of at least one other namespace in the set of namespaces. One configuration option is a “disposition service” that, once enabled for a namespace, automatically deletes objects that were once under retention and whose retention time has expired.

Abstract: This invention provides a specified retention date within a data set that is locked against deletion or modification within a WORM storage implementation. This retention date scheme does not utilize any proprietary application program interfaces (APIs) or protocols, but rather, employs native functionality within conventional file (or other data containers, data sets or block-based logical unit numbers) properties available in commonly used operating systems. In an illustrative embodiment, the retention date/time is calculated by querying the file's last-modified time prior to commit, adding the retention period to this value and thereby deriving a retention date after which the file can be released from WORM. Prior to commit, the computed retention date is stored in the file's “last access time” property/attribute field, or another metadata field that remains permanently associated with the file and that, in being used for retention date, does not interfere with file management in a WORM state.

Abstract: In one embodiment, a method for providing a transient data facility for database applications includes creating a definition of transient data that corresponds to a unit of work to be performed by an application, and mapping the definition of transient data to a temporary storage table. The method further includes storing the transient data in the temporary storage table while the application performs the unit of work spanning one or more user sessions, and deleting the transient data after the application completes the unit of work.

Abstract: Methods, systems, and apparatus, including computer program products, for data structure locking. In one aspect, a proper subset of variables of a set of variables in a data structure are received. An access privilege to modify variables in the data structure to administrator accounts is assigned. A first administrator access request to modify a variable in the proper subset of variables is received, and the access privilege to modify the variable in the proper subset of variables for the first administrator account. A second administrator access request to modify the variable in the proper subset of variables is received, and an access timer that expires after a time period is initiated; the access privilege is disabled for the first administrator account in response to expiration of the access timer; and the access privilege for the second administrator account is enabled in response to expiration of the access timer.

Abstract: System and method for removing threads from discussion groups based on ratings of the individual posts within the thread. If a user takes the time to rate a post positively, then the post (and the thread) is considered to be useful to the entire community and should not be deleted. To rate the post, a window is displayed to the user whenever the post is open and queries the user whether the post is useful. A positive rating resets a delete date associated with the post. If there is not positive rating of a post, the thread may be considered useful if the originator of a post marks the post as being answered, in which case delete clock is reset. If however, none of the posts within the thread are rated positively, then the thread is considered not be useful and deleted.

Abstract: A plurality of data elements are stored on storage devices in a storage system and are identified by unique identifiers. Each data element has management information associated therewith for enabling management of a quality of service of each data element individually. The management information is individually changeable for each data element for changing the quality of service of each data element individually without affecting the quality of service of others of the data elements. The quality of service of a particular data element can be changed as a result of the storage system receiving a WRITE request sent to the storage system, the WRITE request being directed to a virtual metadata file corresponding to the particular data element and specifying a new quality of service for the particular data element or specifying custom metadata for the particular data element.

Abstract: A peripheral device has a mounting portion and a storage unit. The mounting portion is configured to mount a removable storage. The storage unit is configured to store data. The reading out unit reads out specific information from the removable storage medium when the removable storage medium is mounted to the mounting portion. The deletion unit deletes at least part of the data in the storage unit based on the specific information read out by the reading out unit.

Abstract: A problem of prior art is that normal backup data is lost as a result of taking a backup by overwriting the normal backup data with data that has been changed greatly from a virus infection or the like. This invention provides a computer system having a storage system. The storage system contains a first storage area and a second storage area for storing a copy of data that is stored in the first storage area at one point in time. Only when the differential amount indicating the difference between data stored in the first storage area and data stored in the second storage area is smaller than a predetermined threshold, the storage system deletes the data which is stored in the second storage area and newly stores a copy of the data stored in the first storage area in the second storage area.

Abstract: A system facilitates the deletion of data, such as files, orphaned chunks, and stale replicas. The system may identify a file to be deleted, rename the identified file, permanently delete the renamed file a predetermined amount of time after renaming the identified file as part of a garbage collection process, receive, from the servers, information concerning chunks stored by the servers, and identify, to the servers, ones of the chunks that do not exist possibly due to the permanent deletion of the renamed file. The system may further provide a mapping of file names to chunks, identify chunks, as orphaned chunks, that are not reachable from any of the file names, delete the orphaned chunks, receive, from the servers, information concerning chunks stored by the servers, and identify, to the servers, ones of the chunks that are orphaned chunks.

Abstract: Policies are associated with files according to a number of criteria, for example, a file type and a user who created the file. Policies may control when a file can be deleted. In one example, a device includes a computer-readable medium configured to store a file, and a processing unit configured to determine a time of retention for the file specified by a policy associated with the file, receive a request to delete the file, and delete the file in response to the request only after the time of retention for the file specified by the policy has passed. In addition, a file may be subject to a legal hold that prevents the file from being deleted even after the time of retention has passed. Similarly, while a user stores a link to the file, the device may prevent the file from being deleted.

Abstract: Systems, methods, and software for managing information retention using uniform retention rules is disclosed. Particularly, the disclosure relates to identifying data to be archived and assigning, inter alia, a destruction date to the identified data. Data for archival are identified using one or more defined retention rules. The retention rules identify the data for archival by one or more properties of the data. Once identified, retention information is applied to the identified data.

Abstract: Retention and disposition of components of a complex stored object is disclosed. An indication that a retention policy is to be applied to a complex stored object comprising a root content object and one or more child content objects included in a body of managed content is received. The root content object and the one or more child content objects and associated metadata are retained in parallel automatically in accordance with the retention policy.

Abstract: Systems and methods for managing digital assets in a distributed computing environment are described. Meta-data for the digital assets is stored separately from the digital assets. Meta-data for some of the digital assets is copied and stored at a central location. Meta-data for the digital assets is generated by clients of the system.

Abstract: Methods and systems for using undo hints to speed up segment extension are disclosed. While a process is searching other segments to find available space, the process collects undo hints that describe when space in a segment might become available. These undo hints are placed in a table of undo hints. When a process is not able to find available space, it may consult the table of undo hints to determine how much to decrease the undo retention. After the undo retention is decreased, the process may again consult the table of undo hints to find a segment that likely contains available space now that the undo retention time has been reduced.

Abstract: A method and computer-readable medium are provided for formula-based document retention. According to the method, a retention formula and a retention action are defined for one or more items. The retention formula is utilized to calculate a retention date for each item. The retention action specifies the action that should be taken on or after the retention date. The retention date for one or more items is initially calculated using the retention formula for the items. A retention service may be periodically executed to identify any items having a retention date earlier than the current date. If any items are identified that have a retention date earlier than the current date, the retention service recalculates the retention date for these items utilizing the corresponding retention formula. If the recalculated retention date for any item is still prior to the current date, the retention action for the item is executed.

Abstract: It is presented a method for managing content items of a mobile communication terminal. The method comprises the steps of: reading a current time, selecting at least one content item, reading a time of last access of said at least one selected content item, calculating a difference between said current time and said time of last access of said at least one selected content item, and conditionally deleting said at least one selected content item, said condition of deleting comprising at least that said difference is larger than a threshold value. A corresponding mobile communication terminal and computer program are also presented.

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 method and apparatus for protecting file data is provided that combines or merges revision based backup with backup based on time intervals. One embodiment is directed to a method for protecting data contained in a file of a computer system, wherein the computer system is useable to create multiple successive file versions. The method comprises the steps of specifying a maximum number of file versions that can be stored collectively at first and second storage locations, and apportioning the maximum number into a first number of file versions and a second number of file versions. The method further comprises storing the most recent of the multiple file versions, up to a number equal to the first number, at the first storage location. A number of file versions respectively created before the stored most recent versions, up to a number equal to the second number, are stored at the second storage location, over a pre-specified time period and in accordance with a pre-specified strategy.