Abstract: A method performed by one or more processing devices includes receiving, from a client device controlled by a user, a search query including one or more search terms and user information of the user; accessing, by a server device based on receipt of the search query, a private content index for indexing private content of users; wherein the private content index includes access control lists; identifying, based on a comparison of the access control lists to the user information received, private content that is accessible to the user; identifying private content that is responsive to the one or more search terms and that is accessible to the user; identifying, based on a search of public content by the server device, public content that is responsive to the one or more search terms; and sending, to the client device, search results for the identified private and public content.

Abstract: Systems, methods, computer-readable media and other embodiments are provided for automatically determining a language of a document from a set of candidate languages. In one embodiment, a system includes a logic for setting an assumption value associated with each of the languages of the set of candidate languages where the assumption value indicates that the document is not in the language. A language analyzer determines the language and generates an output that indicates that the document is one language of the candidate languages when the assumption value for the one language passes a threshold value.

Abstract: Systems, methods, media, and other embodiments associated with (non)contiguous n-gram based spell correction are described. One exemplary system embodiment includes logic for creating contiguous and non-contiguous trigrams, logic for creating an inverted index relating trigrams and the words from which they were generated, and logic for comparing trigrams associated with a word to spell check to trigrams associated with the words selected using the inverted index.

Abstract: Systems, methods, media, and other embodiments associated with ranking documents by providing a search engine with a series of sub-queries generated from an original query are described. One example system includes input logic for receiving a query. The example system may include a relaxation logic configured to produce sub-queries from the query. The sub-queries may describe metadata string matching, content string matching, and/or metadata numerical attribute analysis. The sub-queries may be provided by an output logic to a search engine in an order that facilitates defining document relevance without requiring post-retrieval relevance ranking.

Abstract: Systems, methods, media, and other embodiments associated with ranking documents by providing a search engine with a series of sub-queries generated from an original query are described. One example system includes input logic for receiving a query. The example system may include a relaxation logic configured to produce sub-queries from the query. The sub-queries may describe metadata string matching, content string matching, and/or metadata numerical attribute analysis. The sub-queries may be provided by an output logic to a search engine in an order that facilitates defining document relevance without requiring post-retrieval relevance ranking.

Abstract: Systems, methods, media, and other embodiments associated with (non)contiguous n-gram based spell correction are described. One exemplary system embodiment includes logic for creating contiguous and non-contiguous trigrams, logic for creating an inverted index relating trigrams and the words from which they were generated, and logic for comparing trigrams associated with a word to spell check to trigrams associated with the words selected using the inverted index.

Abstract: An efficient information search mechanism provides control over the relaxation of a search query to users that are requesting searches. Through such a mechanism, a user can specify a sequence of sub-queries that is associated with variations of the main search criteria, and specify a progression in which to execute the sub-queries. Hence, users can impart their priorities with respect to search term variations used in relaxing the main search criteria, which further allows the users to impart their notion of the relevance of results that may be returned by particular sub-queries. A query that includes a sequence of sub-queries is received and the sub-queries are executed, if at all, by a database server in an order based on the progression specified by the user. Response time and network loading are improved through reduction of unnecessary work by the database server and through reduction of computationally costly communications between client and server and associated processing.

Abstract: Systems, methods, computer-readable media and other embodiments are provided for automatically determining a language of a document from a set of candidate languages. In one embodiment, a system includes a logic for setting an assumption value associated with each of the languages of the set of candidate languages where the assumption value indicates that the document is not in the language. A language analyzer determines the language and generates an output that indicates that the document is one language of the candidate languages when the assumption value for the one language passes a threshold value.

Abstract: A system and method for determining the language of an unknown document is provided. For a set of candidate languages, a negative assumption is set for each candidate language that the document is not that language and the system attempts to prove the negative assumption is wrong. If the negative assumption fails for one language, then the document is identified as being in that language. The present system and method provides a higher degree of accuracy when determining the language of a document.

Abstract: Example, systems, methods, computer media, and other embodiments for determining relevance rankings for pages identified in a search query is provided. In one example, a computer program product can be configured to identify a candidate set of pages in response to a search query. A content-based relevance rank can be determined for at least one page of the candidate set of pages based on a content of the at least one page. The content-based relevance rank can be adjusted for one or more selected pages from the candidate set of pages by distributing a relevance rank from one or more pages that point to the one or more selected pages.

Abstract: A method and system for determining relevance rankings for pages identified in a search query is provided. In response to the search query, an information retrieval system identifies candidate pages/documents from a network that potentially match the search query. A relevance ranking system determines a relevance value for each of candidate pages so that the most relevant pages are displayed to a user. The relevance value is based on a combination of content-based relevance values of the pages and link values determined from a link structure of the pages. A link value is a function of a probability that a user will follow the link as compared to following all other links. With the present invention, improved relevance rankings are obtained for a candidate set of pages.

Abstract: A database management system and method provides access to a data table having structured data and unstructured data. A user interface allows a user to issue instructions to the database management system such as to build an index based on the structured and unstructured data and to search the data table. An indexing logic generates an index structure by combining the structured and unstructured data. With this index structure, a single query can contain search conditions from both the structured data and the unstructured data. In this manner, efficiency for searching the data table for combined structured and unstructured conditions is improved.

Abstract: A method and system for optimizing response time for data query rankings and retrieval is provided. In response to a received search query that contains one or more terms, an information retrieval system identifies a candidate set of documents that match any of the terms. Terms are assigned a term weight making them more or less relevant in relation to other terms. A ranking logic defines score bins from a total score range based on possible matched term weights. A relationship is established that classifies a document into a score bin based on a sum of term weights from matched terms. Documents that match more term weights have higher total relevance scores than documents that match less term weights. The most relevant documents are retrievable without having to retrieve the entire set of candidate documents and without having to compute total relevance scores for all the candidate documents.

Abstract: An efficient information search mechanism provides control over the relaxation of a search query to users that are requesting searches. Through such a mechanism, a user can specify a sequence of sub-queries that is associated with variations of the main search criteria, and specify a progression in which to execute the sub-queries. Hence, users can impart their priorities with respect to search term variations used in relaxing the main search criteria, which further allows the users to impart their notion of the relevance of results that may be returned by particular sub-queries. A query that includes a sequence of sub-queries is received and the sub-queries are executed, if at all, by a database server in an order based on the progression specified by the user. Response time and network loading are improved through reduction of unnecessary work by the database server and through reduction of computationally costly communications between client and server and associated processing.

Abstract: A method and system for determining relevance rankings for pages identified in a search query is provided. In response to the search query, an information retrieval system identifies candidate pages/documents from a network that potentially match the search query. A relevance ranking system determines a relevance value for each of candidate pages so that the most relevant pages are displayed to a user. The relevance value is based on a combination of content-based relevance values of the pages and link values determined from a link structure of the pages. A link value is a function of a probability that a user will follow the link as compared to following all other links. With the present invention, improved relevance rankings are obtained for a candidate set of pages.

Abstract: A database management system and method provides access to a data table having structured data and unstructured data. A user interface allows a user to issue instructions to the database management system such as to build an index based on the structured and unstructured data and to search the data table. An indexing logic generates an index structure by combining the structured and unstructured data. With this index structure, a single query can contain search conditions from both the structured data and the unstructured data. In this manner, efficiency for searching the data table for combined structured and unstructured conditions is improved.

Abstract: A method and system for optimizing response time for data query rankings and retrieval is provided. In response to a received search query that contains one or more terms, an information retrieval system identifies a candidate set of documents that match any of the terms. Each term is assigned a term weight making it more or less relevant in relation to the other terms. A ranking logic defines score bins from a total score range based on possible matched term weights. A relationship is established that classifies a document into a specific score bin based on a sum of term weights from matched terms. In this manner, documents that match more term weights are guaranteed to have higher total relevance scores than documents that match less term weights. As a result, the most relevant documents are retrievable without having to retrieve the entire set of candidate documents and without having to compute total relevance scores for all the candidate documents.

Abstract: A system and method for determining the language of an unknown document is provided. For a set of candidate languages, a negative assumption is set for each candidate language that the document is not that language and the system attempts to prove the negative assumption is wrong. If the negative assumption fails for one language, then the document is identified as being in that language. The present system and method provides a higher degree of accuracy when determining the language of a document.