Welcome to the InfoSci Platform
Reference Hub2
Privacy in Multidimensional Databases

Privacy in Multidimensional Databases

Francesco M. Malvestuto, Marina Moscarini
Copyright: © 2003 |Pages: 51
ISBN13: 9781591400530|ISBN10: 1591400538|EISBN13: 9781591400868
DOI: 10.4018/978-1-59140-053-0.ch011
Cite Chapter Cite Chapter

MLA

Malvestuto, Francesco M., and Marina Moscarini. "Privacy in Multidimensional Databases." Multidimensional Databases: Problems and Solutions, edited by Maurizio Rafanelli, IGI Global, 2003, pp. 310-360. https://doi.org/10.4018/978-1-59140-053-0.ch011

APA

Malvestuto, F. M. & Moscarini, M. (2003). Privacy in Multidimensional Databases. In M. Rafanelli (Ed.), Multidimensional Databases: Problems and Solutions (pp. 310-360). IGI Global. https://doi.org/10.4018/978-1-59140-053-0.ch011

Chicago

Malvestuto, Francesco M., and Marina Moscarini. "Privacy in Multidimensional Databases." In Multidimensional Databases: Problems and Solutions, edited by Maurizio Rafanelli, 310-360. Hershey, PA: IGI Global, 2003. https://doi.org/10.4018/978-1-59140-053-0.ch011

Export Reference

Mendeley
Favorite

Abstract

When answering queries that ask for summary statistics, the query-system of a multidimensional database should guard confidential data, that is, it should avoid revealing (directly or indirectly) individual data, which could be exactly calculated or accurately estimated from the values of answered queries. In order to prevent the disclosure of confidential data, the query-system should be provided with an auditing procedure which, each time a new query is processed, checks that its answer does not allow a (knowledgeable) user to disclose any sensitive data. A promising approach consists in keeping track of (or auditing) answered queries by means a dynamic graphical data structure, here called the answer map, whose size increases with the number of answered queries and with the number of dimensions of the database, so that the problem of the existence of an efficient auditing procedure naturally arises. This chapter reviews recent results on this problem for “additive” queries (such as COUNT and SUM queries) by listing some polynomially solvable problems as well as some hard problems, and suggests directions for future work.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.