Incremental maintenance of quotient cube based on Galois lattice

  • Authors:

  • Cui-Ping Li;Kum-Hoe Tung;Shan Wang

  • Affiliations:

  • Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100080, P.R. China;School of Computing, National University of Singapore, Singapore 117543;Information School, Renmin University of China, Beijing 100872, P.R. China

  • Venue:
  • Journal of Computer Science and Technology
  • Year:
  • 2004

Quantified Score

Hi-index 0.03

Visualization

Abstract

Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement, Recently proposed quotient cube addressed this fundamental issue through a partitioning method that groups cube cells into equivalent partitions. The effectiveness and efficiency of the quotient cube for cube compression and computation have been proved. However, as changes are made to the data sources, to maintain such a quotient cube is non-trivial since the equivalent classes in it must be split or merged. In this paper, incremental algorithms are designed to update existing quotient cube efficiently based on Galois lattice. Performance study shows that these algorithms are efficient and scalable for large databases.