Microsoft Technology Licensing, LLC

Amazon Technologies, Inc.

Yaron Burd

Andrei Paduroiu

Patrick James Helland

Jingren Zhou

Yan Yan

Jonathan A Forbes

Omid Afnan

Jiahui Wang

A distributed database keeps an abstract syntax tree (AST) and an included user code from interacting with a query engine coordinator during the performance of query execution processes. The query engine coordinator is separated into a frontend and backend, where a compiler on the frontend generates an AST and serializes it to be sent to the backend. The backend is implemented in a security environment separate from the front end. The backend deserializes the AST, sanitizes it, and generates a query plan based on the sanitized AST.

Secure query processing

A distributed database keeps user-defined functions separate from a query engine by using a frontend. The frontend allows a user-defined function to interact with a proxy application processing interface (API) that is based on an API of the query engine. The frontend sends serialized data to the query engine in order to interact with the API of the query engine. The user-defined function is executed in security environments separate from the frontend and the query engine.

Comparing recurring processes. A method includes automatically identifying a plurality of recurring process instances having one or more commonalities. The method further includes displaying the plurality of recurring process instances having one or more commonalities to a user in a user interface. The method further includes receiving user input at the user interface selecting a first recurring process instance from the plurality of recurring process instances. The method further includes receiving user input at the user interface selecting a second recurring process instance from the plurality of recurring process instances. The method further includes automatically identifying differences in the first and second recurring process instances. The method further includes presenting the differences in the graphical user interface to the user.

Analysis of recurring processes

Embodiments of the present invention relate to systems, methods, and computer-storage media for affinitizing datasets based on efficient query processing. In one embodiment, a plurality of datasets within a data stream is received. The data stream is partitioned based on efficient query processing. Once the data stream is partitioned, an affinity identifier is assigned to datasets based on the partitioning of the dataset. Further, when datasets are broken into extents, the affinity identifier of the parent dataset is retained in the resulting extent. The affinity identifier of each extent is then referenced to preferentially store extents having common affinity identifiers within close proximity of one other across a data center.

Growing community of inventors

Bellevue, WA, United States of America

Yaron Burd