Microsoft Technology Licensing, LLC

Snowflake Inc.

Rodger N Kline

Nigel Robin Ellis

Istvan Cseri

Igor A Zinkovsky

Elliott Brossard

Srilakshmi Chintala

Nitya Kumar Sharma

Srikanth Avadhanam

Campbell Bryce Fraser

Maxim Mazeev

James Robert Hamilton

Wei Xiao

Goetz Graefe

Balan Sethu Raman

Tanmoy Dutta

Sameet Harishanker Agarwal

Michael W Thomas

Girish Chander

Lijiang Fang

Sanjay Anand

Anurag Gupta

Srinivasmurthy P Acharya

Ganapathy Subramaniam Krishnamoorthy

Laurentiu Bogdan Cristofor

Sambavi Muthukrishnan

Yanbiao Zhao

Ramesh Nagarajan

Amit Shukla

Mahadevan Venkatraman

Salome Jacob

Joseph Trdinich

Sameet H Argawal

Roopali Kaujalgi

An external function system can be implemented on a database to perform processing on one or more external network services. The external function system can comprise a particular external function for a particular external service, an outbound serializer function, and an inbound serializer function that are linked with the particular external function. The outbound serializer function can be configured to transform the data of a query from a database format to a different format of the particular external network service. The inbound deserializer function can be configured to receive data returned from the external service and transform the data to the format of the database.

Processing external functions using user-defined functions (UDFs)

Extending database external functions with user-defined functions

To provide data from a database in response to an application query, the database is queried an initial time to provide a first set of data. For example, a 'fast first page' may be requested, by requesting that all data which might appear on a first page to be displayed is obtained from the database first. After this, one or more subsequent asynchronous queries obtain the remaining information responsive to the query. Or, certain columns from the database ('spine columns') may be requested in the initial query of the database, and the rest of the data requested subsequently. Thus, information needed to make an initial presentation to a user can be obtained first, and other information filled in subsequently.

Fast rich application view initiation

The systems and methods of the present invention facilitate database row-level security by utilizing SQL extensions to create and associate named security expressions with a query initiator(s). Such expressions include Boolean expressions, which must be satisfied by a row of data in order for that data to be made accessible to the query initiator. In general, a query is augmented with security expressions, which are aggregated and utilized during querying rows of data. The systems and methods variously place security expressions within a query in order to optimize query performance while mitigating information leaks. This is achieved by tagging security expressions as special and utilizing rules of predicate to pull or push non-security expressions above or below security expressions, depending on the likelihood of a non-security being safe, as determined via a static and/or dynamic analysis.

Systems and methods that optimize row level database security

A system for automatic statistics creation comprises a query optimizer which automatically generates statistics derived from data in a database and selects an executable procedure from a plurality of procedures that operate on data in a database using the automatically generated statistics. A counter is maintained of updates made to each statistic that has been automatically generated. If the counter breaches a threshold, the automatically generated statistic is removed from the database.

Automatic database statistics creation

A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

System and method for using a compressed trie to estimate like predicates

Rich structured data for items in a file system that allows different kinds of data to be identified by metadata is mapped into a set of search properties for a desktop search service, which is a flat list. This is applicable to any rich structured data that should be mapped into search properties for a desktop search service. Included is an installation mechanism to install these mappings and an execution infrastructure for utilizing the generated SQL from the mappings to extract search properties from items.

Defining and extracting a flat list of search properties from a rich structured type

A base table is scanned with a delete marker and an insert marker. The delete marker identifies a last change committed to the base table as part of a transaction prior to execution of a statement, and the insert marker identifies a last change committed to base table as part of the transaction during execution of the statement. The results of the delete marker scan are filtered with deletions stored in a delta table, and a delete table is populated with the filtered rows. The results of the insert scan are filtered with insertions stored in the delta table, and an insert table is populated with the filtered rows.

System and method for identifying and storing changes made to a table

A method for preventing Halloween problem conflicts when updating records in a database system is disclosed. According to the method, in response to an update query, possible update plans are generated, and the most efficient one of the possible update plans is selected. Records in the database are thereafter processed in accordance with the selected update plan such that the records are free from Halloween problem conflicts.

System for halloween protection in a database system

Growing community of inventors

Woodinville, WA, United States of America

Rodger N Kline