Abstract: A method for execution in a dispersed storage network operates to determine one or more slice names of one or more slices to consider for deletion; determine an access policy corresponding to the one or more slices; determine a current timestamp; and determine when there is no future slice availability for the one or more slices, based on the current timestamp and the access policy. When there is no future slice availability for the one or more slices, the dispersed storage network determines when reconsideration is available and sends a reconsideration message to a reconsideration entity when the reconsideration is determined to be available. The dispersed storage network deletes the one or more slices when the reconsideration is determined to be unavailable.

Abstract: In one embodiment, entries in a database journal in a non-interactive mode can be partially flushed to maintain database performance. In particular, data records that require decryption prior to flushing a database journal entry can be bypassed in non-interactive mode, while data records that need not be decrypted can be flushed. For example, entries that relate to a creation or deletion of a data record can be performed, while entries relating to modification of an existing record can be bypassed and processed during an interactive mode of operation. Other embodiments also include a transformation of the database journal using a filter so that multiple entries to a same record can be combined.

Abstract: A content management system manages documents such that a document is received and stored in the content management system. Access privileges (e.g., an Access Control List) to the document are defined for one or more users of the content management system. An occurrence of a document life cycle event with respect to the document is detected and a distribution list is generated for notifying the one or more users of the document life cycle event based on the access privileges of the one or more users.

Abstract: A content management system manages documents such that a document is received and stored in the content management system. Access privileges (e.g., an Access Control List) to the document are defined for one or more users of the content management system. An occurrence of a document life cycle event with respect to the document is detected and a distribution list is generated for notifying the one or more users of the document life cycle event based on the access privileges of the one or more users.

Abstract: A data health management apparatus may include a non-transitory memory and a processor communicatively coupled to the memory. In some cases, the processor may be configured to process instructions read from the memory. For example, the instructions may cause the processor to identify data associated with an application, where the data stored in at least one data repository. The processor may then analyze, the data stored in the at least one data repository, such as via a network, to determine a data health metric. The instructions may then cause the processor to determine an action to be performed on the data repository based on the determined data health metric.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

Abstract: A method, computer program product and system are provided. The method, computer program product and system execute a process for determining a size of an object, the object having raw data that is operable upon by one or more physical operators. If the object is smaller than a threshold size, the object is stored in main memory of an in-memory database system. If the object is equal to or larger than the threshold size, the object is stored in a persistency of a disk storage, where storing the object in a disk storage further includes generating a global container identifier (ID) for the object, the global container ID referencing raw data of the object stored in the persistency of the disk storage.

Abstract: Data on a storage device may be marked as sensitive data and this marked sensitive automatically destroyed (e.g., scrubbed) upon erasure. For example, when sensitive data is erased, new data may be immediately written over the erased sensitive data. To destroy the erased data, random characters and/or a fixed sequence of characters may be written over the erased data. The storage device, the operating system, and/or other software may share tasks related to tracking and scrubbing sensitive data. Scrubbing may include writing a fixed sequence, such as zeroes, or writing random characters of data.

Abstract: Embodiments of the invention relate to data placement for loss protection in a storage system. One embodiment includes constructing multiple logical compartments. Each logical compartment includes a placement policy including a set of storage placement rules for determining permitted placement of storage symbols on specific physical storage containers, and a balancing policy for determining a particular placement of the storage symbols among permitted placements for balancing the storage symbols for each volume among the physical storage containers that is useable within the placement policy.

Abstract: An electronic service provides a sample of a media item to a user, along with a prompt. The prompt gives the user the opportunity to receive an additional part of the item substantially without further interaction with the user. The streamlined acquisition of the additional part of the media item is enabled by the user's establishment, in advance, of user identification information, payment information, and so on.

Abstract: A system method and program product for data replication comprising based on metadata, creating a mapping of pending IO to a logical storage medium and changing a mapping of the logical storage medium to tiered storage mediums to optimize the pending IO to the logical storage medium.

Abstract: A sampling based technique for eliminating duplicate data (de-duplication) stored on storage resources, is provided. According to the invention, when a new data set, e.g., a backup data stream, is received by a server, e.g., a storage system or virtual tape library (VTL) system implementing the invention, one or more anchors are identified within the new data set. The anchors are identified using a novel anchor detection circuitry in accordance with an illustrative embodiment of the present invention. Upon receipt of the new data set by, for example, a network adapter of a VTL system, the data set is transferred using direct memory access (DMA) operations to a memory associated with an anchor detection hardware card that is operatively interconnected with the storage system. The anchor detection hardware card may be implemented as, for example, a FPGA is to quickly identify anchors within the data set.

Abstract: Managing data in a multitenant environment having a relational database and a non-relational database. A set of one or more policies for data retention corresponding to data stored in the relational database environment is received. The policies for data retention are defined on a tenant-by-tenant basis within the multitenant environment. The policies are deployed to data in the relational database on a tenant-by-tenant basis within the multitenant environment. Data to be copied from the relational database to the non-relational database is identified. The data to be copied in the non-relational database is stored while maintaining tenant isolation so that data belonging to the respective tenants is not accessible by other tenants when stored in the non-relational database.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for automatic code generation for database object deletion. These mechanisms and methods for automatic code generation for database object deletion can generate code for deleting database objects in an automated manner. The ability to generate code for deleting database objects in an automated manner can enable the efficient and accurate deletion of database objects, including database objects with relationships to other database objects.

Abstract: The present invention relates to a data-processing technology allowing data to be recognized as a being, i.e. an organism having life, by applying, to all digital data, a birth/old-age/sickness/death concept derived from nature and giving the time-limited functions of naming, changing, and extinction to the digital data which has traditionally been recognized by the attributes of perpetuity and infinite replication and reproduction with complete fidelity. More particularly, the present invention relates to a system allowing a user to easily determine data maintenance and deletion by managing the history of data distribution and representing the current state of use of the data through an aging effect (i.e. becoming old, gray, sick, or recovering), which applies to living things in nature.

Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.

Abstract: A method and a system for archiving data from a source database to a target database perform the following step: a) specifying the data being subject to the archiving operation in the source database; b) extracting the data genealogy of the specified data, thereby revealing the physical relations among tables of the specified data and/or arbitrary rules defined by an administrator in order to create a data tree of the specified data; c) executing an export/import operation of the specified data from the source database to the target database, thereby starting in a direction from the root of the data tree to the leaves of the data tree; and d) after the successful execution of the export/import operation, executing a delete operation in the source database for the specified data, thereby starting in a direction of the leaves of the data tree to the root of the data tree.

Abstract: In one aspect, in general, a method is described for managing an archive for determining approximate matches associated with strings occurring in records. The method includes: processing records to determine a set of string representations that correspond to strings occurring in the records; generating, for each of at least some of the string representations in the set, a plurality of close representations that are each generated from at least some of the same characters in the string; and storing entries in the archive that each represent a potential approximate match between at least two strings based on their respective close representations.

Abstract: When update information with respect to a first database or a second database is received, a database update control apparatus updates the first database or the second database on the basis of the update information. When updating the first database or the second database, the database update control apparatus associates pre-update data with an identifier that is added to the update information and retains them for each database. The database update control apparatus extracts, for each database from among the retained identifiers, an identifier that indicates the latest update information and specifies, from the extracted identifiers, an identifier that is the oldest updated identifier. The database update control apparatus reflects pre-update data associated with an identifier that is newer than that specified in a corresponding database out of the first database and the second database.

Abstract: Aspects of the present invention are directed to a system for next day reconciliation of transportation records. The system having a transportation record storage provider (TRSP) that receives and stores storage medium transportation requests; an outside service provider (OSP) inventory manager that receives and maintains records of transported storage mediums scanned at the OSP; and a reconciliation provider that receives a first list from the TRSP and a second list from the OSP inventory manger, for reconciliation. The reconciliation provider includes receivers for receiving the first and second list; a processing engine that reconciles the first list and the second list; and a reporting unit that reports the results of the reconciliation. The processing engine matches inbound and outbound records of the first list and second list, and processes invalid records; and analyzes and accounts for un-matched records.

Abstract: An archive cluster application runs across a redundant array of independent nodes. Each node runs an archive cluster application instance comprising a set of software processes: a request manager, a storage manager, a metadata manager, and a policy manager. The request manager manages requests for data, the storage manager manages data read/write functions, and the metadata manager facilitates metadata transactions and recovery. The policy manager implements policies, which are operations that determine the behavior of an “archive object” within the cluster. The archive cluster application provides object-based storage. It associates metadata and policies with the raw archived data, which together comprise an archive object. Object policies govern the object's behavior in the archive. The archive manages itself independently of client applications, acting automatically to ensure that object policies are valid.

Abstract: A method of controlling access to a database includes autonomously archiving data within a database from a first storage device into a second storage device, according to an archive condition; the archive condition being input in conjunction with the data and being associated with the data; accepting an input of an access command to the database; determining whether data to be accessed in response to the access command input has already been archived in the second storage device based on the access command and the archive condition; and accessing data included in the database or data archived in the second storage device according to the access command based on the determination.

Abstract: Methods and apparatus, including computer program products, implementing and using techniques for archiving an active record in a database. An auxiliary table is created in the database. The auxiliary table can store metadata information about active records to be archived and deleted from the database. An active record to be deleted from the database is selected. Metadata information is stored in the auxiliary table for the selected active record. The selected active record is archived into a data storage device. The selected active record is deleted from the database, based on the update information in the auxiliary table, without comparing column data for the archived record in the data storage device and the active record in the database prior to deletion of the active record from the database.

Abstract: Various systems and methods for cooperative tiering between an application and a storage device. One method can include receiving information from the application where the information identifies a storage object and identifies a location in a storage device. The location identifies one or more tiers of a plurality of tiers included in the storage device, and the storage object is assigned to the one or more tiers. The method also involves detecting whether the storage object is stored in the one or more tiers. If not, the storage device copies the storage object to the identified location. The information can also include an instruction by the application to move the storage object from a first tier to a second tier.

Abstract: Techniques to enforce policies with respect to managed files and/or endpoints are disclosed. A policy to be applied with respect to a synchronization set is received at a file management system. Compliance with the policy across a plurality of heterogeneous endpoints associated with the synchronization set is ensured by propagating the policy to the heterogeneous endpoints. Each of the endpoints is configured to enforce at the endpoint policies received from the file management system, including by responding in a manner prescribed by the policy to occurrence of a policy-triggering event defined in the policy.

Abstract: A mechanism is provided that aggregates data in a way that permits data to be deleted efficiently, while minimizing the overhead necessary to support bulk deletion of data. A request is received for automatic deletion of segments in a container and a waterline is determined for the container. A determination is made if at least one segment in the container falls below the waterline. Finally, in response to one segment falling below the waterline, the segment from the container is deleted. Each object has an associated creation time, initial retention value, and retention decay curve (also known as a retention curve). At any point, based on these values and the current time, the object's current retention value may be computed. The container system continually maintains a time-varying waterline: at any point, objects with a retention value below the waterline may be deleted.

Abstract: A system and method is disclosed which enables network administrators and the like to quickly analyze the data produced by log-producing devices such as network firewalls and routers. Unlike systems of the prior art, the system disclosed herein automatically parses and summarizes log data before inserting it into one or more databases. This greatly reduces the volume of data stored in the database and permits database queries to be run and reports generated while many types of attempted breaches of network security are still in progress. Database maintenance may also be accomplished automatically by the system to delete or archive old log data.

Abstract: Exemplary embodiments for partitioning management of storage resources in a computing storage environment across multiple users including an existing administrator and an existing non-administrator are provided.

Abstract: Both live and offline transcoding of media is managed for storage in a cache. Requests for media are made by a client on a network and media taken from the cache and transcoded for delivery to the client. Media is also transcoded and stored in memory during idle request in anticipation of future requests during idle transcoder time between client requests. A prioritizer manages at least offline transcoding requests. A high priority queue operates at a higher priority than the low priority queue. The high priority queue receives live transcoding requests from a client on the network. A low priority queue receives offline transcoding requests. A media transcoder primarily transcodes media in accordance with requests from the high priority queue for delivery to a client on the network and then secondarily transcodes media in accordance with requests from the low priority queue when the high priority queue is empty.

Abstract: Embodiments are directed towards a system and method for a cloud-based front end that may abstract and enable access to the underlying cloud-hosted elements and objects that may be part of a multi-tenant application, such as a search application. Search objects may be employed to access indexed objects. An amount of indexed data accessible to a user may be based on an index storage limit selected by the user, such that data that exceeds the index storage limit may continue to be indexed. Also, one or more projects can be elastically scaled for a user to provide resources that may meet the specific needs of each project.

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: A computerized system and method are presented that utilize the assistance of subject matter experts to create a research archive for researching fundamental texts of a variety of spiritual and religious domains. Using a subject matter expert interface that provides tools not available to users of the archive database, the subject matter experts identify ideas having snippets from the fundamental texts. Each idea is associated with a single life issue tag and a religious or spiritual domain. Through the subject matter expert tools, subject matter experts are requested to provide commentaries that comment on the snippet from the point of view of the religious domain and its relationship to the associated life issue tag. The commentaries are each written with respect to a particular role.

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: Described herein is a system and method for retaining deduplication of data blocks of a resulting storage object (e.g., a flexible volume) from a split operation of a clone of a base storage object. The clone may comprise data blocks that are shared with at least one data block of the base storage object and at least one data block that is not shared with at least one data block of the base storage object. The data blocks of the clone that are shared with the base storage object may be indicated to receive a write allocation that may comprise assigning a new pointer to a indicated data block. Each data block may comprise a plurality of pointers comprising a virtual address pointer and a physical address pointer. As such, data blocks of the clone comprising the same virtual address pointer may be assigned a single physical address pointer. Thus, a new physical address pointer is assigned or allocated once to a given virtual address pointer of data blocks of a clone.

Abstract: Embodiments provide data storage of object and action data for use in media content development applications. For example, a data storage scheme may make information available to a user interface specifying, for a particular object type, which actions can be performed by objects of that type, as well as default values for objects of that type. Embodiments involve data storage techniques that are adaptable for use with new and changing object and media types.

Abstract: Systems and methods for scheduling requests to access data may adjust the priority of such requests based on the presence of de-duplicated data blocks within the requested set of data blocks. A data de-duplication process operating on a storage device may build a de-duplication data map that stores information about the presence and location of de-duplicated data blocks on the storage drive. An I/O scheduler that manages the access requests can employ the de-duplicated data map to identify and quantify any de-duplicated data blocks within an access request. The I/O scheduler can then adjust the priority of the access request, based at least in part, on whether de-duplicated data blocks provide a large enough sequence of data blocks to reduce the likelihood that servicing the request, even if causing a head seek operation, will not reduce the overall global throughput of the storage system.

Abstract: Provided are a method, system, and program for archiving files. A hierarchical file system having directories is provided. An archival retention policy is associated with at least one of the directories in the hierarchical file system, wherein the retention policy applies to files included in the associated directory, and wherein the retention policy specifies a retention time indicating a time period during which a file is subject to the retention policy.

Abstract: The objects of an archive may be verified with a cryptographic signature stored in the archive. However, when an object is extracted, the authentication involves re-authenticating the entire archive, re-extracting the object, and comparing the extracted object with the current object, which is inefficient or unachievable if the archive is unavailable. Instead, the archive may include a block map signed with the signature and comprising hashcodes for respective blocks of the objects of the archive. When an object is extracted, the signature and block map may also be extracted and stored as objects outside of the archive. The extracted signature and block map may later be verified by authenticating the signature, verifying the block map with the signature, and matching the hashcodes of the block map with those of the blocks of the extracted objects, thus enabling a more efficient and portable verification of extracted object with extracted authentication credentials.

Abstract: A data block storage management capability is presented. A cloud file system management capability manages storage of data blocks of a file system across multiple cloud storage services (e.g., including determining, for each data block to be stored, a storage location and a storage duration for the data block). A cloud file system management capability manages movement of data blocks of a file system between storage volumes of cloud storage services. A cloud file system management capability provides a probabilistic eviction scheme for evicting data blocks from storage volumes of cloud storage services in advance of storage deadlines by which the data blocks are to be removed from the storage volumes. A cloud file system management capability enables dynamic adaptation of the storage volume sizes of the storage volumes of the cloud storage services.

Abstract: A technique for archiving a relational database having tables of rows may use clusters. Transaction identifiers may be assigned to each of the rows in each of the tables such that all rows belonging to the same application transaction share a unique transaction identifier. Plural hierarchies may be determined, each hierarchy having high level nodes corresponding to the rows in a single table and dependent nodes corresponding to rows in other tables to which the rows in the single table are related in the database. The plural hierarchies may be merged to form plural clusters, one cluster for each unique transaction identifier. Each cluster may have high level nodes corresponding to the plural hierarchies but only those dependent nodes from the plural hierarchies whose transaction identifiers correspond to that of the cluster. The clusters may be stored in one or more files to form an archive.

Abstract: A reading device, comprising: a reading unit configured to read a document and to generate image data representing the read document; an uploading unit configured to upload the image data read by the reading unit to an server on a network; a storage time limit setting unit configured to set a storage time limit within which the image data is stored on the server; a judgment unit configured to judge whether the storage time limit has expired with respect to the image data uploaded on the server; and a data management unit configured to delete, from the server, the image data for which the judgment unit judges that the storage time limit has expired.

Abstract: Storage systems and methods are presented. In one embodiment, a data storage resource management method comprises: performing a data update process, including communicating a data update input output packet between a primary storage resource and a secondary storage resource, wherein corresponding data updates in the secondary storage resource are a mirror of data updates in the primary storage resource; and performing a reclamation process, including: communicating reclamation information in a reclamation input output packet through the same interface as the data update input output packet, wherein the reclamation input output packet is communicated between the primary storage resource and the secondary storage resource; and reclaiming storage locations on the secondary storage resource in accordance with reclamation information in the reclamation input output packet communicated between the primary storage resource and secondary storage resource.

Abstract: This disclosure describes techniques of managing electronic documents as electronic records that do not require moving the electronic documents to a different repository. As described herein, an electronic document is stored at a first repository prior to a time when the electronic document is declared to be an electronic record. An administrator is able to configure a document management system (DMS) to manage the electronic document as an electronic record after the electronic document is declared to be an electronic record. In addition, the administrator is able to configure the DMS to store a copy of the electronic document at a second repository after the electronic document is declared to be an electronic record and to manage the copy of the electronic document as an electronic record.

Abstract: Various technologies and techniques are disclosed for searching for and extracting data from databases of content management applications. User input is received to connect to a database or database snapshot of an application, and a connection is established. When the database is not part of a current live instance of the application, an emulation is performed such that the database is treated like it is attached to the current live instance of the application. The user is able to browse and/or search for content, including documents, in the database or database snapshot without having to explore individual site collection structure and user interfaces of individual sites. A site collection user interface (UI), a site selector UI, and/or a list selector UI, for example, provide data entry fields for entering search requirements. Unattached databases can be managed using commands, such as using an object model or command line.

Abstract: A method and system for managing a file lifecycle is disclosed. The method incorporates a virtual file cabinet having virtual drawers. Files are moved from drawer to drawer throughout their lifecycle in accordance with policies associated with each drawer. The files are moved automatically and as such, a file's lifecycle is managed from file creation to file deletion in an automated fashion. By using an archiving device such as magneto optical storage media, the files are automatically moved to their final archived location in an archiving drawer once certain policies of their present drawer are met. The system is an electronic system employing the inventive method.

Abstract: A method performed by a processor allows an individual to update or maintain a database including a core and an extension. The core contains core tables including general data and the extension contains extension tables including specific data. The core tables and the extension tables have the same primary keys and the specific data are an extension of the general data. The method includes receiving an input from the individual for modifying the database, modifying the core using the received input, and automatically modifying the extension to reflect the modifying of the core.

Abstract: A file editing apparatus for revoking (Undo) destructive segmentation. An audio file is segmented into two files by destructive segmentation. When revoking (Undo) operation is performed after segmentation, an end portion of a preceding file is deleted, and a head of a subsequent file is deleted. A copy file, which has been generated by copying during segmentation and preserved, is inserted between the two files to thereby concatenate the preceding file with the subsequent file, whereby an original file is generated.

Abstract: A sampling based technique for eliminating duplicate data (de-duplication) stored on storage resources, is provided. According to the invention, when a new data set, e.g., a backup data stream, is received by a server, e.g., a storage system or virtual tape library (VTL) system implementing the invention, one or more anchors are identified within the new data set. The anchors are identified using a novel anchor detection circuitry in accordance with an illustrative embodiment of the present invention. Upon receipt of the new data set by, for example, a network adapter of a VTL system, the data set is transferred using direct memory access (DMA) operations to a memory associated with an anchor detection hardware card that is operatively interconnected with the storage system. The anchor detection hardware card may be implemented as, for example, a FPGA is to quickly identify anchors within the data set.

Abstract: A method and apparatus for data recovery are disclosed. Undo tablespace size is calculated for user-specified undo retention time based on system statistics collected over a period of time specified by a history time parameter.

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.