Abstract: Random access to run-length encoded data values is provided. A target value is identified by a logical index into a structure of run-length-encoded values. To access the value, a bookmark is selected based on the logical index, on a maximum logical index of the bookmark, and on a specified bookmark distance. An initial run in the structure is located, based on the selected bookmark. A final run is chosen, at most one bookmark distance from the initial run. The target value is the value of the final run. Efficiency heuristics are used when generating bookmarks or creating the structure of run-length-encoded values.

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.

Abstract: Systems and methodologies for identification of factors that cause significant shifts in transactions in a relational store and/or OLAP environment. Transactions are grouped into significant categories defined across the whole data space, to detect interesting sub spaces transactions. Subsequently, sub spaces that show strong variance between two slices can be selected, followed by grouping the subspaces in sub reports to measure the coverage for each sub report. A final report can then be generated that contains list of sub-reports detected in the previous acts.

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: Provided are systems and methods that facilitate direct write back in a multi-dimensional database. The system includes a delta cache component that receives a user request to change an original cell value and determines a delta value based at least in part upon the changed cell value. Also included is a write back partition component that selectively updates a data cell based at least in part upon the delta value without updating corresponding data cell values. The system and methods allow attributes to be added to any dimension of a cube without affecting the write back data. Adding, modifying or removing a hierarchy has no affect on write back data nor does deleting a dimension that is not referenced by a write back.

Abstract: The subject invention pertains to systems and methods that facilitate generation of a database to support a multidimensional model. A database schema is generated in a top-down fashion. In particular, multidimensional structures and attributes such as cubes and dimensions can be defined. From such definition, a proposed database schema can be produced. This schema can subsequently be modified prior to or after populating the database. For example, a table or column could be added. Thereafter, the cubes and dimensions could be altered and a modified schema generated that preserves changes made to the schema. Accordingly, the subject systems and methods disclose an iterative approach that supports both top-down and bottom-up multidimensional database design.

Abstract: The present invention relates to a system and methodology associated with providing a flexible unified view of key performance indicators (KPIs). Retrieving KPI values from a store is not always trivial and may require submitting multiple queries to in order to obtain desired results. The present system and method makes it easier for front-end applications to access and display KPIs in an easily customizable form. Furthermore, third parties can leverage off the provided architecture in connection with their own applications to facilitate quick and easy access to a single view of performance indicators.

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: 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: The subject disclosure relates to querying of column based data encoded structures enabling efficient query processing over large scale data storage, and more specifically with respect to complex queries implicating filter and/or sort operations for data over a defined window. In this regard, in various embodiments, a method is provided that avoids scenarios involving expensive sorting of a high percentage of, or all, rows, either by not sorting any rows at all, or by sorting only a very small number of rows consistent with or smaller than a number of rows associated with the size of the requested window over the data. In one embodiment, this is achieved by splitting an external query request into two different internal sub-requests, a first one that computes statistics about distribution of rows for any specified WHERE clauses and ORDER BY columns, and a second one that selects only the rows that match the window based on the statistics.

Abstract: The subject disclosure relates to querying of column based data encoded structures enabling efficient query processing over large scale data storage, and more specifically, with respect to join operations. Initially, a compact structure is received that represents the data according to a column based organization, and various compression and data packing techniques, already enabling a highly efficient and fast query response in real-time. On top of already fast querying enabled by the compact column oriented structure, a scalable, fast algorithm is provided for query processing in memory, which constructs an auxiliary data structure, also column-oriented, for use in join operations, which further leverages characteristics of in-memory data processing and access, as well as the column-oriented characteristics of the compact data structure.

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 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: 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: 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 disclosure relates to column based data encoding where raw data to be compressed is organized by columns, and then, as first and second layers of reduction of the data size, dictionary encoding and/or value encoding are applied to the data as organized by columns, to create integer sequences that correspond to the columns. Next, a hybrid greedy run length encoding and bit packing compression algorithm further compacts the data according to an analysis of bit savings. Synergy of the hybrid data reduction techniques in concert with the column-based organization, coupled with gains in scanning and querying efficiency owing to the representation of the compact data, results in substantially improved data compression at a fraction of the cost of conventional systems.

Abstract: The subject disclosure relates to efficient query processing over large scale data storage. An exemplary process includes retrieving a subset of columns implicated by a query as integer encoded and compressed sequences of values corresponding to different columns of data, defining query processing buckets that span over the subset of columns based on changes of compression type occurring in the integer encoded and compressed sequences of values of the subset of data and processing the query in memory on a bucket by bucket basis and processing the query based on type of current bucket when processing the integer encoded and compressed sequences of values. The column based organization of the data, and the application of a hybrid run length encoding and bit packing technique, enable a highly efficient and speedy query response in real-time.

Abstract: A system that facilitates one or more of querying and updating a multi-dimensional structure comprises a component that receives a statement in a declarative language relating to a typed object associated with a multi-dimensional structure. A conversion component analyzes context associated with the statement and automatically converts the object to a disparate type as a function of the analysis. For example, an execution engine can comprise the conversion component, and the execution engine can be an Online Analytical Processing (OLAP) engine.

Abstract: Various technologies and techniques are disclosed for utilizing spreadsheet references with grouped aggregate views. A grouped aggregate view feature enables a user to create a grouped aggregate view of data. A calculation feature enables the user to calculations for the grouped aggregate view of data that are based upon relative or absolute references to data in the grouped aggregate view. Input is received from a user to write a calculation within a first cell in a grouped aggregate view. Input is received from the user to select a second cell to reference when writing the calculation. The user is presented with available references that are relevant to data contained in the second cell. Input is received from the user to select one of the available references that are relevant for the second cell. The selected one of the available references is placed into the first cell.

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.