Microsoft Technology Licensing, LLC

Christopher Walter Anderson

Harish Jayanti

Ajay Nair

Stelios Paparizos

Alexandros Ntoulas

Wei Liu

Naga Srinivas Vemuri

Trishul A Chilimbi

Michael Joseph Hopcroft

Karthik Kalyanaraman

Knut Magne Risvik

Paul J Miller

Edward David Harris

Henry Setiawan

Ravi Aringunram

Vishal Singh

A preliminary segment root and a final segment root are selected for each segment. Each time a search query is received, a set of nodes in each segment that will be used to resolve the search query is identified. A preliminary segment root is selected from the set of nodes. Based on statistical data from each node in the set of nodes indicating each node's capability to act as a final segment root that assembles query-execution data, the preliminary segment root algorithmically selects the final segment root. The other nodes in the set of nodes are notified regarding the identity of the final segment root.

Dynamic query master agent for query execution

Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars include a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.

Grammar compression

Compression of extensive, rule-based grammars used to facilitate search queries is provided herein. Rule-based grammars includes a list of rules that each comprise a sequence of token classes. Each token class is a logical grouping of tokens, and each token is a string of characters. A grammar is parsed to identify rules and token classes. Unimportant token classes are identified and sets of unimportant token classes are merged to generated merged token classes. A compressed grammar is generated by substituting the merged token classes into the grammar for corresponding unimportant token classes used to generate the merged token classes.

Methods are described for utilizing user-submitted data to provide a response to a query request. User-submitted data are received and referenced upon receiving a query request from an unregistered requester, a potential response is automatically identified from the user-submitted data, the potential response is extracted, and presented in response to the query request.

Presenting instant answers to internet queries

A full text indexing system is provided for processing content associated with data applications such as encyclopedia and dictionary applications. A build process collects data from various sources, processes the data into constituent parts, including alternative word sets, and stores the constituent parts in structured database tables. A run-time process is used to query the database tables and the results in order to provide effective matches in an efficient manner. Run-time processing is optimized by preprocessing all steps that are query-independent during the build process. A double word table representing all possible word pair combinations for each index entry and an alternative word table are used to further optimize runtime processing.

Content data indexing and result ranking

Content data indexing with content associations

A full text indexing system is provided for processing content associated with data applications such as encyclopedia and dictionary applications. A build process collects data from various sources, processes the data into constituent parts, including alternative word sets, and stores the constituent parts in structured database tables. A run-time process is used to query the database tables and the results in order to provide effective matches in an efficient manner. Run-time processing is optimized by preprocessing all steps that are query-independent during the build process. A double word table representing all possible word pair combinations for each index entry and an alternative word table are used to further optimize run-time processing.

Content data indexing

Prestructuring disparate content data types prior to receiving any access requests to provide fast retrieval, assembly, and delivery of content data. Source content data are obtained from a source data structure that is readily created and editable by an author who does not have programming skills. The source content data are transformed into a predefined output structure that enables efficient access to the content data over a network. Predefined classes and entities of metadata indicate subsets of the content data that are deliverable and indicate relationships between elements of the content data. The content data and controlling metadata are preformatted for display and stored in fields of the output structure. The content data are also cross referenced by a plurality of categories within various areas of interest to create a hierarchical structure of interrelationships that is stored in the output structure, enabling a user to browse through related content data.

Growing community of inventors

Redmond, WA, United States of America

Christopher Walter Anderson