Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a query containing two or more hops in a graph of online professional network data and one or more predicates containing one or more attributes of the online professional network data. The graph includes nodes representing members and companies, and a set of edges representing relationships between pairs of nodes. The query also includes two or more input nodes, including a first input member and/or an input company, that are used to form a path containing the two or more hops, along with an output that matches the one or more predicates and includes one or more output members. Next, the system executes the query to obtain a subset of the online professional network data matching the query. Finally, the system provides the subset of the online professional network data in response to the query.

Abstract: During a feedback technique, a system that provides a social network requests feedback regarding an initial connection strength associated with an edge between two nodes in the social graph, which are associated with an entity and a counterparty, respectively. Note that the social graph represents interactions among users of the social network. Based on the feedback, the system determines a directional asymmetry between revised connection strengths received from the entity and the counterparty. Then, the system performs a remedial action based on the determined directional asymmetry, such as adjusting the connection strength of the edge. In addition, the remedial action may include: feedback about an accuracy of the initial connection strength, estimating a power distance between the entity and the counterparty, and/or encouraging interaction between the entity and the counterparty.

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: The disclosed embodiments provide a system for processing data. During operation, the system obtains a query containing two or more hops in a graph of online professional network data and one or more predicates containing one or more attributes of the online professional network data. The graph includes nodes representing members and companies, and a set of edges representing relationships between pairs of nodes. The query also includes two or more input nodes, including a first input member and/or an input company, that are used to form a path containing the two or more hops, along with an output that matches the one or more predicates and includes one or more output members. Next, the system executes the query to obtain a subset of the online professional network data matching the query. Finally, the system provides the subset of the online professional network data in response to the query.

Abstract: During a feedback technique, a system that provides a social network requests feedback regarding an initial connection strength associated with an edge between two nodes in the social graph, which are associated with an entity and a counterparty, respectively. Note that the social graph represents interactions among users of the social network. Based on the feedback, the system determines a directional asymmetry between revised connection strengths received from the entity and the counterparty. Then, the system performs a remedial action based on the determined directional asymmetry, such as adjusting the connection strength of the edge. In addition, the remedial action may include: feedback about an accuracy of the initial connection strength, estimating a power distance between the entity and the counterparty, and/or encouraging interaction between the entity and the counterparty.

Abstract: A system, apparatus, and methods are provided for searching a distributed graph sharded by node. A controller receives a query that illustratively requires a breadth-first search commencing at an origination node. The controller issues a search request to a first data server that maintains the origination node, with an identifier of other criteria (e.g., a destination node) and with any applicable execution parameters, which may cause the search to terminate early or may cause some results to be pruned. If the first data server cannot resolve the request, it propagates the search to one or more other data servers storing other nodes (i.e., nodes that are directly connected to the origination node), and forwards the execution parameters and any partial results (e.g., partial paths) that it may have generated. Those data servers will process the search request, return responsive results to the controller, and/or further propagate the request.