Pravin Mittal

US Patent:

8103638, Jan 24, 2012

Filed:

May 7, 2009

Appl. No.:

12/436805

Inventors:

Fabricio Voznika - Kenmore WA, US
Alexandre Verbitski - Woodinville WA, US
Pravin Mittal - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707687, 707704, 710200, 711145

Abstract:

Methods, systems, and computer-readable media are disclosed for partitioning contended synchronization objects. A particular method determines a contention-free value of a performance metric associated with a synchronization object of a data structure. A contended value of the performance metric is measured, and the synchronization object is partitioned when the contended value of the performance metric exceeds a multiple of the contention-free value of the performance metric.

US Patent:

8176021, May 8, 2012

Filed:

Jun 2, 2008

Appl. No.:

12/131906

Inventors:

Hanumantha R. Kodavalla - Sammamish WA, US
Pravin Mittal - Redmond WA, US
Srikumar Rangarajan - Sammamish WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707696, 707715, 707741

Abstract:

Aspects of the subject matter described herein relate to optimized reverse key indexes. In aspects, a dispersion function disperses index values such that they are distributed across multiple pages of an index. The dispersion function utilizes a dispersion factor that indicates to what extent the index values are dispersed. Because the index values are dispersed, contention regarding inserts may be reduced or eliminated and other advantages realized.

US Patent:

20090182746, Jul 16, 2009

Filed:

Jan 15, 2008

Appl. No.:

12/014764

Inventors:

Pravin Mittal - Redmond WA, US
Hanumantha Rao Kodavalla - Sammamish WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 17/00

US Classification:

707 8, 707E17059

Abstract:

Described is a technology by which a database management system more efficiently processes read requests than write requests for a read-mostly database table, which is a database table that is generally read far more often than written. A lock partitioning mechanism may be implemented to provide a read lock for each CPU of a plurality of CPUs, in which only one read lock is acquired to process a read request. A database table state changing mechanism may be implemented that more efficiently processes read requests relative to write requests by maintaining the database table in a read-only state until a write request is processed. When a write request is received, the database table is changed to a read-write state to process the write request. The database table is then reset back to a read-only state, such as by running a background thread.