Create the Multiway and BUC (Bottom up constuction) algorithms in Java language.
The algorithms will read entries of dimension n and the cube will store the the number of the entries for every value combination.
The algorithms must be implemented in such a way that thay can support iceberg queries, where
HAVING COUNT(*) >= X.
Data is stored in the attached file. This file contains 100000 entries with 6 dimensions each. The values in each dimension are from 1 to 12.
the paramaters that the program will accept are:
a) The name of the entry file
b) the number of dimesions n (if n<6 then some of the columns in the entry file
will be ignored.
c) The X
d) The chunk size for Multiway algorithm
The output of each algorithm must be:
1)Execution time of the algorithm (without the initial reading of the file)
2)The value of each cell for all cubes (for example: (12*,*,*,*,5,*):1234 in the order they were calculated.
Compare execution time of both algorithms for the cases shown below.
- For Multiway algorithm the size of each chunk per dimension is the constant 1
- The number of dimensions is 3 (additional dimensions in file are ignored)
- X takes the values 1, 10, 20, 30, ..., 100.
You should also write a short report on the general thinking for the implementation, a short user manual,
explanation of the experimental results and the environment of execution.
Also the code must be well commented.
I want the project to be done till next monday,
Thank you
Hi sir, I am good at the algorithm design and implementation on OLAP.
And your algorithm is not hard for me.
I can handle this.
Please choose my bid.
Thank you