I'm working on vertical partitioning for databases exploiting the
datamining techniques.
I tested my approche on small databases: Teaching Assistant Evaluation
(TAE) and ADULT, which were taken from the UCI Machine Learning
Repository. Now, I want to test the proposed approach on large databases.
I want to ask you if you would like to provide me a benchmark: a table + a
workload (for large databases).
Thanks!