Microsoft Technology Licensing, LLC

Cristian Petculescu

Amir Netz

Marius Dumitru

Mosha Pasumansky

Alexander Berger

Paul Jonathon Sanders

Richard R Tkachuk

Vasile Paraschiv

Ioan Bogdan Crivat

Thomas P Conlon

Akshai Mirchandani

Eran Megiddo

Daniel C Battagin

Shahar Prish

C James MacLennan

Irina Gorbach

Liviu Asnash

Thulusalamatom Krishnamurthi Anand

Adrian Dumitrascu

Radu C Coman

Bongshin Lee

Robert C Collie

Patrick John Baumgartner

Pedram Faghihi Rezaei

Raman S Iyer

Adam Donald Wilson

Greg R Smith

Matthew Carroll

Amy Nicole Forstrom

Diego M Oppenheimer

Rong Jian Guan

Thierry D'Hers

Andriy Garbuzov

Robert B Zare

Edward Melomed

Adrian Ilcu Predescu

Oleg G Lvovitch

Grzegorz Guzik

Matthew J Longley

Chu Xu

Valeri Kim

Sergei Gringauze

Allison Tran

Krystian Sakowski

Bogdan Crivat

Greg Smith

Matt J Longley

Example solutions read compressed data from a file in persistent storage, directly into an in-memory store without decompression. Some examples transcode the compression scheme used by the file into the compression scheme used by the in-memory store whereas, in other examples, the in-memory store is compatible with the compression scheme used by the file. In some examples that use transcoding, radix clustering is used to speed up compression dictionary transcoding. The radix clustering minimizes cache misses, thereby increasing the efficiency of memory access. These approaches significantly improve cold start times when responding to queries.

Reading compressed data directly into an in-memory store

A computer-navigable trie structure used in order to represent predicates for matching foreign keys to primary rows in a primary table. The predicates may be wide ranging, and each may be represented by a corresponding descendant path of the trie structure, and defines which foreign keys are to be mapped to the particular row. The trie structure is built by incrementally augmenting the trie structure as each predicate is analyzed. During later use of the trie structure, each foreign key that is a candidate for mapping to one or more parent rows are evaluated. The foreign key is used to navigate through a set of one or more descendant paths of the computer-navigable trie structure. Matching parent rows may then be identified based on the identity of the navigated descendant paths. The foreign key may then be mapped to each of the one or more matching parent rows.

Trie-structure formulation and navigation for joining

Implementing a database system using a plurality of sequentially ordered drives to store sequential portions of columns of the database, but where the database system is usable by a system configured for use with in-memory database systems. The method includes loading one or more columns of a database into main memory of a computing system as a table based database. The method further includes dividing a column of the database into sequential portions. Each of the sequential portions is of sufficient size to create efficient transfers using hard disk controllers to transfer an entire sequential portion. The method further includes writing each of the sequential portions sequentially onto sequentially ordered drives in a round robin fashion such that sequential portions of the column are on sequential drives.

Disk optimized paging for column oriented databases

Methods for efficient display of data points in a user interface are performed by systems and apparatuses. Efficient display of data point in a user interface includes maximizing coverage of data points prior to rendering. Coverage is determined using a radius value for represented data points in a data set. The radius may be increased to correspondingly generate additional coverage. Covered data points may be removed from the rendering subset as the radius is set and increased. The radius is increased until the number of represented data points to render is less than a threshold value. Multiple data sets may be efficiently rendered together.

Efficient display of data points in a user interface

Linking of a child table to a parent table in a database system. For a given parent table row, an expression associated with the particular row is identified. The expression may be a semantic expression that comprises something different than or more than an equals expression or a contains expression. The expression might also take as input a field of the parent table other than the primary key of the parent table. For each of multiple (and potentially all) rows of a child table, the expression is evaluated against a foreign key of the corresponding row of the child table. If the foreign key matches the expression, an association is created, and perhaps saved, between the foreign key and the particular row of the parent table. The expressions may differ even down to the granularity of a single row in the parent table, thereby enabling perhaps custom per-row expressions.

Rule-based joining of foreign to primary key

Reusing data in a memory. A method includes determining to revalidate a first set of data stored in a first, invalidated, portion of the memory. An amount of data in a second set of data in the free portion of the memory that will also be revalidated by revalidating the first portion of the memory is determined. As a result, an action to perform is determined and performed. The action includes either revalidating the first portion of the memory if the amount of data in the second set of data is at or below a predetermined threshold or copying the first set of data in the first portion of the memory, and re-writing the first set of data to the active valid portion of the memory, if the amount of data in the second set of data is above the predetermined threshold.

Re-use of invalidated data in buffers

Performing a distributed data operation. A method includes receiving a request for one or more data operations from a first computing system, such as a client. The method further includes determining a number of node endpoints that can be used to satisfy the query. Based on the number of node endpoints, the method further includes selecting a plan from the group consisting essentially of a flat data operation plan, a hierarchical data operation plan or a combination of partially flat/partially hierarchical data operation plan. The request for one or more data operations is serviced using the selected data operation plan.

Hierarchical organization for scale-out cluster

Reusing data in a memory buffer. A method includes reading data into a first portion of memory of a buffer implemented in the memory. The method further includes invalidating the data and marking the first portion of memory as free such that the first portion of memory is marked as being usable for storing other data, but where the data is not yet overwritten. The method further includes reusing the data in the first portion of memory after the data has been invalidated and the first portion of the memory is marked as free.

The creation and updating of an association index that defines a linking between a child table and a parent table in a database system, and in which each of at least some of the parent table rows have an associated expression defining rules for mapping child table rows to the associated parent table row. The association index may be constructed with one pass of the parent table by evaluating the mapping definition to identifying associated child table rows. If there are such associations for a given parent table row, the linking module may record that association in an association index. If there are changes made that potentially invalidate an association status (whether an association or lack thereof), a re-evaluation module then determines which mapping definitions for which parent rows need to be re-evaluated, and potentially for which child table rows, rather than perform the entire process again.

Association index linking child and parent tables

The description relates to an interactive digital display. One example includes a display device configured to receive user input and recognize commands relative to data visualizations. The system also includes a graphical user interface configured to be presented on the display device that allows users to interact with the data visualizations via the user commands.

Interactive digital displays

Growing community of inventors

Redmond, WA, United States of America

Cristian Petculescu