Set-Based Adaptive Distributed Differential Evolution for Anonymity-Driven Database Fragmentation

By breaking sensitive associations between attributes, database fragmentation can protect the privacy of outsourced data storage. Database fragmentation algorithms need prior knowledge of sensitive associations in the tackled database and set it as the optimization objective. Thus, the effectiveness...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Data Science and Engineering Ročník 6; číslo 4; s. 380 - 391
Hlavní autoři: Ge, Yong-Feng, Cao, Jinli, Wang, Hua, Chen, Zhenxiang, Zhang, Yanchun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Singapore Springer Singapore 01.12.2021
Springer
Springer Nature B.V
Témata:
Algorithm Analysis and Problem Complexity
Algorithms
Analysis
Artificial Intelligence
Chemistry and Earth Sciences
Computer Science
Data Mining and Knowledge Discovery
Data security
Data storage
Database Management
Domains
Evolutionary algorithms
Evolutionary computation
Fragmentation
Information storage and retrieval
Mutation
Operators (mathematics)
Optimization
Physics
Privacy
Privacy, Right of
Statistics for Engineering
Systems and Data Security
Database fragmentation
Differential evolution
Data privacy
ISSN:2364-1185, 2364-1541
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:By breaking sensitive associations between attributes, database fragmentation can protect the privacy of outsourced data storage. Database fragmentation algorithms need prior knowledge of sensitive associations in the tackled database and set it as the optimization objective. Thus, the effectiveness of these algorithms is limited by prior knowledge. Inspired by the anonymity degree measurement in anonymity techniques such as k -anonymity, an anonymity-driven database fragmentation problem is defined in this paper. For this problem, a set-based adaptive distributed differential evolution (S-ADDE) algorithm is proposed. S-ADDE adopts an island model to maintain population diversity. Two set-based operators, i.e., set-based mutation and set-based crossover, are designed in which the continuous domain in the traditional differential evolution is transferred to the discrete domain in the anonymity-driven database fragmentation problem. Moreover, in the set-based mutation operator, each individual’s mutation strategy is adaptively selected according to the performance. The experimental results demonstrate that the proposed S-ADDE is significantly better than the compared approaches. The effectiveness of the proposed operators is verified.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2364-1185
2364-1541
DOI:10.1007/s41019-021-00170-4