Microsoft Technology Licensing, LLC

Linkedin Corporation

Sanjay Sachdev

SungJu Cho

Sean S Peng

Arjun K Kulothungun

Andrew Joseph Carter

Hao Liu

Jane Alam Jan

Rohan Ramanath

Hardik Bati

Lihong Pei

Divye Khilnani

Yingfeng Oh

Qingpeng Niu

Jianchao Lu

Alexander Easton

Abhishek Nigam

Jefferson Lai

Srikant Veera Raghavan

Christopher Harris

Deepak Dileep Kumar

Mark Dietz

The disclosed embodiments provide a system for processing a query for a ranking of candidates for an opportunity. During operation, the system obtains parameters associated with a query for a ranking of candidates for an opportunity, wherein the parameters include a candidate and the opportunity. Next, the system matches one or more of the parameters to a fixed number of quantile thresholds calculated from a distribution of scores for the candidates. The system then estimates, based on the fixed number of quantile thresholds, a quantile for a score of the candidate. Finally, the system outputs a position of the candidate within the ranking based on the estimated quantile.

Efficient percentile estimation for applicant rankings

The disclosed embodiments provide a system for processing a query for a ranking of candidates for an opportunity. During operation, the system obtains a set of parameters associated with a query for a ranking of candidates for an opportunity, wherein the set of parameters include a candidate, the opportunity, and a ranking category. Next, the system uses the set of parameters to obtain a set of pre-computed scores for use in generating the ranking and determine a number of online scores required to complete the ranking. The system then generates a set of calls to produce the determined number of the online scores. Finally, the system uses the pre-computed scores and the online scores to generate a result of the query.

Scalable processing of queries for applicant rankings

Techniques are provided for securely obtaining trusted information in an online environment. A first entity stores trusted information from a third entity. A second entity retrieves the trusted information from the first entity. In response to a request from a computing device of the third entity, the first entity identifies a set of attributes selected by the second entity. The first entity identifies, from a profile of the third entity, a set of values that correspond to the set of attributes. The first entity may immediately transmit the set of values to the second entity or may first cause the set of values to be presented to the third entity, for example, in an electronic form. The form may allow some of the values to be editable by the third entity and may prevent other of the values to be edited.

Secure transmission of digital content over a computer network

A data stream processors transition system which implements techniques for transitioning control from a first data stream processor to a second data stream processor. The data stream processors transition system preserves the integrity of data streams produced by first and second data stream processors when transitioning control between the first to the second data stream processors. For example, timestamp information may be provided to the first data stream processor that specifies when the first data stream processor may transfer control to the second data stream processor. The first data stream processor may process events by consuming and publishing results until the time specified by the timestamp information. The second data stream processor may, after the time specified by the timestamp information, process events by consuming and publishing results.

Transitioning between data stream processors in a publish-subscribe system

A data center management system is described herein which implements techniques for receiving an event at a first data system and updating data objects stored at another data system. The first data system may receive multiple events within a given a time frame and perform the proper updates to the other data system when certain criteria are met. The data center management system may be responsible for at least two different types of data systems. For example, the first data system may be of the first type of data system and the second data system may be of the second type of data system. The first type of data system may have different technical requirements (e.g., latency, responsiveness, or other requirements), different than the second type of data system.

Managing systems hosted at data centers

Techniques for monitoring performance of a computer system are provided. Bucket data is stored that indicates that multiple buckets are associated with a particular type of request. Then, multiple requests are received, where a first request and a second request indicate the same type of request. Based on the bucket data, the first request is assigned to a first bucket and the second request is assigned to a second bucket. The assignment may be further based on a complexity determined for each request. First performance data is generated while processing the first request and is aggregated with second performance data that was generated while processing one or more third requests that are assigned to the first bucket. Third performance data is generated while processing the second request and aggregated with fourth performance data that was generated while processing one or more fourth requests that are assigned to the second bucket.

Monitoring performance of a computer system

A system, method, and apparatus are provided for performing update operations on variable-length data records stored and indexed to facilitate reverse reading. Each record contains a key offset for each key field, and the key offset stores a reference (e.g., an offset) to the next most recently stored record that has the same value for the key. Key offsets of a new set of records are configured based on the data index and an assumed write location (e.g., an end offset of the data). The data repository is locked and, if no other intervening records were stored, the new ones are written, the index is updated, and the lock is released. If intervening records were stored, the new set of records is adjusted further based on the current index and the current write location, the records are stored, the index is updated, and the lock is released.

Performing updates on variable-length data sequentially stored and indexed to facilitate reverse reading

A system, method, and apparatus are provided for facilitating reverse reading of sequentially stored variable-length data records. Each record is stored with accompanying size metadata that identifies the size or length of the record. Further, if the length of a given record is greater than a threshold (e.g., 127 bytes when the length is stored with variable-length quantity encoding), such that more than one byte (or other storage unit) is needed to store the record length, an additional byte (or other unit) is configured to store the size/length of the record length (e.g., the number of bytes required to store the record length). The most significant bit of the additional byte is set to 1, so that during reverse reading, the location and size of the record length value can be quickly determined.

Facilitating reverse reading of sequentially stored, variable-length data

The disclosed embodiments provide a system for processing data. During operation, the system obtains a graph of a social network, wherein the graph includes a set of nodes representing users in the social network and a set of edges representing relationships between pairs of the users. Next, the system stores, on a single computer system, a static representation of the graph, wherein the static representation includes a first set of fixed-size blocks representing the nodes and the edges and a first index that maps a set of identifiers for the nodes and the edges to offsets of the first set of fixed-size blocks. The system then uses the static representation of the graph to process, by the single computer system, one or more queries of the graph.

Fast querying of social network data

A social graph is divided into a series of partial graphs having limited hops and reference counts. For each of a plurality of nodes in the social graph, a partial graph for the node is created having a first degree list of nodes reachable in one hop and a second degree list of nodes reachable in two hops. Reference counts of how many paths exist between the node and each node reachable in two hops are also added to the second degree list. A global inverted index is maintained containing a list of all nodes in the social graph and for each node in the social graph a list of nodes that directly connect to the node. The partial graphs created for each of the plurality of nodes are distributed across a plurality of data servers. An index of which partial graphs are stored on which data servers is maintained.

Partial graph incremental update in a social network

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.

Growing community of inventors

San Jose, CA, United States of America

Sanjay Sachdev