Computer Science ›› 2005, Vol. 32 ›› Issue (11): 88-90.

Previous Articles     Next Articles

  

  • Online:2018-11-17 Published:2018-11-17

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

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!