Abstract
With the advent of an unprecedented magnitude of data, top-k queries have gained a lot of attention. However, existing work to date has focused on optimizing efficiency without looking closely at privacy preservation. In this paper, we study how existing approaches have failed to support a combination of accuracy and privacy requirements and we propose a new data publishing framework that supports both areas. We show that satisfying both requirements is an essential problem and propose two comprehensive algorithms. We also validated the correctness and efficiency of our approach using experiments.
| Original language | English |
|---|---|
| Title of host publication | Database Systems for Advanced Applications - 15th International Conference, DASFAA 2010, Proceedings |
| Pages | 414-428 |
| Number of pages | 15 |
| Edition | PART 1 |
| DOIs | |
| Publication status | Published - 2010 |
| Event | 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 - Tsukuba, Japan Duration: 2010 Apr 1 → 2010 Apr 4 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Number | PART 1 |
| Volume | 5981 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 15th International Conference on Database Systems for Advanced Applications, DASFAA 2010 |
|---|---|
| Country/Territory | Japan |
| City | Tsukuba |
| Period | 10/4/1 → 10/4/4 |
Bibliographical note
Funding Information:This work was supported by Engineering Research Center of Excellence Program of Korea Ministry of Education, Science and Technology (MEST) / Korea Science and Engineering Foundation (KOSEF), grant number R11-2008-007-03003-0.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)