A cubic-wise balance approach for privacy preservation in data cubes

Information Sciences

Volumn 176, Issue 9, 2006, Pages 1215-1240

  Liu, Yao ^a   Sung, Sam Y ^a   Xiong, Hui ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Data perturbation; Data warehouse; OLAP; Privacy preservation; Range query

Indexed keywords

DATA PERTURBATION; OLAP; PRIVACY PRESERVATION; RANGE QUERY;

BENCHMARKING; DATA MINING; DATA WAREHOUSES; PERTURBATION TECHNIQUES; QUERY LANGUAGES; SECURITY OF DATA;

DATA PRIVACY;

EID: 33144471694     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.03.010     Document Type: Article

References (32)

1. Hackers, Crackers, Spooks, ensuring that your data warehouse is secure DBMS Magazine 10 4 1997 14
2. D. Kim, E. Lee, M. Kim, and Y. Lee An efficient processing of range-min/max queries over data cube source Information Sciences 112 1998 223 237
3. P.M. Deshpande, K. Ramasamy, A. Hukla, J.F. Naughton, Caching multidimensional queries using chunks, in: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, 1998, pp. 259-270.
4. V. Harinarayan, A. Rajaraman, J.D. Ullman, Implementing data cubes efficiently, in: Proceedings of the 15th ACM SIGMOD International Conference on Management of Data, 1996.
5. T. Priebe, G. Pernul, Towards OLAP security design-survey and research issues, in: Proceedings of the third ACM International Workshop on Data Warehousing and OLAP, 2000.
6. L. Wang, D. Wijesekera, S. Jajodia, Cardinality-based inference control in sum-only data cubes, in: Proceedings of the Seventh European Symposium on Research in Computer Security, 2002, pp. 55-71.
7. R. Agrawal, R. Srikant, Privacy-preserving data mining, in: Proceedings of the 19th ACM SIGMOD Conference on Management of Data, 2000, pp. 439-450.
8. A. Evfimievski, J. Gehrke, R. Srikant, Limiting privacy breaches in privacy preserving data mining, in: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003, pp. 211-222.
9. R.A. Evfimievski, R. Srikant, J. Gehrke, Privacy preserving mining of associations rules, in: Proceedings of the Eighth Conference on Knowledge Discovery and Data Mining, 2002, pp. 217-228.
10. I. Dinur, K. Nissim, Revealing information while preserving privacy, in: Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2003, pp. 202-210.
11. J. Vaidya, C. Clifton, Privacy preserving association rule mining in vertically partitioned data, in: Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining, 2002, pp. 639-644.
12. H. Kargupta, S. Datta, Q. Wang, K. Sivakumar, On the privacy preserving properties of random data perturbation techniques, in: Proceedings of IEEE International Conference on Data Mining, 2003, pp. 19-22.
13. N.R. Adam, and J.C. Wortman Security-control methods for statistical databases: a comparative study ACM Computing Surveys 21 4 1989 515 556
14. D.E. Denning, P.J. Denning, and M.D. Schwartz The tracker: a threat to statistical database security ACM Transactions on Database Systems 4 1 1979 76 96
15. D. Dobkin, A.K. Jones, and R.J. Lipton Secure database: protection against user influence ACM Transactions on Database Systems 4 1 1979 97 106
16. S.P. Reuss Practical data swapping: the first steps ACM Transactions on Database Systems 9 1 1984 20 37
17. C.K. Liew, U.J. Choi, and C.J. Liew A data distortion by probability distribution ACM Transactions on Database Systems 10 3 1985 395 411
18. J.F. Traub, Y. Yemini, and H. Woznlakowski The statistical security of a statistical database ACM Transactions on Database System 9 4 1984 672 679
19. A.-L. Abul-ela, B.G. Greenberg, and D.G. Horvitz A multi-proportions randomized response model Journal of American Statistical Association 62 319 1967 990 1008
20. D.E. Denning Secure statistical databases with random sample queries ACM Transactions on Database Systems 5 3 1980 291 315
21. L.L. Beck A security mechanism for statistical databases ACM Transactions on Database Systems 5 3 1980 316 338
22. C. Faloutsos, H. Jagadish, N. Sidiropoulos, Recovering data from summary information, in: Proceedings of the 23rd International Conference on Very Large Data Bases, 1997, pp. 36-45.
23. D. Barbara, W. DuMouched, C. Faloutsos, P. Haas, J.M. Hellerstein, and Y. Ioannidis The New Jersey data reduction report Data Engineering Bulletin 20 1997 3 45
24. D. Barbara, and M. Sullivan Quasi-cubes: exploiting approximations in multidimensional databases ACM SIGMOD Record 26 3 1997 12 17
25. B. Srinivasan Parallel searching in distributed databases Computer Networks 4 1980 157 166
26. O. Council, OLAP council's release II of the analytical processing benchmark (apb-1) for OLAP server performance, 1998. Available from: < http://www.olapcouncil.org/news/APBlr2b_PR.htm>.
27. H. Harinarayan, A. Rajaraman, J.D. Ullman, Implementing data cubes efficiently, in: Proceedings ACM SIGMOD 1996, 1996, pp. 205-216.
28. Y. Chen, F. Dehne, T. Eavis, A. Rau-Chaplin, Building large Olap data cubes in parallel, in: Proceedings of the International Database Engineering and Applications Symposium, 2004, pp. 367-377.
29. Microsoft, EMC, Unisys, T3 project technical overview, White Paper.
30. F. Dehne, T. Eavis, S. Hambrusch, and A. Rau-chaplin Parallelizing the data cube Distributed and Parallel Databases 11 2 2002 181 201
31. H. Lu, X. Huang, Z. Li, Computing data cubes using massively parallel processors, in: Proceedings of Seventh Parallel Computing Workshop, 1997.
32. S. Goil, and A. Choudhary High performance OLAP and data mining on parallel computers Journal of Data Mining and Knowledge Discovery 1 4 1997 391 417