G06F16/185

Using path-based indexing to access media recordings stored in a media storage service

A media storage service may store a plurality of copies of a same media recording in cloud DVR, one copy specific to one of a plurality of clients. The client may interact directly with the media storage service based on path-based indexing techniques for playback of the media recording. The client may send a request, including a path of a manifest file associated with the copy specific to the client, to the media storage service. The manifest file may include information indicating respective paths of one or more segments of the copy. The media storage service may identify and return the manifest file to the client. The media storage service may further receive requests from the client to access the segments of the copy. The requests may include the respective paths, based on which the media storage service may retrieve the segments for the client to play.

Using path-based indexing to access media recordings stored in a media storage service

A media storage service may store a plurality of copies of a same media recording in cloud DVR, one copy specific to one of a plurality of clients. The client may interact directly with the media storage service based on path-based indexing techniques for playback of the media recording. The client may send a request, including a path of a manifest file associated with the copy specific to the client, to the media storage service. The manifest file may include information indicating respective paths of one or more segments of the copy. The media storage service may identify and return the manifest file to the client. The media storage service may further receive requests from the client to access the segments of the copy. The requests may include the respective paths, based on which the media storage service may retrieve the segments for the client to play.

Nested namespaces for selective content sharing

Nested namespaces for selective content sharing.

Nested namespaces for selective content sharing

Nested namespaces for selective content sharing.

Policy driven data placement and information lifecycle management

A method, apparatus, and system for policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative policies that define the movement and transformation of stored database objects. The policies are associated with a database object and may also be inherited. A policy defines, for a database object, an archiving action to be taken, a scope, and a condition before the archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. Conditions based on access statistics can be specified at the row level and may use segment or block level heatmaps. Policy evaluation occurs periodically in the background, with actions queued as tasks for a task scheduler.

Policy driven data placement and information lifecycle management

A method, apparatus, and system for policy driven data placement and information lifecycle management in a database management system are provided. A user or database application can specify declarative policies that define the movement and transformation of stored database objects. The policies are associated with a database object and may also be inherited. A policy defines, for a database object, an archiving action to be taken, a scope, and a condition before the archiving action is triggered. Archiving actions may include compression, data movement, table clustering, and other actions to place the database object into an appropriate storage tier for a lifecycle phase of the database object. Conditions based on access statistics can be specified at the row level and may use segment or block level heatmaps. Policy evaluation occurs periodically in the background, with actions queued as tasks for a task scheduler.

Time-based partitioning to avoid in-place updates for data set copies

Time-based partitioning of a data set is applied to capture updates to the data set in a copy of the data set. Items that have been updated in a data set with in a time period are identified. Partitions of the data set that include the updated items are created according to a partitioning scheme. The created partitions are grouped in a storage location for the time period in a file structure that stores a copy of the database. A latest version of the copy of the data set may be accessed according to latest partitions of the data set stored in the different locations of the file structure.

Time-based partitioning to avoid in-place updates for data set copies

Time-based partitioning of a data set is applied to capture updates to the data set in a copy of the data set. Items that have been updated in a data set with in a time period are identified. Partitions of the data set that include the updated items are created according to a partitioning scheme. The created partitions are grouped in a storage location for the time period in a file structure that stores a copy of the database. A latest version of the copy of the data set may be accessed according to latest partitions of the data set stored in the different locations of the file structure.

SYSTEMS AND METHODS FOR STORAGE MODELING AND COSTING

The present invention provides systems and methods for data storage. A hierarchical storage management architecture is presented to facilitate data management. The disclosed system provides methods for evaluating the state of stored data relative to enterprise needs by using weighted parameters that may be user defined. Also disclosed are systems and methods evaluating costing and risk management associated with stored data.

METHOD OF MOVING FILES IN HIERARCHICAL STORAGE SYSTEM
20180004450 · 2018-01-04 ·

A method for moving files in a hierarchical storage system having a primary storage and a secondary storage including a sequential storage device from the primary storage to the secondary storage includes obtaining a predetermined file size to be written to the secondary storage, extracting, from a plurality of files in the primary storage, a file not stored in the secondary storage and having the oldest last access time, estimating a file size of the file having the oldest last access time on the secondary storage if the file having the oldest last access time is written to the secondary storage, and selecting the file having the oldest last access time as a file to be moved to the secondary storage as long as the estimated file size does not exceed the predetermined file size to be written to the secondary storage.