Patents by Inventor Mosha Pasumansky
Mosha Pasumansky 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).
-
Publication number: 20060010139Abstract: A system that facilitates analyzing content of a multi-dimensional structure comprises a calculation component that receives statements in a declarative language relating to one or more of an assignment and calculation and executes such statements against a multi-dimensional structure. A pass generation component creates a pass in order to maintain content of the multi-dimensional structure as it existed prior to execution of the statement, the pass is accessible upon reference to such pass.Type: ApplicationFiled: March 1, 2005Publication date: January 12, 2006Applicant: Microsoft CorporationInventors: Amir Netz, Marius Dumitru, Mosha Pasumansky, Cristian Petculescu, Richard Tkachuk, Alexander Berger
-
Publication number: 20060010113Abstract: The subject invention pertains to systems and methods for interacting with fact dimensions. In particular, systems and methods are disclosed that optimize performance and scalability with respect to processing queries that involve fact dimensions. Furthermore, queries involving fact dimensions can be evaluated in distinct manners. For instance, queries can be processed such that regular dimensions restrict the scope of the data and only fact dimension members that are relevant to that scope are exposed.Type: ApplicationFiled: May 24, 2005Publication date: January 12, 2006Applicant: Microsoft CorporationInventors: Alexander Berger, Edward Melomed, Amir Netz, Cristian Petculescu, Akshai Mirchandani, Mosha Pasumansky, Marius Dumitru, Richard Tkachuk
-
Publication number: 20060010114Abstract: The subject invention pertains to interaction with multidimensional data. More specifically, interactions can be constrained to a limited subset of a multidimensional data cube, namely a subcube. Subsequent to or concurrently with subcube creation, query execution or other interactions such as calculations can be consolidated or restricted to the smaller subcube query space rather than the typically enormous main cube. Multiple subcubes can also be created and nested to gradually reduce the query space. Deletion of one subcube can cause a reversion back to a previously defined or hierarchical parent subcube.Type: ApplicationFiled: May 25, 2005Publication date: January 12, 2006Inventors: Marius Dumitru, Amir Netz, Mosha Pasumansky, Cristian Petculescu, Richard Tkachuk, Paul Sanders
-
Publication number: 20060010164Abstract: The subject invention pertains to a centralized key performance indicator (KPI) framework and systems and methods of utilization. In particular, KPIs can be defined and centrally stored as data or metadata in a data store. Systems and methods are provided to enable, among other things, KPI definition, storage, identification of defined or available KPIs, and interaction with the KPIs. For instance, an interface is provided to allow KPI data to be requested and retrieved from a source such as a database. A generic application program or users thereof can then interact with and display KPI data without knowing anything a priori about the stored data or the structure thereof.Type: ApplicationFiled: February 3, 2005Publication date: January 12, 2006Applicant: Microsoft CorporationInventors: Amir Netz, Robert Zare, Mosha Pasumansky, Irina Gorbach, Cristian Petculescu, Thierry D'Hers
-
Publication number: 20060010156Abstract: A system that facilitates generating a report based upon data within a relational database comprises a mapping component that utilizes mapping functions to associate a multi-dimensional structure with the relational database. A report generator communicates with the multi-dimensional structure to obtain data relating to the relational database and generates a report that includes the obtained data. For example, the mapping component can utilize measure groups to effectuate the association between the multi-dimensional structure and the relational database.Type: ApplicationFiled: March 1, 2005Publication date: January 12, 2006Applicant: Microsoft CorporationInventors: Amir Netz, Richard Tkachuk, Cristian Petculescu, Mosha Pasumansky, Paul Sanders, Alexander Berger
-
Publication number: 20060010294Abstract: Maintaining data used for performing “what-if” analysis is disclosed. The systems and methods of the invention define an efficient mechanism allowing a user to specify how base values from a database are to be changed. The changes can be held in a local delta cache which is only exposed to a single user, leaving the base data unchanged. The changes can also be maintained in a write-back partition, which results in the changes being exposed to all clients of the database. Values in the write-back partition can be selectively rolled back if required.Type: ApplicationFiled: September 6, 2005Publication date: January 12, 2006Applicant: Microsoft CorporationInventors: Mosha Pasumansky, Amir Netz
-
Publication number: 20050182703Abstract: A simple interface may be provided that enables the user to define parameters for aggregation of a semi-additive measure. The interface may enable the user to designate a measure as a semi-additive measure and to pair the measure with an additive aggregation function. The interface may also enable the user to select non-additive dimensions and to pair each non-additive dimension with a corresponding aggregation function. One such aggregation function is a by account aggregation function, which enables each account in an account dimension to be aggregated across a corresponding non-additive dimension according to an associated account type.Type: ApplicationFiled: February 12, 2004Publication date: August 18, 2005Inventors: Thierry D'hers, Thomas Conlon, Mosha Pasumansky, Irina Gorbach, Alexander Berger
-
Publication number: 20050091246Abstract: Maintaining data used for performing “what-if” analysis is disclosed. The systems and methods of the invention define an efficient mechanism allowing a user to specify how base values from a database are to be changed. The changes can be held in a local delta cache which is only exposed to a single user, leaving the base data unchanged. The changes can also be maintained in a write-back partition, which results in the changes being exposed to all clients of the database. Values in the write-back partition can be selectively rolled back if required.Type: ApplicationFiled: November 24, 2004Publication date: April 28, 2005Applicant: Microsoft CorporationInventors: Mosha Pasumansky, Amir Netz
-
Publication number: 20040267799Abstract: A data model for accessing data in a relational database in an OLAP system utilizes a multiple-hierarchy dimension. The dimension includes a set of attributes. Each attribute is bound to a column in the relational database. A logical structure is defined, indicating the relationships between the attributes. Hierarchies are defined. Each hierarchy includes a sequence of attributes. A hierarchy provides a common drill-down path that a database user can utilize to access the database. A hierarchy can include a single attribute or a combination of attributes. Both the relationships between the attributes and the sequence of attributes in a hierarchy are defined independent of any restrictions associated with the database.Type: ApplicationFiled: June 24, 2003Publication date: December 30, 2004Inventors: Cristian Petculescu, Amir Netz, Mosha Pasumansky, Marius Dumitru, Alexander Berger, Paul Jonathon Sanders
-
Publication number: 20040225692Abstract: Maintaining data used for performing “what-if” analysis is disclosed. The systems and methods of the invention define an efficient mechanism allowing a user to specify how base values from a database are to be changed. The changes can be held in a local delta cache which is only exposed to a single user, leaving the base data unchanged. The changes can also be maintained in a write-back partition, which results in the changes being exposed to all clients of the database. Values in the write-back partition can be selectively rolled back if required.Type: ApplicationFiled: June 8, 2004Publication date: November 11, 2004Applicant: Microsoft CorporationInventors: Mosha Pasumansky, Amir Netz
-
Patent number: 6766325Abstract: Maintaining data used for performing “what-if” analysis is disclosed. The systems and methods of the invention define an efficient mechanism allowing a user to specify how base values from a database are to be changed. The changes can be held in a local delta cache which is only exposed to a single user, leaving the base data unchanged. The changes can also be maintained in a write-back partition, which results in the changes being exposed to all clients of the database. Values in the write-back partition can be selectively rolled back if required.Type: GrantFiled: December 2, 1999Date of Patent: July 20, 2004Assignee: Microsoft CorporationInventors: Mosha Pasumansky, Amir Netz
-
Publication number: 20040015471Abstract: A system and method for analytically modeling data in a data cube is disclosed. A first dimension of the data cube is modeled according to a first table having a referencing attribute. A second dimension of the data cube is modeled according to a second table having a referenced attribute. The first dimension is tied to the second dimension according to the referencing attribute and the referenced attribute.Type: ApplicationFiled: July 19, 2002Publication date: January 22, 2004Applicant: Microsoft CorporationInventors: Amir Netz, Cristian Petculescu, Mosha Pasumansky, Alexander Berger
-
Publication number: 20040015472Abstract: A system and method for analytically modeling data organized according to non-referred attributes is disclosed. Data stored in a first and a second relational data table is analytically modeled in a data cube. The first table organizes a first type according to a first attribute. The second table organizes a second type according to the first attribute and a second attribute. A first measure is modeled according to the first type of the first table. A first dimension is modeled according to the first attribute of the first and second tables. A second dimension is modeled according to the second attribute of the second table. The first measure is tied to the first dimension according to the first attribute of the first table to allow the first measure to be analyzed by the first dimension according to the first attribute. The first measure is tied to the second dimension by, for each entry of the first dimension, allocating the entry to each entry of the second dimension in a predetermined manner.Type: ApplicationFiled: July 19, 2002Publication date: January 22, 2004Applicant: Microsoft CorporationInventors: Amir Netz, Cristian Petculescu, Mosha Pasumansky, Richard R. Tkachuk, Alexander Berger
-
Publication number: 20040015513Abstract: A system and method for analytically modeling data from different measure groups onto a single cube are disclosed. The single cube preferably includes a first measure associated with a first measure group with a first set of corresponding dimensions. The single cube preferably also includes a second measure associated with a second measure group with a second set of corresponding dimensions. The single cube preferably also includes each dimension in both the first and second set of dimensions. Each measure is preferably tied to each corresponding dimension according to data in an underlying relational data table. Each measure is preferably tied to each non-corresponding dimension according to an approximation.Type: ApplicationFiled: June 25, 2003Publication date: January 22, 2004Applicant: Microsoft CorporationInventors: Cristian Petrulescu, Amir Netz, Mosha Pasumansky, Alexander Berger
-
Publication number: 20040015507Abstract: A system and method for analytically modeling data with related attributes is disclosed. A single dimension is used to provide data according to each of the related attributes, and, thus, may be said to play the role of each related attribute depending on a received query. The measure of the analytical data model is tied to the dimension according to both data attributes to allow the measure to be analyzed by the dimension according to both attributes.Type: ApplicationFiled: July 19, 2002Publication date: January 22, 2004Inventors: Amir Netz, Cristian Petculescu, Mosha Pasumansky, Richard R. Tkachuk, Alexander Berger, Paul J. Sanders
-
Patent number: 6493718Abstract: Systems, clients, servers, methods, and computer-readable media of varying scope are described in which, a data retrieval module of database client implements an aggressive caching scheme that seeks to predict what data cells will be needed to satisfy future queries. The data retrieval module applies an adaptive algorithm to dynamically determine the granularity of data to retrieve from a database server. The data retrieval module adaptively balances the benefit of satisfying future queries locally with the cost of retrieving larger data set from remote database server.Type: GrantFiled: October 15, 1999Date of Patent: December 10, 2002Assignee: Microsoft CorporationInventors: Cristian Petculescu, Alexander Berger, Amir Netz, Mosha Pasumansky
-
Patent number: 6477536Abstract: Systems and methods for creating and maintaining virtual cubes are disclosed. A virtual cube is a logical representation of a subset of the dimensions and measures of at least one physical cube maintained by an OLAP server. Metadata defines the mappings from the dimensions and measures of the virtual cube to the dimensions and measures of the physical cube. Client applications can manipulate the virtual cube as if it were a physical cube.Type: GrantFiled: June 22, 1999Date of Patent: November 5, 2002Assignee: Microsoft CorporationInventors: Mosha Pasumansky, Alexander Berger, Amir Netz
-
Patent number: 6473750Abstract: Systems, clients, servers, methods, and computer-readable media of varying scope are described in which, a database client applies an adaptive method to dynamically determines whether a particular request should execute on the client-side or the server-side of a client-server database system. In determining where a particular request should be executed, the database client analyzes the size of the data sets involved and the data flow generated by the data sets.Type: GrantFiled: October 15, 1999Date of Patent: October 29, 2002Assignee: Microsoft CorporationInventors: Cristian Petculescu, Amir Netz, Mosha Pasumansky, Alexander Berger
-
Patent number: 6460026Abstract: A method, apparatus, software and data structure is disclosed for more efficient mapping of three dimensional data to linear storage mediums. These embodiments provide that multidimensional space is divided into volumes based on the priority of levels of one or more dimensions. Spatial to linear mapping is then applied to the multidimensional data such that records in the same volume will be close to each other. According to another aspect, a data structure is provided wherein data from a multidimensional space is stored in a one-dimensional space in a storage medium in accordance with the above-described method.Type: GrantFiled: March 30, 1999Date of Patent: October 1, 2002Assignee: Microsoft CorporationInventor: Mosha Pasumansky
-
Patent number: 6446059Abstract: Creating and maintaining cell data records in a multidimensional database is disclosed using flexible dimension paths is disclosed. The systems and methods of the invention define an efficient mechanism to specify a cell's location within the multidimensional database where there are hierarchies of levels within a dimension. The flexible dimension path does not change when a member is moved from a first point to a second point on a dimension thereby avoiding the need to rebuild the OLAP database. The format used lends itself well to indexing, and also to creating aggregations of the cell data.Type: GrantFiled: June 22, 1999Date of Patent: September 3, 2002Assignee: Microsoft CorporationInventors: Alexander Berger, Amir Netz, Mosha Pasumansky