Facebook, Inc.

Microsoft Technology Licensing, LLC

Facbook, Inc.

Sriram Sankar

Rajat Raina

Kihyuk Hong

Kittipat Virochsiri

Gintaras Andrius Woss

Kedar Dhamdhere

Badriddine Khessib

Maxim Gubin

Michael Curtiss

Chaitanya Mishra

Christian L Belady

Sriram Govindan

Zhongxian Chen

Bryan David Kelly

Srinivas P Narayanan

Brandon Aaron Rubenstein

Thomas Jackson

Dmytro Andriyovich Ivchenko

Joseph M Sherman

Stanislav Basovnik

Ryan Allen Stout

Igor Ribeiro De Assis

Woongki Baek

T Varugis Kurien

Jie Jerry Liu

Eric Clarence Peterson

Mark Edward Shaw

Sean Michael James

Gregory Joseph McKnight

John Joseph Siegler

David Thomas Gauthier

Kushagra Vaid

Sandhya Kunnatur

Stephan W Gilges

Harry Raymond Rogers

Brian Andersen

Scott Longheyer

Apurva Rajiv Mehta

J Darrin Schroeder

In an example embodiment, a first set of results from first search results are displayed in a user interface. A plurality of facets, including selectable filters, of the first search results are displayed. A sampling scheme is retrieved, with the sampling scheme defining a first sampling rate for a first number of search results and a second sampling rate for a second number of search results. The first search results are traversed using the sampling scheme, sampling search results for the first number of search results at the first sampling rate and sampling search results for the second number of search results at the second sampling rate, for each sampled search result, causing an increase in a facet count for a facet and/or selectable filter having a matching value in the sampled search result. Facet counts for each of the facets and/or selectable filters are displayed in the user interface.

Hybrid facet counting using different sampling rates

A location query engine in a social networking system provides users with a subset of candidate locations based on location query received from a user. The social networking system identifies candidate locations from stored location data that has one or more attributes matching at least one attribute of the location query. The candidate locations are ranked based on social data determined from a user profile associated with the user, and the subset of candidate locations is selected from the ranking and provided to the user. Examples of social data used for ranking the candidate locations include locations associated with other users connected to the user, locations associated with objects connected to the user and locations previously associated with the user.

Ranking location query results based on social networking data

In one embodiment, a method includes receiving a search query from a client system; modifying the search query by removing a first search term associated with a first object type from the search query; retrieving search results responsive to the modified search query from a first data store storing objects of the first object type; and sending one or more of the search results to the client system.

Vertical-based query optionalizing

In one embodiment, a method includes accessing a first set of scored results received from a client system of a first user, the first set of scored results including: one or more results, each having a rank with respect to the other results, generated by a first search algorithm, and one or more scores inputted by the first user corresponding to the results. The method includes calculating a discounted cumulative gain for each scored result based on the rank and score of the result. The method includes generating a second search algorithm based on the calculated gains and the first search algorithm, the second search algorithm including a modification of the first search algorithm to improve the ranking of results, and, if a quality metric of the second search algorithm is higher than a quality metric of the first, substituting the second search algorithm for the first.

Ranking test framework for search results on an online social network

In one embodiment, a method including maintaining an index of a plurality of nodes of a social graph, each node being associated with an assigned value, wherein the value for each node is calculated based at least in part on one or more factors. The method further includes receiving, from a client device of a first user, a query from the first user, searching the index to identify a top N nodes having the highest assigned values that match the query, ranking the identified nodes based at least in part on the query, and sending, to the client device of the first user for display, a search-results interface responsive to the received query, the search-results interface comprising M search results corresponding to the top M ranked nodes, respectively.

Social static ranking for search

In one embodiment, a method includes receiving a query comprising one or more n-grams, generating a plurality of query commands based on a parsing of the query input, wherein each query command comprises an inner query constraint and an outer query constraint, scoring the query commands based at least in part on a number of objects matching the inner query constraint of the respective query command, selecting a first query command based at least in part on the respective scores of the query commands, and executing the first query command to identify a plurality of objects based on: (1) a first set of objects matching the first inner query constraint and at least in part matching the first outer query constraint, and (2) a second set of objects matching the first outer query constraint.

Search query interactions

In one embodiment, a method includes receiving a query comprising one or more n-grams, generating a plurality of query commands based on a parsing of the query input, wherein each query command comprises a plurality of query constraints, scoring the plurality of query commands based at least in part on a number of objects matching each of the query constraints of the respective query command, selecting a first query command based at least in part on the respective scores of the query commands, wherein the first query command comprises an inverse constraint corresponding to a first query constraint that has previously been flagged as identifying greater than a threshold number of objects and one or more second query constraints, and executing the first query command to identify a plurality of objects matching the inverse constraint and the one or more second query constraints.

Using inverse operators for queries

In one embodiment, a method includes accessing a string of symbols by a computing device. The string is divided into one or more string components each including at least one of the symbols, and each string component is associated with at least one string-position identifier. The string components and their respective associated string-position identifiers are stored for the string of symbols.

Index for electronic string of symbols

In an example embodiment, information to be stored in a record is received, the information comprising at least two pieces of data of at least two different data types, at least one of the data types being of a variable length. Then a data structure is created. The data structure comprises a first portion indicating an offset size, a second portion comprising an offset pointing to a third portion of the data structure, the third portion of the data structure containing a table of offsets, each offset in the table of offsets pointing to a different one of the at least two pieces of data, the at least two pieces of data stored in a fourth portion of the data structure. A schema is also created for the data structure, the schema storing metadata for the at least two pieces of data.

Storage and access time for records

Electrical power is provided to power consuming, heat-exhausting devices by multiple gas-fueled electrical power sources located near such devices. Exhaust heat from such devices is utilized as intake cooling air for the gas-fueled power sources, thereby excluding them from cooling capacity requirements. The gas piping delivering gas to gas-fueled power sources is positioned so as to be within hot aisles comprising exhaust heat. The gas piping is located up high for lighter than air gasses and near the floor for heavier than air gasses, with leak detection located nearby. Additionally, gas piping is externally coated with material that visually indicates a leak. By locating gas piping in the hot aisle, exhausted heat increases temperature and, thereby, pressure of the gas, resulting in more efficient gas distribution through the piping and preventing valve freezing. Furthermore, the gas piping is located after potential ignition sources in the airstream.

Gas distribution system within temperature differentiated environments

In one embodiment, a method includes receiving, from a client system of a first user, a request to post content to the online social network, identifying a plurality of second users, wherein each second user is associated with a privacy setting, and wherein a percentage of the identified second users have a privacy setting likely to make the content posted by the first user accessible to the second user, determining, for each identified second user, whether the content posted by the first user is accessible to the second user, and sending, to one or more client systems of one or more of the second users, respectively, instructions for presenting the content posted by the first user, wherein the content is sent to second users determined to be able to access the content and is not sent to second users determined to be not able to access the content.

Approximate privacy indexing for search queries on online social networks

In one embodiment, a method includes receiving a search query input comprising a character string having a first number of characters; searching one or more indexes of one or more verticals to identify terms corresponding to the search query input, wherein if the first number is less than or equal to a threshold number, then searching one or more first indexes, wherein each first index is related to objects of a first object-type, and if the first number is greater than the threshold number, then searching the one or more first indexes and one or more second indexes, wherein each second index is related to objects of a second object-type different than the first object-type; and sending instructions for presenting one or more suggested queries, each suggested query comprising the character string of the search query input and one or more of the identified terms.

Variable search query vertical access

In one embodiment, a method includes receiving a query specifying a name including a given name and a surname; locating a set of users, comprising: for each of a plurality of users, including the user in the set of users if the user's given name matches the given name specified in the query and the user's surname matches the surname specified in the query or if the user's given name matches the given name specified in the query and the user's surname does not match the surname specified in the query and the surname of at least one family connection of the user matches the surname specified in the query; and discarding the user otherwise; and sending at least a portion of the set of users in response to the query.

User search based on family connections

In one embodiment, a method includes receiving a plurality of search results based on a search query from a user. A computing system determines a plurality of scores for each search result, each score generated by applying a distinct scoring function of a plurality of scoring functions to the search result. The computing system generates a plurality of diversity groups, each diversity group corresponding to a scoring function of the plurality of scoring functions, each diversity group including at least a subset of the plurality of search results ordered according to the scores generated by applying the scoring function to the at least the subset of the plurality of search results. The method further includes selecting at least one of the plurality of search results from each diversity group and sending the selected search results to the user.

Ranking search results using diversity groups

In one embodiment, a method includes receiving, from a first user, a query specifying one or more criteria; accessing a data store comprising information associated with one or more users of a social-networking system; identifying a second user from a plurality of users of the social-networking system based on private information stored in the data store and the one or more criteria, wherein the private information is not viewable by the first user; and sending, to the first user, substitute information associated with the second user in place of the private information, the substitute information being information that is viewable by the first user.

Growing community of inventors

Palo Alto, CA, United States of America

Sriram Sankar