Patents by Inventor Marius Dumitru

Marius Dumitru has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11366960
    Abstract: 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.
    Type: Grant
    Filed: August 3, 2020
    Date of Patent: June 21, 2022
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Howard J. Dickerman, Marius Dumitru, Akshai Mirchandani, Yutong (Jeffrey) Wang, Amir Netz, Paul J. Sanders
  • Patent number: 11036717
    Abstract: 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.
    Type: Grant
    Filed: May 7, 2018
    Date of Patent: June 15, 2021
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz
  • Publication number: 20210019472
    Abstract: 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.
    Type: Application
    Filed: August 3, 2020
    Publication date: January 21, 2021
    Inventors: Howard J. DICKERMAN, Marius DUMITRU, Akshai MIRCHANDANI, Yutong (Jeffrey) WANG, Amir NETZ, Paul J. SANDERS
  • Patent number: 10846289
    Abstract: In various embodiments, methods and systems for cross-filtering based on configurable direct relationships are provided. A selection of a first endpoint of a first table and a second endpoint of a second table is received. A direct relationship object is configured between the first table and the second table based on the first endpoint and the second endpoint. A cross-filtering direction and endpoint cardinality settings can also be configured for the direct relationship object. The direct relationship object may be configured as a many-to-one, one-to-many, or one-to-one. Automatic cross-filtering is configurable and can be set to cross-filter in one direction, the reverse direction, or both directions, with bidirectional cross filtering being a default configuration. The direct relationship object between the first endpoint and the second is configurable, such that, cross-filtering the first table and the second table to select rows for cross-filtering results is based on the cross-filtering direction.
    Type: Grant
    Filed: February 20, 2018
    Date of Patent: November 24, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Yutong Wang, Anand Bheemarajaiah, Xiaoqing Tang, Srinivasan S. Turuvekere, Howard J. Dickerman, Marius Dumitru
  • Patent number: 10803638
    Abstract: 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.
    Type: Grant
    Filed: July 3, 2019
    Date of Patent: October 13, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Radu C. Coman, Amir M. Netz
  • Patent number: 10762289
    Abstract: 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.
    Type: Grant
    Filed: May 11, 2017
    Date of Patent: September 1, 2020
    Inventors: Howard J. Dickerman, Marius Dumitru, Akshai Mirchandani, Yutong (Jeffrey) Wang, Amir Netz, Paul J. Sanders
  • Patent number: 10635673
    Abstract: 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.
    Type: Grant
    Filed: February 14, 2018
    Date of Patent: April 28, 2020
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz, Paul Jonathon Sanders
  • Patent number: 10565232
    Abstract: Various technologies pertaining to construction of a query for execution over a cube are described. Tabular data is presented on a displayed on a display screen, where the tabular data represents at least a portion of a data cube. Input is received with respect to the tabular data, and responsive to the input being received, a query is constructed based upon the input. The query is executed over the data cube, resulting in provisioning of a new table.
    Type: Grant
    Filed: February 21, 2017
    Date of Patent: February 18, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Gregory Hughes, Michael J. Coulson, Alexandre Tristan St-Cyr, Faisal Mohamood, Theresa Palmer-Boroski, Clemens Szyperski, Marius Dumitru
  • Publication number: 20190325625
    Abstract: 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.
    Type: Application
    Filed: July 3, 2019
    Publication date: October 24, 2019
    Inventors: Cristian Petculescu, Marius Dumitru, Radu C. Coman, Amir M. Netz
  • Patent number: 10388042
    Abstract: 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.
    Type: Grant
    Filed: January 15, 2018
    Date of Patent: August 20, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Radu C. Coman, Amir M. Netz
  • Publication number: 20190065563
    Abstract: 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.
    Type: Application
    Filed: January 15, 2018
    Publication date: February 28, 2019
    Inventors: Cristian Petculescu, Marius Dumitru, Radu C. Coman, Amir M. Netz
  • Patent number: 10102243
    Abstract: A relationship amongst multiple relationships between database tables can be specified independent of a query. More specifically, a function (USERELATIONSHIP) can be introduced to the DAX language (Data Analysis Expressions), which provides a way to author formulas that are not evaluated immediately, but that can be evaluated dynamically and concurrently in many different contexts. The function enables a single relationship to be specified in the calculation formula away from the query. This provides a mechanism within the formula that specifies specific relationship(s) that are to be followed when the dynamic expression is evaluated.
    Type: Grant
    Filed: April 20, 2016
    Date of Patent: October 16, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Howard Dickerman, Vjacheslav Min, Marius Dumitru
  • Publication number: 20180253466
    Abstract: 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.
    Type: Application
    Filed: May 7, 2018
    Publication date: September 6, 2018
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz
  • Publication number: 20180173752
    Abstract: In various embodiments, methods and systems for cross-filtering based on configurable direct relationships are provided. A selection of a first endpoint of a first table and a second endpoint of a second table is received. A direct relationship object is configured between the first table and the second table based on the first endpoint and the second endpoint. A cross-filtering direction and endpoint cardinality settings can also be configured for the direct relationship object. The direct relationship object may be configured as a many-to-one, one-to-many, or one-to-one. Automatic cross-filtering is configurable and can be set to cross-filter in one direction, the reverse direction, or both directions, with bidirectional cross filtering being a default configuration. The direct relationship object between the first endpoint and the second is configurable, such that, cross-filtering the first table and the second table to select rows for cross-filtering results is based on the cross-filtering direction.
    Type: Application
    Filed: February 20, 2018
    Publication date: June 21, 2018
    Inventors: Yutong WANG, Anand BHEEMARAJAIAH, Xiaoqing TANG, Srinivasan S. TURUVEKERE, Howard J. DICKERMAN, Marius DUMITRU
  • Publication number: 20180173766
    Abstract: 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.
    Type: Application
    Filed: February 14, 2018
    Publication date: June 21, 2018
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz, Paul Jonathon Sanders
  • Patent number: 9977812
    Abstract: 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.
    Type: Grant
    Filed: January 30, 2015
    Date of Patent: May 22, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz
  • Patent number: 9922081
    Abstract: In various embodiments, methods and systems for cross-filtering based on configurable direct relationships are provided. A selection of a first endpoint of a first table and a second endpoint of a second table is received. A direct relationship object is configured between the first table and the second table based on the first endpoint and the second endpoint. A cross-filtering direction and endpoint cardinality settings can also be configured for the direct relationship object. The direct relationship object may be configured as a many-to-one, one-to-many, or one-to-one. Automatic cross-filtering is configurable and can be set to cross-filter in one direction, the reverse direction, or both directions, with bidirectional cross filtering being a default configuration. The direct relationship object between the first endpoint and the second is configurable, such that, cross-filtering the first table and the second table to select rows for cross-filtering results is based on the cross-filtering direction.
    Type: Grant
    Filed: June 11, 2015
    Date of Patent: March 20, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Yutong Wang, Anand Bheemarajaiah, Xiaoqing Tang, Srinivasan S. Turuvekere, Howard J. Dickerman, Marius Dumitru
  • Patent number: 9916357
    Abstract: 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.
    Type: Grant
    Filed: June 27, 2014
    Date of Patent: March 13, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz, Paul Jonathon Sanders
  • Patent number: 9892143
    Abstract: 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.
    Type: Grant
    Filed: February 4, 2015
    Date of Patent: February 13, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Cristian Petculescu, Marius Dumitru, Vasile Paraschiv, Amir Netz
  • Publication number: 20180032498
    Abstract: 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.
    Type: Application
    Filed: May 11, 2017
    Publication date: February 1, 2018
    Inventors: Howard J. Dickerman, Marius Dumitru, Akshai Mirchandani, Yutong (Jeffrey) Wang, Amir Netz, Paul J. Sanders