会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • ASYNCHRONOUS DISTRIBUTED OBJECT UPLOADING FOR REPLICATED CONTENT ADDRESSABLE STORAGE CLUSTERS
    • 用于替代内容可寻址存储群集的异步分布式物件上载
    • WO2010123773A1
    • 2010-10-28
    • PCT/US2010/031410
    • 2010-04-16
    • GOOGLE INC.DROBYCHEV, AlexandreKESSELMAN, Alexander
    • DROBYCHEV, AlexandreKESSELMAN, Alexander
    • G06F17/30
    • G06F17/30578G06F17/30091G06F17/30212
    • A method is performed by two or more devices of a group of devices in a distributed data replication system. The method includes receiving, at the two or more devices, a group of chunks having a same unique temporary identifier, where the group of chunks comprises an object to be uploaded; creating an entry for the object in a replicated index, where the entry is keyed by the unique temporary identifier, and where the replicated index is replicated at each of the two or more devices; and determining, by an initiating device of the two or more devices, that a union of the group of chunks contains all data of the object. The method also includes calculating a content-based identifier to the object; creating another entry for the object in the replicated index, where the other entry is keyed by the content-based identifier; and updating the replicated index to point from the unique temporary identifier to the content-based identifier.
    • 一种方法由分布式数据复制系统中的一组设备的两个或多个设备执行。 该方法包括在两个或更多个设备处接收具有相同唯一临时标识符的一组块,其中该组块包括要上传的对象; 为复制索引中的对象创建条目,其中该条目由唯一的临时标识符键入,并且复制索引被复制在两个或更多个设备中的每一个上; 以及由所述两个或多个设备的发起设备确定所述一组组合的联合包含所述对象的所有数据。 该方法还包括向对象计算基于内容的标识符; 为复制索引中的对象创建另一个条目,其中另一个条目由基于内容的标识符键入; 并将所复制的索引更新为从唯一临时标识符指向基于内容的标识符。
    • 6. 发明申请
    • PROBABILISTIC THROTTLING
    • 概率调节
    • WO2017123335A1
    • 2017-07-20
    • PCT/US2016/064351
    • 2016-12-01
    • GOOGLE INC.
    • DROBYCHEV, AlexandreKESSELMAN, AlexanderSUBBIAH, Arun
    • G06F9/50
    • H04L67/1008G06F9/5011G06F9/5044H04L41/0896H04L67/101H04L67/1029H04L67/1097
    • Methods, systems, and apparatus, including computer programs encoded on computer storage media, for throttling data probabilistically. One of the methods includes receiving, from a client device for a particular entity, a request to process data, determining a size of data to be processed, providing, to a throttler system, a bandwidth assignment request indicating the particular entity and the size of data to be processed, receiving, from the throttler system, a bandwidth assignment for the particular entity to use when serving the request, and probabilistically determining whether to currently serve the request based on the bandwidth assignment, the size of the data to be processed, and an accrued quantity of tokens for the particular entity.
    • 包括在计算机存储介质上编码的计算机程序的方法,系统和装置用于概率性地调节数据。 其中一种方法包括从用于特定实体的客户端设备接收处理数据的请求,确定要处理的数据的大小,向调节器系统提供指示特定实体的带宽分配请求以及 从节流器系统接收特定实体在服务该请求时使用的带宽分配,以及基于带宽分配,要处理的数据的大小以概率方式确定是否当前服务该请求, 以及特定实体的应计数量的代币。
    • 7. 发明申请
    • HIERARCHICAL CHUNKING OF OBJECTS IN A DISTRIBUTED STORAGE SYSTEM
    • 分布式存储系统中对象的分层重构
    • WO2015100416A1
    • 2015-07-02
    • PCT/US2014/072356
    • 2014-12-24
    • GOOGLE INC.
    • KESSELMAN, AlexanderO'REILLY, MichaelDATUASHVILI, GeorgeDROBYCHEV, Alexandre
    • G06F17/30
    • G06F17/30575G06F3/0614G06F3/065G06F3/067G06F17/30321G06F17/30342
    • Placement of object replicas in a distributed storage system includes, at a first instance, opening a journal for storage of object chunks. Each journal is associated with a single placement policy. An object is received, which comprises a chunk. The object has a placement policy, and the chunk comprises a plurality of storage blocks. The blocks are stored in a journal that matches the placement policy. Global metadata for the object is stored, which includes a list of chunks for the object. Local metadata for the chunk is stored, which includes a block list identifying each block of the plurality of blocks. The local metadata is associated with the journal. The journal is later closed. The journal is subsequently replicated to a second instance according to the placement policy. The global metadata is updated to reflect the replication, whereas the local metadata is unchanged by the replication.
    • 在分布式存储系统中放置对象副本包括首先打开用于存储对象块的日志。 每个日记帐都与单一的刊登位置政策相关联。 接收到一个包含一个块的对象。 对象具有放置策略,并且该块包括多个存储块。 这些块存储在与展示位置策略匹配的日记帐中。 存储对象的全局元数据,其中包含对象的块的列表。 存储块的本地元数据,其包括标识多个块的每个块的块列表。 本地元数据与日记相关联。 该杂志以后关闭。 该杂志随后根据放置政策复制到第二个实例。 全局元数据被更新以反映复制,而复制的本地元数据不变。
    • 8. 发明申请
    • GROUPING OF OBJECTS IN A DISTRIBUTED STORAGE SYSTEM BASED ON JOURNALS AND PLACEMENT POLICIES
    • 基于用户和放置政策的分布式存储系统中的对象分组
    • WO2014209911A1
    • 2014-12-31
    • PCT/US2014/043721
    • 2014-06-23
    • GOOGLE INC.
    • KESSELMAN, AlexanderDROBYCHEV, AlexandreDATUASHVILI, George
    • G06F17/30G06F3/06H04L29/08
    • G06F17/30598G06F3/0605G06F3/0656G06F3/067G06F17/30575H04L67/1095
    • Managing placement of object replicas is performed at a first instance of a distributed storage system. One or more journals are opened for storage of object chunks. Each journal is associated with a single placement policy. A first object is received comprising at least a first object chunk. The first object is associated with a first placement policy. The first object chunk is stored in a first journal whose associated placement policy matches the first placement policy. The first journal stores only object chunks for objects whose placement policies match the first placement policy. For the first journal, the receiving and storing operations are repeated for multiple objects whose associated placement policies match the first placement policy, until a first termination condition occurs. Then, the first journal is closed. Subsequently, the first journal is replicated to a second instance of the distributed storage system according to the first placement policy.
    • 管理对象副本的放置在分布式存储系统的第一个实例执行。 打开一个或多个日志以存储对象块。 每个日记帐都与单一的刊登位置政策相关联。 接收包括至少第一对象块的第一对象。 第一个对象与第一个放置策略相关联。 第一个对象块存储在第一个日志中,其关联的布局策略与第一个布局策略匹配。 第一个日记帐仅存储其展示位置政策与第一个展示位置政策匹配的对象的对象块。 对于第一个日志,对于其相关联的布局策略与第一布局策略匹配的多个对象重复接收和存储操作,直到发生第一终止条件。 那么,第一本杂志是关闭的。 随后,根据第一放置策略,第一个日志被复制到分布式存储系统的第二个实例。