QC-Tree is an effective data structure for constructing data cube, which makes a significant reduction in the cube size, while preserving its semantics. The original construction algorithm of QC-Tree performs not well because it does not begin the construction until all the temporary classes generated and sorted. The number of temporary classes is usually so huge, which leads to a huge memory requirement and poor sorting performance and thus quite a long time for constructing QC-Tree. In order to solve the problems, a new algorithm called ConstructTreeByBFS is proposed in this paper. ConstructTreeByBFS immediately constructs a corresponding QC-Tree branch once a temporary class is generated and then the temporary class is dropped. Without storing all of the temporary classes in memory, it significantly reduces the memory requirement during construction. In addition, for speeding up the construction, ConstructTreeByBFS searches the temporary classes in efficient iterative BFS way instead of inefficient recursive DFS way. An experimental study illustrates the space saving and time saving achieved by ConstructTreeByBFS algorithm. Finally, we discuss the plan for further improving the performance of QC-Tree by reducing storage size and speeding query answer in the future.
[1]
Laks V. S. Lakshmanan,et al.
QC-trees: an efficient summary structure for semantic OLAP
,
2003,
SIGMOD '03.
[2]
Wang Shan,et al.
Research on Closed Data Cube Technology
,
2004
.
[3]
Laks V. S. Lakshmanan,et al.
Quotient Cube: How to Summarize the Semantics of a Data Cube
,
2002,
VLDB.
[4]
Hongjun Lu,et al.
Condensed cube: an effective approach to reducing data cube size
,
2002,
Proceedings 18th International Conference on Data Engineering.
[5]
C. J. Hahn,et al.
Extended Edited Synoptic Cloud Reports from Ships and Land Stations Over the Globe, 1952-1996
,
1999
.
[6]
Yannis Sismanis,et al.
Dwarf: shrinking the PetaCube
,
2002,
SIGMOD '02.
[7]
Adam Drozdek,et al.
Data structures and algorithms in C
,
1995
.
[8]
Yan Zhao.
Quotient cube and QC-tree : efficient summarizations for semantic OLAP
,
2003
.
[9]
Stephen G. Warren,et al.
Edited synoptic cloud reports from ships and land stations over the globe
,
1996
.
[10]
Hamid Pirahesh,et al.
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals
,
1996,
Data Mining and Knowledge Discovery.