Brad M Olenick, Age 5412135 NE 106Th Pl, Kirkland, WA 98033

7680935, Mar 16, 2010

Sep 30, 2004

10/955693

Clemens A. Szyperski - Redmond WA, US
Brad M. Olenick - Redmond WA, US
Balasubramanian Shyamsundar - Redmond WA, US
Arshad F. Ahmad - Bellevue WA, US
Arthur H. Watson - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 9/44

709226, 709223, 709229, 709204, 709218, 717120, 717100, 717136, 717114, 717116

Strategies are described for organizing the runtime components of an application into an entity domain framework. The entity domain framework includes one or more entity domains arranged in a hierarchical fashion. Each entity domain further groups one or more components together in a hierarchical fashion. Each entity domain can include one or more services that provide a policy to the components within the entity domain. Composite functionality couples the framework together, and further provides a bus-like mechanism whereby an entity can forward service requests up through the hierarchy until a domain is found that satisfies the requests. Exemplary services provided by the entity domain framework include lifetime management services, error handling services, and so forth. The hierarchical structure provides an efficient way of exposing functionality to groups of components that will share this functionality in a common context, without requiring costly and complex atomistic coupling of services to components or duplication of service instances.

7761586, Jul 20, 2010

Feb 6, 2006

11/348388

Brad M. Olenick - Redmond WA, US
Clemens A. Szyperski - Redmond WA, US
David George Hunt - Woodinville WA, US
Gregory Lawrence Hughes - Bellevue WA, US
William A. Manis - Sammamish WA, US
Terry Zmrhal - Kirkland WA, US

Microsoft Corporation - Redmond WA

G06F 15/16
G06F 7/00
G06F 17/30

709230, 709246, 707705, 707736, 707756, 707797, 707966

The present invention extends to methods, systems, and computer program products for accessing and manipulating data in a data flow graph. A data flow graph includes one more transforms for transforming data from one or more data stores into different formats accessible to clients. Transforms can be configured to join and split data from the same or different data stores. A metadata tree logically represents the data flow graph including locations that provide output from transforms of the data flow graph. The locations can be referenced by clients to access transformed outputs. Clients can register dependencies on data at various locations and can request evaluation of the data in response to data changes at a corresponding data store. Clients can also request data changes be propagated back through the data flow graph to one or more data stores and implemented at the one or more data stores.

7917547, Mar 29, 2011

Jun 10, 2008

12/136616

Gregory L. Hughes - Redmond WA, US
Clemens Kerer - Bellevue WA, US
Brad M. Olenick - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30

707804, 707811

The present invention extends to methods, systems, and computer program products for virtualizing objects within queries. Embodiments of the invention virtualize data access for use with queries. Virtualization can be implemented within any portion of a syntax tree. For example, data can be virtualized for a property of an object that is itself another object. Data virtualization facilitates lazy evaluation of query expressions. That is, actual property values for properties within a data construction statement are virtualized until a query specifically requests the actual property values. Further, data virtualization also conserves resources and results in more efficient query evaluations.

8275793, Sep 25, 2012

Feb 23, 2006

11/360456

Arshad F. Ahmad - Bellevue WA, US
Brad M. Olenick - Redmond WA, US
Clemens A. Szyperski - Redmond WA, US
David G. Hunt - Woodinville WA, US
Terry D. Zmrhal - Kirkland WA, US
Yuri Rychikhin - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 7/00

707792, 715234

A method and system for maintaining isolated data in an application is disclosed which data to be selectively isolated until a data client orders the changes to be committed or abandoned. A computer-readable medium for constructing an application capable of localized data isolation is also disclosed. An application specification is used to determine which data entities should be isolated, and one or more transaction transforms are implemented for each data entity to be isolated.

8280924, Oct 2, 2012

Mar 26, 2009

12/412135

Brad Mark Olenick - Redmond WA, US
Gregory Lawrence Hughes - Redmond WA, US
Siddharth Jayadevan - Seattle WA, US
Carll Bennett Hoffman - Mercer Island WA, US
Clemens Kerer - Vienna, AT

Microsoft Corporation - Redmond WA

G06F 7/00
G06F 17/30

707807, 707810

In an embodiment, a generic database application of a computer system receives a portion of input data from a database. The generic database application can communicate with the database using a variety of different database schemas. The generic database application of the computer system infers a portion of ORM metadata associated with the received input data. The computer system accesses a generic ORM query where the ORM query is configured to provide mapping information to map the input data into a graph of objects according to the database object properties included in the ORM metadata. The computer system maps the input data into a graph of objects using the database object properties included in the ORM metadata and displays an ORM object view which includes the graph of objects.

2006024, Nov 2, 2006

Feb 23, 2006

11/360455

Arshad Ahmad - Bellevue WA, US
Brad Olenick - Redmond WA, US
Clemens Szyperski - Redmond WA, US
David Hunt - Woodinville WA, US
Gregory Hughes - Bellevue WA, US
Simeon Cran - Redmond WA, US
William Manis - Sammamish WA, US

Microsoft Corporation - Redmond WA

G11B 5/00

360001000

The present invention comprises phasing systems and methods for software systems. In embodiments of the present invention, the phasing system comprises a multi-tiered phasing space where operations within the software system are constrained to a phase or a sub-phase. The operations execute only in the specified phase. Thus, operations that could yield improper results in large and complex software systems do not execute simultaneously but follow a certain order. The present invention also provides a data structure to introduce the phase constraints as software attributes into the software code.

2006024, Nov 2, 2006

Feb 23, 2006

11/360454

Arshad Ahmad - Bellevue WA, US
Balasubramanian Shyamsundar - Redmond WA, US
Brad Olenick - Redmond WA, US
Clemens Szyperski - Redmond WA, US
Simeon Cran - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 9/46

718102000

Methods, systems and computer products are provided for partitioning software application components into separate domains called concurrency domains. Computationally expensive, slow or long-running methods may be deployed into such domains, thus keeping the associated application more responsive to the end user. According to one aspect of the invention, a given concurrency domain is a partition of runtime objects for providing synchronization and thread isolation within the partition and for providing concurrency with other such partitions in a data-driven dynamically composed and reconfigured application.

2011013, Jun 9, 2011

Dec 7, 2009

12/632613

Clemens Kerer - Vienna, AT
Siddharth Jayadevan - Seattle WA, US
Brad Mark Olenick - Redmond WA, US
Gregory Lawrence Hughes - Redmond WA, US

MICROSOFT CORPORATION - Redmond WA

G06F 7/00

707812, 707E17045

In an embodiment, a computer system defines a generic relational meta-schema (GRMS), where the GRMS describes a generic representation for relational schemas and where the GRMS includes metadata indicating how a relational schema is to be stored as data in the data store. The computer system also defines describes a generic relational data schema (GRDS), where the GRDS describes a generic representation for relational data and where the GRDS includes metadata that indicates how relational data is to be stored in the data store in a generic fashion not necessarily complying with the relational schema for the data. Next, the computer system stores data in the data store according to the generic relational data schema and stores metadata as data in the data store according to the generic relational meta-schema.