Compact Data Cube Structure for Keeping Semantics
Liu Hong-min · Jisuanji gongcheng · 2008
Normally data cube is very large and relations among cells are very complicated. So semantic data cube is difficult to realize. Based on quotient cube, Semantic Data Cube(SDC) structure is put forward in this paper. Each cell in lattice expressed by its upper bound and low bound is also preserved. SDC depicts the lattice of cells concisely and stores data cube compactly and can keep all the semantic relations. The operators of drill-down and roll-up between cells can be done in SDC. Applying semantics to answer query and maintain incrementally, the cost of queries and updating can be reduced greatly. Experimental results show that SDC is effective.