Microsoft Technology Licensing, LLC

Nimish S Khanolkar

Tapas Kumar Nayak

Srikumar Rangarajan

Aleksandras Surna

Erik Ismert

Cesar Alejandro Galindo-Legaria

Mostafa Elhemali

Yavor Vesselinov Angelov

Pawel Terlecki

Pooja N Darera

Jingwei Lu

Feng Tian

Denis Churin

Mihai Popescu-Stanesti

Sundaram Narayanan

Andrew B Cencini

A query is received. The query comprises a plural number of efficiency expressions. A key is generated for the query indicating a first selectivity region in multi-dimensional selectivity space comprising an array of selectivity regions arranged according to a grid with a number of dimensions equal to the plural number. The generated key is used to look up a stored query plan among a plurality of stored query plans. A stored query plan is executed for the query that is associated with a stored key determined to match the generated key.

Database system for executing parameter-sensitive query

A data normalization system is described herein that represents multiple data types that are common within database systems in a normalized form that can be processed uniformly to achieve faster processing of data on superscalar CPU architectures. The data normalization system includes changes to internal data representations of a database system as well as functional processing changes that leverage normalized internal data representations for a high density of independently executable CPU instructions. Because most data in a database is small, a majority of data can be represented by the normalized format. Thus, the data normalization system allows for fast superscalar processing in a database system in a variety of common cases, while maintaining compatibility with existing data sets.

Normalizing data for fast superscalar processing

A query configured according to a query template is received. The query includes values for a plurality of parameters. A key is generated for the query that indicates a selectivity region in a selectivity space determined for the included parameter values. Whether the generated key matches any key of a plurality of keys is determined. Each key of the plurality of keys is associated with a corresponding query plan. If the generated key is determined to not match any of the keys, the query is compiled to generate a new query plan, and the generated query plan is executed with respect to the query. If the key is determined to match any key of the plurality of keys, a query plan associated with the matched key is selected, and the query plan associated with the matched key is executed with respect to the query.

Parameter-sensitive plans

The present invention relates to an integrated full-text search architecture that integrates full text search with database server applications in a tight manner so that it becomes part of the server in all aspects including storage, metadata, query processing, back/up restore and resource management. This provides improved performance with respect to queries as well as improved manageability. Furthermore, the subject architecture is open and schema directed unlike other conventional full-text search architectures. Accordingly, the full-text search architecture enables expert users (e.g., search providers) to define their own index structures as well as ranking algorithms.

Integrated full text search system and method

Detailed herein is a technology which, among other things, allows a search engine to utilize a user-defined relevance function. In one approach to the technology, a method of applying a user-defined relevance function is described. In this approach, a complex search query is decomposed into a simple operator. The simple operator is associated with the user-defined relevance function. A document which matches the search query is retrieved, and a rank is calculated for the document, using the user-defined relevance function.

User-defined relevance ranking for search

The subject invention pertains to database reverse query matching. A text document can be received and analyzed to determine which, if any, queries the document matches. To enable such functionality, a number of intermediate structures such as tables are generated in accordance with designated queries. In particular, a canonical table can be generated that specifies the expressions or phrases as well as match rules. Furthermore, a Boolean table can be generated that specifies the Boolean relationship of expressions in canonical table. A match component or methodology can match text phrases to query phrases identified by the canonical table. An evaluation component or related methodology can subsequently utilize the Boolean table to determine if the preliminary phrase matches match the query logic.

Database reverse query matching

Consistency between the components used to generate and query a full-text index is determined and if a mismatch is detected, an error may be surfaced. A structure including information associated with each component used to build an index is programmatically compared with currently available components. The structure may be interrogated to enumerate the resources bound to a particular index. The enumeration of bound resources facilitates determination of what indexes (if any) must be regenerated for consistency as a result of a component upgrade or a move to another system.

Growing community of inventors

Redmond, WA, United States of America

Nimish S Khanolkar