Facebook, Inc.

Mark V Marchukov

Venkateshwaran Venkataramani

Venkatasiva Prasad Chakkabala

George Cabrera, Iii

Dmitri Petrov

Lovro Puzar

The disclosure is directed to storing a data log file ('log') in a distributed computing system. The log can be stored as a sequence of data records ('records'). A number of writer computers (&#x201c;writers&#x201d;) can write to a log, and a number of reader computers (&#x201c;readers&#x201d;) can read from the log. A log sequencer computer (&#x201c;log sequencer&#x201d;) facilitates storage of the records in data storage nodes of the distributed computing system. When the log sequencer receives a request for appending a record to a log, the log sequencer assigns a sequence number to the record that is unique and increases monotonically within the log. When a reader requests the log, the records can be delivered to the reader in the order of their sequence numbers. Further, since the records are associated with sequence numbers, a reader can seek to arbitrary sequence number within the log.

Managing sequential data store

In one embodiment, a system includes a database operative to maintain a social graph of an online social network, a leader cache layer, a plurality of servers, and a follower cache layer comprising one or more follower cache clusters, where each follower cache cluster maintains at least a portion of the social graph, and where the follower cache layer is operative to receive a command from the servers with instructions for updating a portion of the social graph, send the command to one of the leader cache layers, receive an acknowledgment of the command from one of the leader cache layers and a request to update; and update one or more of the follower cache clusters storing the portion of the social graph associated with the command.

Distributed cache for graph data

In one embodiment, a system includes a database; and a cache layer comprising one or more leader cache nodes, the one or more leader cache nodes operative to: communicate graph information between a follower cache layer and the database; receive a request from one of the follower cache nodes to store graph information in the database; update the database storing the graph responsive to the request; and update one or more of the follower cache nodes storing the portion of the graph associated with the request.

In one embodiment, a system comprises a database operative to maintain a social graph, a leader cache layer comprising one or more leader cache clusters, and a follower cache layer comprising one or more follower cache clusters, wherein the leader cache layer is operative to, communicate social graph information between the follower cache cluster and the database, wherein each follower cache cluster maintains at least a portion of the social graph, receive a request from one of the follower cache clusters to store social graph information in the database, update the database storing the social graph responsive to the request, and update one or more of the follower cache clusters storing the portion of the social graph associated with the request.

In one embodiment, a system includes a database; and a cache layer comprising one or more cache nodes, the one or more cache nodes operative to: maintain in a memory one or more data structures storing association information describing associations between nodes in a graph a plurality of distributed cache clusters for storing information in the form of a graph, the graph comprising a plurality of nodes, each uniquely identified by a node identifier, and edge information indicating associations between nodes; respond to queries for associations between nodes in the graph by accessing the memory; and forward other queries to the database for processing.

In one embodiment, a system includes a database operative to maintain a social graph; and a cache layer comprising a plurality of data shards, the data shards being divided among a plurality of cache nodes of a cache layer, wherein each data shard is operative to: maintain at least a portion of the social graph; receive a request to store associations between a first graph node and a second graph node of the social graph, wherein the first and second graph nodes are identified by a first and second unique identifier, respectively, the first and second graph nodes each corresponding to a particular data shard of the plurality of data shards; and update, responsive to the request, the data shard corresponding to the first graph node and the data shard corresponding to the second graph node.

Distribution cache for graph data

A distributed caching system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Growing community of inventors

Mountain View, CA, United States of America

Mark V Marchukov