| Autor: |
Tie Ming Chen, Zhu Yan Gu, Jie Jiang |
| Rok vydání: |
2013 |
| Předmět: |
|
| Zdroj: |
Applied Mechanics and Materials. :2139-2143 |
| ISSN: |
1662-7482 |
| DOI: |
10.4028/www.scientific.net/amm.303-306.2139 |
| Popis: |
Vertical partitioning is a process of generating fragments, each of which is composed of attributes with high affinity. It is widely used in the distributed database to improve the efficiency of system by reducing the connection between the table access operations. The current research on vertical partitioning is mainly focused on how to measure the "affinity" to get the best-fit vertical partitioning and the n-way vertical partitioning which support generating the specific number of fragments required by the user. In this paper, we propose a vertical partitioning algorithm based on privacy constraint. It supports both the best-fit vertical partitioning and the n-way vertical partitioning. It also provides the data privacy protection by privacy constraint checking. We conduct several experimental results to show that our algorithm not only keeps higher efficiency, but also provides data privacy protection. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
