Zlatko V Michailov

US Patent:

20080228697, Sep 18, 2008

Filed:

Mar 16, 2007

Appl. No.:

11/725195

Inventors:

Atul Adya - Redmond WA, US
Sergey Melnik - Kirkland WA, US
Zlatko Michailov - Redmond WA, US
Colin Joseph Meek - Redmond WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/30

US Classification:

707 2, 707E17045

Abstract:

A database update pipeline may be incorporated into a data access architecture for providing data services to applications, thereby bridging the gap between application data and data as persisted in databases. The update pipeline has the ability to translate changes made to object instances into data store change constructs, and carry those changes over to a data store. Such a pipeline can also advantageously perform the reverse operation, allowing applications to query using the database update pipeline, and receive materialized object instances.

US Patent:

20090030870, Jan 29, 2009

Filed:

Jul 27, 2007

Appl. No.:

11/829214

Inventors:

Zlatko Michailov - Redmond WA, US
Colin J. Meek - Redmond WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 7/00

US Classification:

707 1

Abstract:

Systems and methods that present error messages in context of entities to application that issue rich queries, via an error propagation component. Accordingly, errors can be built up along the way (e.g., context/nesting), wherein troubleshooting processes can drill back down to the original cause. Hence, the error messages can be presented in the context of entities, as opposed to the underlying store.

US Patent:

20090083265, Mar 26, 2009

Filed:

Sep 25, 2007

Appl. No.:

11/861198

Inventors:

Zlatko Velkov Michailov - Redmond WA, US

Assignee:

MICROSOFT CORPORATION - Redmond WA

International Classification:

G06F 17/30

US Classification:

707 6, 707E17001

Abstract:

A mechanism is provided to facilitate complex textual pattern matching. Regular expressions are specified utilizing a set of rules of various simplicity/complexity. These rules are subsequently employed to generate a more complex regular expression described by the rules, which can be passed to a regular expression engine to identity textual patterns as a function thereof.

US Patent:

20110087636, Apr 14, 2011

Filed:

Oct 8, 2009

Appl. No.:

12/575475

Inventors:

Zlatko V. Michailov - Redmond WA, US
David W. Olix - Woodinville WA, US
Matt A. Neerincx - Sammamish WA, US
Chadwin J. Mumford - Woodinville WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 11/14
G06F 7/00
G06F 17/00

US Classification:

707655, 714E11117

Abstract:

Aspects of the subject matter described herein relate to database connectivity behavior. In aspects, an entity seeking to access data that is replicated via instances of a database follows a plan. The plan provides information as to which instance(s) the entity is to attempt to access the data from. The plan may include connection data that indicates parameters the entity is to use in connecting to the instance(s). The plan may also indicate one or more other instances from which the entity may attempt to access the data if the client is not able to access the data from initial instance(s).

US Patent:

20110119449, May 19, 2011

Filed:

Nov 16, 2009

Appl. No.:

12/618787

Inventors:

Matthew A. Neerincx - Sammamish WA, US
Zlatko V. Michailov - Redmond WA, US
Chadwin J. Mumford - Woodinville WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 12/08
G06F 12/00

US Classification:

711133, 711118, 719312, 711E12001, 711E12022, 711E12017

Abstract:

A request for application information can be received from an application running in a process. The application information can be requested from an information repository, and received back from the repository in a first format. The application information can be converted to a second format, and passed to the application in the second format. In addition, the application information can be saved in the second format in a cache in the process. Also, when application information has been cached in response to a request for the information for a first user object, and a subsequent request for the application information for a second user object is received, it can be determined whether the second user object is authorized to access the application information. If so, then the application information can be fetched from the cache and returned for use by the second user object.

US Patent:

20120158651, Jun 21, 2012

Filed:

Dec 17, 2010

Appl. No.:

12/972023

Inventors:

Zlatko V. Michailov - Redmond WA, US
Stephen H. Toub - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 17/00

US Classification:

707613, 707E17007

Abstract:

Managing a concurrency based system. A method includes determining a defined number of concurrent operations for a concurrency based management system. An operation queue is accessed. The operation queue stores or has therein zero or more asynchronous operations. An asynchronous operation is an operation that returns an object representing the asynchronous completion of the operation. The method further includes, as long as the queue is not empty, scheduling asynchronous operations from the queue until a number of asynchronous operations equal to the defined number has been reached.

US Patent:

20120159512, Jun 21, 2012

Filed:

Dec 17, 2010

Appl. No.:

12/972039

Inventors:

Zlatko V. Michailov - Redmond WA, US
Niklas Gustafsson - Redmond WA, US
Daniela Cristina Manu - Sammamish WA, US
Stephen H. Toub - Seattle WA, US

Assignee:

Microsoft Corporation - Redmond WA

International Classification:

G06F 9/46

US Classification:

719313

Abstract:

One embodiment includes a method of performing dataflow processing. The method includes representing a first asynchronous processing node as a first future. The first future represents the lifecycle of processing of the first asynchronous processing node. The method further includes representing one or more other asynchronous operations as one or more other futures. The one or more other futures represent the asynchronous completion of one or more operations' processing. The first future and the one or more other futures are represented as a single composite future. The single composite future represents completion of processing of the combination of the first asynchronous processing node and the one or more other asynchronous operations.

US Patent:

20190095226, Mar 28, 2019

Filed:

Feb 6, 2018

Appl. No.:

15/889918

Inventors:

- Redmond WA, US
Hoe Jin Kim - Redmond WA, US
Zlatko Michailov - Redmond WA, US
Hardik V. Shah - Seattle WA, US
Shaofeng Zhu - Bellevue WA, US
John Zhongqi Wang - Austin TX, US
Chae Seong Lim - Issaquah WA, US
Hailei Zhang - Redmond WA, US
Sudheer Maremanda - Redmond WA, US
Abhimanyu Sharma - Redmond WA, US
Jay R. Rathi - Redmond WA, US
Robert Ion Gavrila - Redmond WA, US
Ehab Sobhy - Redmond WA, US
Thomas A. Morrison - Redmond WA, US
Jai Srinivasan - Bellevue WA, US
Rolando Jimenez Salgado - Redmond WA, US
Nicholas Weinandt - Redmond WA, US
Alexandru Croicu - Redmond WA, US

International Classification:

G06F 9/445
G06F 8/76
G06F 8/61

Abstract:

Systems, methods, and computer-executable instructions for supporting custom functions within an application. An application add-in is received that includes a custom function and a custom function location. The application is available across multiple platforms. The custom function is also available across multiple platforms. The custom function is registered within the application using the custom function location. A request to invoke the custom function is received within the application A custom function implementation is downloaded from the custom function location. The custom function implementation is executed. A return value is received from the custom function implementation. The return value may be displayed within the application.