Microsoft Technology Licensing, LLC

David John Nettleton

Jason Todd Hunter

Steven James Bailey

Amir Netz

Giovanni Moises Della-Libera

Ramachandran Venkatesh

Kevin Grealish

Andrew James Peacock

Michael Justin Flasko

Christina Storm

Mark Wade Heninger

Chiu Ying Cheung

Cheryl Couris

Sonia P Carlson

Paula M Bach

Lev Novik

Nigel Robin Ellis

David J Simons

Shishir Samir Mehrotra

Gregory Scott Friedman

Sergey Melnik

Greg S Friedman

Richard Louis Negrin

Joshua M Michaels

Song Xue

Job execution can be scheduled and monitored. Execution of a job results in generation of one or more data slices, which can be consumed as input by one or more related jobs. Data slices can be presented in an interactive view. Selection of a data slice in the view can trigger automatic identification of related data slices based on dependencies between data slices. Each data slice can also include and be presented with a status indicating the availability of corresponding data, such as pending, ready, or failed. Furthermore, selection of a data slice that failed to generate successfully can trigger identification of related data slices that failed or are predicted to fail to generate successfully.

Job scheduling and monitoring in a distributed computing environment

A view of data transformation jobs can be presented by way of a user interface. Related jobs can subsequently be identified automatically after a job is selected based on data dependencies between jobs. Execution status can also be determined and presented such that successful and failed execution of jobs, for example, can be differentiated. Furthermore, selection of a job run that failed to execute successfully can trigger identification of related jobs runs that failed or are predicted to fail to execute successfully.

Systems and methodologies are provided for efficiently performing concurrent transactions by multiple users, and tracking data at a logical level beneath a physical level of the object being modified. Each transaction can copy a committed version of the data segment to be modified to its respective space, and can update such copy during modification. A detect component detects whether any data segment being operated upon requires updating as a result of other transactions committing, and a merge component synchronizes the data segment with its committed version. Various optimization procedures can also be incorporated as part of the commit stage, upon completion of the detect and merge process.

Concurrent transactions and page synchronization

Systems and methodologies are provided that employ an allocation lock, which permits only a single transaction to acquire space on a particular page at any one time. The allocation lock of the present invention facilitates operations of concurrent transactions at a subpage level (e.g., a row level), and in conjunction with a heap manager can enforce a set of conditions such that prior to a commit stage of a transaction, a space availability for a particular page can be typically assured (e.g., that transactions operating on various copies of the page do not consume all of storage space on that page), and reorganization of data around the page is mitigated (e.g., that a transaction need not move data around the page for purpose of merging various copies.)

Allocation locks and their use

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

Aspects of the subject matter described herein relate to creating, maintaining, and using relationships between items. In aspects, items such as files, folders, and other objects may be stored in a data store. A user may desire to form a relationship between two items that provides additional semantic information regarding the relationship. To do so, an instance of an item reference is created and populated with data that associates the item reference with a source item and optionally a target item. The item reference is part of a type hierarchy and inherits properties from ancestor types. These types are included in a payload of the item reference and may be exposed to programs that seek to obtain information about the relationship indicated by the item reference. An item reference may be added without changing other data about the referenced items.

Typed relationships between items

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 are provided in a lock hierarchy arrangement wherein upon release of all child locks associated with a parent lock, then such parent lock is also released. The present invention supplies each lock with sufficient information to determine its own life time. Such framework enables a higher degree of transaction concurrency in a database, and mitigates an over locking thereof, thus conserving system resources.

System and methods for database lock with reference counting

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

Systems and methodologies are provided for enforcing a set of conditions such that prior to a commit stage of a transaction, a space availability for a particular page can be typically assured (e.g., that transactions operating on various copies of the page do not consume all of storage space on that page), and reorganization of data around the page is mitigated (e.g., that a transaction need not move data around the page for purpose of merging various copies.) A page aggregator and a heap manager can facilitate operations of concurrent transactions at a subpage level (e.g., a row level), during such modifications of a data base by multiple users.

Systems and methods in support of data base page synchronization

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

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.

Growing community of inventors

Seattle, WA, United States of America

David John Nettleton