Exploitation des techniques de fouille de données pour la compression de contraintes table
Abstract
In this paper, we propose an improvement of the compression step of sliced table method
proposed for compressing table constraints. We propose to use of the frequency and the cover
of an itemset in the FP-tree to improve the construction step of the resulting compressed tables.
Moreover, we propose to exploit the compression rate metric instead of savings to compute
frequent itemsets relevant for compression. This allows higher compression. Experimental
results show the effectiveness and efficiency of our approach.