Abstract: In order to prevent data thrashing and the resulting performance degradation, a computer system may maintain an application-layer cache space to more effectively use physical memory and, thus, significantly improve an application-memory hit ratio and reduce disk input-output operations. In particular, the computer system may maintain a managed memory cache that is separate from an operating systems' default page cache. The managed memory cache may be managed according to predefined caching rules that are separate from rules used to manage the page cache. Moreover, at least one of the data entries in the managed memory cache may have a page size that is smaller than a minimum page size of the page cache. Furthermore, at least some of the data entries in the managed memory cache may have different page sizes and, more generally, different associated predefined caching rules.

Abstract: A system and method for virally growing a social network. The social network system receives a member account sign-up message for a first social network from a first member. The social network system then posts a member sign-up notification to the first member's event wall on a second social network; wherein the first member has one or more social contacts through the second social network. For at least a second respective member in the one or more social contacts, the social network system posts a personalized invitation message as a comment to the member sign-up notification on the first member's event wall, wherein the comment is initially hidden from all members other than the second respective member of the one or more member contacts.

Abstract: Techniques for optimizing a delivery time for the delivery of messages are described. According to various embodiments, members of an online social network service that are currently located in a particular geographic location (e.g., a particular time zone) are identified. Thereafter, messages (e.g., e-mails) are transmitted to the members at multiple local times (e.g., multiple times of the day). It is then determined that one or more of the messages that were transmitted at a particular local time have received a highest value for a response metric among the messages, the response metric indicating responses by the members to the messages. The particular local time is then classified as an optimum local message delivery time for the particular geographic location.

Abstract: Structure of a resultant Every Document as a Graph (EVG) graph may be outlined using an EVG query. First metadata for a first data source may be retrieved. At least one entity key may be determined for a first entity, the entity key coming directly from the EVG query or from an entity on a preceding level of the EVG graph. Based on the first metadata and entity key, an edge may be created in the EVG graph beginning at the first entity, wherein the edge contains information retrieved from the first data source. Second metadata for a second data source may be retrieved. Based on the second metadata and information contained in the edge retrieved from first data source, a second entity may be created in the EVG graph, wherein the edge connects to the second entity, wherein the second entity contains information retrieved from the second data source.

Abstract: A method and system to determine a category score of a social network member is described. An example system comprises a sample selector, a weight value module, a storing module, an access module, and a category score module. The sample selector selects a sample of member profiles from the profiles maintained by an on-line social network system. The weight value module obtains respective weight values associated with various phrases present in the sample of member profiles. The access module accesses a member profile and the weighted phrases associated with a certain category. The category score module determines a category score for the member profile based on a presence of one or more phrases from the plurality of weighted phrases in the member profile.

Abstract: Systems and methods for the forming of user device groups are presented. In one example, potential membership of a first user in a first group of users is determined, the first group of users containing a plurality of users, by selecting the first group from a plurality of possible groups, the selecting being based on scores generated, for each of the plurality of possible groups, the scores based at least partially on the a loneliness score for the first user, the loneliness score being an estimate of how lonely the first user is and being calculated by examining past communications between an electronic device of the first user and other electronic devices via a social network service. The first user is then added to the first group of users based on the loneliness score. Content from a second user in the first group of users is received, and then the content is distributed to users in the first group of users.

Abstract: A method is provided for maintaining a list of content channels that a user of a multi-channel content service subscribes to or has followed, and a client device for operation by the user to receive the content. If a list on the user's device has been modified, the device (e.g., an applet provided by the service) informs a synchronization server by uploading the list. The server synchronizes it with a master list and downloads a copy to the device. A channels list includes an entry for each channel the user follows (and possibly channels he has deleted), which includes an index or ordinal position of the channel among all the user's channels, an identifier of the channel (e.g., a URL), identifiers of sub-lists the channel has been assigned to, and a timestamp identifying the last time the entry changed (e.g., when the channel was added, removed, assigned to a sub-list).

Abstract: A method for a computer system includes receiving a first user communication, determining a first group of users, determining a target number of users, determining whether the first group of users includes the target number of users, and if not, providing the communication to the first group of users, determining a hierarchal mapping of groups of users in response to user memberships, determining a second group of users from the hierarchal mapping, determining a plurality of social network relationship factors for the second group of users with respect to the first user, and providing the communication to at least a subset of users in the second group of users in response to the first plurality of social network relationship factors.

Abstract: Systems and methods for providing push notifications of social network content items include determining first and second engagement values for first and second content items, respectively, provided by first and second content item sources, respectively, based on previous interactions with content items. First and second utility values are determined for the first and second content items, respectively, based on a mathematical operation applied to the first and second engagement values, respectively, the first and second selection metrics, respectively, and, for the first utility value, the value metric. One of the first and second content items are determined as a push content item based on a difference between the first and second utility values and displayed on a user device.

Abstract: Techniques for team searches within a social graph are described. Consistent with some embodiments, a search request initiated by a searching member profile is received. The search request includes search criteria. A team membership connection between the searching member profile and a team profile is then detected. Based on the detected team membership connection, profile connections between member profiles and teammates of the searching member profile are identified. The teammates are member profiles with team membership connections to the team profile. Then, matching member profiles are identified by matching the member profiles with the identified profile connection with the search criteria. The matching member profiles are then communicated to the searching member profile.

Abstract: A score is generated for each of a plurality of potential user groups in which to add the first user, each potential user group containing a plurality of users, the score based on a location of the first user. The first user is added to a first user group based on the score generated for the first user group. A pinning action by the first user pinning the first user to the first user group is then received. A change in location of the first mobile device is detected, and the score of each of the potential user groups is regenerated based on the changed location, causing a determination that the first user should be removed from the first user group. The first user is maintained as a member of the first user group despite the determination that the first user should be removed based on the pinning.

Abstract: A first member of a social network service provides a set of desired attributes and a designation of the type of a candidate having the desired attributes that is desired as a recommendation. The attributes of the profiles of other members of the social networks are searched for entities having the set of desired attributes. At least one of the entities having the desired attributes that result from the search is presented to the first member as the recommendation of a candidate. The first member may provide a second set of desired attributes and a designation of the type of at least one second candidate having the second set of desired attributes. The attributes of the profiles of the other members of the social network may be searched for second entities having the second set of desired attributes. The first member is presented with at least one of the second entities as the recommendation of a second candidate.

Abstract: Disclosed in some examples is a method including determining a set of recommended connections for a member of a social networking service based upon a recommendation criteria; presenting the set of recommended connections to the member; receiving from the member a selection of a set of target members; and for each particular member in the set of target members: determining a second set of recommended connections for the particular target member, the second set of recommended connections based upon the recommendation criteria and based upon the set of target members; and sending a notification to the particular member, the notification including the second set of recommended connections.

Abstract: In order to prevent unauthorized access to information, a system may analyze and may selectively store the information provided based on requests from users that are not unauthorized to access the information. In particular, the system may receive a request for information associated with a document (such as a web page) from an authorized user, either in real-time (i.e., during live or online operation of the system) or offline (in which case the system may operate as a proxy for a live feed of requests). In response, the system may provide or replay the request, but may include the credentials of an unauthorized user. Then, the system may analyze the response to the request to determine if the response is substantive (i.e., includes information). If yes, the system may store the response for use in subsequent analysis and to guide remedial action.

Abstract: A system, methods, and apparatus are provided for performing capacity planning within a system that experiences high volumes of data having high velocity and high variability. Based on historical traffic, a forecast is generated for one or more relatively coarse time periods (e.g., weeks, days), and is decomposed to yield finer-grained forecasts (e.g., for hours, minutes) by applying a distribution index also generated from historical traffic. Estimated replication latency for the forecast period can be calculated from the traffic forecast and an expected level of replication capacity. Further, a required amount of replication capacity can be determined based on a traffic forecast and a maximum replication latency permitted by a service level agreement (SLA) of an event consumer. In addition, replication headroom can be computed, to identify a maximum level of traffic that can be sustained without violating an SLA and/or a date/time at which a violation may occur.

Abstract: A system, apparatus, and methods are provided for conditionally forwarding electronic messages. Users of an online application or service are provided internal addresses (e.g., electronic mail addresses) within a domain (e.g., an Internet domain) of the application or service. When a message is received that is addressed to a user's internal address, it is queued for conditional forwarding to an external address of the user (e.g., an electronic mail address in a domain other than the domain of the application or service). After a threshold period of time lapses, if the message was not read via the online system (e.g., via web or mobile client software) it is forwarded to the external address. If additional messages were received for the same conversation or thread, they may be forwarded at the same time. Messages may be forwarded in their original form; multiple messages may be forwarded in digest form.

Abstract: A navigation system and method are described. A destination may be determined for a user. A starting location may be determined for the user using data obtained via a mobile device of the user. The user may be enabled to establish a route from the starting location to the destination using the mobile device. Route information that details the established route may be stored in a database for subsequent display to other users. In some embodiments, a value total for each user may be stored, and value may be added to the user's value total in response to the user establishing the route from the starting location to the destination.

Abstract: Techniques for enabling members to learn about and interact with their social network via games are described. According to various embodiments, it is determined that a content item or entity associated with an online social network service is relevant to a member of the online social network service. An online game including a game question and a correct game answer is generated based on the content item or entity. The game question is then displayed to the member, and a member response to the displayed game question is received. Thereafter, a game result is displayed, and the member is enabled to interact with the content item or entity.

Abstract: In order to request desired information from a graph database, a system executes a query against the graph database. The graph database may store a graph that includes nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency. Moreover, the query may identify a first edge associated with a predicate that specifies one or more of the nodes in the graph. In response to the query, the system receives a result that includes a subset of the graph. Then, the system may verify the subset of the graph. In particular, the system may verify that the subset of the graph includes one or more particular edges, such as an edge with the predicate in the query. Furthermore, the system may verify that the subset of the graph includes data and/or associated structure in the portion of the graph.

Abstract: In order to request desired information from a graph database, a system executes a query against the graph database. The graph database may store a graph that includes nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency. Moreover, the query may identify a first edge associated with a predicate that specifies one or more of the nodes in the graph. In response to the query, the system receives a result that includes a subset of the graph. Then, the system may use the result of the query in a concatenated set of queries. In particular, the system may execute a second query against the subset of the graph. Furthermore, in response to the second query, the system may receive a second result that includes a second subset of the graph.