Mark C Benvenuto, 43New Rochelle, NY

2006008, Apr 20, 2006

Jul 20, 2005

11/185310

Dragan Tomic - Redmond WA, US
Shankar Pal - Redmond WA, US
Stanislav Oks - Kirkland WA, US
Jonathan Morrison - Woodinville WA, US
Mark Benvenuto - Seattle WA, US

Microsoft Corporation - Redmond WA

G06F 17/30

707200000

Caching architecture that facilitates translation between schema data and relational structures. A schema translation component consumes schema data (e.g., XML schema data) having a schema structure. The schema structure is shredded into tables. A validation component interfaces to a memory management interface to facilitate loading only the necessary components to perform instance validation. During validation, only parts of the schema that are used are loaded and cached. A schema cache stores the in-memory representation of the schema optimized for instance validation. The schema components are loaded from metadata into the cache memory as read-only objects such that multiple users can use the in-memory objects for validation.

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.

2012010, May 3, 2012

Jan 25, 2011

13/013746

Sandeep Lingam - Bellevue WA, US
Kanmin Zhang - Redmond WA, US
Mark Benvenuto - Seattle WA, US
David Lo - Saratoga CA, US

MICROSOFT CORPORATION - Redmond WA

G06F 15/16
G06F 17/00

705400, 709226

The subject disclosure relates to load balancing systems and methods. In one embodiment, a reactive load balancer can receive feedback from a first database node, and allocate resources to the first database node based, at least, on the feedback. The feedback is dynamic and comprises information indicative of a load level at the first database node. In some embodiments, the feedback includes information indicative of a load level at a second, under loaded, database node. In other embodiments, load balancing is performed by an overloaded node polling a set of devices (e.g., cell phone, personal computer, PDA) at which resources may be available. Specifically, the method includes polling devices for resource availability at the devices, and receiving price information for resources provided by at least one device. The overloaded node utilizes the resource in response to providing payment of the price. Auction models or offer/counteroffer approaches can be employed.

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.

2020039, Dec 17, 2020

Jun 8, 2020

16/895503

Kenneth White - New York NY, US
Mark Benvenuto - New York NY, US
Kevin Albertson - New York NY, US
David Lenox Storch - Brooklyn NY, US
Eliot Horowitz - New York NY, US

G06F 21/60
G06F 16/21
H04L 9/14

A database system comprising a database having a dynamic schema and comprising a plurality of data storage nodes; and at least one processor configured to, using an encryption process: manage access to plaintext data stored in the plurality of data storage nodes by users employing at least one client-controlled resource in a client access layer; restrict access to the plaintext data by other users, wherein the other users include users with system administration privileges for the database and administrators of processing resources hosting the database; and manage access to encrypted copies of the plaintext data by the users with system administration privileges for the database such that the system administration privileges do not enable access to plaintext versions of the encrypted copies. A method for managing data security for a database. A database system with a dynamic schema architecture, a client access layer, and an operational database layer.

2019015, May 23, 2019

Jan 25, 2019

16/257396

- Redmond WA, US
Todd F. PFLEIGER - Seattle WA, US
Mark C. BENVENUTO - Seattle WA, US
Ajay KALHAN - Redmond WA, US

G06F 11/07
G06F 11/22
G06F 11/00
G06F 11/32
G06F 11/30
H04L 12/26

Embodiments are directed to predicting the health of a computer node using health report data and to proactively handling failures in computer network nodes. In an embodiment, a computer system monitors various health indicators for multiple nodes in a computer network. The computer system accesses stored health indicators that provide a health history for the computer network nodes. The computer system then generates a health status based on the monitored health indicators 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.

2019015, May 23, 2019

Nov 26, 2018

16/199732

- Redmond WA, US
Madhan GAJENDRAN - Bellevue WA, US
Quetzalcoatl BRADLEY - Monroe WA, US
Shireesh Kumar THOTA - Redmond WA, US
Karthik RAMAN - Sammamish WA, US
Mark Connolly BENVENUTO - Seattle WA, US
John MACINTYRE - Seattle WA, US
Nemanja MATKOVIC - Seattle WA, US
Constantin DULU - Redmond WA, US
Elisa Marie FLASKO - Kirkland WA, US
Atul KATIYAR - Sammamish WA, US

H04L 29/08

A server set may provide a document service to various clients in view of considerations such as availability, fault tolerance, flexibility, and performance. Presented herein are document service architectures that involve partitioning the document set into at least two document ranges, and assigning the respective document ranges to an agent that is deployed to at least one assigned server. A request to apply an operation to a selected document may be fulfilled by identifying the document range of the document; identifying a selected server of the server set that hosts the agent to which the range is assigned; and forwarding the request to the selected server. In some variations, servers may retain detailed information about neighboring servers (e.g., according to logical and/or physical proximity) and scant information about distant servers, thereby avoiding both the extensive information exchange of highly informed network architectures and the inefficiency of uninformed routing algorithms.

2017031, Nov 2, 2017

Jul 14, 2017

15/650801

- Redmond WA, US
Madhan Gajendran - Bellevue WA, US
Quetzalcoatl Bradley - Monroe WA, US
Shireesh Kumar Thota - Issaquah WA, US
Karthik Raman - Issaquah WA, US
Mark Connolly Benvenuto - Seattle WA, US
John Macintyre - Seattle WA, US
Nemanja Matkovic - Seattle WA, US
Constantin Dulu - Redmond WA, US
Elisa Marie Flasko - Kirkland WA, US
Atul Katiyar - Redmond WA, US

H04L 29/08

A server set may provide a document service to various clients in view of considerations such as availability, fault tolerance, flexibility, and performance. Presented herein are document service architectures that involve partitioning the document set into at least two document ranges, and assigning the respective document ranges to an agent that is deployed to at least one assigned server. A request to apply an operation to a selected document may be fulfilled by identifying the document range of the document; identifying a selected server of the server set that hosts the agent to which the range is assigned; and forwarding the request to the selected server. In some variations, servers may retain detailed information about neighboring servers (e.g., according to logical and/or physical proximity) and scant information about distant servers, thereby avoiding both the extensive information exchange of highly informed network architectures and the inefficiency of uninformed routing algorithms.