Compressed datacubes for fast OLAP applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1676, Issue , 1999, Pages 65-77

  Buccafurri, Francesco ^a   Rosaci, Domenico ^a   Saccà, Domenico ^b  

^a UNIVERSITY MEDITERRANEA OF REGGIO CALABRIA   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; DATA WAREHOUSES; WAREHOUSES;

AGGREGATE DATUM; COMPARATIVE ANALYSIS; DATA CUBE; DIFFERENT SIZES; EXPECTED VALUES; MATRIX REPRESENTATION; NON NEGATIVES; RANGE QUERY;

QUERY PROCESSING;

EID: 22844453379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48298-9_7     Document Type: Conference Paper

References (18)

1. Agarwal, S., Agrawal, R., Deshpande, P., Gupta, A., Naughton, J.F., Ramakrish- nan, R., Sarawagi, S., On the Computation of Multidimensional Aggregates, Proc. of VLDB 1996, pp. 506-521
2. Byard, J., Schneider, D., The Ins and Outs (and everything in between) of Data Warehousing, ACM SIGMOD'96 Tutorial Notes
3. Barbara, D., Sullivan, M., Quasi-Cubes: Exploiting approximations in multidimen- sional databases, ACM SIGMOD Record, 1996
4. Chaudhuri, S., Dayal, U., An Overview of Data Warehousing and OLAP Technol- ogy, ACM SIGMOD Record 26(1), March 1997.
5. Codd, E.F., Codd, S.B., Salley, C.T., Providing OLAP (On-Line Analytical Pro- cessing) to User-Analysts, An IT Mandate E.F. Codd and Associates, 1993, Avail- able from http: //www.arborsoft.com/papers/intro.html
6. Faloutsos, C., Jagadish, H.V., Sidiripoulos, N.D., Recovering Information from Summary Data, Proc. VLDB'97, Athens, 1997
7. Gray, J., Bosworth, A., Layman, A., Pirahesh, H., Data Cube: A Relational Aggre- gation Operator Generalizing Group-By, Cross-Tab, and Sub-Total, Proc. of the ICDE 1996, pp. 152-159
8. Haas, P.J., Naughton, J.F., Seshadri, S., Stokes, L., Sampling Based Estimation of the Number of Distinct Values of an Attribute, Proc. of the VLDB 1995, pp. 311-322
9. Harinarayan, V., Rajaraman, A., Ullman, J. D., Implementing Data Cubes Efficiently, Proc. of the ACM SIGMOD 1996, pp. 205-216
10. Hellerstein, J.M., Haas, P.J., Wang, H.J., Online Aggregation, Proc. of ACM SIG- MOD'97, pp. 171-182.
11. Ho, C.T., Agrawal, R., Megiddo, N., Srikant, R., Range Queries in OLAP Data Cubes, Proc. of the ACM SIGMOD Conference 1997, pp. 73-88
12. Ioannidis, Y., Poosala, V., Balancing histogram optimality and practicality for query result size estimation, Proc. of the ACM SIGMOD Conf. 1995, pp. 233-244
13. Kenan Technologies, An Introduction to Multidimensional Database Technology, Available from http: //www.kenan.com/
14. Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K., Suel, T., Optimal histograms for quality guarantees, Proc. of the ACM SIGMOD Conference 1998, pp. 275-286
15. Mannino, M.V., Chu, P., Sager, T., Statistical profile estimation in database sys- tems, ACM Computing Survey 20, 3, pp. 192-221.
16. MicroStrategy Inc., The Case for Relational OLAP. A white paper available from http://www.strategy.com/
17. Poosala, V., Ioannidis, Y.E., Haas, P.J., Shekita, E.J., Improved histograms for selectivity estimation of range predicates, Proc. of the ACM SIGMOD Conference 1996, pp. 294-305
18. Shukla, A., Deshpande, P.M., Naughton, J.F., Ramasamy, K., Storage estimation for multidimensional aggregates in the presence of hierarchies, Proc. of VLDB 1996, pp. 522-531.