Microsoft Technology Licensing, LLC

Hari Sudan Sundar

Dharma Kiritkumar Shukla

Karthik Raman

Momin Mahmoud Al-Ghosien

Shireesh Kumar Thota

Madhan Gajendran

Pankaj Sharma

Liang Li

Ankur Savailal Shah

Samer Boshra

Krishnan Sundaram

Atul Katiyar

Mikhail Mikhailovich Koltachev

Rajeev Sudhakar Bhopi

Adrian Ilcu Predescu

Brandon Chong

Aravind Ramachandran Krishna

Kiran Kumar Kolli

Karan Vishwanath Popali

Ji Huang

Arsalan Ahmad

Ankur Jauhari

Sujit Vattathil Kuruvilla

Jayanta Mondal

Vinod Sridharan

Yogesh Kumar

Per Mikael Horal

Siddhesh Dilip Vethe

Oliver Drew Leonard Towers

Muthukumaran Arumugam

Swarnim Vyas

Brikesh Kumar

Emily Lawton

Lalitha Manjapara Viswanathan

Artavazd Ginosian

Balachandar Perumalswamy

Denis Rystsov

Mohammad Derakhshani

Orestis Kostakis

Ashwini Singh

Vivek Ravindran

A database management system for managing a database includes each document being stored as a number of replicas for accessibility and data preservation. The system includes: a processor; a network interface; and a memory comprising programming instructions for execution by the processor to implement a database management service, the service configured to maintain a primary replica of a document, a number of secondary replicas of the document, and another log-only replica storing a log of changes to the document rather than contents of the document. The service makes head reads to the primary replica as needed when a read request to the number of secondary replicas does not result in a quorum.

Document database system using replicas of a stored document

Data sets such as databases are often distributed over a number of servers, where each server stores a subset of records and an index that enables the server to locate the records in response to queries. However, tight coupling of indexing and storage may limit load-balancing, fault recovery, and distribution. Instead, the set of servers may be partitioned into a set of storage servers that store the records and a set of index servers of the index over the records. In a set that is decoupled in this manner, load-balancing may involve provisioning and locating index servers independently of the provisioning and locating of the storage servers in view of the particular sensitivities and tolerances of various applications. Additionally, the index servers may also utilize a data layout that is selected and adapted independent of the data layout of the storage servers and/or the schema of the data stored thereby.

Schema-agnostic indexing of distributed databases

Data services are often provided with consistency guarantees of either strong consistency models, comprising uniform wall-clock consistency, or eventual consistency models, where temporary logical inconsistency is guaranteed to be resolved only after full data propagation. However, the performance characteristics of contemporary services often require an intermediate consistency model, where some aspects of the service have specific consistency expectations and other aspects of the service are flexible, such as bounded staleness (e.g., a maximum delay in reaching consistency); session consistency (e.g., individual sessions remain logically consistent, but ordering may vary across sessions); and prefix consistency (e.g., each view during a session is logically consistent, but ordering may vary between session views). Service guarantees may involve a selection within a range of consistency models that includes one or more intermediate consistency levels, and server configurations may be selected and applied to fulfill the intermediate consistency level selected in the service level agreement.

Intermediate consistency levels for database configuration

Databases are often provided according to various organizational models (e.g., document-oriented storage, key/value stores, and relational database), and are accessed through various access models (e.g., SQL, XPath, and schemaless queries). As data is shared across sources and applications, the dependency of a data service upon a particular organizational and/or access models may become confining. Instead, data services may store data in a base representation format, such as an atom-record-sequence model. New data received in a native item format may be converted into the base representation format for storage, and converted into a requested format to fulfill data requests. Queries may be translated from a native query format into a base query format that is applicable to the base representation format of the data set, e.g., via translation into an query intermediate language (such as JavaScript) and compilation into opcodes that are executed by a virtual machine within the database engine.

Unified data organization for multi-model distributed databases

A data service may be distributed over a set of servers in order to provide a database with properties such as low latency, high availability, and support for various consistency levels. Presented herein is a particular architecture that promotes rapid provisioning to promote scalability and failover; adaptive load-balancing to accommodate fluctuations in demand; and resiliency in the event of various types of failure, such as network partitions or regional outages. For a service comprising a resource set, a container is provided that hosts a set of replicas of a partition, and that is assigned an allocation of computing capabilities of one or more servers. The resource set of the service may be distributed over the replicas of the container. Scalability is achieved by adding replicas to the container, and load-balancing may be provided by splitting, merging, or otherwise refactoring the partition to accommodate anticipated and unanticipated fluctuations in service demand.

Containerization for elastic and scalable databases

Workloads are often performed by a server set according to a service level agreement, and are often provisioned and load-balanced by dedicating selected computational resources (e.g., servers and bandwidth) for application to the workload. However, resource-based provisioning may not accurately reflect the computational resource expenditure of the workload, leading to overprovisioning or underprovisioning of servers for the workload. Instead, the workload may be evaluated according to a service unit as a measurement of a volume of computational resources consumed by a workload unit, including performance dimensions specified in the service level agreement. The service level agreement may indicate a service unit rate for the workload. The workload may therefore be allocated to a subset of servers in portions according to a service unit rate, where the sum of the service unit rates for the portions allocated to the servers satisfies the service unit rate specified in the service level agreement.

Data service provisioning, metering, and load-balancing via service units

Growing community of inventors

Redmond, WA, United States of America

Hari Sudan Sundar