Microsoft Technology Licensing, LLC

Adrian Sorin Baras

Istvan Cseri

Michael Rys

Oliver Nicholas Seeliger

Peter Kukol

Torsten Walther Grabs

Cesar Alejandro Galindo-Legaria

Shankar Pal

Erik Ismert

Wei Yu

Raul Garcia

Gideon Schaller

Denis Churin

Craig Alan Gick

Jiazhen Wu

Systems and methods that extend static typing rules/algorithms of the World Wide Web Consortium (W3C) rules, with a more precise static typing algorithm that supplies knowledge for types occurring in the Lax validation section. The Lax validation can be identified, and associated expressions known with particularity, wherein types can be inferred for XQuery expressions that navigate down into the Lax validation section. An annotation component annotates elements (e.g., wild card sections) with additional information about wild card sections, and a mapping component maps Lax wild cards to type systems.

Static typing of xquery expressions in lax validation content

Systems and methods that incorporate fuzzing capabilities within an SQL server to facilitate penetration testing. A fuzzing component associated with the SQL server provides an entry point for accessing the fuzzing system to update explicit user specified parameters associated with SQL, wherein the server's in depth knowledge regarding semantics of the language code (e.g., manner of parsing) can be employed to determine vulnerabilities thereof.

Fuzzing system and method for exhaustive security fuzzing within an SQL server

When two or more scalar subtrees in an execution plan are directed towards the same data set, but request different data from the data set, the two subtrees are replaced in the execution plan with a new subtree which queries the data set only once. This new query to the data set covers all data required by the different subtrees. A pivoting step then is used to separate the data which would have been sought by each subtree. The pivoting step also yields data in the same form as would have resulted from the original subtrees.

Relational database scalar subquery optimization

An improved type inference may be calculated for a path expression that may be classified into a series of input expressions followed by steps. For each such series, the inference may be calculated based on input including a type for the input expression, an axis for the step, and a node test for the step. The cardinality of the input expression type is preserved for the calculation of the step type. Also, a set of one or more matching node types may be identified within the type repository. These matching node types are node types within the axis of the step that match the node test of the step. These matching node types are identified without calculating the full content type implied by the axis. Avoiding the calculation of the full content type of the axis may reduce the processing time required to perform the inference.

System and method for an improved type inference

An extensible markup language (XML) expression included in a query is parsed to yield an abstract syntax tree. The abstract syntax tree is then transformed into a unified tree including XML algebra operations. The unified tree is then converted into a relational tree including enhanced relational algebra operations. The relational tree is then forwarded to a query processor for optimization and execution of the query at the query processor.

System and method for compiling an extensible markup language based query

Growing community of inventors

Redmond, WA, United States of America

Adrian Sorin Baras