摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
Computer-readable media, systems, and methods for building a multidimensional data cube having one or more high-cardinality attributes are described. In embodiments, data is extracted from one or more databases. It is determined that one or more instances of the data are fact data and one or more instances of the data are dimension data. Each member of the fact data is one instance of a dimension and each instance of the dimension data includes an attribute for grouping the fact data. Moreover, in embodiments it is determined that one or more instances of the dimension data are high-cardinality attributes. The one or more high-cardinality attributes are processed with fact data and stored in fact tables on a computer storage medium.
摘要:
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.