Skip to main content
Article thumbnail
Location of Repository

COP: Privacy-Preserving Multidimensional Partition in DAS Paradigm

By Jieping Wang, Xiaoyong Du, Haocong Wang and Pingping Yang

Abstract

Database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partition or ignores multidimensional data distribution characteristic, especially sparsity and locality. In this paper, we propose Cluster based Onion Partition (COP), which is designed to decrease both false positive and dead space at the same time. Basically, COP is composed of two steps. First, it partition covered space level by level, which is like peeling of onion; second, at each level, a clustering algorithm based on local density is proposed to achieve local optimal secure partition. Extensive experiments on real dataset and synthetic dataset show that COP is a secure multidimensional partition with much less efficiency loss than previous top down or bottom up counterparts

Topics: protection, H.3.3 [Information Search and Retrieval, Clustering Keywords Database security, Multi-dimensional partition, Cluster, DAS
Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.178.4613
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://cscdb.nku.edu/pais09/pd... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.