Efficient computation of Iceberg cubes with complex measures
- 1 May 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 30 (2) , 1-12
- https://doi.org/10.1145/375663.375664
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient mining of constrained correlated setsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Can we push more constraints into frequent pattern mining?Published by Association for Computing Machinery (ACM) ,2000
- Mining frequent patterns without candidate generationPublished by Association for Computing Machinery (ACM) ,2000
- Bottom-up computation of sparse and Iceberg CUBEPublished by Association for Computing Machinery (ACM) ,1999
- Optimization of constrained frequent set queries with 2-variable constraintsPublished by Association for Computing Machinery (ACM) ,1999
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- An overview of data warehousing and OLAP technologyACM SIGMOD Record, 1997
- An array-based algorithm for simultaneous multidimensional aggregatesPublished by Association for Computing Machinery (ACM) ,1997
- Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-TotalsData Mining and Knowledge Discovery, 1997
- Implementing data cubes efficientlyPublished by Association for Computing Machinery (ACM) ,1996