Please use this identifier to cite or link to this item:
|Title:||Incremental maintenance of quotient cube based on Galois lattice|
|Citation:||Li, C.-P.,Tung, K.-H.,Wang, S. (2004). Incremental maintenance of quotient cube based on Galois lattice. Journal of Computer Science and Technology 19 (3) : 302-308. ScholarBank@NUS Repository.|
|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.|
|Source Title:||Journal of Computer Science and Technology|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.