Sciweavers

19 search results - page 2 / 4
» Data Cube Approximation and Histograms via Wavelets
Sort
View
CIKM
1999
Springer
13 years 9 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
SIGMOD
2001
ACM
104views Database» more  SIGMOD 2001»
14 years 5 months ago
Independence is Good: Dependency-Based Histogram Synopses for High-Dimensional Data
Approximating the joint data distribution of a multi-dimensional data set through a compact and accurate histogram synopsis is a fundamental problem arising in numerous practical ...
Amol Deshpande, Minos N. Garofalakis, Rajeev Rasto...
VLDB
2001
ACM
144views Database» more  VLDB 2001»
14 years 5 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...
VLDB
2001
ACM
139views Database» more  VLDB 2001»
13 years 9 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
CORR
2010
Springer
209views Education» more  CORR 2010»
13 years 2 months ago
Generalized Tree-Based Wavelet Transform
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
Idan Ram, Michael Elad, Israel Cohen