Aleksey V Tsingauz

7805456, Sep 28, 2010

Feb 5, 2007

11/671414

Henricus Johannes Maria Meijer - Mercer Island WA, US
Amanda K. Silver - Seattle WA, US
Eugueni Zabokritski - Redmond WA, US
Aleksey V. Tsingauz - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 7/00

707759, 707760

The claimed subject matter relates to a formalization of operator patterns that can facilitate type flow of element types between an operator in a first clause of an expression to an operator in a next clause of the expression. The type that flows to, and the operator extant in, the next clause can be combined to infer the element type of the next clause. As such, type-checking, autocompletion and other advantageous features can be accomplished incrementally without the need for a prior full translation of the expression.

7865533, Jan 4, 2011

Feb 5, 2007

11/671417

Henricus Johannes Maria Meijer - Mercer Island WA, US
Amanda K. Silver - Seattle WA, US
Eugueni Zabokritski - Redmond WA, US
Aleksey V. Tsingauz - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 7/00

707804, 707805, 707807, 707899, 71109, 71110, 71113, 71136

The claimed subject matter relates to an architecture that can facilitate query comprehension that are constructed in a compositional manner. In accordance therewith, the query comprehensions can be assembled together in virtually in order without common requirements that force query operators of a query expression to follow ordering/syntactic rules. In addition, the architecture can provide for query expressions that arbitrarily composable and which can be terminated at any point. If the query expression terminates without a Select or Return clause at the end, the architecture can facilitate generation of an implicit Select or Return, and output results.

8201155, Jun 12, 2012

Jan 9, 2009

12/351514

Avner Y. Aharoni - Seattle WA, US
Samuel Y. Ng - Bellevue WA, US
Michael Shneerson - Redmond WA, US
Edward T. Maurer - Bellevue WA, US
Raja Krishnaswamy - Redmond WA, US
Kevin Halverson - Seattle WA, US
Timothy Y. Ng - Bellevue WA, US
Aleksey V. Tsingauz - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 9/45

717140, 707821, 717147

User assemblies can be created by a compiler that can handle more than one type definition during execution. Local copies are created for respective authoritative types in a code library, and the local copies are marked with a local type identifier. An authoritative type identifier (e. g. , a globally unique identifier (GUID)) is copied from the authoritative type to the local type, and functions and properties associated with the local type are also copied from the authoritative type. Authoritative types are resolved for requested types when a local assembly references a local type from a compiled user assembly. The local type can be identified by a local type identifier, and an authoritative type can be retrieved from the code library that has a same authoritative type identifier as the requested type. A local copy of the retrieved authoritative type can be copied to the local assembly under compilation. The compiler can then emit user assemblies that comprise merely local types.

8479178, Jul 2, 2013

Jun 27, 2008

12/163763

Avner Y. Aharoni - Seattle WA, US
Henricus Johannes Maria Meijer - Mercer Island WA, US
Timothy Yat Tim Ng - Bellevue WA, US
Amanda K. Silver - Seattle WA, US
Scott Daniel Wisniewski - Mercer Island WA, US
Kevin Wagner Halverson - Seattle WA, US
David N. Schach - Redmond WA, US
Aleksey V. Tsingauz - Seattle WA, US
Paul A. Vick - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 9/45
G06F 9/445

717148, 718 1

A batch compiler is employed to enable compilation of code provided at runtime. A managed application receives code during execution and invokes the compiler to transform the code to enable it to execute within the context of the receiving application. Among other things, employment of a batch compiler preserves investments made to such compilers while also opening up new scenarios in application scripting and/or hosting that are otherwise unavailable.

20080133492, Jun 5, 2008

Nov 30, 2006

11/565469

Henricus Johannes Maria Meijer - Mercer Island WA, US
Amanda Silver - Seattle WA, US
Paul A. Vick - Seattle WA, US
Evgueni Zabokritski - Redmond WA, US
Aleksey Tsingauz - Seattle WA, US

MICROSOFT CORPORATION - Redmond WA

G06F 17/30

707 4, 707E17015

A query language system is provided that includes a query component that specifies operations for one or more items in a data set. An aggregator component identifies one or more keys associated with the data set, the keys are supplied to one or more aggregators that perform direct computations from the keys in order to determine at least one aggregated value for the data set.

20090144229, Jun 4, 2009

Nov 30, 2007

11/948078

Henricus Johannes Maria Meijer - Mercer Island WA, US
Amanda K. Silver - Seattle WA, US
Paul A. Vick - Seattle WA, US
Aleksey V. Tsingauz - Seattle WA, US

MICROSOFT CORPORATION - Redmond WA

G06F 7/06

707 2, 707E17017

Systems and methods that optimize query translations at compile time in LINQ languages. An optimization component optimizes algebraic trees and rewrites an expression composed from sequence operators into a more efficient expression(s). A compiler associated with the optimization component can receive syntax (e.g., query comprehensions, query expressions) to turn into standard sequence operators that can operate on arbitrary collections. The compiler can then perform transformations on the algebraic trees, such as push filter conditions upwards or downwards and/or to combine filter conditions.

20110167088, Jul 7, 2011

Jan 7, 2010

12/683445

Matthew J. Warren - Redmond WA, US
Avner Y. Aharoni - Seattle WA, US
Mads Torgersen - Issaquah WA, US
Renaud Paquay - Redmond WA, US
Neal M. Gafter - San Jose CA, US
Jared Parsons - Seattle WA, US
David N. Schach - Redmond WA, US
Aleksey V. Tsingauz - Seattle WA, US
Peter Golde - Bellevue WA, US
Kevin Pilch-Bisson - Snohomish WA, US
Karen Liu - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707781, 707E17005, 707E17012, 707797, 707813, 707E17002

Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.

20200183667, Jun 11, 2020

Feb 17, 2020

16/792706

- Redmond WA, US
Avner Y. Aharoni - Seattle WA, US
Mads Torgersen - Issaquah WA, US
Renaud Paquay - Redmond WA, US
Neal M. Gafter - San Jose CA, US
Jared Parsons - Seattle WA, US
David N. Schach - Redmond WA, US
Aleksey V. Tsingauz - Seattle WA, US
Peter Golde - Bellevue WA, US
Kevin Pilch-Bisson - Snohomish WA, US
Karen Liu - Bellevue WA, US

G06F 8/41
G06F 16/22

Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.