Abstract: 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.

Abstract: 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.

Abstract: A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user.

Abstract: A business networking system receives a user a first search query that includes search criteria. The system executes the first search query to retrieve information relating to members of the business networking system based on the search criteria and to retrieve additional information relating to one or more facet values of the business networking system based on the search criteria and a scoring of a relevance of the facet values to the user. The system then executes a second search query using the one or more retrieved facet values to determine a count of documents that satisfy the search criteria and that include the one or more facet values. The system selects a portion of the facet values for transmission to the user, and displays on a user device the information relating to the members, the one or more facet values, and the counts for the one or more facet values.

Abstract: A system and method for rearranging search operators of a search query are disclosed. In some example embodiments, a first initial search query is received from a first user. The first initial search query comprises at least one search operator and at least one search term. A first rewritten search query is generated based on the first initial search query. The generating of the first rewritten search query comprises rewriting at least one optional search operator in the first initial search query using at least one required search operator and at least one exclusion search operator in response to a determination that the first initial search query comprises the at least one optional search operator and does not comprise any required search operators. A first set of search results is generated for the first rewritten search query and caused to be presented to the first user.

Abstract: A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user.

Abstract: A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user.

Abstract: 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.

Abstract: Disclosed in some examples are methods, systems, and machine readable mediums which allow for fast and efficient advertisement selection using search indices. Selection criteria of the advertisement campaigns are converted into documents using a conversion schema. The documents are then indexed to create an advertising campaign index. Member profile data is then converted into a member search query using the conversion schema. The member search query is then issued to a search engine which uses the advertising campaign index to find matching campaigns.

Abstract: 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.

Abstract: A system and method for rearranging search operators of a search query are disclosed. In some example embodiments, a first initial search query is received from a first user. The first initial search query comprises at least one search operator and at least one search term. A first rewritten search query is generated based on the first initial search query. The generating of the first rewritten search query comprises rewriting at least one optional search operator in the first initial search query using at least one required search operator and at least one exclusion search operator in response to a determination that the first initial search query comprises the at least one optional search operator and does not comprise any required search operators. A first set of search results is generated for the first rewritten search query and caused to be presented to the first user.

Abstract: A business networking system receives a user a first search query that includes search criteria. The system executes the first search query to retrieve information relating to members of the business networking system based on the search criteria and to retrieve additional information relating to one or more facet values of the business networking system based on the search criteria and a scoring of a relevance of the facet values to the user. The system then executes a second search query using the one or more retrieved facet values to determine a count of documents that satisfy the search criteria and that include the one or more facet values. The system selects a portion of the facet values for transmission to the user, and displays on a user device the information relating to the members, the one or more facet values, and the counts for the one or more facet values.

Abstract: In some embodiments, a rewritten search query is received. The rewritten search query can comprise a first flexible operator being applied to a term, a first condition, a first satisfaction target indicating a minimum amount of search results for the first flexible operator that are to satisfy the first condition, a second condition, and a second satisfaction target indicating a minimum amount of search results for the first flexible operator that are to satisfy the second condition. Search results for the first flexible operator can be determined from a search index. A first set of documents from the search index can be determined to be part of the search results for the first flexible operator based on the first set of documents satisfying the first condition without requiring the first set of documents to satisfy the second condition until a skip number for the second condition has been reached.

Abstract: A first user of a presentation machine may be a recruiter that initiates an action in reference to a first user profile. The first user profile may describe a first candidate for a job. The presentation machine may identify the first user profile and determine a similarity score that indicates a degree of similarity between the first user profile and a second user profile that describes a second candidate for the job. The presentation machine may also access a volatility score that indicates a likelihood that the second candidate is receptive to a proposal that the second candidate be employed by an employer. Based on the similarity score and on the volatility score, the presentation machine may determine a rank of the second user profile. Based on the determined rank, the presentation machine may present the second user profile to the first user.