Microsoft Technology Licensing, LLC

Amazon Technologies, Inc.

Other

Tanmoy Dutta

Girish Chander

Cristian Marius Ilac

Gennady Medvinsky

Raul Garcia

Ziquan Li

Andreas K Luther

Liqiang Zhu

Alexander Gourkov Balikov

Bronislav Kavsan

Steven Richard Gott

Liquiang Zhu

Himani Naresh

Stefano Stefani

James Robert Hamilton

Paul J Leach

Conor J Cunningham

Jeremy Mazner

Eric N Hanson

Dennis Tighe

Laurentiu Bogdan Cristofor

Ruslan Pavlovich Ovechkin

Ziquian Li

Roger Lynn Wolter

Anoop Gupta

Michael Anthony Hall

Scott Field

John Peter Shewchuk

Grant Alexander Macdonald McAlister

David Benson Cross

Thomas C Jones

Brian Russell Glaeske

Eric C Perlin

John J Lambert

Rodger N Kline

Brian L Welcker

Kevin T Damour

Aravind Ramarathinam

Barry Bailey Hunter, Jr

Sandor Loren Maurice

Karthik Jaganathan

Peter Villadsen

Alexey Kuznetsov

Arthur Baker

Brian J Guarraci

Dave M McPherson

David Charles Wein

Gustavo A Plancarte

Sunil P Gottumukkala

Amit Purohit

Amar Nalla

Lawrence Douglas Webley

Raghavendra Malpani

Cezar Ungureanasu

Amit Raghunath Kulkarni

Grant Alexander McAlister

Matthew Z Tamayo-Rios

George Li

Matthew Walters

Jagdeep Singh Sidhu

Yuhui Yuan

Mark Porter

David McPherson

Vijeta Johri

Crispin Cowan

Elena Daniela Cristofor

Rahul Nambiar

Bharath Subramanian Pichai

Alain Comeau

Andrew Stewart Tucker

Clifford T Dibble

Satyajit Nath

Ramakrishna Dwivedula

Sung L Hsueh

Timothy Michael Galvin

Shawn McCoy

Khaled Sinno

Pramit H Desai

Sachin Honnudike

Sundaresan Krishnamurthy

Serhii Poliakov

Parijatham Santosh Kumar Vodela

James H Mlodgenski

Daniel Myers

Steven L Hiskey

Klaus Schultz

Arthur H Baker

Techniques for query execution against relational databases using connection pooling are described. According to some embodiments, a query processing service is disclosed that enables users to execute queries against target relational databases implemented by a relational database service. The service receives query requests originated by a client application at a web service endpoint and identifies a connection to a particular target database. In some examples, the query request is a Hyper Text Transfer Protocol (HTTP) message comprising a query to be executed by a target database instance within the provider network. The service transmits the query for execution at the target database via the connection and obtains a query result based on the execution of the query. The service transforms the query result into a format suitable for the client and transmits a query response to the client.

SQL execution over HTTP for relational databases using connection pooling

Techniques for aggregating and emitting database activity record batches are described. Database activity records can be written to a shared memory queue and emitted to a destination using a remote procedure call (RPC). Individual database connection server processes can write client activity records to the queue. An activity monitor plugin in the database engine can monitor the audit records and aggregate the audit records into batches. Batches of audit records can be sent via RPC to their final or intermediate destination. Each instance host in a database service can include a client backend process configured to define how to submit audit records to shared memory. The activity monitor plugin can batch audit records in to messages and submit those messages via RPC to a security host manager and relaying response back to each relevant client backend.

Aggregating and emitting database activity record batches

Resources hosted in different virtualization platforms may be managed across the different virtualization platform. Requests to perform types of actions with respect to a resource hosted in a type of virtualization platform may be received. Mapping information between types of actions and actions available via interfaces for different types of virtualization platforms may be evaluated to select actions for an interface of the type of virtualization platform that hosts the resource. The selected actions may then be performed via the interface to perform the action with regard to the resource.

Managing hosted resources across different virtualization platforms

Abstract Syntax Trees (ASTs) are generated using the source code of a programming language that include information relating to the structure of the program. The generation of the ASTs may be performed in parallel. The types are split into a number of modules (e.g. configurable) that form an assembly. During the different stages of the compilation process, each module may be compiled in parallel. As the different modules are being compiled (e.g. in parallel), compiler metadata from the different modules may be written to a repository accessible by the different compilation processes. After flowing through the compilation pipeline, each of the enriched ASTs are used for code generation where they are transformed into the target language (e.g. a code stream that can be executed on hardware). The executable code is then stored as part of the assembly. The storage of the code may also be performed in parallel.

Deeply parallel source code compilation

A search system, separate from a relational database, generates an index of information in the relational database that can be used to look up business records (or entities). A search system, that is also separate from the relational database, receives typing or other character inputs in a search user input mechanism and generates queries against the index based on the typing inputs, or other character inputs, received. The search system returns results and modifies those results as additional typing inputs, or characters, are received.

Search-as-you-type on a relational database

Example embodiments are provided for integrating operating systems with content offered by internet based entities.

Integrating operating systems with content offered by web based entities

In one embodiment, an object in a database schema may be verified as having a valid digital signature associated with a trusted entity. An application may be permitted access to the object of the database schema only when the object of the database schema is verified to have a valid digital signature associated with the trusted entity. In another embodiment, an object in a database schema may be verified as having a digital signature associated with at least one trusted entity. An application may be permitted access to the object of the database schema only when the digital signature for the object is verified to be associated with the at least one trusted entity.

Schema signing

Computer-executable instructions that are directed to the performance of consequential actions and automatically elevate to execute at a higher privilege level to do so can perform such consequential actions only after user notification. Doing so can enable monitoring processes to avoid presenting duplicative user notification upon detection of such auto-elevation. In addition, prior to presenting user notification, input from the execution environment can be ignored and access to DLLs for performing consequential actions can be avoided. A static analyzer can identify non-conforming computer-executable instructions. A wrapper can be utilized to provide compliance by otherwise unknown or non-conforming computer-executable instructions.

Unobtrusive assurance of authentic user intent

A computer based system and method of providing document isolation during routing of a document through a workflow is disclosed. The method comprises maintaining a separate 'working' copy of the original base document while the document is routed through a workflow. Access controls, which define who may access the original document as well as any versions of the working copy document, are defined and stored in relation to the documents. The access controls further define the types of actions users may take with respect to the document. Users are selectively directed to the appropriate document, either the base document or working copy, and selectively granted permission to perform publishing operations on the working copy document, as determined by the access controls.

System and method for document isolation

This disclosure describes methods, systems and application programming interfaces for creating an advanced security negotiation package. This disclosure describes creating an advanced security negotiation protocol under a Simple and Protected Negotiation Mechanism (SPNEGO) protocol to negotiate an authentication scheme. The protocol describes defining a Windows Security Type (WST) Library message to protect negotiation data during the advanced security negotiation protocol. The protocol sends an initial message that carries multiple authentication messages to reduce redundant roundtrips and implements key exchanges by a mini Security Support Provider (SSP).

Advanced security negotiation protocol

A computer related security mechanism requires that a human participate in an access verification sequence. Upon a request to access secure data, a puzzle is provided to the requester. Proper solution of the puzzle requires human participation. The puzzle is chosen such that its solution is within the capabilities of a human, but beyond the current state of the art for computer systems. The puzzled can be visually and/or audibly rendered to the user. In one configuration, the puzzle is obtained via a library of pluggable puzzle generators. Puzzle generators in the library can be replaced as the state of the art of computing technology improves.

Secure data storage and retrieval incorporating human participation

Modern network communications often require a client application requesting data to authenticate itself to an application providing the data. Such authentication requests can be redundant, especially in the case of stateless network protocols. When a full authentication is performed, a conversation identifier and one or more encryption keys can be agreed upon. Subsequent authentication requests can be answered with a fast reconnect token comprising the conversation identifier and a cryptographically signed version of it using the one or more encryption keys. Should additional security be desirable, a sequence number can be established and incremented in a pre-determined or a random manner to enable detection of replayed fast reconnect tokens. If the recipient can verify the fast reconnect token, the provider can be considered to have been authenticated based on the prior authentication. If an aspect of the fast re-authentication should fail, recourse can be had to the original full authentication process.

Fast-reconnection of negotiable authentication network clients

Growing community of inventors

Sammamish, WA, United States of America

Tanmoy Dutta