US 9,792,311 B2Granted

System and method for managing a partitioned database of user relationship data

AssigneeApple Inc.

InventorDerrick S. Huhn

Life of this patent

Estimating the term…

Loading patent…

Abstract

A system and method are described for storing and managing relationship data defining relationships between a plurality of users using a plurality of partitions. For example, a system according to one embodiment of the invention comprises: a relationship graph updater to fetch edge records defining user relationships on an online service from a plurality of queues at a specified time interval, each of the plurality of queues associated with a graph partition, the relationship graph updater creating a temporary update file for each of the plurality of graph partition; a relationship graph merger to determine if each temporary update file has already been merged and, if not, then merging relationship graph data contained in the update files with existing relationship graph data; and the relationship graph merger providing its merged results to a plurality of different relationship graph services.

Claims24

Dependent claims

A system for storing and managing relationship data defining relationships between a plurality of users comprising:

at least one memory;
at least one transceiver;
and
at least one microprocessor coupled to the at least one memory and the at least one transceiver, the at least one microprocessor configured to:
fetch, by the at least one transceiver, edge records defining user relationships on a plurality of online services from a plurality of queues at a specified time interval, each of the plurality of queues associated with a graph partition and a separate one of the plurality of online services, each separate one of the plurality of online services comprising one or more separate servers and a database of edge records;
create, in the at least one memory, a temporary update file for each of the plurality partitions;
identify each temporary update file that has not already been merged;
for each temporary file that has not been merged, merge relationship graph data contained in the temporary update file with existing relationship graph data to create a result file in the at least one memory, the result file containing a result of merging the relationship graph data contained in the temporary update file with the existing relationship graph data;
and
provide, by the at least one transceiver, the result file to each respective database of edge records of each of the plurality of online services.

7 more elements

Dependencies are inferred from the claim text.