Shankar Pal - Redmond WA, US Istvan Cseri - Redmond WA, US Oliver Seeliger - Sammamish WA, US Gideon Schaller - Bellevue WA, US Adrian Baras - Redmond WA, US Wei Yu - Issaquah WA, US Denis Churin - Sammamish WA, US Peter Kukol - Scottsdale AZ, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/30 G06F 7/00
US Classification:
707 3, 707 1, 707 2, 707100, 707101, 707102
Abstract:
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.
Systems And Methods For The Implementation Of Unordered And Ordered Collections In A Data Store
Balaji Rathakrishnan - Sammamish WA, US Beysim Sezgin - Redmond WA, US Denis Y. Altudov - Redmond WA, US Jose A. Blakeley - Redmond WA, US Oliver Nicholas Seeliger - Sammamish WA, US Ramachandran Venkatesh - Bellevue WA, US Wei Yu - Issaquah WA, US Dragan Tomic - Redmond WA, US Denis Churin - Bellevue WA, US Bruno H. M. Denuit - Bellevue WA, US Conor J. Cunningham - Redmond WA, US Stefano Stefani - Seattle WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 17/00
US Classification:
707100, 707 4, 707200, 717108
Abstract:
Several embodiments of the present invention are directed to systems and methods for extending the UDT framework of an extended relational data store (ERDS) to include support for unordered collections (multisets) and ordered collection (lists). More specifically, several embodiments of the present invention use an UDT infrastructure, CLR generics, and a new UNNEST operator to create and utilize a special type abstraction for collections that is simultaneously a scalar and a relation. As a scalar, this collection type can be processed by all parts of the data store engine that understand scalars (including but not limited to the client stack) and, as a relation, this collection type is queriable like any other type of relation.
System And Method For Forcing A Query Execution Plan
Cesar Galindo-Legaria - Redmond WA, US Ganapathy Krishnamoorthy - Issaquah WA, US Eric N. Hanson - Bellevue WA, US Wei Yu - Issaquah WA, US Milind Joshi - Redmond WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00
US Classification:
707 2, 707 3
Abstract:
A suggested query execution plan is used as a constraint on a guided optimization process such that all execution plans that do not conform to the suggested execution plan are eliminated as possible alternatives. If the guided optimization process successfully generates a resulting execution plan, then the result will conform to the suggested execution plan. If the guided optimization process fails to generate a resulting execution plan, then it may be determined that the suggested execution plan is invalid.
Systems And Methods For Supporting Inheritance For User-Defined Types
Beysim Sezgin - Redmond WA, US Denis Y. Altudov - Redmond WA, US Jose A. Blakeley - Bothell WA, US Ramachandran Venkatesh - Bellevue WA, US Wei Yu - Issaquah WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00 G06F 17/00
US Classification:
707100, 707 4, 717106, 717108
Abstract:
Various embodiments of the present invention are directed to a database with an extensible type system for at least one user-defined type that comprises information for describing its structure as well as information for describing an inheritance relationship between itself and another user-defined type (either a subtype or a supertype/base type). For certain embodiments, the user-defined type is defined in something other than Sequential Query Language (SQL) statement such as, for example, a Common Language Runtime (CLR) statement, a statement in C, C++, and C# (“C-sharp”), and/or a visual basic statement. In any event, several embodiments are further directed to a system wherein the database is aware of the inheritance relationship between two user-defined types by an explicit registration of the user-defined types with said database.
Wei Hung Yu - Irvine CA, US Connie Wang - Irvine CA, US
International Classification:
F21V 33/00
US Classification:
362102, 362 96, 362101, 362318, 362577
Abstract:
This invention is a light baton for use in aquatic games, comprising a translucent baton body, end inserts at both ends of the baton body, an end insert connected to an inserted light-emitting module, holes in the translucent baton body, and arcuate convex protuberances on the outer surface of the translucent baton body; the holes in the translucent baton body allow water to flow in and surround the light-emitting module, with the change in air and water density causing the baton to sink in water, while the liquid has a refractive effect on the colorful lights from the light-emitting module; the colorful beams of light pass through and are refracted by the ripples in the liquid within the baton body to produce illumination, making the baton ideal for having fun in water.
Dragan Tomic - Redmond WA, US Shankar Pal - Redmond WA, US Gideon Schaller - Killara, AU Istvan Cseri - Redmond WA, US Wei Yu - Issaquah WA, US
Assignee:
Microsoft Corporation - Redmond WA
International Classification:
G06F 7/00 G06F 17/00
US Classification:
707690, 707803
Abstract:
Modifying a portion of an XML document stored in a relational database includes converting operations on the document into an operator tree. The operator tree includes a first operator corresponding to a first portion of the schema for the modified data and a second operator corresponding to a parent portion of the schema for the modified data. A first and a second portion of the schema are extracted from the overall document schema. A first validation of the modified data using the first operator with the first portion of the schema is performed. This forms a partially validated XML document portion. Next, a second validation of the partially validated XML document portion with the second portion of the schema is performed using the second operator. The XML document constraints are verified and the modified data is merged into the XML document, thus avoiding a full validation of the XML document when certain XML Schema types are absent in the modified data.
A two-phase process quickly and accurately identifies representations of the same items within a collection of item representations. In the first phase, referred to as a “blocking phase,” frequency information indicating the frequency with which terms appear within the collection of item representations is used to quickly identify “candidate pairs” (i. e. , pairs of item representations that have a relatively high probability of matching). The blocking phase results in a reduced subset of the data for further analysis during the second phase. In the second phase, referred to as a “matching phase,” the candidate pairs are analyzed using fuzzy matching functions to accurately identify “matching pairs” (i. e. , representations of the same items).
The present invention relates to a straw cup with variable lights, primarily comprising of a set of light-emitting diodes surrounding the inside of the cup's straw, a circuit controller board, and power switch; when the power is activated, the liquid inside the straw's cup refracts and directs light, increasing the variation and brilliance of the twinkling lights and thus further increasing the variation of the straw cup's multicolored lights.
Massachusetts Institute of Technology - Research Assistant (2011)
Education:
Massachusetts Institute of Technology - Materials Science & Engineering, University of Science and Technology of China - Materials Science & Engineering