Results 21 to 30 of about 50 (50)
Some of the next articles are maybe not open access.
Condensed cube: an effective approach to reducing data cube size
Proceedings 18th International Conference on Data Engineering, 2003Pre-computed data cube facilitates OLAP (on-line analytical processing). It is well-known that data cube computation is an expensive operation. While most algorithms have been devoted to optimizing memory management and reducing computation costs, less work has addressed a fundamental issue: the size of a data cube is huge when a large base relation ...
Hongjun Lu +3 more
openaire +2 more sources
Cubing Algorithms for XML Data
2009 20th International Workshop on Database and Expert Systems Application, 2009-
openaire +4 more sources
2000
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions.
Amr El Abbadi +2 more
openaire +2 more sources
Range sum queries on data cubes are a powerful tool for analysis. A range sum query applies an aggregation operation (e.g., SUM, AVERAGE) over all selected cells in a data cube, where the selection is specified by providing ranges of values for numeric dimensions.
Amr El Abbadi +2 more
openaire +2 more sources
Range cube: efficient cube computation by exploiting data correlation
Proceedings. 20th International Conference on Data Engineering, 2004Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the representation of a data cube. We introduce range cubing as an efficient way to compute and compress the data cube without any loss of precision.
A. El Abbadi +3 more
openaire +2 more sources
Privacy preservation for data cubes [PDF]
Knowledge and Information Systems, 2005 A range query finds the aggregated values over all selected cells of an online analytical processing (OLAP) data cube where the selection is specified by the ranges of contiguous values for each dimension. An important issue in reality is how to preserve the confidential information in individual data cells while still providing an accurate estimation ...
Sung, S.Y., Liu, Y., Xiong, H., Ng, P.A.
openaire +1 more source
Data Cube Is Dead, Long Life to Data Cube in the Age of Web Data
2019In a short time, the data warehouse (DW) technology took an important place in the academic and industrial landscapes. This place materialized in the large majority of engineering and management schools that adopted it in their curriculum and in the small, medium-size and large companies that enhanced their decision making capabilities thanks to it ...
Khouri, Selma +3 more
openaire +2 more sources
ROLAP implementations of the data cube
ACM Computing Surveys, 2007Implementation of the data cube is an important and scientifically interesting issue in On-Line Analytical Processing (OLAP) and has been the subject of a plethora of related publications. Naive implementation methods that compute each node separately and store the result are impractical, since they have exponential time and space complexity with ...
Stratis Konakas +3 more
openaire +2 more sources
1999
Nested data cubes (NDCs in short) are a generalization of other OLAP models such as f-tables [4] and hypercubes [2], but also of classical structures as sets, bags, and relations. This model adds to the previous models flexibility in viewing the data, in that it allows for the assignment of priorities to the different dimensions of the multidimensional
Dekeyser, S. +3 more
openaire +3 more sources
Nested data cubes (NDCs in short) are a generalization of other OLAP models such as f-tables [4] and hypercubes [2], but also of classical structures as sets, bags, and relations. This model adds to the previous models flexibility in viewing the data, in that it allows for the assignment of priorities to the different dimensions of the multidimensional
Dekeyser, S. +3 more
openaire +3 more sources
Extracting semantics from data cubes using cube transversals and closures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '03, 2003In this paper we propose a lattice-based approach intended for extracting semantics from datacubes: borders of version spaces for supervised classification, closed cube lattice to summarize the semantics of datacubes w.r.t. COUNT, SUM, and covering graph of the quotient cube as a visualization tool of minimal multidimensional associations.
Rosine Cicchetti +2 more
openaire +2 more sources
Dynamic Multidimensional Data Cubes
2003Data cubes are ubiquitous tools in data warehousing, online analytical processing, and decision support applications. Based on a selection of pre-computed and materialized aggregate values, they can dramatically speed up aggregation and summarization over large data collections.
Mirek Riedewald +2 more
openaire +2 more sources