Fast computation of sparse data cubes with constraints
Wuhan University Journal of Natural Sciences(2004)
摘要
For a data cube there are always constraints between dimensions or among attributes in a dimension, such as functional dependencies. We introduce the problem that when there are functional dependencies, how to use them to speed up the computation of sparse data cubes. A new algorithm CFD (Computation by Functional Dependencies) is presented to satisfy this demand. CFD determines the order of dimensions by considering cardinalities of dimensions and functional dependencies between dimensions together, thus reduce the number of partitions for such dimensions. CFD also combines partitioning from bottom to up and aggregate computation from top to bottom to speed up the computation further. CFD can efficiently compute a data cube with hierarchies in a dimension from the smallest granularity to the coarsest one.
更多查看译文
关键词
sparse data cube,functional dependency,dimension,partition,CFD,TP 311
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络