高级检索

    Star Cube——一种高效的数据立方体实现方法

    Star Cube——An Approach to Implementing Data Cube Efficiently

    • 摘要: 一个具有n个维的数据立方体有 2 n 个视图 ,视图越多 ,用于维护数据立方体的时间也就越长 通过将维分成划分维和非划分维 ,数据立方体可以转换成starcube starcube由一个综合表和那些仅包含划分维的视图组成 starcube使用前缀共享和元组共享技术不仅减少了所需的存储空间 ,还大大减少了计算和维护时间 在把一个分片限制在一个I/O单位的条件下 ,starcube的查询响应时间与数据立方体基本相同 实验结果也表明 ,starcube是一种在时空两方面均有效的数据立方体实现技术

       

      Abstract: A data cube of n dimensions has 2 n views The more the views, the more the maintenance time of data cube By dividing dimensions of a data cube into partition dimensions and no partition dimensions, a data cube can be transformed to a star cube, which includes a summary table and views consisting of partition dimensions Star cube uses prefix and tuple sharing technology to reduce the storage requirement, computation time, and maintenance time By confining the size of a fragment to one I/O unit, the query response time of star cube is almost the same as data cube The results of experiments also show that star cube is a promising way to implement data cube

       

    /

    返回文章
    返回