Download now Free registration required
Range-aggregate queries are popular in many applications in data warehouse environments with large business relational databases. To evaluate these efficiently, several studies on data cubes (such as the aggregate cubetree) have been carried out. In the wellknown aggregate cubetree, each entry in every node stores the aggregate values of its corresponding subtree. Therefore, range-aggregate queries can be processed without visiting the child subtree whose nodes are all fully included in the query range. However, the aggregate cubetree does not consider range queries using partial dimensions and range queries without aggregation operations.
- Format: PDF
- Size: 374.37 KB