Bruno H Denuit

20030101194, May 29, 2003

Nov 1, 2001

10/001289

Michael Rys - Sammamish WA, US
Chris Suver - Seattle WA, US
Bruno Denuit - Bellevue WA, US
Srinivasa Burugapalli - Sammamish WA, US
Murray Low - Santa Cruz CA, US

G06F007/00

707/101000

Users and programmers can load semi-structured hierarchical data, such as XML data, of arbitrary size and structure into relational database tables using an schema such as an SQL-annotated XML schema. The schema describes how XML data maps into base tables and fields, including complex one-to-many and many-to-many relationships. The hierarchical data is streamed into the relational database tables in a single operation.

20050177551, Aug 11, 2005

Dec 30, 2004

11/027416

Balaji Rathakrishnan - Sammamish WA, US
Beysim Sezgin - Redmond WA, US
Denis Altudov - Redmond WA, US
Jose Blakeley - Redmond WA, US
Oliver 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 Denuit - Bellevue WA, US
Conor Cunningham - Redmond WA, US
Stefano Stefani - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F017/30

707002000

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.

20060015490, Jan 19, 2006

Jul 14, 2004

10/891220

Bruno Denuit - Bellevue WA, US
Stefano Stefani - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707004000

Pursuant to receipt of a data modification command or statement, such as an Update command, it is determined which fields in a data structure, such as a UDT, computed column, indexed view, or index, for example, will be changed as a result of the command. Only those fields that are affected by the command will be changed. Thus, changes are propagated to only to those dependent data structures whose content is being modified. Tree representations are used to facilitate the determination as to whether a subfield in a hierarchy is changed.

20060259465, Nov 16, 2006

May 10, 2005

11/126034

Bruno Denuit - Bellevue WA, US
Eugene Zabokritski - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707003000

Methods and computer-readable media for binding a query containing one or more multi-part identifiers in a database. An attempt is made to bind a multi-part identifier that has at least one part to any data in a database that corresponds to the part. A score that is proportional to the number of parts that bind successfully in each multi-part identifier binding attempt is generated for each unsuccessful binding attempt. A result is outputted if one successful identifier binding occurred, while a first error message is outputted if more than one successful binding occurred. A second error message corresponding to the multi-part identifier binding attempt having a highest score is outputted if no successful bindings occurred.

20100281018, Nov 4, 2010

Jul 15, 2010

12/836993

Bruno H.M. Denuit - Bellevue WA, US
Stefano Stefani - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707718, 707759, 707E17131, 707E17132

Pursuant to receipt of a data modification command or statement, such as an Update command, it is determined which fields in a data structure, such as a UDT, computed column, indexed view, or index, for example, will be changed as a result of the command. Only those fields that are affected by the command will be changed. Thus, changes are propagated to only to those dependent data structures whose content is being modified. Tree representations are used to facilitate the determination as to whether a subfield in a hierarchy is changed.

20110178984, Jul 21, 2011

Jan 18, 2010

12/688921

Tomas Talius - Sammamish WA, US
Bruno H.M. Denuit - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/00
G06F 12/00

707634, 707682, 707812, 707620, 707E17005, 707E17044, 707E17045

Database management architecture for recovering from failures by building additional replicas and catching up replicas after a failure. A replica includes both the schema and the associated data. Modifications are captured, as performed by a primary replica (after the modifications have been performed), and sent asynchronously to secondary replicas. Acknowledgement by a quorum of the replicas (e.g., primary, secondaries) at transaction commit time is then awaited, and desired to be obtained. The logging of changes for recovery from failures is implemented, as well as online copying (e.g., accepting modifications during the copy) of the data when replica catch-up is not possible. Modifications can be sent asynchronously to the secondary replicas and in parallel.

20110191299, Aug 4, 2011

Feb 1, 2010

12/697302

Hanh Huynh Huu - Redmond WA, US
Zhongwei Wu - Sammamish WA, US
Oliver N. Seeliger - Sammamish WA, US
Shankar Pal - Redmond WA, US
Christian Rober - Seattle WA, US
Bruno H.M. Denuit - Redmond WA, US
Lev Novik - Bellevue WA, US
Nigel R. Ellis - Redmond WA, US
Tomas Talius - Sammamish WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707646, 707648, 707E17005, 707E17032, 707E17014

Architecture that eliminates the need for on-disk full backups of data retaining only changes that have occurred, in a separate table. Thus, the architecture provides for incremental recovery of incremental changes in a relational database (e.g., SQL). The architecture provides improved recovery time and recovery point objectives. By using the incremental capture of changed data (e.g., in an XML format), the capability is provided to capture schema changes, query the incremental change data and efficiently restore user data to an earlier point-in-time state. Changes (e.g., insert, update and delete operations) are tracked (e.g., continuously) by a set of triggers and the incrementally captured changed rows are inserted in a data capture table (a differential change “delta” table) in a human-readable format (e.g., XML). Rollback is also provided.

20110225122, Sep 15, 2011

Mar 15, 2010

12/723696

Bruno H.M. Denuit - Redmond WA, US
Tomas Talius - Sammamish WA, US

MICROSOFT CORPORATION - Redmond WA

G06F 17/30

707634, 707637, 707E17005, 707E17007, 707E17032

Architecture that provides the capability to automatically (e.g., dynamically) reorganize (repartition) an existing partition by dividing (splitting) or recombining (merging) logical databases. This reorganization can be performed to logical databases belonging to the same customer, and based on the partitioning of the tables in these databases. This can include not only splitting secondary replicas of a partition or merging secondary replicas of the partition, but also splitting off secondary replicas of the partition to create a new partition and merging two partitions into one partition. Moreover, these operations can occur while the logical databases are accepting workload (online).