Abstract
We address the inference control problem in data cubes with some data known to users through external knowledge. The goal of inference controls is to prevent exact values of sensitive data from being inferred through answers to online analytical processing (OLAP) queries. We present an information theoretic approach for cardinality-based inference control, which simply counts the number of cells that all queries have covered thus far to determine whether a new query should be answered. Compared to previous approaches in sum-only data cubes, our new approach has a more general framework (applies to MIN, MAX and SUM) and is more effective.
Original language | English (US) |
---|---|
Pages | 59-64 |
Number of pages | 6 |
State | Published - 2004 |
Event | DOLAP 2004: Proceedings of the Seventh ACM International Workshop on Data Warehousing and OLAP - Washington, DC, United States Duration: Nov 12 2004 → Nov 13 2004 |
Other
Other | DOLAP 2004: Proceedings of the Seventh ACM International Workshop on Data Warehousing and OLAP |
---|---|
Country/Territory | United States |
City | Washington, DC |
Period | 11/12/04 → 11/13/04 |
All Science Journal Classification (ASJC) codes
- General Engineering