Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
