Shard data based on associated social relationship
    1.
    发明授权
    Shard data based on associated social relationship 有权
    根据相关的社会关系划分数据

    公开(公告)号:US09547711B1

    公开(公告)日:2017-01-17

    申请号:US13948130

    申请日:2013-07-22

    Applicant: Google Inc.

    CPC classification number: G06F17/30598 G06F17/3071 G06F17/30864

    Abstract: A method includes identifying a plurality of content types in a database of a social network, wherein members produce and request content of different content types from the database. Job types to be performed on each content type are identified, when requests for content are received from members of the social network. A sharding process for each content type is selected based on the job types to be performed on the content types. The database is sharded into first group of shards for content types having job types that are parallel processing efficient and into second group of shards for content types having job types that are linear processing efficient. The first and second group of shards define a multi-shard database. Requests for contents are serviced from the first group or the second group of shards from the multi-shard database depending on the job types associated with the requests.

    Abstract translation: 一种方法包括在社交网络的数据库中识别多个内容类型,其中成员从数据库产生和请求不同内容类型的内容。 当从社交网络的成员收到对内容的请求时,将识别要针对每种内容类型执行的作业类型。 基于要对内容类型执行的作业类型,选择每种内容类型的分片过程。 将数据库划分为具有并行处理效率的作业类型的内容类型的第一组分片,并将其分割为具有线性处理效率的作业类型的内容类型的第二组分片。 第一组和第二组分片定义了一个多分片数据库。 根据与请求相关联的作业类型,来自多分片数据库的第一组或第二组分片对内容的请求进行服务。

Patent Agency Ranking