Comparative study on the Mining Iceberg Cubes Algorithms
Main Article Content
Abstract
A data warehouse is a collection of data for supporting of decision making process. Data cubes and on-line analytical processing
(OLAP) have become very popular techniques to help users analyze data in a warehouse. An iceberg cube consists of only the set of group-bys
whose aggregates are no less than a user-specified aggregate threshold, and does not compute a complete cube. Mining iceberg cubes is an
important research problem in both online analytic processing (OLAP) and data mining. It can be to answer group-by queries, mine
multidimensional association rules, and identify interesting subsets of the cube for pre-computation. A data warehouse is often organized in a
schema of multiple tables, such as star schema or snowflake schema, in practice. Several algorithms, such as BUC, MultiWay (Y. Zhao et al.,
1997), H-Cubing (Han et al., 2001), and Star-Cubing (Xin et al., 2003), have been proposed to compute iceberg cubes from data warehouse. This
paper focus on comparative study in respect to the performance of all above mentioned algorithms. Researcher finds that MultiWay and HCubing
do not perform well in high dimension and high cardinality datasets. Performance study demonstrates that Star-Cubing is a promising
method.
Â
Â
Keyword: Mining, Algorithms, data warehouse, online analytic processing
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.