Please use this identifier to cite or link to this item:
|Title:||Privacy preservation for data cubes|
|Authors:||Sung, S.Y. |
Random data distortion
|Citation:||Sung, S.Y., Liu, Y., Xiong, H., Ng, P.A. (2006). Privacy preservation for data cubes. Knowledge and Information Systems 9 (1) : 38-61. ScholarBank@NUS Repository. https://doi.org/10.1007/s10115-004-0193-2|
|Abstract:||A range query finds the aggregated values over all selected cells of an online analytical processing (OLAP) data cube where the selection is specified by the ranges of contiguous values for each dimension. An important issue in reality is how to preserve the confidential information in individual data cells while still providing an accurate estimation of the original aggregated values for range queries. In this paper, we propose an effective solution, called the zero-sum method, to this problem. We derive theoretical formulas to analyse the performance of our method. Empirical experiments are also carried out by using analytical processing benchmark (APB) dataset from the OLAP Council. Various parameters, such as the privacy factor and the accuracy factor, have been considered and tested in the experiments. Finally, our experimental results show that there is a trade-off between privacy preservation and range query accuracy, and the zero-sum method has fulfilled three design goals: Security, accuracy, and accessibility. © Springer-Verlag London Ltd. 2005.|
|Source Title:||Knowledge and Information Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2018
WEB OF SCIENCETM
checked on May 29, 2018
checked on May 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.