ABSTRACT The advent of database services has resulted in privacy concerns on the part of the client storing data with third party database service providers. Previous approaches to enabling such a service have been based on data encryption, causing a large overhead in query processing. A distributed architecture for secure database services was proposed as a solution to this problem. In this paper we explore partitioning algorithms for these distributed architectures. We show that a general version of the problem is NP-hard.We therefore propose heuristic techniques based on greedy hill climbing to obtain partitions which satisfy the privacy constraints. Experimental results show that in practice our heuristics provide nearly optimal solutions. 1
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.