Sarawagi, Sunita ; Agrawal, Rakesh ; Megiddo, Nimrod (2006) Discovery-driven exploration of OLAP data cubes Advances in Database Technology — EDBT'98, 1377 . pp. 168-182. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://doi.org/10.1007/BFb0100984
Related URL: http://dx.doi.org/10.1007/BFb0100984
Abstract
Analysts predominantly use OLAP data cubes to identify regions of anomalies that may represent problem areas or new opportunities. The current OLAP systems support hypothesis-driven exploration of data cubes through operations such as drill-down, roll-up, and selection. Using these operations, an analyst navigates unaided through a huge search space looking at large number of values to spot exceptions. We propose a new discovery-driven exploration paradigm that mines the data for such exceptions and summarizes the exceptions at appropriate levels in advance. It then uses these exceptions to lead the analyst to interesting regions of the cube during navigation. We present the statistical foundation underlying our approach. We then discuss the computational issue of finding exceptions in data and making the process efficient on large multidimensional data bases.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to Springer Nature Switzerland AG |
Keywords: | Data Cube;Aggregate Function;Multiple Equation;Cube Computation;Huge Search Space |
ID Code: | 128433 |
Deposited On: | 20 Oct 2022 10:12 |
Last Modified: | 20 Oct 2022 10:12 |
Repository Staff Only: item control page