Title: Novel Incremental Update Algorithm of the Cube Based on Dimension Hierarchy Aggregate Tree
Abstract: The paper proposes a novel incremental update algorithm to update the aggregate cube with the dimension hierarchy aggregate tree on the cube.By using the hierarchical prefix of the dimension hierarchy aggregate tree,the aggregate cube can incrementally update the all affected ancestor notes while updating the data cell in it.The aggregate cube can also incrementally update without being recreated while being added new dimension data in it.As a result,this algorithm can greatly reduce the update time.We have compared the algorithms of the aggregate cube based on dimension hierarchy aggregate tree with the existed other ones such as DDC(dynamic data cube).The results show that the algorithms of the aggregate cube proposed in this paper are more efficient than other existed ones.
Publication Year: 2005
Publication Date: 2005-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot