Abstract: An agent installed on a server reclaims one or more reclaimable off-site copy storage volumes and one or more reclaimable on-site copy storage volumes. To this end, the agent identifies each reclaimable off-site copy storage volume, runs a plurality of threads to collectively copy each data object of the identified reclaimable off-site copy storage volume(s) that is stored within one or more primary storage volumes to one or more one on-site target copy storage volumes, identifies each reclaimable on-site copy storage volume, and runs the plurality of threads to collectively transfer each data object of the identified reclaimable on-site copy storage volume(s) to the on-site copy target copy storage volume(s).

Abstract: One embodiment is directed to the deletion of content units from a storage system. When a content unit is deleted, a reflection may be created and stored on the storage system. The reflection identifies the deleted content unit and may include additional information, such as a portion of the content of the content unit and audit information regarding the deletion of the content unit.

Abstract: A method and system for efficient space management for single-instance-storage volumes is provided. A backup module storing data within a collection of containers according to access locality and retention time of the data, wherein the retention time defines an amount of time the data is stored within the collection of containers before deletion of the data, and the access locality comprises an order in which the data is to be accessed is further provided. A compaction module compacting the stored data by selecting at least two containers among the collection of containers, wherein the selection is performed using a predetermined criteria that includes access locality and retention time of the data is also provided. The compaction module distributes the data among the at least two containers. The compaction criteria creates an imbalance among the containers to create more empty, full, or nearly full containers.

Abstract: A records management system and method includes sending periodic notifications to record owners and managers when their records are under a hold order. Also, return receipts in response to an e-mail message related to a record are automatically declared as records themselves and linked to the original record.

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: In an image forming apparatus, a first document manager stores image data in an image storage device, associates the image data with a first identifier, outputs the image data via an image output device when the first identifier is specified via an operation device, and deletes the image data from the image storage device when a first condition is satisfied. A second document manager associates the image data with a second identifier, outputs the second identifier via the image output device, and outputs the image data via the image output device when the second identifier is input via an image input device. The first document manager does not delete the image data from the image storage device and prohibits the operation device from specifying the first identifier when the image data is associated with both the first and second identifiers.

Abstract: A system and method for data storage and removal includes providing databases and providing encryption keys. Each database is associated with a database time period and each encryption key is associated with an encryption time period. Data items are received and each data item is encrypted using the encryption key associated with the encryption time period that corresponds to a time associated with the data item. Each encrypted data item is stored in the database associated with the database time period that corresponds to the time associated with the data item. Each encryption key is deactivated at a predetermined time after the associated encryption time period ends. Each database is made irretrievable upon a determination that all of the encryption keys associated with the data items stored in that database have been deactivated.

Abstract: The present invention is a system and method for managing content across one or more storage device systems. A typical system according to the present invention includes one or more indexing systems and a set of storage device systems. Each indexing system monitors usage of content stored on the storage systems. Based upon usage of particular content, an indexing system may issue requests such as move, delete or copy to more efficiently utilize the overall storage capacity of the storage system. All indexing systems monitor the servicing of such requests and update stored data concerning the file subject to the request accordingly.

Abstract: Provided is a computer system which is capable of backup operation with a minimum count of volumes in a remote copy environment when a disaster or the like causes a storage system to stop working normally. The computer system has a host computer, a first storage system, a second storage system, and a management computer. The first storage system contains a data volume which stores data requested by an application to be written. The second storage system contains a mirrored volume to which data stored in the data volume is copied. The computer system is characterized by being configured to receive an input of a policy about backup processing executed in backup volumes and set a configuration of the first storage system and a configuration of the second storage system under the received policy.

Abstract: A two copy versioning scheme is proposed. The scheme provides efficient implementation for a high read load database and eliminates read dependencies. The versioning scheme provides efficient implementation for transactions executing under ANSI READ COMMITTED isolation, and is extensible to serializable isolation. The two-copy versioning scheme is garbage free meaning that all versions of data records are used during execution and is adapted to index scanning operations. A “deferred delete” scheme allows read transactions to complete data deallocation operations. Statements that require “snapshots” are efficiently supported.

Abstract: There is disclosed a method for accelerating network communications. The method may be implemented on a server computer or other computing device. The method may exist as a software program and may be stored on a storage medium. The method may include receiving a request, forwarding the request to a server, receiving a response from the server, and reviewing the response to determine whether the response includes a native expiration. When the response does not include the native expiration, a calculated expiration for the response may be computed. The calculated expiration may be inserted into the response creating an amended response. The amended response may be forwarded to the client. When the response includes the native expiration, the response may be forwarded to the client. The amended response may be stored and provided to other requesters.

Abstract: A method is disclosed for obtaining data from a kernel, including obtaining data from the kernel, and storing the data in a data set an aggregation buffer using an aggregation function. A method is disclosed for storing data in a data set, wherein the data set includes a key component, an aggregation identifier component, and a value component, including obtaining an expression, a new value, and an aggregation identifier, generating a key using the expression and the aggregation identifier; and storing the data set in a buffer, wherein storing the data set comprises storing the key in the key component, storing the aggregation identifier in the aggregation identifier component, and updating a current value in the value component using the new value and an aggregation function.

Abstract: A method, apparatus, and computer program product for setting and implementing a policy to compress the history of data on a temporal volume is described.

Abstract: Aspects for identifying stale contents in a file system include processing a set of attributes of each file in the file system. These aspects further also include determining access times at the directory level, recursively, from all the files in lower-level directories. The aspects further include identifying the highest-level stale directories in the file system.

Abstract: An information processor may include a command receiving unit that receives an immediate processing command in which a deletion target to be deleted from the database is conditioned, and a registration processing unit that registers information defining the deletion target into a management data unit. In addition, the information processor may include a deletion processing unit that deletes the deletion target from a database, and deregisters the deleted deletion target from the management data unit. The information processor can also include a data manipulation command processing unit, which, in the case where a data manipulation command having a manipulation target that coincides with a table of the deletion target registered in the management data unit is received, processes the data manipulation command in a state where a condition to exclude the deletion target from the manipulation target is added to the data manipulation command.

Abstract: Triggers are dynamically created and destroyed on an application database. Rules are represented in active databases as ECA (event-condition-action) items, in which an action formulates a reaction to an event and is executed after the rule is triggered when the condition is evaluated to true. The event is defined as an instantaneous and atomic (that is, the event either happens completely, or not at all) point of occurrence within an application. Events can be classified as either database, temporal, or user-defined events, and their type can be either primitive or composite.

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: A method for keeping track, in an electronic data processing system, of when references made to an element that is stored in memory have all been removed, the method being designed to deal with failures in a manner that does not falsely conclude there are no references.

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 provide a file plan including a plurality of containers, wherein each container is capable of providing management information for record information objects assigned to the container, wherein the record information objects represent documents, wherein one of the containers points to a physical record. An electronic record associated with the physical record is stored. The physical record is automatically associated with the electronic record by updating the file plan.

Abstract: A computer receives records to be published to a target application, including at least one record identified as not effective until a specified date in future. The target application is unable to delay processing of the identified record(s) until after the specified date. Hence, the computer is programmed, e.g. by a software developer extending predefined classes, to initially prepare and transmit to the target application, an outgoing message based on records that are not future dated, while omitting a new record to be effective in future. The computer stores the omitted data in a store of data to be published in future. The computer is pre-programmed to automatically respond to a date for data in the store becoming current, by preparing and transmitting a new version of the outgoing message, based on to-be-published data from the store, and based on a current version of previously published data if needed.

Abstract: An archiving system for enabling searching for collections of items is disclosed. A processing unit displays an archived items collection management template in respect of a particular collection of items and prompts a user to complete the template fields with data obtained by the user from manually reviewing that collection of items to capture information relevant to each of the template fields. An archiving controller stores, in pre-determined data fields of a storage area of a data store corresponding to said collection of items, the data from the completed template fields. A document search controller may search the pre-determined data fields of the storage areas of the data store corresponding to each of the collections of items to identify ones of the collection of items which match search criteria.

Abstract: Machines and methods for optimizing data storage among a plurality of data storage repositories are provided. The method comprises processing a data request submitted for storing data on one or more data storage mediums; determining whether duplicate copies of the data are to be maintained on more than one storage medium so that established quality of service requirements are met; and managing duplicate copies of the data on said one or more data storage mediums to meet the established quality of service requirements while servicing the data request.

Abstract: A system and method for optimizing a storage system to support short data object lifetimes and highly utilized storage space are provided. With the system and method, data objects are clustered based on when they are anticipated to be deleted. When an application stores data, the application provides an indicator of the expected lifetime of the data, which may be a retention value, a relative priority of the data object, or the like. Data objects having similar expected lifetimes are clustered together in common data structures so that clusters of objects may be deleted efficiently in a single operation. Expected lifetimes may be changed by applications automatically. The system automatically determines how to handle these changes in expected lifetime using one or more of copying the data object, reclassifying the container in which the data object is held, and ignoring the change in expected lifetime for a time to investigate further changes in expected lifetime of other data objects.

Abstract: A method and system for the management of deletion requests for related documents in a content management system. When a user requests to delete a related document associated with a record in the content management system, the request determines whether there are other documents associated with the record, collects the documents and determines if any of the collected documents are parent documents, removes the association between each collected document and the record, and initiates a deletion process to delete the parent documents.

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: Tombstones can be removed from a data store without data corruption. Tombstones placed into a forgotten knowledge list can be compared against each other and/or items in a tombstone table, and deleted when tombstones representing subsequently deleted items are extant. Also, creation database version information can be kept along with database items, and databases can record database version information when they synchronize. If a synchronizing database discovers an item that it does not have, but the creation database version information associated with the item reflects that the synchronizing database “should” have the item, then it can be inferred that the item was subsequently deleted, and item resurrection can be prevented.

Abstract: In one embodiment, there is provided a method for a media storage device to manage digital content. The method comprises determining if there is digital content to be categorized into one or more galleries; automatically categorizing said digital content into the one or more galleries; and for digital content categorized into a gallery with an auto-publish flag, sending at least one of said digital content and a derivative form of said digital content to a server.

Abstract: Data that is to be deduplicated and compressed is received. The data is compressed then deduplicated to generate first compressed then deduplicated data. The data is deduplicated then compressed to generate first deduplicated then compressed data. The first compressed then deduplicated data is stored if the first compressed then deduplicated data is smaller in size than the first deduplicated then compressed data. The first deduplicated then compressed data is stored if the first deduplicated then compressed data is smaller in size than the first compressed then deduplicated data.

Abstract: During the normal operation state of a computer system 1000, the data stored in a primary storage system 200P is copied to an intermediate storage system 200I via synchronous copying and the data stored in the intermediate storage system 200I is copied to a secondary storage system 200R via asynchronous copying. During the reverse operation state, however, the data stored in the secondary storage system 200R is copied to the intermediate storage system 200I via asynchronous copying and the data stored in the intermediate storage system 200I is copied to the primary storage system 200P via synchronous copying. In this way, practical remote copying can be carried out in a computer system in which three or more storage devices are installed at different locations and connected serially.

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: There is provided a computer-readable medium storing a program causing a computer to execute a process for controlling archiving of an electronic document, the program causing the computer to function as: a requirement memory that stores a document archive requirement for each rule; and an archive processor that judges, on the basis of the requirement memory, each document archive requirement corresponding to each rule to be applied to an electronic document to be archived, determines an archive mode which satisfies all of the judged document archive requirements, and executes a process to archive the electronic document in an archiving device in the determined archive mode.

Abstract: Data is decayed over time by a type of data item by identifying constituent units of each data item; creating a shelf-life criterion for the constituent units by assigning dimensions to each data item and to each constituent unit; for each of the data items of the data item type, establishing relationship factors for each data item to other data items, between constituent units within data items, and between data items; periodically calculating or updating a decomposability index for each constituent unit as a function of the priority dimensions and the data life dimensions by moving the index towards a threshold for constituent units which are reproducible; and subsequently, decaying the data by deleting from storage constituent units which have decomposability indices exceeding a configured threshold, thereby reducing the amount of storage occupied by a remaining plurality of data items.

Abstract: A framework for identifying and resolving inconsistencies between multiple data sources is provided. Identification data that indicates rules for identifying inconsistencies between multiple data sources is stored. Rule data that indicates rules for resolving inconsistencies between the multiple data sources is also stored. The rules contained in the identification data are evaluated by an inconsistency identifier. Based on the evaluation, the inconsistency identifier generates output data that identifies the inconsistencies between the multiple data sources. The output data may be stored in a persistent store. Reports and user interfaces may be generated that present the generated output data. An inconsistency resolver processes the output data and the rule data to resolve one or more of the inconsistencies that are identified in the output data in a manner indicated by the rules represented in the rule data.

Abstract: Generating backup sets for a specific point in time from backup data stored in a backup storage device is provided. A backup set, in accordance with an illustrative embodiment, is a collection of the files and data that would have been the most recently backed-up version of a computer's files and data at the particular point in time if the backup set had been created at that point in time. In order to generate the backup set, versions of data objects are identified in the backup storage system that have backup timestamps equal to or prior to the designated point in time and that have deactivation times that are after the designated point in time. In addition, a mechanism for deleting versions of data objects based on a retention time and an inactive version limit is provided.

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 method, system, and computer program for dynamically setting up collaborative associations between a group of users, computing resources, and/or communication devices, where the constituents of the collaborative association are chosen based on a variety of contextual criteria. The dynamic collaboration enabler component determines the explicit identities of the parties that should be a part of the collaboration. The group of individual entities involved in the collaboration can change dynamically during the lifetime of the collaboration, based on appropriate changes in the contextual data. Such contextual data refers to both state variables associated with the collaboration software or infrastructure itself, or to the state of entities external to the collaboration. The duration of the collaborative association is specified either explicitly or through a set of context related conditions.

Abstract: Methods and systems for automatically tuning the undo retention in a database system are disclosed. The undo tablespace may be of a fixed size or may be set to be automatically extended. If the undo tablespace is of a fixed size, the undo retention is set to a “best possible” undo retention, which is calculated based on statistical data stored in the system. If the undo tablespace is configured to be automatically extensible, the undo retention may be set to be greater than the duration of the longest running query in the system. The duration of the longest running query may be calculated in a distributed process in which each instance broadcasts information about its longest running query to other instances.

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 video contents recording apparatus and a method of managing a data storage medium include: a data storage medium in which a plurality of contents are recorded; and a controller displaying a list of contents to be deleted generated from the contents recorded in the data storage medium to a user via a display unit according to a predetermined delete priority and deleting contents selected by the user from the data storage medium with reference to the list. According to an embodiment of the present invention, a recording space of a data storage medium having limited data storage capacity may be efficiently managed by automatically deleting contents stored in the data storage medium according to a predetermined priority selected by a user or by providing a delete list for referring to when the user determines contents to be deleted.

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 for synchronizing account names from a plurality of source security systems. In response to coupling a conversion system between the plurality of source security systems and a target security system, identity data from a human resource system and account data from the plurality of local source security systems is loaded into the conversion system. A name resolution rule set is retrieved and a unique account name identification is generated for a set of account names associated with an identity using the name resolution rule set. The set of account names associated with the identity is converted to the unique account name identification to produce a synchronized set of account names associated with the identity. Then, the synchronized set of account names associated with the identity is stored in the target security system.

Abstract: Systems and methods for decomposing and decaying data over time by decomposing a type of data item into constituent units of the data item, establishing relationship factors between data items to other data items and between constituent units, creating a shelf-life criterion for the constituent units priority dimensions, calculating or updating a decomposability index for each constituent unit as a function of the priority dimensions while also applying a relationship factor and optionally incrementing for another dimension, and then decaying over time the data items by deleting all constituent units which have decomposability indices exceeding a configured threshold.

Abstract: A data migration method is provided which can provide a user at a low cost with a function of migrating data from an existing storage when an additional storage is installed. A business application is operated by using a business server and a first storage. When the capacity and performance of data used by a business application become insufficient, a second storage is installed to compensate for insufficiency. In this case, the management server collectively copies data and configuration information of the first storage to the second storage, the data and configuration information are deleted at a later time in accordance with migration command information selected from a GUI screen. It is therefore possible to migrate necessary data and configuration information of the first storage to the second storage, without making a user be conscious of the details of the configuration information of logical devices of a storage.

Abstract: The present invention relates to a method or an operation for providing a personalized TV-Anytime metadata service. According to an embodiment of the present invention, there is provided a method of deleting user metadata managed by a TV-Anytime metadata server using a SOAP operation, comprising the steps of a) providing an element type of a SOAP delete operation, the element of the SOAP delete operation including at least a first sub-element for designating user identifier information, b) receiving the element of the SOAP delete operation, in which the user identifier information is designated, from a client of a user, and c) identifying the user on the basis of the user identifier information in the received element of the SOAP delete operation and deleting user metadata about the identified user.

Abstract: Consistent retention and disposition of managed content and associated metadata is disclosed. An indication that a retention policy is to be applied to a selected item of content comprising a body of managed content is received. The selected item of content and its associated metadata are retained automatically in parallel in accordance with the retention policy.

Abstract: A server, which functions as an image data control device, makes a judgment as to whether a job containing image data stored in a hard disk of the storage unit has received deletion designation for being designated to be deleted from the hard disk. Then, among the jobs judged to have received the deletion designation, the server provides control that prevents a referenced job containing image data that is referenced by a reproduced or combined job (referencing job) from being deleted from the hard disk.

Abstract: The present invention discloses a method and system that automatically analyzes digital images containing people or objects to generate derived data from the images including non-imaging numerical data and text data. The image content of the digital image can then be destroyed and the derived data can be stored along with any associated capture metadata for use and/or analysis. By converting images containing people to derived data and associated capture metadata, which does not include images of people or likenesses of people, the privacy of the individual is maintained. The method is useful for security monitoring and advertising.

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.