Threats to validity in our evaluation are also analyzed. Star Student Project computation time of the minimum cost benchmarking approach is far higher than other storage strategies and in fact impractical at runtime, e.g., taking more than 6 minutes for this case and increasing very rapidly when the number of data sets grows. This is because its computation complexity depends on the total number of data sets, which means that for any number of newly generated data sets or changes of the data sets’ usage frequencies, Star Student Project need to call the general CTT-SP algorithm on the whole DDG to find the minimum cost storage strategy.
Project Support for : Ph.D/M.E/M.Tech/B.E/B.Tech/MCA/Msc/BCA/Diplomo
Department : Computer Science/ Information Technology/ Electronics
Star Student Project
Threats to validity in our evaluation are also analyzed. Star Student Project computation time of the minimum cost benchmarking approach is far higher than other storage strategies and in fact impractical at runtime, e.g., taking more than 6 minutes for this case and increasing very rapidly when the number of data sets grows. This is because its computation complexity depends on the total number of data sets, which means that for any number of newly generated data sets or changes of the data sets’ usage frequencies, Star Student Project need to call the general CTT-SP algorithm on the whole DDG to find the minimum cost storage strategy.