Algorithm for obtaining aggregated value sets from multidimensional databases

Authors:
Mirela Voicu;Gabriela Mircea
Affiliations:
Faculty of Economic Sciences, West University of Timisoara, Romania;Faculty of Economic Sciences, West University of Timisoara, Romania
Venue:
AIC'05 Proceedings of the 5th WSEAS International Conference on Applied Informatics and Communications
Year:
2005

Citing 3
Cited 1

Including Group-By in Query Optimization

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Querying Multiple Features of Groups in Relational Databases

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Improved Unnesting Algorithms for Join Aggregate SQL Queries

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases

Algorithm using hypercube for aggregations

ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

For n fields (used for grouping) from a database, we can obtain 2n aggregation types - the maximal set possible (obtained, for example, with the Cube operator from Oracle). In this paper we want to present one algorithm with which the user can obtain any subsets from this maximal set.