Incremental Maintenance of Quotient Cube Based on Galois Lattice

Data cube computation is a well-known expensiveoperation and has been studied extensively. It is often not feasible tocompute a complete data cube due to the huge storage requirement.Recently proposed quotient cube addressed this fundamental issuethrough a partitioning method that groups cube cells into equivalentpartitions. The effectiveness and efficiency of the quotient cube forcube compression and computation have been proved. However, as changesare made to the data sources, to maintain such a quotient cube isnon-trivial since the equivalent classes in it must be split ormerged. In this paper, incremental algorithms are designed to updateexisting quotient cube efficiently based on Galois lattice. Performancestudy shows that these algorithms are efficient and scalable for largedatabases.