Sciweavers

102 search results - page 1 / 21
» Aggregation Algorithms for Very Large Compressed Data Wareho...
Sort
View
VLDB
1999
ACM
159views Database» more  VLDB 1999»
13 years 9 months ago
Aggregation Algorithms for Very Large Compressed Data Warehouses
Many efficient algorithms to compute multidimensional aggregation and Cube for relational OLAP have been developed. However, to our knowledge, there is nothing to date in the lite...
Jianzhong Li, Doron Rotem, Jaideep Srivastava
HICSS
2011
IEEE
183views Biometrics» more  HICSS 2011»
12 years 8 months ago
Optimizing Access across Multiple Hierarchies in Data Warehouses
In enterprise data warehouses, different users in different business units often define their own application specific dimension hierarchies tailor made to their reporting and b...
Lipyeow Lim, Bishwaranjan Bhattacharjee
RIVF
2007
13 years 6 months ago
Forgetting data intelligently in data warehouses
— The amount of data stored in data warehouses grows very quickly so that they can get saturated. To overcome this problem, we propose a language for specifying forgetting functi...
Aliou Boly, Georges Hébrail
VLDB
2004
ACM
119views Database» more  VLDB 2004»
14 years 5 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran
SSDBM
2000
IEEE
168views Database» more  SSDBM 2000»
13 years 8 months ago
pCube: Update-Efficient Online Aggregation with Progressive Feedback and Error Bounds
Multidimensional data cubes are used in large data warehouses as a tool for online aggregation of information. As the number of dimensions increases, supporting efficient queries ...
Mirek Riedewald, Divyakant Agrawal, Amr El Abbadi