Computing full and iceberg datacubes using partitions

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

Volumn 2366 LNAI, Issue , 2002, Pages 244-254

  Laporte, Marc ^a   Novelli, Noël ^b   Cicchetti, Rosine ^a,c   Lakhal, Lotfi ^a,c  

^a University of the Mediterranean   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

^c AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS; ALGORITHMS;

CONDENSED REPRESENTATIONS; CRITICAL PROBLEMS; DATA CUBE; EXPLOSION PROBLEMS; OPERATIONAL SOLUTIONS;

SEA ICE;

EID: 84884618423     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48050-1_28     Document Type: Conference Paper

References (18)

1. S. Agarwal, R. Agrawal, P . Deshpande, A. Gupta, J.F. Naughton, R. Ramakrishnan, and S. Sarawagi. On the Computation of Multidimensional Aggregates. In VLDB'96, pages 506-521, 1996.
2. D. Barbará and M. Sullivan. Quasi-Cubes: Exploiting Approximations in Multidimensional Databases. SIGMOD Record, 26(3):12-17, 1997.
3. K.S. Beyer and R. Ramakrishnan. Bottom-Up Computation of Sparse and Iceberg CUBEs. In ACM SIGMOD, USA, pages 359-370, 1999.
4. G. Dong, J. Han, J. M. W. Lam, J. Pei, and K. Wang. Multi-Dimensional Constrained Gradients in Data Cubes. In VLDB'01, pages 321-330, Italy , 2001.
5. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J.D. Ullman. Computing Iceberg Queries Efficiently. In VLDB'98, New York City, New York, USA, pages 299-310. Morgan Kaufmann, 1998.
6. B. Ganter and K. Reuter. Finding all Closed Sets: A General Approach. Order, 8:283-290, 1991.
7. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer-Verlag, 1999.
8. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-T ab, and Sub Totals. Data Mining and Knowledge Discovery, 1(1), 1997.
9. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.
10. J. Han, J. Pei, G. Dong, and K. Wang. Efficient Computation of Iceberg Cubes with Complex Measures. In ACM SIGMOD'01, USA, 2001.
11. V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In ACM SIGMOD'96, pages 205-216, Montreal, Quebec, Canada, June 1996.
12. A. C. Klug. Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions. Journal of ACM, 29(3):699-717, 1982.
13. H. Lu and H. Liu. Decision Tables: Scalable Classification Exploring RDBMS Capabilities. In VLDB'00, pages 373-384, Cairo, Egypt, September 2000.
14. H. Mannila and H. Toivonen. Levelwise Search and Borders of Theories in Knowledge Discovery. Data Mining and Knowledge Discovery, 10(3):241-258, 1997.
15. K.A. Ross and D. Srivastava. Fast Computation of Sparse Datacubes. In VLDB'97, Athens, Greece, pages 116-125, 1997.
16. K.A. Ross, D. Srivastava, and D. Chatziantoniou. Complex Aggregation at Mutiple Granularities. In EDBT'98, LNCS vol. 1377, pages 263-277. Springer Verlag, 1998.
17. K.A. Ross and K.A. Zaman. Serving Datacube Tuples from Main Memory. In SSDM'2000, Berlin, Germany, pages 182-195, 2000.
18. N. Spyratos. The partition model: A deductive database model. ACM TODS, 12(1):1-37, 1987.