Data Cube Approximation and Histograms via Wavelets

International Conference on Information and Knowledge Management, Proceedings

Volumn 1998-January, Issue , 1998, Pages 96-104

  Vitter, Jeffrey Scott ^a   Wang, Min ^a   Iyer, Bala ^b  

^a Duke University ^*  (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; GEOMETRY; GRAPHIC METHODS; QUERY PROCESSING; WAVELET DECOMPOSITION;

ANALYSIS OF DATA; DATA CUBE; DATA VALUES; MULTIDIMENSIONAL ARRAYS; MULTIRESOLUTION WAVELET DECOMPOSITIONS; ON-LINE ANALYTICAL PROCESSING; PARTIAL SUMS; SPACE EFFICIENT; STORAGE SPACES; SUM-QUERY;

DATA WAREHOUSES;

EID: 85139860001     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/288627.288645     Document Type: Conference Paper

References (26)

1. A. Agarwal et al. On the computation of multidimensional aggregates. In Proceedings of the 1996 International Conference on Very Large Databases, Mumbai, India, 1996.
2. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9), 1116-1127, 1988.
3. D. Barbara et al. The New Jersey data reduction report. Bulletin of the Technical Committee on Data Engineering, 20(4), 1997.
4. C. B. Databases, http://www.census.gov/.
5. D. L. Donoho. Unconditional bases are optimal bases for data compression and statistical estimation. Technical report, Department of Statistics, Stanford University, 1992.
6. P. B. Gibbons and Y. Matias. New sampling-based summary statistics for improving approximate query answers. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, June 1998.
7. J. Gray et al. Data cube: A relational aggregation operator generalizing group-by, cross-tabs and subtotals. In Proceedings of the 12th Annual IEEE Conference on Data Engineering (ICDE '96), 131-139, 1996.
8. P. Haas and A. Swami. Sequential sampling procedures for query size estimation. In Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, 1992.
9. P. Haas and A. Swami. Sampling-based selectivity for joins using augmented frequent value statistics. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, March 1995.
10. V. Harinarayan et al. Implementing data cubes efficiently. In Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, May 1996.
11. J. M. Hellerstein et al. Online aggregation. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, May 1997.
12. C.-T. Ho et al. Range queries in OLAP data cubes. In Proceedings of the 1991 ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, May 1997.
13. B. Jawerth and W. Sweldens. An overview of wavelet based multiresolution analyses. SIAM Rev., 36(3), 377-412, 1994.
14. R. Lipton and J. Naughton. Query size estimation by adaptive sampling. J. of Comput. Sys. Sci., 51, 18-25, 1985.
15. R. Lipton, J. Naughton, and D. Schneider. Practical selectivity estimation through adaptive sampling. In Proceeding of the 1990 ACM SIGMOD International Conference on Management of Data, 1-11, 1990.
16. Y. Matias, J. S. Vitter, and M. Wang. Wavelet-based histograms for selectivity estimation. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, Seattle, Washington, June 1998.
17. M. Muralikrishna and D. J. DeWitt. Equi-depth histograms for estimating selectivity factors for multi-dimensional queries. In Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 28-36, 1988.
18. V. Poosala and Y. E. Ioannidis. Selectivity estimation without the attribute value independence assumption. In Proceedings of the 1997 International Conference on Very Large Databases, Athens, Greece, August 1997.
19. S. Sarawagi and M. Stonebraker. Efficient organization of large multidimensional arrays. In Proceedings of the 11th Annual IEEE Conference on Data Engineering (ICDE '94), Houston, Texas, 1994.
20. J. E. Savage and J. S. Vitter. Parallelism in space-time tradeoffs. In F. P. Preparata, editor, Advances in Computing Research, Volume 4, 117-146. JAI Press, 1987.
21. E. J. Stollnitz, T. D. Derose, and D. H. Salesin. Wavelets for Computer Graphics. Morgan Kaufmann, 1996.
22. TPC benchmark D (decision support), 1995.
23. D. E. Vengroff and J. S. Vitter. I/O-efficient scientific computation using TPIE. In Proceedings of the Goddard Conference on Mass Storage Systems and Technologies, 553-570, College Park, MD, September 1996.
24. J. S. Vitter. External memory algorithms. In Proceedings of the 1998 ACM Symposium on Principles of Database Systems, June 1998. Invited tutorial.
25. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3), 110-147, 1994. Special double issue on Large-Scale Memories.
26. Y. Zhao, P. M. Deshpande, and J. F. Naughton. An array-based algorithm for simultaneous multidimensional aggregates. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, May 1997.