Twitter, Inc.

Aneesh Sharma

Pankaj Gupta

Ashish Goel

Brian Larson

Venumadhav Satuluri

Ajeet Grewal

Siva Gurumurthy

Volodymyr Zhabuik

Jerry Jiang

Gilad Avraham Mishne

Zhenghua Li

The present invention relates generally to messaging platforms, and relates more particularly to data storage such that random sampling can be accomplished in real-time in messaging platforms. Aspects of the present invention include storing a bipartite graph with associations of two node types. The graph can be stored as a power law graph. The graph can be used to provide real-time content recommendations in a messaging platform. The content recommendations can be provided using random sampling of the node types stored in the graph.

Graph-based data storage for real-time content suggestions

A method for determining a circle of trust (CoT) includes receiving a request for the CoT, generating the CoT for the context account by: identifying a primary graph with nodes based on at least one action within a social network for the context account. The method further includes performing random walks through the nodes of the primary graph, each of the random walks including two steps, ranking each of the nodes based on an amount of the random walks that end on each of the nodes, with the CoT including a number of the highest ranking plurality of nodes, filtering content items using the CoT to identify a subset of relevant items, and providing the subset for display on a client device.

Method and system for implementing circle of trust in a social network

A method for distributed processing involves receiving a graph (G) of targets and of influencers, with each influencer related to at least one target, receiving an action graph of actions performed by one or more of the influencers, and key partitioning G across shards. The method further involves transposing the first graph (G) to obtain a first transposed graph (G), value partitioning Gacross the shards, storing the action graph on multiple shards, issuing, to a shard, a request specifying an influencer, to perform an intersection, receiving a response to the request of a set of influencers each of which is related to a target, and determining whether to send a recommendation to the target based on the response.

Distributed processing in a messaging platform

Indexing and data storage for realtime and contemporaneous content suggestions

A system and method for providing real-time search assistance is provided. Incoming queries are analyzed and an in core set of query statistics is maintained to enable a current suggestion list to be generated. By analyzing each query as it occurs, the suggestion list and associated data stores may be updated in substantially real-time to enable suggestions to be available at the same time as new messages are occurring relating to the subject of the query.

Real time search assistance

A method for distributed processing involves receiving a graph (G) of targets and of influencers, with each influencer related to at least one target, receiving an action graph of actions performed by one or more of the influencers, and key partitioning G across shards. The method further involves transposing the first graph (G) to obtain a first transposed graph (G), valuing partitioning Gacross the shards, storing the action graph on multiple shards, issuing, to a shard, a request specifying an influencer, to perform an intersection, receiving a response to the request of a set of influencers each of which is related to a target, and determining whether to send a recommendation to the target based on the response.

Growing community of inventors

San Francisco, CA, United States of America

Aneesh Sharma