LinkedIn Patent Applications

SCALABLE PROCESSING OF HETEROGENEOUS USER-GENERATED CONTENT

Granted: October 5, 2017
Application Number: 20170286551
The disclosed embodiments provide a system for processing data. During operation, the system obtains a first configuration for processing a first set of content items from a first data source and a second configuration for processing a second set of content items from a second data source. For each content item in the first set of content items, the system uses mappings from the first configuration to transform original fields from the content item into required fields in a record…

ON-DEMAND PROFILING BASED ON EVENT STREAMING ARCHITECTURE

Granted: September 21, 2017
Application Number: 20170270024
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.…

REAL-TIME INCREMENTAL DATA AUDITS

Granted: September 21, 2017
Application Number: 20170270153
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…

TRACKING DATA REPLICATION AND DISCREPANCIES IN INCREMENTAL DATA AUDITS

Granted: September 21, 2017
Application Number: 20170270175
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.…

VISUALIZATION OF COMPUTER RESOURCE QUOTAS

Granted: September 21, 2017
Application Number: 20170272379
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…

CLIENT IDENTIFICATION FOR ENFORCING COMPUTER RESOURCE QUOTAS

Granted: September 21, 2017
Application Number: 20170272475
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…

LOCAL ENFORCEMENT OF COMPUTER RESOURCE QUOTAS

Granted: September 21, 2017
Application Number: 20170272541
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…

PARTITIONING AND REPLICATING DATA IN SCALABLE DISTRIBUTED DATA STORES

Granted: September 14, 2017
Application Number: 20170262521
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…

THROUGHPUT-BASED FAN-OUT CONTROL IN SCALABLE DISTRIBUTED DATA STORES

Granted: September 14, 2017
Application Number: 20170262524
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…

GENERATING CONTENT FEEDS BASED ON EXPANDED NETWORK ENGAGEMENT

Granted: September 14, 2017
Application Number: 20170262532
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…

FAN-OUT CONTROL IN SCALABLE DISTRIBUTED DATA STORES

Granted: September 14, 2017
Application Number: 20170262551
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…

ENGAGEMENT-BASED SELECTION OF CONTENT FOR MEMBER SEGMENTS OF SOCIAL NETWORKS

Granted: September 14, 2017
Application Number: 20170262762
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,…

CHARACTERIZING AND MANAGING SOCIAL NETWORK INTERACTIONS

Granted: September 14, 2017
Application Number: 20170264584
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…

INDEX STRUCTURES FOR GRAPH DATABASES

Granted: September 7, 2017
Application Number: 20170255708
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…

ATOMIC UPDATING OF GRAPH DATABASE INDEX STRUCTURES

Granted: September 7, 2017
Application Number: 20170255709
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…

AUTOMATIC RESPONSE TO INEFFICIENT JOBS IN DATA PROCESSING CLUSTERS

Granted: August 17, 2017
Application Number: 20170235608
The disclosed embodiments provide a method, apparatus, and system for obtaining user ratings and/or feedback for a software application. During operation, for each of a plurality of jobs executed by a computing system component, wherein each job includes an execution of a corresponding job definition: the system retrieves metadata about the job from the computing system component and calculates an inefficiency metric for the job based on the metadata, wherein a higher inefficiency metric…

PROCESSING AND VISUALIZATION OF SINGLE-PAGE APPLICATION PERFORMANCE METRICS

Granted: August 17, 2017
Application Number: 20170237635
The disclosed embodiments provide a system for processing data. During operation, the system obtains a set of metrics related to a performance of a single-page application (SPA), wherein the set of metrics includes an initial page load time of the SPA that is calculated from a page load event and a render completion time and a subsequent page load time of the SPA that is calculated from a transition time and the render completion time. Next, the system uses the set of metrics to display…

REAL USER MONITORING OF SINGLE-PAGE APPLICATIONS

Granted: August 17, 2017
Application Number: 20170237799
The disclosed embodiments provide a system for processing data. During operation, the system obtains a first set of metrics generated during loading of a single-page application (SPA) in a web browser, wherein the first set of metrics includes a page load event and a render completion time. Next, the system uses the first set of metrics to calculate an initial page load time for the SPA. The system also obtains a second set of metrics generated during loading of a subsequent view in the…

HYBRID ARCHITECTURE FOR PROCESSING GRAPH-BASED QUERIES

Granted: July 27, 2017
Application Number: 20170212930
The disclosed embodiments provide a system for processing data. During operation, the system launches a set of child processes for processing queries of a graph database storing a graph, wherein the graph comprises a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. When a query of the graph database is received, the system transmits the query to one or more of the child processes. Next, the system receives a result of the query from the…

BRANCHABLE GRAPH DATABASES

Granted: July 27, 2017
Application Number: 20170212945
The disclosed embodiments provide a system for providing a graph database storing a graph. During operation, the system executes one or more processes for providing the graph database. Next, the system stores a sequence of changes to the graph in a base version of the graph database. The system then branches a version of the graph database from a virtual time in the base version. Finally, the system uses the branched version to process one or more queries of the graph database.