A heuristic for disclosure control in hierarchical tables was introduced in . In that heuristic, the complete set of all possible subtables is being protected in a sequential way. In this article, we will show that it is possible to reduce the set of subtables, to a set that contains subtables with the same dimension as the complete hierarchical table only. I.e., in case of a three dimensional hierarchical table, only three dimensional subtables need to be checked, not all two or one dimensional subtables. We performed the old and the new approach on a few testtables. Based on the results we conclude that neither approach outperforms the other for all testtables. However, conceptually we prefer the approach with the reduced set of subtables. © Springer-Verlag 2004.
De Wolf, P. P., & Loeve, A. (2004). Reducing the set of tables τ-ARGUS considers in a hierarchical setting. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3050, 99–109. https://doi.org/10.1007/978-3-540-25955-8_8