公开(公告)号：US09942337B2

公开(公告)日：2018-04-10

申请号：US14933491

申请日：2015-11-05

Applicant: HITACHI DATA SYSTEMS CORPORATION

Inventor： Andrea Orioli ,  Umberto Malesci ,  Alessandro Erta ,  Gianni Rosa Gallina

IPC: H04L29/08 ,  H04L12/58 ,  H04L29/06

CPC classification number: H04L67/22 ,  H04L51/046 ,  H04L51/20 ,  H04L51/32 ,  H04L65/4084

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.

公开(公告)号：US09672372B2

公开(公告)日：2017-06-06

申请号：US15054279

申请日：2016-02-26

Applicant: HITACHI DATA SYSTEMS CORPORATION

Inventor： Robert S. Mason

IPC: G06F21/62 ,  G06F17/30

CPC classification number: G06F21/6209 ,  G06F17/30082 ,  G06F17/30188 ,  G06F17/30197

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.

公开(公告)号：US09514143B2

公开(公告)日：2016-12-06

申请号：US13313839

申请日：2011-12-07

Applicant: Fabrice Helliker ,  Simon Chappell

Inventor： Fabrice Helliker ,  Simon Chappell

IPC: G06F17/30

CPC classification number: G06F11/1464 ,  G06F11/1461 ,  G06F17/30082 ,  G06F17/30129 ,  G06F2201/80

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 translation: 启用数据管理系统，使得用户可以选择数据源节点，存储库和数据路径，为每个策略选择策略并分发由管理系统管理的策略。

公开(公告)号：US09305011B2

公开(公告)日：2016-04-05

申请号：US11675224

申请日：2007-02-15

Applicant: Robert S. Mason, Jr.

Inventor： Robert S. Mason, Jr.

IPC: G06F17/30

CPC classification number: G06F21/6209 ,  G06F17/30082 ,  G06F17/30188 ,  G06F17/30197

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 translation: 优选对称节点的归档存储集群包括数据保护管理系统，其周期性地将当前可用节点组织到一个或多个保护集中，其中每个集合包括一组n个节点，其中“n”是指可配置的“数据保护 级“（DPL）。 在创建时，给定的保护集是关闭的，因为每个可用节点都是一个成员，只有一个保护集。 当一个对象要存储在归档中时，数据保护管理系统将对象存储在给定保护集的给定节点中，然后将该对象的拷贝的分布约束到给定保护集内的其他节点。 因此，对象的所有DPL副本都存储在同一个保护集中，只有该保护设置。 该方案大大提高了集群整体的MTDL，因为只有在给定保护集的节点内发生多个故障时，数据才能丢失。 这比群集内节点的任何随机分布发生的故障更不可能。

公开(公告)号：US09203915B2

公开(公告)日：2015-12-01

申请号：US13733672

申请日：2013-01-03

Applicant: Hitachi Data Systems Corporation

Inventor： Andrea Orioli ,  Umberto Malesci ,  Alessandro Erta ,  Gianni Rosa Gallina

IPC: H04L29/08 ,  H04L12/58

CPC classification number: H04L67/22 ,  H04L51/046 ,  H04L51/20 ,  H04L51/32 ,  H04L65/4084

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 translation: 一种用于连续监视和搜索社交网络媒体的系统，允许至少一个客户端通过相应的连接链路访问系统，并且通过连接链路连接到至少一个社交网络媒体。 该系统还包括连接模块，该连接模块包括至少一个连接单元，以连接至少一个社交网络媒体，用于连续接收由实时共享的活动数据所选择的时间和/或由社交网络媒体的用户发布; 以及处理模块，包括处理单元，其被配置为基于客户端从多个预定标准选择的至少一个预定监视标准连续地处理由客户选择的接收到的活动数据的时间，以及配置的通知单元 当接收到的活动数据满足所选择的监控标准时，向客户端发送通知。

公开(公告)号：US08954406B2

公开(公告)日：2015-02-10

申请号：US14138680

申请日：2013-12-23

Applicant: Hitachi Data Systems Corporation

Inventor： Andres Rodriguez ,  Jack A. Orenstein ,  David M. Shaw ,  Benjamin K. D. Bernhard

IPC: G06F17/30 ,  G06F11/14

CPC classification number: G06F17/30289 ,  G06F11/1469 ,  G06F17/30073 ,  G06F17/30082 ,  G06F17/30117 ,  G06F17/30188 ,  G06F17/30197 ,  G06F17/30221 ,  Y10S707/99932 ,  Y10S707/99944 ,  Y10S707/99956

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 translation: 归档集群应用程序跨独立节点的冗余阵列运行。 每个节点运行包含一组软件过程的归档集群应用程序实例：请求管理器，存储管理器，元数据管理器和策略管理器。 请求管理器管理数据请求，存储管理器管理数据读/写功能，元数据管理器便于元数据事务和恢复。 策略管理器实现策略，这些策略是确定集群中“归档对象”的行为的操作。 归档集群应用程序提供基于对象的存储。 它将元数据和策略与原始归档数据相关联，这些数据共同构成归档对象。 对象策略管理对象在归档中的行为。 归档管理自身独立于客户端应用程序，自动执行以确保对象策略有效。

公开(公告)号：US08838624B2

公开(公告)日：2014-09-16

申请号：US12889574

申请日：2010-09-24

Applicant: Jeffrey M. Crump ,  Margie E. Ioakimidis

Inventor： Jeffrey M. Crump ,  Margie E. Ioakimidis

IPC: G06F17/30 ,  G06Q10/10

CPC classification number: G06F17/30554 ,  G06F17/30073 ,  G06F17/30106 ,  G06F17/30206 ,  G06F17/30212 ,  G06F17/30424 ,  G06F17/30477 ,  G06F17/30489 ,  G06F17/30867 ,  G06Q10/10

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application.

Abstract translation: 独立节点的冗余阵列联网在一起。 每个节点执行提供基于对象的存储的应用程序的实例。 元数据对象存储在分布在阵列中的节点之间的一组区域中。 给定区域通过散列元数据对象属性并提取生成的散列值的给定位的集合来识别。 管理查询结果的方法包括：从客户端应用程序接收多个独立节点中的第一节点对具有标准的对象列表的请求; 由所述第一节点根据接收到的请求向所有节点发出查询; 使用存储在区域中的元数据对象来处理节点上的每个节点的查询; 由第一个节点聚合和过滤来自所有节点的查询结果; 并由第一个节点将聚合和过滤的结果返回给客户端应用程序。

公开(公告)号：US08700571B2

公开(公告)日：2014-04-15

申请号：US12889698

申请日：2010-09-24

Applicant: Richard Rogers ,  Benjamin Isherwood ,  Matthew Michael McDonald ,  Donald P. Pannese ,  David Pinkney

Inventor： Richard Rogers ,  Benjamin Isherwood ,  Matthew Michael McDonald ,  Donald P. Pannese ,  David Pinkney

IPC: G06F17/30

CPC classification number: G06F17/30575 ,  G06F3/0619 ,  G06F3/065 ,  G06F3/067 ,  G06F11/2094 ,  G06F17/30082 ,  G06F17/30165 ,  G06F17/30235

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. A data protection level method comprises setting a numerical value of a system dynamic data protection level for each system of nodes; and in response to user input, setting a value of a data protection level for one or more data objects in a system, the value being a fixed numerical value or a dynamic value. If the one or more data objects have a dynamic value of the data protection level in a system, the one or more data objects inherit the system dynamic data protection level of the system in which the one or more data objects reside. The value of the data protection level represents a number of copies of data of the one or more data objects to be kept where the one or more data objects reside.

Abstract translation: 独立节点的冗余阵列联网在一起。 每个节点执行提供基于对象的存储的应用程序的实例。 节点被分组成多个具有多个节点的系统。 数据保护等级方法包括为每个节点系统设置系统动态数据保护级别的数值; 并且响应于用户输入，为系统中的一个或多个数据对象设置数据保护级别的值，该值为固定数值或动态值。 如果一个或多个数据对象具有系统中的数据保护级别的动态值，则一个或多个数据对象继承其中存在一个或多个数据对象的系统的系统动态数据保护级别。 数据保护级别的值表示要存放在一个或多个数据对象所在的一个或多个数据对象的数据的副本。

公开(公告)号：US08621270B2

公开(公告)日：2013-12-31

申请号：US12889641

申请日：2010-09-24

Applicant: Benjamin Isherwood ,  Donald P. Pannese ,  Richard Rogers ,  Vitaly Zolutusky

Inventor： Benjamin Isherwood ,  Donald P. Pannese ,  Richard Rogers ,  Vitaly Zolutusky

IPC: G06F11/00

CPC classification number: G06F11/2089 ,  G06F11/2097

Abstract: A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. An object recovery method comprises: receiving, by a first system of the plurality of systems from a client application, a read request for an object, the object having been replicated to/from at least one second system among the plurality of systems; if the object of the read request is available in the first system, returning by the first system the object of the read request to the client application; and if the object of the read request is not available in the first system, performing a read from replica process by the first system to access a replica of the object from a second system among the plurality of systems and using the replica of the object to return the object of the read request to the client application.

Abstract translation: 独立节点的冗余阵列联网在一起。 每个节点执行提供基于对象的存储的应用程序的实例。 节点被分组成多个具有多个节点的系统。 一种对象恢复方法，包括：由多个系统中的第一系统从客户应用程序接收对象的读取请求，该对象已被复制到多个系统中的至少一个第二系统; 如果读请求的对象在第一系统中可用，则由第一系统将读请求的对象返回给客户端应用; 并且如果所述读取请求的对象在所述第一系统中不可用，则执行由所述第一系统从所述副本处理的读取以从所述多个系统中的第二系统访问所述对象的副本，并且使用所述对象的副本 将读请求的对象返回给客户端应用程序。

公开(公告)号：US08533155B2

公开(公告)日：2013-09-10

申请号：US12609869

申请日：2009-10-30

Applicant: David B. Pinkney ,  Matthew M. McDonald ,  Benjamin J. Isherwood

Inventor： David B. Pinkney ,  Matthew M. McDonald ,  Benjamin J. Isherwood

IPC: G06F17/00

CPC classification number: G06F17/30584 ,  G06F11/2094 ,  G06F17/30212

Abstract: A content platform (or “cluster”) that comprises a redundant array of independent nodes is logically partitioned. Using a web-based interface, an administrator defines one or more “tenants” within the cluster, wherein a tenant has a set of attributes: namespaces, administrative accounts, data access accounts, and a permission mask. A namespace is a logical partition of the cluster that serves as a collection of objects typically associated with at least one defined application. Each namespace has a private file system with respect to other namespaces. This approach enables a user to segregate cluster data into logical partitions. According to this disclosure, tenant information, including all associated namespaces, in the cluster (the “source cluster”) is replicated to at least one target cluster over a replication link. Preferably, replication is available for multiple tenants in the source cluster, and a replication algorithm ensures that a particular tenant can be added to the replication link without stalling the progress of other tenants.

Abstract translation: 包含独立节点的冗余阵列的内容平台（或“群集”）被逻辑地分区。 使用基于Web的界面，管理员定义集群内的一个或多个“租户”，其中租户具有一组属性：命名空间，管理帐户，数据访问帐户和权限掩码。 命名空间是集群的逻辑分区，用作通常与至少一个定义的应用程序相关联的对象的集合。 每个命名空间都有一个与其他命名空间相关的私有文件系统。 这种方法使用户能够将集群数据分离成逻辑分区。 根据本公开，集群中的租户信息（包括所有关联的命名空间）（“源集群”）通过复制链路复制到至少一个目标集群。 优选地，复制可用于源集群中的多个租户，并且复制算法确保特定租户可以被添加到复制链接，而不会阻碍其他租户的进展。