Database Systems Concepts
A new OLAP aggregation based on the AHC technique
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Preparing complex data for warehousing
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Viewpoints on obtaining aggregated value sets
ICCOMP'07 Proceedings of the 11th WSEAS International Conference on Computers
Algorithm using hypercube for aggregations
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Database analysis models used for studying the residential assemble market
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.00 |
For n fields used for grouping we can obtain 2n aggregation types. When n is not small, 2n is a considerable value. With a new model for the specification of aggregation types, we present ways in which we can obtain any subsets of aggregation types, starting from n fields used for grouping. The algorithms concern cases in which: - The specification of aggregation types is made after we insert the data in the tables. - The specification of aggregation types is made before we insert the data in the tables. In order to obtain the results really fast, we also use hypercubes. - The case of one table (the fields used for grouping and for aggregation are from the same table) where we use one hypercube and we can specify the aggregation types in any moment (after or before the data insertion in the table) - model which can be used for questionnaires. These algorithms can be used in many economic analyses, in order to obtain complex reports. We will also present an example which concerns the sales in a supermarket chain. In our study we have worked with databases from Access and we have made the algorithm implementation in Delphi, but the implementation can also be made in other programming environments and we can also use other relational databases.