Computer Science ›› 2005, Vol. 32 ›› Issue (11): 88-90.
Previous Articles Next Articles
Online:
Published:
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 Dwarf cube com- pressed the complete data cube into
Key words: Data warehousing, Prefix redundancy, Dwarf, Incremental update
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2005/V32/I11/88
Cited