Michailov
Julian Petrov Michailov, Mississauga CA
Patent application number | Description | Published |
---|---|---|
20100023757 | METHODS AND SYSTEMS FOR SENDING SECURE ELECTRONIC DATA - A method and system for providing encryption are provided, involving a) transmitting a request from a sender to a database for a public key for a selected recipient, the database being configured to store for each member in a plurality of members a member public key for encrypting electronic data; b) determining if the selected recipient is in the plurality of members, and; c) if the selected recipient is in the plurality of members, then executing a member procedure, the member procedure comprising transmitting from the database to the sender the member public key stored in the database for the selected recipient; d) if the selected recipient is not in the plurality of members, then executing a non-member procedure, the non-member procedure comprising determining if at least one predetermined criterion is met, and, if the at least one predetermined criterion is met, generating a non-member public key for encrypting electronic data and a non-member private key for decrypting the electronic data encrypted using the non-member public key; otherwise, if the at least one predetermined criterion is not met the non-member public key and the non-member private key are not generated. | 01-28-2010 |
Zlatko Michailov, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20080228697 | View maintenance rules for an update pipeline of an object-relational mapping (ORM) platform - 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. | 09-18-2008 |
20090030870 | ERROR PROPAGATION IN OBJECT-RELATIONAL MAPPING PLATFORM - 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. | 01-29-2009 |
Zlatko V. Michailov, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20110087636 | MODELING DISTRIBUTION AND FAILOVER DATABASE CONNECTIVITY BEHAVIOR - 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). | 04-14-2011 |
20110119449 | APPLICATION INFORMATION CACHE - 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. | 05-19-2011 |
20120158651 | CONFIGURATION OF ASYNCHRONOUS MESSAGE PROCESSING IN DATAFLOW NETWORKS - 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. | 06-21-2012 |
20120159512 | CANCELABLE AND FAULTABLE DATAFLOW NODES - 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. | 06-21-2012 |
Zlatko Velkov Michailov, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090083265 | COMPLEX REGULAR EXPRESSION CONSTRUCTION - 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. | 03-26-2009 |