Microsoft Technology Licensing, LLC

Microsoft Corporation

Conor J Cunningham

Eric N Hanson

Stefano Stefani

Cesar Alejandro Galindo-Legaria

Ramachandran Venkatesh

Florian Michael Waas

Craig Steven Freedman

Milind Madhukar Joshi

Tanmoy Dutta

Panagiotis Antonopoulos

Beysim Sezgin

Girish Chander

Michael James Zwilling

Alexandre Olegovich Verbitski

Ajay Kalhan

Tomas Talius

Alan D Halverson

Jose A Blakeley

Aleksandras Surna

Erik Ismert

Raghav Kaushik

Wei Yu

Thierry Fevrier

Oliver Nicholas Seeliger

Raul Garcia

Santeri Olavi Voutilainen

Stanislav A Oks

Bruno H M Denuit

Kwanghyun Park

Jack Smith Richins

Balaji Rathakrishnan

Denis Y Altudov

Karthik Saligrama Ramachandra

Yixue Zhu

Dragan Tomic

Denis Churin

Jeffrey A East

Jakub J Szymaszek

Igor Ilic

Clifford T Dibble

Petar Lotrean

Vukasin Jovic

Dejan Dundjerski

Mladen Pantic

Stefan Lazic

Veljko Vasic

Jovan Cukalovic

Kameswara Venkatesh Emani

Djordje Petrovic

Balaji Rathakrishan

Ramachandron Venkatesh

Computing resource management is improved during fast sorting using vector instructions. The process includes: determining a pivot value and a pivot position in a data set (e.g., by sampling with vectors and determining the sample median), determining whether moving data in the sampled portion may be avoided (e.g., if it is constant-valued or already sorted) and, leveraging that determination to possibly avoid unnecessary data movement, sorting the data set. Some examples further determine the microarchitecture version of the computing device performing the sorting and select an implementation of sorting instruction that is tuned for that microarchitecture version (e.g., based on the number of vector registers and motherboard cache configuration). Some examples leverage a soft 3-way quicksort by finding data elements adjacent to the pivot position that also have the pivot value and adding a partition boundary at the end of the set of same-valued data elements.

Computing resource management with fast sorting using vector instructions

Methods for asynchronously determining relational data integrity using cryptographic data structures are performed by systems and devices. Changes in current tables of relational databases are reflected in associated history tables. Cryptographic hybrid blockchain ledgers are updated with transaction records, for entry changes in current and history tables, including transaction information and hash values of corresponding entry changes. Hybrid blockchain ledgers also include root hash values of Merkle trees of transaction records in current blocks, and hash values of prior blocks. A current block receipt is asynchronously generated and provided as a single hash value from which the validity states of the tables and ledger are able to be verified. Cryptographic receipts of specific transactions reflected in table entry changes are generated and provide immutable evidence of specific transaction existence for users. Ledger-enabled tables are provided for mixed database operations with ledger-disabled tables, and temporal history table database operations are enabled.

Asynchronously determining relational data integrity using cryptographic data structures

Database systems are subject to automatic troubleshooting. Query execution data for individual queries executed by a database system can be collected. The query execution data can be evaluated automatically in conjunction with one or more detection metrics to determine whether or not a potential performance issue exists. After detection of a potential issue, the query execution data can be analyzed further to determine one or more causes by matching query execution data to one or more patterns that encode candidate causes. Subsequently, a root cause amongst multiple causes is determined based on causal dependency. Corrective action associated with a root cause can also be determined and optionally applied automatically.

Automatic database troubleshooting

Processing a database query. A method includes receiving a database query from a user. The database query includes one or more imperative functions. The one or more imperative functions are converted to one or more declarative query representations. The one or more declarative query representations include standardized relational operators included in a relational query language. Further, the one or more declarative query representations are optimizable by a query optimizer of the database. The database query is optimized at the query optimizer to create a query plan by evaluating any declarative query representation originally in the database query received from the user and the one or more declarative query representations.

Method for optimization of imperative code executing inside a relational database engine

A system and method of enabling row level security through security policies is disclosed herein. In this system and method, a computing device may be communicatively coupled to a storage device. The computing device may further be activated and maintain data that comprises a plurality of rows. When executed by the computing device, the system and method may process a data definition language statement comprising a security policy definition. Further, the system and method may receive a query language statement comprising a request to access a first column of a row from the plurality of rows. The system and method may process the request and determine if access may be granted to a user based on the security policy definition in the system.

Row level security

Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record and a deleted version of the data store record in the case of a delete in the data store. The instance of the data store operation statement is correlated with the new version of the data store record or the deleted version of the data store record.

Halloween protection in a multi-version database system

Embodiments are directed to providing distributed database service upgrades of database server instances in a computer cluster using multiple database server instances and to monitoring and maintaining a distributed database service during upgrade. In an embodiment, each computer system in a computer cluster instantiates at least two different database server instances on each of the nodes in the cluster. The first database server instances are configured to operate using a current distributed database version and the second instances are configured to operate using a new, updated distributed database service version. The computer system receives an indication that the distributed database service is to be upgraded. Then, based on the received indication, the computer system migrates database replicas from the first database server instances to the second database server instances which operate the new, updated service version, substantially without user-visible downtime.

Seamless upgrades in a distributed database system

Database management systems allow modification of existing table rows through update statements or other data modification commands. For example, a user may specify, via a command statement, the table to update, the columns to modify and their respective new value(s), and qualify the rows to be updated. Optimized constraint and index maintenance for data modification statements and commands is provided where the new value being assigned to the columns is actually the same as the current value, e.g., update commands that actually leave the columns unchanged.

Optimized constraint and index maintenance for non updating updates

The claimed subject matter provides a system and/or a method that facilitates paging and/or cursoring over the results of a query associated with a file storage system. An interface component can receive the query targeted to the file storage system including at least one key that relates to data. A query component can enable cursoring over a query operation on a query result utilizing the key in order to provide an extended set of query operators.

Efficient querying and paging in databases

Implementations of various technologies for compiling a query. In one implementation, the memory consumption of the query may be monitored. If the amount of memory consumed by the query exceeds one or more gateway thresholds, then the query may be processed to acquire one or more gateways. The query may then be compiled as having acquired the one or more gateways.

Optimization of performing query compilations

The present invention describes an efficient and fast framework for implementing table-valued functions (TVF's) in a relational database server. The framework provides desirable extensibility properties and has the ability to minimize performance degradations by integrating tightly with the optimization infrastructure in a query processor. The present invention also enables a managed execution environment (MEE) such as the Common-Language-Runtime (CLR), to efficiently and dynamically extend the logic of the database engine with user-supplied code.

System and method for efficient evaluation of a query that invokes a table valued function

A system and method for facilitating secure access to database(s) is provided. The system relates to authorizing discriminatory access to relational database data. More particularly, the invention provides for an innovative technique of defining secured access to rows in relational database tables in a way that cannot be spoofed while preserving various optimization techniques. The invention affords a persistent scheme via providing for a security architecture whereby discriminatory access policies on persistent entities can be defined and enforced while preserving set based associative query capabilities. A particular aspect of the invention relates to the specification of such policies and the technique by which those policies are enforced. With respect to one particular implementation of the invention, creation, modification and deletion of access control lists called security descriptors is provided. The security descriptors can be provisioned independent of rows in tables of the database and can be shared and embody the policy on what permissions are granted to whom when associated with a row.

Systems and methods for fine grained access control of data stored in relational databases

Efficient hierarchical searching is based on object type. By pre-computing additional information and storing it in a fast-lookup structure, it is possible to quickly identify objects that satisfy an object retrieval request. Furthermore, it is also possible to use this technique to avoid object hydration for operations in the store. Moreover, it is possible to leverage database statistical structures such as histograms to estimate the number of qualifying objects without having to examine each object.

Type path indexing

Growing community of inventors

Redmond, WA, United States of America

Conor J Cunningham