Microsoft Technology Licensing, LLC

Jason Todd Hunter

David John Nettleton

Ramachandran Venkatesh

Kedarnath Atmaram Dubhashi

Gregory Scott Friedman

Simon Skaria

Srinivasmurthy P Acharya

Lev Novik

John Joseph Duffy

Christopher Wellington Brumme

Martin Taillefer

Lu Xun

Ahmed Hassan Mohamed

Nigel Robin Ellis

Jinsong Yu

David J Simons

Michael Jack Newman

Anil Kumar Nori

Sergey Melnik

F Soner Terek

Bekim Demiroski

Gopala Krishna Reddy Kakivaya

Jack Smith Richins

Jeffrey T Pearce

Amit Shukla

Gregory Michael Neverov

Dmitry Kakurin

Song Xue

The environment and use of an immutable buffer. A computing entity acquires data or generates data and populates the data into the buffer, after which the buffer is classified as immutable. The classification protects the data populated within the immutable buffer from changing during the lifetime of the immutable buffer, and also protects the immutable buffer from having its physical address changed during the lifetime of the immutable buffer. As different computing entities consume data from the immutable buffer, they do so through views provided by a view providing entity. The immutable buffer architecture may also be used for streaming data in which each component of the streaming data uses an immutable buffer. Accordingly, different computing entities may view the immutable data differently without having to actually copy the data.

Immutable sharable zero-copy data and streaming

Various mechanisms are provided for the lockdown of an item store. For example, a method is provided that comprises of disabling access to a relational engine for a set of users associated with a filing system utilizing the relational engine to manipulate data in an item store. Following such disabling of access, an exception is created by allowing access to the relational engine for users of the filing system based on a set of privileges the users have been assigned. The disabling of access can be accomplished by removing system users from ownership roles, and the allowing of access can be accomplished by providing certificates to users that have associated set of privileges granted to the users.

Relational lockdown for an item store

Systems and methods that supply a global knowledge on what nodes are available in the system, via employing routing tokens that are analyzed by a centralized management component to infer status for the nodes. When nodes fail, the routing tokens associated therewith are acquired by neighboring nodes, and the global knowledge updated. Moreover, upon inferring a failed or down status for a node, a challenge can be sent to a node reporting such failure to verify actual failure(s).

Failure notification in rendezvous federation

A system that generates a unique identifier that employs a public key of a cryptographic key pair as a contribution to a name for an attribute associated with a schema. Additionally, a hash over the relevant entity name, version, and culture can be employed to automatically produce the remaining portion of the unique identifier. The innovation can ensure that the unique identifiers used by a schema are mathematically related to a public key in a way that can not be spoofed by malicious agents. To this end, unique identifiers can be computed at installation time by combining the n-bytes of the public key (or a hash, e.g., SHA1, of the public key) with the first n-bytes of another entity-specific hash (e.g., SHA1) computed with respect to specific attributes.

Secure schema identifier generation

Embodiments define a set of rules such that a type designer can express as part of a type's definition whether the type has extended the logic and/or constraints of its ancestral types in such a way that applications written against that ancestral type will continue to function correctly. Nonconformity can also be indicated and an embodiment can enforce limitations on a set of operations that can be performed on such instances when treated as their ancestral types. Applications can use standard interfaces to discover from embodiments whether such limitations can be in force for a particular instance and provide a user experience that accounts for those limitations. Embodiments can also provide mechanisms to enable type designers to limit a degree of extensibility for both types and/or Items.

Programmable logic and constraints for a dynamically typed storage system

A system and/or methodology that enables schema motion and 'just-in-time' installation thereof. Aspects of the invention employ signing technology to facilitate secure definition of schema data. These public key technologies can also be employed to facilitate verification of the document (e.g., schema) received at a destination.

Schema signing and just-in-time installation

Systems and methodologies that facilitate data handling among participants with mismatched schema sets of an extensible data model, via employing a versioning component. The versioning component can identify and separate the mismatched and matched data, and direct the mismatched portion to a bit bucket component. The bit bucket component can further persistently store the mismatched data, to enable interaction among participants with mismatched data types. The data can be re-integrated to ensure that round trip data is available to the next participant.

Version tolerant serialization

Systems and methodologies that facilitate evolving a data model via a combination of an explicit logical model definition, logical model changes, functional units, an explicit/implicit physical model and physical model changes, to derive a data model transformation are presented. Such an arrangement can provide for a rich set of transformations, which can be automatically applied to a data model instantiation. The subject invention facilitates leveraging a common set of code in data model instantiation evolution, by defining the set of transformations across an arbitrary data model.

Data model and schema evolution

Described is a collection of type versions (objects) associated with an application program that lists only those type versions that can be bound to an application program. This ensures stability and security by preventing other type versions from being bound to the application program, unless overridden by policy. A type binding process only materializes objects for stored types that correspond to matching type versions in the application's known types collection. The type may be loaded from a local folder, or from a global cache, providing installation flexibility. A data container accessible to the application may be populated with data for fields defined on a type in the collection having a version not bound to the application program, and for fields of a related type not maintained in the collection. Default values are used to populate any unpopulated fields when policy specifies that a different type version be used.

Type restriction and mapping for partial materialization

The subject invention provides a system and/or a method that facilitates mapping a data base model to a database object. A type storage system can utilize a storage mapping of a file storage data model. The mapping can describe the database object created based at least in part upon a schema and how instances of the type described in the schema are stored and/or accessed. Furthermore, a query can be provided to find at least one of an item, a document, and/or a contact that satisfy at least one criterion. The type storage system can receive data, wherein the data is at least one of a schema, a data model, a type, a query, and query criteria via an interface to provide the storing and querying. Additionally, the type storage system can generate a view that exposes at least one instance of the type.

Mapping of a file system model to a database object

A system and/or methodology that enables schema packaging, distribution and availability. Aspects of the invention employ signing technology to facilitate secure definition of a schema package. The system and/or methodology can also include the schema package as a resource in a client-side assembly thereby guaranteeing that exactly the same infrastructure used to discover the assembly will be leverageable in discovery of the schema package(s). Other aspects can include the schema package as a satellite assemble or as a separate file. In these scenarios, the invention can facilitate constructing and distributing the schema package and information necessary to enable the client to interact with the store with regard to uninstalled schemas.

Schema packaging, distribution and availability

The subject invention provides a system and/or a method that facilitates adapting at least two disparate file systems. A file system adapter can provide uniformity and/or seamless integration between a first file system and a second file system. The file system adapter can employ a file-backed item that is enriched by a file to provide at least one of a property to an item and a file stream associated with the item. The file-backed item can allow a manipulation by at least one of an API for the first file system and an API for the second file system.

File system represented inside a database

A system that generates a per user abstraction of a store from a connection point. Filtering a view set of a hierarchically secured containment hierarchy based on the access permissions of the principal is one of the novel features of the invention. The invention can offer a collection of primitives that can operate on this aggregation that span multiple container hierarchies with potentially heterogeneous security descriptors. The model can reduce the necessity to traverse the container hierarchy to discover all the accessible items in a domain.

Growing community of inventors

Redmond, WA, United States of America

Jason Todd Hunter