%0 Journal Article
%T PMC: Select Materialized Cells in Data Cubes
%A Hong-Song Li
%A Hou-Kuan Huang
%A <br>Hong-Song
%A Li
%A and
%A Hou-Kuan
%A Huang
%J 计算机科学技术学报
%D 2006
%I 
%X QC-Tree is one of the most storage-efficient structures for data cubes in an MOLAP system. Although QC- Tree can achieve a high compression ratio, it is still a fully materialized data cube. In this paper, an improved structure PMC is presented allowing us to materialize only a part of the cells in a QC-Tree to save more storage space. There is a notable difference between our partially materialization algorithm and traditional materialized views selection algorithms. In a traditional algorithm, when a view is selected, all the cells in this view are to be materialized. Otherwise, if a view is not selected, all the cells in this view will not be materialized. This strategy results in the unstable query performance. The presented algorithm, however, selects and materializes data in cell level, and, along with further reduced space and update cost, it can ensure a stable query performance. A series of experiments are conducted on both synthetic and real data sets. The results show that PMC can further reduce storage space occupied by the data cube, and can shorten the time to update the cube.
%K data warehousing
%K data cube
%K multidimensional database
%K partial materialization<br>数据库
%K 多维数据库
%K 数据挖掘
%K 存储结构
%K MOLAP结构
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=F0F8269F3C1A08BC0517484631D5FE70&yid=37904DC365DD7266&vid=659D3B06EBF534A7&iid=0B39A22176CE99FB&sid=E42CAFB11D4BE21A&eid=407C905D8F0449C4&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=22