Privacy preservation for data cubes

被引:0
作者
Sam Y. Sung
Yao Liu
Hui Xiong
Peter A. Ng
机构
[1] National University of Singapore,Department of Computer Science
[2] Rutgers University,MSIS Department
[3] University of Texas—Pan American,Department of Computer Science
来源
Knowledge and Information Systems | 2006年 / 9卷
关键词
Privacy preservation; OLAP; Random data distortion; Range query;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:38 / 61
页数:23
相关论文
empty
未找到相关数据