Abstract:
A network-based data store maintaining storage volumes for file systems at storage clients may implement dynamic storage volume scaling. A scaling event may be detected according to a specified scaling policy for a storage volume maintained at a network-based data store that is mounted at a storage client and configured for a file system. In a least some embodiments, the scaling policy for the storage volume may be received from the storage client. In response to detecting the storage event, storage maintaining the storage volume may be modified according to the scaling policy to scale the storage volume. An indication of the scaling event may be sent to the storage client in order to update the file system at the storage client so that the file system may utilize the scaled storage volume.
Abstract:
A method of monitoring a cloud service modeled as a topology with a processor includes establishing a number of monitoring policies to monitor an instantiated topology, detecting an event at a node based on the number of monitoring policies, and processing the detected event based on the number of monitoring policies.
Abstract:
A technique includes in response to a request to access a distributed object stored on a plurality of team members, retrieving data stored associated with the distributed object from at least one of the team members and selectively reporting information about a degraded state of the retrieved data.
Abstract:
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for storing data are disclosed. In some implementations, visual representations of files are generated for presentation in a backup user interface. The visual representations are generated from sparse file system metadata stored on the computing device, thus allowing faster navigating of the backup user interface. During a restore operation, the metadata can be used to retrieve the items from their physical storage locations. In some implementations, when the storage capacity of a backup storage device exceeds a threshold, the data for the N oldest backups are replaced with sparse file system metadata, which can be used to generate visual representations for presentation in the backup user interface.
Abstract:
Technology for a method for backing up and restoring application state across multiple devices is disclosed herein. The method includes running an instance of a computer application at a first electronic device, determining a backup event that occurs in the first electronic device, wherein the backup event suggests a backup of application state data and the application state data represent an application state of the computer application at the backup event, and transmitting the application state data of the computer application to a remote storage service, in response to the backup event. A second electronic device can retrieve the application state data from the remote storage service and restore the application state.
Abstract:
Techniques for a method for automatically synchronizing application state across multiple devices are disclosed herein. The method includes running an instance of a computer application on an electronic device, automatically determining a sync event that occurs in the electronic device, wherein the sync event suggests a synchronization of application state data and the application state data represent an application state of the computer application at the sync event, and transmitting the application state data of the computer application to a storage server in response to the sync event. The application state data of the computer application enables another instance of the computer application to resume the application state at the sync event at another electronic device.
Abstract:
A key-value store provides column-oriented access to data in a distributed and fault tolerant manner. Data can be inserted into the data store and data can be retrieved either randomly or sequentially from the data store at high rates. Keys for a table are ordered and the entire table is divided into key ranges. Each key range is handled by a table which itself is divided into key ranges called a partition. Partitions are also divided into segments. Such recursive division into smaller and smaller key ranges provides parallelism. At the highest level, operations on tablets can be distributed to different nodes. At lower levels, different threads can handle operations on individual segments. Large-scale restructuring operations can be decomposed into operations on individual segments so that a global lock on larger objects does not need to be kept across the entire operation.
Abstract:
Methods for generating file relationship data, and media file systems that generate file relationship data A method of generating, in a media file system comprising a data store and a file record database, file relationship data for a first media file in the media file system. The method determines the essence data in the data store from which the first media file was derived, by determining from the file record for the media file in the file record database details of any previous media files in the media file system from which the media file was created. If the media file was not created from any previous media files, the essence data in the data store that constitutes the media file is determined from the file record. If on the other hand the media file was created from any previous media files, the previous steps are repeated for the previous media files. The file relationship data is the generated using the details of the determined essence data.