Indexing for Range-Aggregation Queries on Large Relational Datasets
Range-aggregate queries are popular in many applications having business relational data. In order to efficiently evaluate it, several works on data cubes (such as the aggregate cubetree) are proposed. In the 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 nodes whose parent nodes are fully included in the query range. However, the aggregate cubetree does not take range queries using partial dimensions and range queries without aggregation operations into account.