Sciweavers

5640 search results - page 6 / 1128
» Parallelizing the Data Cube
Sort
View
VLDB
2000
ACM
163views Database» more  VLDB 2000»
13 years 11 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
14 years 8 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
13 years 11 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
DAWAK
2000
Springer
13 years 12 months ago
Data Cube Compression with QuantiCubes
: Data warehouses typically store a multidimensional fact representation of the data that can be used in any type of analysis. Many applications materialize data cubes as multidime...
Pedro Furtado, Henrique Madeira
TDSC
2008
116views more  TDSC 2008»
13 years 7 months ago
Practical Inference Control for Data Cubes
The fundamental problem for inference control in data cubes is how to efficiently calculate the lower and upper bounds for each cell value given the aggregations of cell values ove...
Haibing Lu, Yingjiu Li