Efficient computation of Iceberg cubes with complex measures
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On the Computation of Multidimensional Aggregates
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Cardinality-based inference control in OLAP systems: an information theoretic approach
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Cardinality-based inference control in data cubes
Journal of Computer Security
Overcoming Limitations of Approximate Query Answering in OLAP
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Privacy preservation for data cubes
Knowledge and Information Systems
Improving range-sum query evaluation on data cubes via polynomial approximation
Data & Knowledge Engineering
Accuracy Control in Compressed Multidimensional Data Cubes for Quality of Answer-based OLAP Tools
SSDBM '06 Proceedings of the 18th International Conference on Scientific and Statistical Database Management
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
FMC: an approach for privacy preserving OLAP
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Journal of Computer and System Sciences
Towards a theory for privacy preserving distributed OLAP
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Trustworthiness analysis of sensor data in cyber-physical systems
Journal of Computer and System Sciences
Data warehousing and OLAP over big data: current challenges and future research directions
Proceedings of the sixteenth international workshop on Data warehousing and OLAP
Hi-index | 0.00 |
In this paper we propose an innovative framework based on flexible sampling-based data cube compression techniques for computing privacy preserving OLAP aggregations on data cubes while allowing approximate answers to be efficiently evaluated over such aggregations. In our proposal, this scenario is accomplished by means of the so-called accuracy/privacy contract, which determines how OLAP aggregations must be accessed throughout balancing accuracy of approximate answers and privacy of sensitive ranges of multidimensional data.