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. In particular, the subset of the graph may include the desired information expressed within an associated structure of the graph.

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 a page cache. The managed memory cache may be managed according to predefined caching rules that are separate from the caching rules in the operating system that are used to manage the page cache, and these caching rules may be application-aware. Subsequently, when data for an application is accessed, the computer system may prefetch the data and associated information from disk and store the information in the managed memory cache based on data correlations associated with the application.

Abstract: The disclosed embodiments relate to a system that uses data from an online social network to optimize subscription offers. During operation of the online social network, the system gathers data associated with subscription offers that were presented to members of the online social network, including information about which subscription offers were converted. Next, the system uses a machine-learning technique to train a model based on the gathered data. Finally, the system uses the trained model to select subscription offers to present to a member of the online social network.

Abstract: Determining an item to present to a first user is disclosed. Preference information is received that comprises the preferences of a plurality of users associated with one or more items. User correlations are determined from the received preference information. For the first user, a set of other users most correlated with the first user is determined. One or more items are presented to the first user based at least in part on the preferences of the other users.

Abstract: Methods and systems for leveraging one's social network in the context of an opportunities marketplace are described. One aspect of the invention involves integrating social networking features into an online marketplace, or exchange. Accordingly, one aspect of the invention involves facilitating an opportunity search in a manner that provides social networking information with the results of the search.

Abstract: A system may include a database configured with individual partitions, one of the partitions corresponding to a sponsored content campaign of a social network. The system may further include multiple servers each communicatively coupled to the database, and each configured to implement a campaign having a campaign termination criterion. Each of the servers may include a processor configured to track sponsored content event data received from a user device based on the campaign and transmit the event data to the database and terminate the campaign based on a comparison of the event data as received from a partition of the database corresponding to the campaign and an estimation of event data not received from the database. The database may be configured to store the event data as received from the servers in the partition corresponding to the campaign upon receipt of the event data.

Abstract: Systems and methods for reducing a churn rate associated with subscribers of social network services are described. In some example embodiments, the systems and methods may access activity information associated with a former subscriber of a social network service, compare the accessed activity information to activity information associated with subscribers of the social network service, identify one or more differences between the activity information associated with the former subscriber of the social network service and the activity information associated with the subscribers of the social network service, and perform an action based on the identified one or more differences.

Abstract: The disclosed embodiments relate to a system for analyzing performance in an online professional network. During operation, the system receives time series data for user actions, wherein for each user action, the time series data comprises a series of numbers associated with consecutive time intervals, wherein a given number indicates a number of times the user action occurred during the time interval. The system also receives time series data for performance metrics, wherein for each performance metric, the time series data comprises a series of numbers associated with consecutive time intervals, wherein a given number indicates the number of times the performance metric occurred during the time interval. The system then performs a time series analysis on the received time series data for user actions and performance metrics to determine relationships between the user actions and the performance metrics.

Abstract: A system, computer-readable storage medium, and computer-implemented method for automatic discovery of how and when people met is provided. A plurality of signals are analyzed to determine a level of significance of each of the plurality of signals in providing a suggested entry into a data field of a contact management system designated to provide a description of how a user met a contact. In response to at least one signal of the plurality of signals exceeding a threshold level of significance, a suggested entry for the data field of the contact management system is determined. The suggested entry of how a user met a contact is automatically displayed to a user.

Abstract: During a storage technique, multiple messages (such as emails) associated with a user of a communication application are received. Then, the multiple messages are stored in a message table associated with the user and the multiple messages are indexed in an index associated with the user. This index may be divided into multiple divisions if a total number of messages stored in the message table exceeds a threshold value, where each division corresponds to messages received during a different time interval.

Abstract: A system executes a query associated with an application against a graph database by providing, to a first shard of the graph database, the query and a first query header that specifies the first shard. The query includes a subject, a predicate and an object, and the graph database stores a graph that includes nodes, edges between the nodes, and predicates to represent and store data. In response to the query, the system receives results and associated result headers from the first shard and a second shard, where the result headers specify that the results are partial results that are particular fractions of a total result. Furthermore, a combination of the partial results provides the total result to the query that includes a subset of the graph. Note that the subset of the graph may include desired information expressed within an associated structure of the graph.

Abstract: A system, method, and apparatus are provided for identifying an ideal or target network of a member of a professional network or social network, or one or more characteristics of such a network. Based on a type of the member, one or more attributes of a profile of the member, and/or one or more goals of the member, characteristics may be identified that support achievement of those goals or that promote more effective use of the professional network or social network by the member. By way of illustration, an ideal or target user network of a member seeking to improve her future job opportunities may include a minimum number of connections to members employed by different organizations, while an ideal or target user network of a member seeking a mentor may include a maximum number of connections to members holding senior positions within the member's industry or functional area.

Abstract: A system, method, and apparatus are provided for automatically establishing an inferred (‘follow’) relationship between a first member and a second member of a user community. Based on passive and/or active signals indicating affinity of the first member for the second member, the system determines whether an inferred connection from the first member to the second member would improve the first member's network within the user community. A potential improvement may be observed if the potential connection would improve some aspect or characteristic of a target or ideal network identified for the first member, and/or if there is more than a threshold level of affinity between the members. The first member's network may be pruned, if necessary, to accommodate a connection to the second member if, for example, the connection would violate a constraint associated with the target or ideal network.

Abstract: A system, method, and apparatus are provided for selecting electronic content to surface to a member of a user community, among content associated with a second member with whom an inferred (i.e., non-explicit) connection has been formed. Based on the members' types (e.g., Professional, Student, Recruiter) and/or other factors, a type is assigned to the new connection. A default vector comprising weights corresponding to multiple categories of content that may be served to a community member (e.g., content creation items, content curation items) is generated based on how other members within the same type of relationship interacted with content surfaced to them. A personal vector copied from the default vector is used to select, from content associated with the second member, items to surface to the first member, but may be altered over time based on the first member's interaction with the items.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains one or more metrics associated with user interaction with a set of content items in a member segment of a social network. Next, the system ranks the set of content items by the one or more metrics. The system then generates a content pool for the member segment based on the ranking of the content items. Finally, the system creates a content feed from the content pool for presentation to a user in the member segment.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a set of content pools for a user, wherein each content pool in the set of content pools includes a set of content items associated with user activity in a member segment of a social network. Next, the system calculates a set of probabilities of clicking the content items in the content pool. The system then uses the probabilities to order the content items with other content items from other content pools into a content feed for the user. Finally, the system presents the content feed to the user.

Abstract: A system, method, and apparatus are provided for issuing content event notifications to members of a user community that makes content available to its members. Events involving content items of interest to a given member (e.g., creation, upload, sharing) are recognized, particularly events that involve another member connected to the given member in the community, and the relevance of the items to the member or to content topics of interest to the member is determined. Time slots during which notifications can be issued to the member are identified (e.g., using the member's calendar data), possibly in association with events on the member's calendar, and may be associated with one or more topics that interest the member. During a time slot, only notifications regarding content items related to the associated topic(s) may be issued. A do-not-disturb time slot may be defined as a period during which no notifications should be issued.

Abstract: A method of making it easier for users to interact with each other via a social networking system is disclosed. It is detected that a first user of a social networking system performed an action with respect to a second user of the social networking system. It is interpreted that the action of the first user corresponds to a command that the first user intends to issue to a social networking system, the command pertaining to the second user. The command is processed by the social networking system on behalf of the first user.

Abstract: A system, method, and apparatus are provided for identifying and/or ordering events (or notifications of events) within a computing environment featuring a high rate of events (e.g., hundreds of millions per minute). New events are labeled based on multiple alternating epochs comprising sequences of event identifiers, wherein each epoch's identifiers are mutually exclusive of other epochs. Illustratively, each epoch may commence with a different initial identifier (e.g., 0, 1, 2) and each epoch's sequence of identifiers thereafter increment in the same manner (e.g., by twos, by threes) until a maximum identifier is encountered. All of one epoch's identifiers are applied before the next epoch's are applied. After a last epoch is exhausted, labeling begins again with the first epoch. Verifying or enforcing event ordering may involve determining a given event's identifier, epoch, timestamp, and/or other characteristics, and/or characteristics of a previous event.

Abstract: Disclosed in some examples are methods, systems and machine readable medium for recommending an out-of-network communication by determining a set of potential recommended members of a social networking service based upon one or more recommendation criteria. In some examples the recommendation criteria may include: a profile similarity to a previous target of an out-of-network communication, a degree of correspondence between an interest and intent of the sending member, and a likelihood of response.