Microsoft Technology Licensing, LLC

Andrew Conrad

Pablo Castro

Luca Bolognese

Alexander Vaschillo

Chris A Suver

Michael Justin Flasko

Srinivasa Rao Burugapalli

Subramanian Muralidhar

Shyamalan Pather

Todd F Pfleiger

Jeffrey Michael Derstadt

Colin Joseph Meek

Jason Zhengnan Zhu

Bertan Ari

Carl Yates Perry

David E Sceppa

Pratik Patel

Ilker Cengiz

Avner Y Aharoni

Amanda K Silver

Michael Pizzo

Christopher Allen Suver

Michael Lee Brundage

David N Schach

Paul Allen Vick, Jr

Jose A Blakeley

Steven D White

Adam Wiener

Benjamin Albahari

Marcelo Lopez Ruiz

Alex Laskos

Simon Cavanagh

Dempsey R Swan

Jeffrey E Reed

Mark Ashton

Alyssa Heather Henry

Data communications are enabled to be performed between first and second computer systems without having to match data types at the first and second computer systems. A first data type is associated with a request for a resource. The request for the resource is transmitted from a first agent at the first computer system to a second agent at the second computer system. The resource is instantiated at the second computer system according to a second data type that is different from the first data type. The resource is received by the first agent from the second agent. The received resource is materialized into an instance of the first data type using the first agent.

Soft type binding for distributed systems

Techniques for exchanging data are provided herein. An 'open' data type is established on a computer system to define the structure of data. The open data type includes one or more predefined properties, and enables one or more extension properties to be optionally included. Data that is defined according to the open data type includes data values for the predefined properties, and may optionally include data values for extension properties. A second computer system may consider the extension properties to be extension properties or predefined properties of a data type known at the second computer system. In this manner, the type system that is used to exchange data between nodes need not necessarily be commonly known among the nodes, and/or may be dynamically modified, even for a particular data instance. Furthermore, queries may be performed against the data that query against the predefined properties and/or extension properties.

Open types for distributed systems

There is alteration of a late-bound expression produced by a compiler into an early-bound structure. Alteration of the late-bound expression can occur at runtime and a visitor pattern can be used to create the alteration. In one instance, a conversion from late-bound to early-bound takes place through replacing a late-bound property with a statically typed call. The early-bound structure can translate into an expression tree to enable an implementation of a store specific query operated upon storage.

Translating late bound LINQ expressions into database queries

Query expressions, such as LINQ (language integrated queries) queries, are enabled to be translated to URIs (uniform resource indicators) that may be used to query data sources at REST (representational state transfer) interfaces. A compiler is configured to convert a query into an expression tree. An expression tree normalizer is configured to normalize the expression tree into a normalized expression tree. A resource bound expression tree generator is configured to transform the normalized expression tree into a resource bound expression tree. A URI generator is configured to translate the resource bound expression tree into a URI.

Translating queries to representational state transfer (REST)

Programmers typically like operating with databases through use of classes. Classes allow a user to function with a database through use of a non-database programming language. To ease use of the classes, a class context is generated at runtime that does not force a programmer to handle various source files that are a product of class generation. Therefore, the user can have the ease of using classes without having to perform extra actions.

Runtime class database operation

A data mapping architecture for mapping between two or more data sources without modifying the metadata or structure of the data sources themselves. Data mapping also supports updates. The architecture also supports at least the case where data sources that are being mapped, are given, their schemas predefined, and cannot be changed. The architecture includes a mapping component that receives respective metadata from at least two arbitrary data models, and maps expressions between the data models.

Mapping architecture for arbitrary data models

The present invention relates to a system and methodology to facilitated data object persistence. An object schema is utilized to provide metadata for types in addition to what is provided by the type system for an underlying programming language. This metadata is then utilized by the system to translate data to and from user objects during a materialization or persistence process. The object schema provides information external to programming logic and type definitions. Consequently, the object schema can be deployed independent of an application thereby allowing the persistence storage of user objects to change without force the user to recompile and deploy application code.

System and method of providing and utilizing an object schema to facilitate mapping between disparate domains

The claimed subject matter relates to an architecture that can facilitate an incremental approach to an Object-Relational mapping solution. The architecture can provide a rich data model that is defined at the value layer. The rich data model can expose an interface that conforms with the interfaces exposed by common storage-specific data providers. The architecture can extend common storage-specific data provider to support common command representations, and provide entity services that work in terms of the rich data model as well as object services such as identity management, updating and change tracking.

Incremental approach to an object-relational solution

Users and programmers view 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.

System and method for viewing relational data using a hierarchical schema

The present invention relates to a system and methodology to facilitate data communications and data management between network entities operating in accordance with various data structures and operating environments. A managed class of application programming interfaces (API) are provided that support data communications between remote/local locations employing a first data structure and a second location supporting a second data structure (e.g., API for NET languages to access SQL Server via XML views). The managed class and associated APIs provide data transformations between such structures to facilitate communications and data management among various locations and architectures. In addition, the managed class and APIs facilitate operations between disparate object systems such as between managed and unmanaged object systems via interface support of a wrapper and associated marshalling technologies to bridge communications between such systems.

System and method providing API interface between XML and SQL while interacting with a managed object environment

Growing community of inventors

Sammamish, WA, United States of America

Andrew Conrad