AJAY KALHAN
Pilots at Lk Sammamish Pkwy, Redmond, WA

2010011, May 6, 2010

Jul 29, 2009

12/511644

Santeri Olavi Voutilainen - Seattle WA, US
Gopala Krishna Reddy Kakivaya - Sammamish WA, US
Ajay Kalhan - Redmond WA, US
Lu Xun - Kirkland WA, US
Mark C. Benvenuto - Seattle WA, US
Rishi Rakesh Sinha - Bothell WA, US
Radhakrishnan Srikanth - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707638, 707E17005

Systems and methods for managing configurations of data nodes in a distributed environment A configuration manager is implemented as a set of distributed master nodes that may use quorum-based processing to enable reliable identification of master nodes storing current configuration information, even if some of the master nodes fail. If a quorum of master nodes cannot be achieved or some other event occurs that precludes identification of current configuration information, the configuration manager may be rebuilt by analyzing reports from read/write quorums of nodes associated with a configuration, allowing automatic recovery of data partitions.

6778977, Aug 17, 2004

Apr 19, 2001

09/838691

Srikanth R. Avadhanam - Redmond WA
Milind M. Joshi - Bellevue WA
Ajay Kalhan - Redmond WA
Srikumar Rangarajan - Redmond WA
Tsvi M. Reiter - Bellevue WA

Microsoft Corporation - Redmond WA

G06F 700

707 2, 707101

A method and system for creating an index for a database table of records in a computer environment having a plurality of processing units wherein each processing unit has access to the database table. The method first determines partition delimiters wherein each partition delimiter separates the database table into non-overlapping partitions of records. Each of these partitions is dedicated to one processing unit for index creation. Next, each processing unit independently creates a sub-index, i. e. , different processing units create at least two sub-indexes. Last, the method merges the sub-indexes together to create a final index related to the database table.

2004019, Oct 7, 2004

Apr 21, 2004

10/830164

Srikanth Avadhanam - Redmond WA, US
Milind Joshi - Bellevue WA, US
Ajay Kalhan - Redmond WA, US
Srikumar Rangarajan - Redmond WA, US
Tsvi Reiter - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F007/00

707/100000

A method and system for creating an index for a database table of records in a computer environment having a plurality of processing units wherein each processing unit has access to the database table. The method first determines partition delimiters wherein each partition delimiter separates the database table into non-overlapping partitions of records. Each of these partitions is dedicated to one processing unit for index creation. Next, each processing unit independently creates a sub-index, i.e., different processing units create at least two sub-indexes. Last, the method merges the sub-indexes together to create a final index related to the database table.

2005023, Oct 20, 2005

Apr 9, 2004

10/821687

F. Terek - Bellevue WA, US
Ajay Kalhan - Redmond WA, US
Nagavamsi Ponnekanti - Bellevue WA, US
Srikumar Rangarajan - Sammamish WA, US
Michael Zwilling - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F007/00

707104100

A method and system for fragment-based serialization places one or more object members in fragments. Fragments may comprise a header and a payload. A header can provide useful information about the fragment, such as an indication of fragment type and an indication of fragment length. A payload may comprise one or more members of an object. Primitive members may be stored in a Binary Fragment with a record format payload. LOB and FS members may be stored in fragments that have a Value Type field for setting forth additional properties of the fragment. Collections may be stored in a series of fragments, a first fragment to indicate a start of a collection, one or more second fragments to serialize collection elements, and a Terminator Fragment to indicate the end of a collection. Fragment-serialized objects minimize storage overhead while providing fast instantiation and low-cost location and updating.

7702637, Apr 20, 2010

Jun 15, 2005

11/154496

F. Soner Terek - Bellevue WA, US
Ajay Kalhan - Redmond WA, US
Nagavamsi Ponnekanti - Bellevue WA, US
Srikumar Rangarajan - Sammamish WA, US
Michael J. Zwilling - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/00, G06F 7/00

707100, 707 1

A method and system for fragment-based serialization places one or more object members in fragments. Fragments may comprise a header and a payload. A header can provide useful information about the fragment, such as an indication of fragment type and an indication of fragment length. A payload may comprise one or more members of an object. Primitive members may be stored in a Binary Fragment with a record format payload. LOB and FS members may be stored in fragments that have a Value Type field for setting forth additional properties of the fragment. Collections may be stored in a series of fragments, a first fragment to indicate a start of a collection, one or more second fragments to serialize collection elements, and a Terminator Fragment to indicate the end of a collection. Fragment-serialized objects minimize storage overhead while providing fast instantiation and low-cost location and updating.

2012010, May 3, 2012

Jun 21, 2011

13/165557

Lev Novik - Bellevue WA, US
Andrew Kimball - Sammamish WA, US
Tony Petrossian - Bellevue WA, US
Cihangir Biyikoglu - Issaquah WA, US
Santeri Olavi Voutilainen - Seattle WA, US
Tomas Talius - Sammamish WA, US
Istvan Cseri - Seattle WA, US
Joachim Hammer - Redmond WA, US
Jason D. Clark - Woodinville WA, US
Marc T. Friedman - Seattle WA, US
Ajay Kalhan - Redmond WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707633, 707609, 707E17005, 707E17032

The present invention extends to methods, systems, and computer program products for partitioning online databases. Online database operations, such as, for example, SPLIT, MERGE, and DROP, are used to alter the arrangement of partitions in a federated database. A SPLIT operation splits rows at one partition across a plurality of other partitions. A MERGE operation merges rows at a plurality of partitions in to one partition. A DROP operation shifts responsibility for rows of data from one partition to another partition and then drops the rows from the one partition.

2011018, Jul 28, 2011

Jan 28, 2010

12/695166

Zhongwei Wu - Sammamish WA, US
Oliver N. Seeliger - Sammamish WA, US
Santeri Olavi Voutilainen - Seattle WA, US
Ajay Kalhan - Redmond WA, US
Sandeep Lingam - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707674, 707E17007, 707E17005

Architecture that facilitates the restoration of a cluster database in a scalable way using backups (e.g., SQL database backups) and a partition rebuild mechanism to achieve a high level of partition level data consistency, even when restore fails on individual machines and/or machine failure occurs. The architecture restores replicas of the partitions in consideration that the backups may be created at different points and at different times. Optimized parallelism is achieved in restoring each database machine using local backups, which eliminates cross-machine network traffic. Thus, fast recovery of the distributed database can be accomplished on the order of hours over thousands of machines and terabytes of data.

2012010, May 3, 2012

Jun 21, 2011

13/165511

Lev Novik - Bellevue WA, US
Jason D. Clark - Woodinville WA, US
Marc T. Friedman - Seattle WA, US
Andrew Kimball - Sammamish WA, US
Cihangir Biyikoglu - Issaquah WA, US
Joachim Hammer - Redmond WA, US
Tobias Joakim Bertil Ternström - Kirland WA, US
Ajay Kalhan - Redmond WA, US

Microsoft Coropration - Redmond WA

G06F 17/30

707707, 707E17108

The present invention extends to methods, systems, and computer program products for scoping the context used to access a database partition. Embodiments of the invention enable data isolation using partitions in multi-tenant databases, while relieving client applications from dealing with the partitions. For example, a computer system that includes a distributed database system comprising a plurality of database partitions in a federation receives a context to use when performing database access operations within the distributed database system. The context identifies specified relevant portion of the federation. The computer system also receives a database access operation that is associated with the context. The computer system modifies the semantics of the database access operation in accordance with the associated context, to direct application of the database access operation to the specified relevant portion of the federation.

7437346, Oct 14, 2008

Feb 10, 2004

10/776664

Shrinivas Ashwin - Sammamish WA, US
Jose A. Blakeley - Redmond WA, US
Peter Carlin - Seattle WA, US
Jun Fang - Sammamish WA, US
Ajay Kalhan - Redmond WA, US
Christian Kleinerman - Bellevue WA, US
Stefano Stefani - Seattle WA, US
Aleksandras Surna - Redmond WA, US
Honggang Zhang - Bellevue WA, US

Microsoft Corporation - Redmond WA

G06F 7/00

707 1, 707200, 707 6, 707102

Various embodiments of the present invention are direct to the utilization of Blob Handles (BHs) which are an internal representation of a large value. BHs are immutable and stateless references to a large data object. The structure of a BH contains enough information to return an ILockBytes interface in order to provide access to the corresponding large data block, and a BH can also return information regarding its own lifetime description. A BH can be completely described using (a) a pointer to the beginning of BH data and (b) the byte-length of the BH.

2012025, Oct 4, 2012

Apr 4, 2011

13/079750

Hao Xia - Kirkland WA, US
Todd F. Pfleiger - Seattle WA, US
Mark C. Benvenuto - Seattle WA, US
Ajay Kalhan - Redmond WA, US

MICROSOFT CORPORATION - Redmond WA

G06F 11/34

714 472, 714 473, 714E11202

Embodiments are directed to predicting the health of a computer node using health report data and to proactively handling failures in database services. In an embodiment, a computer system monitors various health indicators for multiple nodes in a database cluster. The computer system accesses stored health indicators that provide a health history for the database cluster nodes. The computer system then generates a health status based on the monitored health factors and the health history. The generated health status indicates the likelihood that the node will be healthy within a specified future time period. The computer system then leverages the generated health status to handle current or predicted failures. The computer system also presents the generated health status to a user or other entity.