Yahoo! Inc.

Tintri by Ddn, Inc.

Tintri Inc.

Marco J Zagha

Fuchun Peng

Yumao Lu

Nawaaz Ahmed

Arkady Borkovsky

Chad Carson

Brandon W Salmon

Sumedh V Sakdeo

Olivier F Lecomte

Rosie Jones

Charles C Carson, Jr

Benjamin Rey

Bradley G Fowlow

Michael Alexander Chowla

Kevin A Epstein

Devika Chawia

James B Harvey

Matvey Nemenman

Mohit Sabharwal

Recovery of an in-memory state in a log-structured filesystem using fuzzy checkpoints is disclosed, including: determining a portion of a data structure to checkpoint to a storage unit, wherein the structure is associated with a set of references to locations in persistent storage at which metadata is stored, wherein the portion of the data structure is dynamically determined based at least in part on a size of the data structure and a predetermined number of storage units to be associated with a checkpoint window, wherein the number of storage units to be associated with the checkpoint window is fewer than a total number of storage units associated with the persistent storage; and checkpointing the portion of the data structure to the storage unit.

Recovery of in-memory state in a log-structured filesystem using fuzzy checkpoints

A computer-implemented method for processing user entered query data to improve results of a search of pages using a database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using probability to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.

Query processing for web search

A computer-implemented method for processing user entered query data to improve results of a search of pages using a local search database, when searching the internet, is disclosed. The method includes receiving the user entered query data and parsing each word of the query data and segmenting words using a probabilistic dictionary to determine a likelihood that the word is for a particular name. And, associating the particular names with a name tag to create one or more tagged name terms. Then, normalizing each of the tagged name terms and the normalizing including boosting information if found in the local search database and determining proximity between selected ones of the tagged name terms. The method then generates an optimized search query that incorporates normalized terms and operators. The optimized search query being applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.

Query identification and normalization for web search

Techniques for determining when and how to transform words in a query to return the most relevant search results while minimizing computational overhead are provided. A dictionary is generated based upon words used in a specified number of previous most frequent search queries and comprises lists of transformations that may include variants based upon the stems of words, synonyms, and abbreviation expansions. When a query is received from a user, candidate queries are generated based upon replacing particular words in the query with a transformation of the particular words. Candidate queries are selected that have a high probability of returning relevant results by computing values of the query using language model scoring and translation scoring. The selected candidate queries and the original query are executed to return search results. The search results are displayed to the user with the words in the original query and the transformed words in bold.

Predictive stemming for web search with statistical machine translation models

Computer-implemented methods and systems for processing user entered query data to improve results of a search of pages using a local search database are provided, when searching the internet. The method includes receiving the user entered query data and parsing each word of the query data and examining each word to determine if the word is associated with one of a business name, a city name or a state name. The examining uses probabilistic dictionaries to determine a likelihood that the word is for a particular term or intent. The method further includes normalizing each of the tagged business terms. The normalizing includes boosting information if found in the local search database and determining proximity between selected ones of the tagged terms. Then, generating an optimized internal search query that incorporates constraints and ranking based on at least the boosting information and the determined proximity between the selected tagged terms. The optimized internal search query is applied to the internet to enable search results to be produced and displayed to the user in response to the entered query data.

Local query identification and normalization for web search

The present invention is directed towards systems and methods for generating one or more related queries with respect to a given query. The method may comprise receiving a query comprising one or more terms, generating a corpus of candidate reformulations and identifying one or more queries or terms from the corpus of candidate reformulations related to the received query. One or more related queries are generated on the basis of the identified one or more queries or terms from the corpus of candidate reformulations.

System and method for generating substitutable queries on the basis of one or more features

A system is disclosed for generating a search result list in response to a search request from a searcher using a computer network. A first database is maintained that includes a first plurality of search listings. A second database is maintained that includes documents having general web content. A search request is received from the searcher. A first set of search listings is identified from the first database having documents generating a match with the search request and a second set of search listings is identified from the second database having documents generating a match with the search request. A confidence score is determined for each listing from the first set of search listings wherein the confidence score is determined in accordance with a relevance of each listing when compared to the listings of the second set of search listings. The identified search listings from the first set of search listing are ordered in accordance, at least in part, with the confidence score for each search listing.

Matching and ranking of sponsored search listings incorporating web search technology and web content

A method and apparatus for generating a list of candidate alternative spellings is provided. Among a plurality of files, a first file, which contains a link that indicates a user-entered spelling, is found. The link links to a second file. A second spelling, which is spelled similarly to, but not exactly the same as, the first spelling, is located within the second file. The second spelling is added to a list of candidate alternative spellings of the first spelling. The second spelling does not need to be contained in any result field (e.g., title, abstract, or URL) that is associated with the second file.

Suggesting an alternative to the spelling of a search query

A method and apparatus for suggesting an alternative spelling for a search query is provided. A request to search for files that match the search query is received. The alternative spelling is selected based on a set of factors. According to one aspect, the set of factors includes how frequently the alternative spelling occurs in a plurality of files. According to one aspect, the set of factors includes how frequently the alternative spelling occurs in one or more previously received requests to search for files.

A method and apparatus for accelerating and improving access to network files is provided. One technique for providing data quickly and efficiently is to send a thumbnail of a file to a user rather than sending the entire file. Another technique for providing data quickly and efficiently is to generate the difference between a current version of data and a non-current version of data, to transmit this difference to the requesting user, and to use the difference to update the non-current version of data the user currently has access to. A third technique that can be used in combination with the first two techniques is to compress data, such as the thumbnail or file difference, before transmitting this data. A fourth technique that can be used in combination with the third technique is to securely transmit the compressed data.

Growing community of inventors

Belmont, CA, United States of America

Marco J Zagha