Abstract: Techniques for generating, storing, and using service call graphs are provided. In one technique, trace data items generated by different services are correlated to generate a service call graph. Trace data indicates when certain services are called and their respective latencies as a result of a client request. A service call graph may reflect a single trace or multiple traces over a particular period of time. A service call graph may be analyzed to inform administrators of a web site how a web application and the services it relies on are performing. A service call graph may be used to determine whether there are sufficient resources to support a projected increase in traffic to a web application. A service call graph may be used to estimate a cost of a web application. Multiple service call graphs may be compared to determine one or more root causes of a performance problem.

Abstract: In an example embodiment, an indication is received via a user interface in a first mobile device to begin recording live video on the first mobile device. Then the recording of live video is begun by the first mobile device in response to the receiving of the indication. The live video is displayed in the user interface as it is being recorded. A gesture by a user of the first mobile device is detected. In response to the detection of the gesture, the broadcasting of the live video as it is being recorded to a plurality of mobile devices other than the first mobile device is begun. Then, in the user interface along with the live video, identifications of a plurality of users corresponding to the plurality of mobile device other than the first mobile device to which the live video is being broadcast are displayed.

Abstract: A system, method, and apparatus are provided for identifying clients or consumers of one or more controlled resources within a computing environment (e.g., a data center, a computing cluster). The resources may be controlled via the enforcement of quotas, wherein different clients have different quotas for the controlled resource(s). A client associated with a given call to a resource is identified using a tuple formed from identifiers of multiple services in the call stack, such as a first service (e.g., a front-end or user-facing service) and an immediate service (e.g., a final service in the stack prior to receipt of the call at a gateway, broker, or other entity that manages access to the controlled resources).

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains input data containing a set of replicated records from a set of data sources. Next, the system generates, in a data store, a first mapping of a first key to a first set of values for a first replicated record in the set of replicated records. The system then audits the input data by comparing the first set of values in the first mapping. Finally, the system outputs a result of the audited input data based on the compared first set of values.

Abstract: A system, apparatus, and methods are provided for managing on-demand profiling of one or more instances of a software application executing on a plurality of machines within one or more data centers. During operation, the system executes the one or more instances of the software application on the plurality of machines. Next, the system publishes, to a command channel, a command message that comprises a profiling request, wherein the profiling request specifies a subset of the machines. The system then receives, via a data channel, one or more data messages from the subset of the machines, wherein the data messages comprise data gathered by the subset of the machines in response to receiving the command message. Next, the system then evaluates the performance of the software application by aggregating and processing the data messages. Responsive to detecting an anomaly in the performance, the system then executes one or more remedies.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system obtains a first transaction timestamp from a record that is replicated across a set of data sources. Next, the system includes at least a portion of the first transaction timestamp in a first key of a first mapping of the record to a first set of values for the record from the set of data sources. The system then audits the record by comparing the first set of values in the first mapping. Finally, the system outputs a result of the audited record based on the compared first set of values.

Abstract: A system, method, and apparatus are provided for visualizing quotas on resources within a computing environment (e.g., a data center, a computing cluster) that includes multiple brokers, gateway servers, or other entities that control access to the resource(s). Through a visualization interface, an operator of a quota system can set, change, and/or delete quotas on resources and/or sub-resources for any number of clients or consumers of the resources. The visualization interface may also enable access to a log of changes to quotas and/or graphs or other displays of statuses of any selected quotas for any selected clients and resources/sub-resources.

Abstract: A system, method, and apparatus are provided for locally enforcing quotas on resources within a computing environment (e.g., a data center, a computing cluster) that includes multiple brokers, gateway servers, or other entities that control access to the resource(s). Instead of using global access statistics provided by all gateways, each server individually allows or denies requested access to a resource based on whether the requesting client has already exceeded its quota (or would exceed its quota if the request is approved). A client associated with a given call to a resource may be identified using a tuple formed from identifiers of multiple services in the call stack, such as a first service (e.g., a front-end or user-facing service) and an immediate service (e.g., a final service in the stack prior to receipt of the call at a gateway, broker, or other entity that manages access to the controlled resources).

Abstract: Disclosed in some examples is a method of providing a bookmarking service on a social networking service, the method including receiving, over a network, an indication that a member of the social networking service interacted with an item of content; associating the item of content with a skill using a computer processor; and storing an indication in a storage device that the member interacted with the item of content and the skill associated with the item of content.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system determines a current incoming queries per second (QPS) to one or more components for processing queries of a graph database, wherein the graph database is replicated across multiple clusters and distributed among a set of storage nodes in each of the clusters. Next, the system uses the current incoming QPS to estimate, for the one or more components, an expected QPS associated with fanning out of the queries to the clusters. The system then selects a number of clusters in the multiple clusters for fanning out of a query based on the expected QPS and one or more throughput limits for the one or more components. Finally, the system transmits the query to one or more of the storage nodes in the selected number of clusters.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system calculates one or more quantiles from a distribution of historic user engagement with content within a member segment of a social network. Next, the system performs a comparison of the one or more quantiles with a current measurement of user engagement with a content item within the member segment. When the comparison indicates that the current measurement of user engagement exceeds a threshold, the system presents the content item to one or more members in the member segment.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system identifies a query type of a query of a graph database storing a graph, wherein the graph comprises nodes, edges between pairs of nodes, and predicates. Next, the system determines, based on the query type, a number of clusters on which the graph database is replicated for fanning out of the query. The system then selects a set of storage nodes in the determined number of clusters for processing of the query. Finally, the system generates a fan-out of the query to the selected storage nodes.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system uses one or more queries of a data set to aggregate one or more measurements of user engagement with a set of content items within a second-degree network of a member. Next, the system calculates one or more metrics from the one or more measurements. The system then ranks the set of content items by the one or more metrics. Finally, the system uses the ranking to present one or more of the content items in a content feed to the member.

Abstract: The disclosed embodiments provide a system for processing data. During operation, the system generates a first distribution of a set of partitions comprising a graph database across a first set of storage nodes in a first cluster. Next, the system replicates the graph database by generating a second, different distribution of the set of partitions across a second set of storage nodes in a second cluster. The system then identifies one or more partitions storing data associated with the query and uses a set of mappings comprising the set of partitions, the first and second sets of storage nodes, and the first and second clusters to select one or more storage nodes containing the one or more partitions. Finally, the system transmits one or more portions of the query to the selected storage nodes.

Abstract: The disclosed embodiments provide a system for facilitating interaction within a social network. During operation, the system obtains a set of attributes of a social network of a first member and a set of historic interactions in the social network. Next, the system analyzes the attributes and the historic interactions to predict an effect of a potential interaction between the first member and a second member of the social network on subsequent interactions in the social network. The system then uses the predicted effect to generate output for modulating the subsequent interactions in the social network.

Abstract: A system and method for personalized search user searcher features may include obtaining a search term from a member of a social network at a user device via the network interface. An initial result may be generated based on the search term, including a first group of content items from a social network and stored in a content database, the content items including member profiles of members of the social network. Each of the content items of the first group may be ranked based on information indicative of interactions from an activity database with the content items of the first group, the interactions being by at least a second user of the social network different than the first user. A second group of the content items may be displayed, including at least some of the first group of the content items, based on the rank of the first group of the content items.

Abstract: Aspects of the present disclosure relate to a self-healing job executor pool. A server detects that a job executing on an executor failed. The server determines, based on at least one factor from a predetermined set of executor-related factors, that the job executing on the executor failed due to a state of the executor. The server adjusts, in response to determining that the job executing on the executor failed due to the state of the executor, the state of the executor to a known good state, where the known good state is selected from a stored set of known good states.

Abstract: The disclosed embodiments provide a system for updating an index structure of a graph database storing a graph. During operation, the system includes, in the index structure, a first compressed edge store containing a first compact representation of edges in the graph at a first virtual time and a first series of updates to the edges after the first virtual time. At a second virtual time, the system creates a second compact representation of the edges from the first compact representation and the first series of updates. The system then appends, to the second compact representation, a second series of updates to the edges after the second virtual time to produce a second compressed edge store. Finally, the system updates the index structure by atomically replacing, in the index structure, a reference to the first compressed edge store with a reference to the second compressed edge store.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database. During operation, the system executes a set of processes for accessing a lock-free hash table stored in memory on a computer system, wherein the processes include a write process and multiple read processes. Next, the system uses the processes and the lock-free hash table to index a graph database storing a graph. The system then uses the processes to access a compressed edge store containing a compact representation of the set of edges at a virtual time in the graph and a series of updates to the edges after the virtual time. During use of the processes and the lock-free hash table to index the graph database, the system references the set of edges in the compact representation from a set of entries in the lock-free hash table.

Abstract: A system and method for personalized search based on similarity may include obtaining a search term. An initial result based on the search term and including a first group of content items as stored in a content database may be generated. Each of the content items of the first group may be ranked based, at least in part, on similarity scores, each of the similarity scores individually based on a first member profile relative to individual ones of second member profiles to which an activity related to a content item of the first group corresponds. The user device may display a second group of the content items, including at least some of the first group of the content items, according to the rank of the first group of the content items.