Microsoft Technology Licensing, LLC

Other

Amir Netz

Cristian Petculescu

Mosha Pasumansky

Marius Dumitru

Alexander Berger

Paul Jonathon Sanders

Richard R Tkachuk

Patrick John Baumgartner

Pedram Faghihi Rezaei

Vasile Paraschiv

Akshai Mirchandani

Vijay Mital

Darryl Ellis Rubin

Bongshin Lee

Olivier Colle

Suraj T Poozhiyil

Howard J Dickerman

Andrew Douglas Reddish

Thomas P Conlon

Christian Beaumont

Yutong (Jeffrey) Wang

Steven Nabil Bathiche

Kenneth Paul Hinckley

Anoop Gupta

Desney S Tan

Brett David Brewer

Christopher Alan Hays

Eran Megiddo

Ioan Bogdan Crivat

Andrew James Peacock

Christina Storm

Cheryl Couris

Ronald O Pessner

Giovanni Moises Della-Libera

Daniel C Battagin

Shahar Prish

Zhaohui Tang

Kevin Grealish

David John Nettleton

Irina Gorbach

Liviu Asnash

Adam Donald Wilson

Michael Justin Flasko

Scott Conrad Oveson

Mark Wade Heninger

Rong Jian Guan

Chiu Ying Cheung

Thierry D'Hers

Paula M Bach

Nigel Christopher WIlliam Wolters

Grzegorz Guzik

Cristain Petculescu

Radu C Coman

Sonia P Carlson

David Earl Heckerman

Christopher A Meek

Robert L Rounthwaite

Robert C Collie

Chairy Chiu Ying Cheung

D Maxwell Chickering

Greg R Smith

Matthew Carroll

Yoav Yassour

Diego M Oppenheimer

Amy Nicole Forstrom

Donald Munro Farmer

Adrian Dumitrascu

Yifat Sagiv

Pedro Ardila

Robert B Zare

Edward Melomed

Yury Berezansky

Adrian Ilcu Predescu

Oleg G Lvovitch

Ovidiu Burlacu

Ran Didi

Matthew J Longley

Kenneth Kwok

Marin Bezic

Moshe Golan

Cristian Petrulescu

Oded Bar Levy

Krystian Sakowski

Allison Tran

Bogdan Crivat

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

Methods and systems are disclosed for receiving and processing data analysis expressions. A particular method includes receiving a data analysis expression at a pivot table of a spreadsheet. The data analysis expression is executed for a particular cell of the pivot table by determining a context associated with the particular cell, calculating a value of the data analysis expression based on the context, and outputting the calculated value at the particular cell.

Data analysis expressions

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

A scalable analysis system is described herein that performs common data analysis operations such as distinct counts and data grouping in a more scalable and efficient manner. The system allows distinct counts and data grouping to be applied to large datasets with predictable growth in the cost of the operation. The system dynamically partitions data based on the actual data distribution, which provides both scalability and uncompromised performance. The system sets a budget of available memory or other resources to use for the operation. As the operation progresses, the system determines whether the budget of memory is nearing exhaustion. Upon detecting that the memory used is near the limit, the system dynamically partitions the data. If the system still detects memory pressure, then the system partitions again, until a partition level is identified that fits within the memory budget.

Processing records in dynamic ranges

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

The modifying of a natural language interpretation model for interpreting natural language queries. The system discovers modifications that one or more queriers made to one or more original query results of one or more natural language queries to generate one or more modified query results. The system then uses the discoveries to identify one or more changes to a natural language interpretation model that would result (given the same natural language queries) in one or more query results that more accurately reflect the one or more modified query results. The system the causes the natural language interpretation model to be modified with at least one of the one or more identified changes. Accordingly, over time, the natural language interpretation model may learn from observations of its own performance.

Observation-based query interpretation model modification

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

The description relates to a shared digital workspace. One example includes a display device and sensors. The sensors are configured to detect users proximate the display device and to detect that an individual user is performing an individual user command relative to the display device. The system also includes a graphical user interface configured to be presented on the display device that allows multiple detected users to simultaneously interact with the graphical user interface via user commands.

User interface for collaborative efforts

Mismatches between schema elements of a data set and a job are identified automatically. Furthermore, the mismatches can be presented visually in conjunction with an interactive visual workspace configured to support diagrammatic authoring of data transformation pipelines. After a data set is connected to a job, one or more mismatches can be determined and presented in context with the workspace. In addition, schema elements can be reconfigured by way of interaction with a visual representation of schema elements to resolve mismatches.

Automatic schema mismatch detection

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

Presenting data from different data providers in a correlated fashion. A first query is performed on a first data set controlled by a first entity to capture a first set of data results. Then a second query is performed on a second data set controlled by a second entity to capture a second set of data results. A relationship ontology that correlates data stored in different data stores controlled by different entities is then consulted to identify one or more relationships between data in the selected results set and the second data set.

Cross-model filtering

Job execution can be scheduled and monitored. Execution of a job results in generation of one or more data slices, which can be consumed as input by one or more related jobs. Data slices can be presented in an interactive view. Selection of a data slice in the view can trigger automatic identification of related data slices based on dependencies between data slices. Each data slice can also include and be presented with a status indicating the availability of corresponding data, such as pending, ready, or failed. Furthermore, selection of a data slice that failed to generate successfully can trigger identification of related data slices that failed or are predicted to fail to generate successfully.

Job scheduling and monitoring in a distributed computing environment

Generating a user interface visualizing a table data structure. A table data structure comprising a plurality of rows and a plurality of columns is accessed. A column to use for sorting each row into a different region of the user interface is identified. Region characteristics, usable for matching which row(s) is to be visualized within a corresponding region, are identified. Each region is associated with a different subset of row(s) that are to be visualized within the region. Each subset comprises rows having a value that matches the region characteristics of the associated region at an intersection between the column and the row in the table data structure. A visual representation of each row is displayed within the user interface. The display includes a visual arrangement of each visual representation into a corresponding region. Each visual representation is arranged within the region the row associated with the visual representation belongs.

User interface technology for displaying table data

The present invention extends to methods, systems, and computer program products for using cinematic techniques to present data. Embodiments of the invention can be used to infer and generate cinematic techniques or combinations thereof based on a model and user action. Cinematic techniques can be used to meet the data exploration and analysis requirements of a user. As such, embodiments of the invention permit users (including non-programmers) to employ cinematic techniques (possibly in combination with other techniques) to gain insights into their data and also convey appropriate emotional messages.

Using cinematic techniques to present data

Growing community of inventors

Bellevue, WA, United States of America

Amir Netz