Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The subject invention relates to systems and methods that extend the network data access capabilities of mark-up language protocols. In one aspect, a network data modeling system is provided. The system includes a protocol component that employs a computerized mark-up language to facilitate data interactions between network components. An extension component operates with the protocol component to support the data transactions, where the extension component supplies various commands above standard network and database protocols. An object model is provided as a wrapper to the extensions in order to support various online and offline database development applications.

Abstract: A method, system, and apparatus are provided for exposing and utilizing workbook ranges as server data sources. The system includes a client computer capable of executing a spreadsheet application program for creating a workbook including a range that includes data objects. The workbook may be published to a server computer where the specified data objects are exposed as server data sources. The server computer allows client applications to discover and connect to the data objects contained within the workbook as server data sources.

Abstract: End-user specified insertion of elements into a database cache is disclosed. The systems and methods of the invention define an efficient mechanism allowing a user with knowledge of anticipated behavior of a database application program to specify cell data that is cached before it is required by the application program. The system determines an appropriate set of cell data to be cached that meets the end-users specification and that can be obtained with a minimum of round-trips to a database server. In a multidimensional database, the system determines a maximum depth level for each user specified dimension member set. A target set of dimension members is formed comprising the set of members at the maximum level that have a common ancestor member. The cell data representing the cross product of the target sets is then obtained and cached.

Abstract: A measure expression may include a relationship between measures defined by an arithmetic operation. A query may request a calculation of the measure expression over a selected range of attributes. The request may be processed by retrieving all rows comprising data within the selected range of attributes for each measure in the expression through a single access to an associated table.

Abstract: 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.

Abstract: The present invention leverages MOLAP performance for ROLAP objects (dimensions, partitions and aggregations) by building, in a background process, a MOLAP equivalent of that object. When the background processing completes, queries are switched from ROLAP queries to MOLAP queries. When changes occur to relevant relational objects (such as tables that define content of OLAP objects), an OLAP object is switched back to a ROLAP mode, and all relevant caches are dropped while, as a background process, a new MOLAP equivalent is created.

Abstract: The present invention leverages interrelationships of a relational schema by utilizing simplified analysis heuristics to define and build dimensional models automatically. A user can also participate interactively in both the definition and building processes to influence an outcome. The relational schema is comprised of relational databases and the like. The dimensional models are comprised of OLAP objects and the like such as ROLAP and MOLAP objects. A means is also provided for allowing a user to initiate via a single user action, such as a single computer mouse click, defining a dimensional model, building a dimensional model, and/or both defining and building a dimensional model.

Abstract: Systems, clients, servers, methods, and computer-readable media of varying scope are described in which, two extensions for a multidimensional database query language extensions, AddCalculatedMembers and StripCalculatedMembers, allow an OLAP client to easily control the integration of calculated members into the results of OLAP database queries. The OLAP client need not be aware of the details of which calculated members are defined within the multidimensional database and need not explicitly request the inclusion or removal of each calculate member from the output data set of the query.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method, apparatus, and software are disclosed for analyzing the data in an OLAP or other type of database. The data is analyzed as if it were indexed by desired dimensions without actually creating the dimensions. Relations known as virtual dimensions are defined in relation to existing base dimensions in the database rather than in relation to the underlying detailed data. Functions operating on these virtual dimensions are translated into functions that operate on the existing base dimensions. As a result, the need to perform certain precalculations is avoided, thereby promoting efficient use of computing resources.

Abstract: A method and system for compressing and decompressing read only data in records that have a fixed size. A plurality of records are divided into segments having a predetermined size. For each segment, the records are arranged in a table with rows for each record and a column for each field in each record. The width of each column of repeated data is compressed to zero bits and the repeated data is referenced in a header of the segment. The width of each column of integer data is compressed to the minimum number of bits required to represent the largest integer value in the fields of the column. Floating point data in each column is converted to integer data and the width of the each column with converted integer data is set to the minimum width necessary to represent the largest converted integer in each column. The conversion to integer data is calculated for floating point and real numbers with a minimum precision exponent that is stored in the header for the segment.