Abstract:
A system for continuously monitoring and searching social networking media allowing at least one client to access the system through a respective connection link and for connecting to at least one social networking media through a connection link. The system further comprises a connecting module comprising at least one connecting unit to connect to the at least one social network media for receiving continuously for a time selected by the activity data shared in real time and/or posted by users of the social network media; and a processing module comprising a processing unit, configured to process continuously for the time selected by the client the received activity data based on at least one pre-determined monitoring criterion selected by the client from a number of predetermined criteria, and a notification unit configured to send a notification to the client when the received activity data meet the selected monitoring criteria.
Abstract:
A method, of managing storage of content of a system in storage units including run units which do not allow spin-down functionality and spin-down units which allow spin-down functionality, comprises: establishing a storage tiering rule which sets a policy indicating what content is eligible to be stored on a run unit and what content is eligible to be stored on a spin-down unit, the storage tiering rule being applicable to at least a group of the contents in the content system to determine stored content eligibility thereof for storage in the storage units and migration between the storage units; and identifying candidates of contents to migrate between the storage units, based on the storage tiering rule, state of the content system, and the stored content eligibility of the at least a group of the contents.
Abstract:
An archival storage cluster of preferably symmetric nodes includes a data protection management system that periodically organizes the then-available nodes into one or more protection sets, with each set comprising a set of n nodes, where “n” refers to a configurable “data protection level” (DPL). At the time of its creation, a given protection set is closed in the sense that each then available node is a member of one, and only one, protection set. When an object is to be stored within the archive, the data protection management system stores the object in a given node of a given protection set and then constrains the distribution of copies of that object to other nodes within the given protection set. As a consequence, all DPL copies of an object are all stored within the same protection set, and only that protection set. This scheme significantly improves MTDL for the cluster as a whole, as the data can only be lost if multiple failures occur within nodes of a given protection set. This is far more unlikely than failures occurring across any random distribution of nodes within the cluster.
Abstract:
In some examples, both object data and corresponding metadata are stored on thin provisioned block storage in which blocks for the storage of the object data and the metadata are dynamically provisioned from a shared pool. For instance, the metadata may be stored on the block storage using a tree data structure that may grow proportionally with the corresponding stored object data. The object storage may automatically adapt to the size and number of objects being stored, and storage space for metadata may be allocated dynamically on demand. Additionally, some implementations include storing data across multiple trays. For instance, a plurality of storage extents of an extent group may be allocated across a plurality of storage devices on multiple trays. The extent allocation may be tray-aware by allocating extents to maximize the probability that data remains available/recoverable in the presence of a failure in one or more trays.
Abstract:
A data management system that is enabled such that the user can select a data source node, a repository and a data path, choose policies for each and distribute the policies to be managed by the management system.
Abstract:
A system for continuously monitoring and searching social networking media allowing at least one client to access the system through a respective connection link and for connecting to at least one social networking media through a connection link. The system further comprises a connecting module comprising at least one connecting unit to connect to the at least one social network media for receiving continuously for a time selected by the activity data shared in real time and/or posted by users of the social network media; and a processing module comprising a processing unit, configured to process continuously for the time selected by the client the received activity data based on at least one pre-determined monitoring criterion selected by the client from a number of predetermined criteria, and a notification unit configured to send a notification to the client when the received activity data meet the selected monitoring criteria.
Abstract:
In some examples, a plurality of content properties may be used for managing indexing of object data, such as a plurality of files. Each content property may include an expression for extracting data values from specific data fields in the object data. Further, each content property may include a name that may be used for indexing the objects using the extracted data values. For instance, multiple content properties may have the same name, but may each have different expressions for extracting different data values from different data fields. Accordingly, the content properties may be used to extract desired data values from the objects for indexing. When a search query is received including a content property name and a specified value, one or more of the objects that are indexed with the specified value may be searched.
Abstract:
An “operate with missing region” feature allows a cluster to continue servicing reads for available regions even when some regions are missing. Upon a given node failure condition, the cluster is placed in an effective read-only mode for all regions. The node failure condition typically is one where there has been a failure of an authoritative region copy and no backup copy is then available. Typically, “read-only” means no client write or update requests succeed while the cluster is in this state. Those requests should fail with an error message that indicates failure because of the read-only status. Preferably, such requests are re-tried. In this mode, regions are only allowed to perform read operations but the cluster continues to operate with missing regions, and missing regions are entered on a region map. The cluster then automatically recovers returning missing regions, after which it leaves the read-only state.
Abstract:
A system for continuously monitoring and searching social networking media allowing at least one client to access the system through a respective connection link and for connecting to at least one social networking media through a connection link. The system further comprises a connecting module comprising at least one connecting unit to connect to the at least one social network media for receiving continuously for a time selected by the activity data shared in real time and/or posted by users of the social network media; and a processing module comprising a processing unit, configured to process continuously for the time selected by the client the received activity data based on at least one pre-determined monitoring criterion selected by the client from a number of predetermined criteria, and a notification unit configured to send a notification to the client when the received activity data meet the selected monitoring criteria.
Abstract:
A storage cluster of symmetric nodes includes a data privacy scheme that implements key management through secret sharing. The protection scheme preferably is implemented at install time. At install, an encryption key is generated, split, and the constituent pieces written to respective archive nodes. The key is not written to a drive to ensure that it cannot be stolen. Due to the secret sharing, any t of the n nodes must be present before the cluster can mount the drives. To un-share the secret, a process runs before the cluster comes up. It contacts as many nodes as possible to attempt to reach a sufficient t value. Once it does, the process un-shares the secret and mounts the drives locally. Given bidirectional communication, this mount occurs more or less at the same time on all t nodes. Once the drives are mounted, the cluster can continue to boot as normal.