GSFC——基于图结构的Free Cube存储方法  

GSFC—The Storage of Free Cube Based on Graph Structure

作　　者：孙延凡[1] 陈红[1] 

机构地区：[1]中国人民大学信息学院,北京100872

出　　处：《计算机研究与发展》2004年第10期1652-1660,共9页Journal of Computer Research and Development

基　　金：国家"八六三"高技术研究发展计划基金项目 ( 2 0 0 2AA4Z3 42 0 );国家自然科学基金项目 ( 60 2 73 0 17);教育部科学技术研究重点基金项目 ( 0 2 0 3 6)

摘　　要：　free cube利用发掘基本关系表维值之间的蕴含规则 ,去除datacube中内在冗余 ,有效减小datacube体积 但是还存在一些值得进一步研究的问题 首先 ,直接地表示freecube仍然不够精简从而浪费了存储空间 其次 ,只提到了查询的基本思想 ,没有给出具体的查询技术 针对这些问题 ,提出了基于图结构的存储方法GSFC ,利用前缀压缩进一步减小freecube体积 同时 ,该方法结合了存储和索引结构 ,有效解决freecube的查询问题 最后给出了计算和查询算法 。Free cube is a technique of reducing data cube size through mining the implication rules of dimension values in base table and removing the inherent redundancies in the structure of data cube While it is an interesting proposal, it leaves many issues unaddressed Firstly, a direct representation of a free cube is not as compact as possible and thus still wastes space Secondly, while a free cube can in principle be used for answering queries, no specific technique is given A new method is proposed to overcome these problems A storage based on graph structure called GSFC is given to exploit prefix redundancy when storing the free cube Meanwhile, GSFC combines the storage and indexing mechanism, and thus can efficiently solve the query of free cube Some algorithms are applied to directly construct GSFC from a base table and answer query using GSFC An experiment is presented to validate the efficiency of algorithms

关 键 词：free CUBE 数据立方体 联机分析 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]