Browsing by Subject "Relational database"
Now showing 1 - 1 of 1
- Results Per Page
- Sort Options
Item Open Access Multirelational k-anonymity(2009) Nergiz, M.E.; Clifton, C.; Nergiz, A.E.k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous data set, any identifying information occurs in at least k tuples. Much research has been done to modify a single-table data set to satisfy anonymity constraints. This paper extends the definitions of k-anonymity to multiple relations and shows that previously proposed methodologies either fail to protect privacy or overly reduce the utility of the data in a multiple relation setting. We also propose two new clustering algorithms to achieve multirelational anonymity. Experiments show the effectiveness of the approach in terms of utility and efficiency. © 2006 IEEE.