Querying Shared Data with Security Heterogeneity

CategoryPublications 211

Authors: Yang Cao, Wenfei Fan, Yanghao Wang, Ke Yi

Published in: ACM Conference on Management of Data(SIGMOD 2020), June 14-19, 2020, Portland Oregon, USA

Date of Publication: June 14, 2020


There has been increasing need for secure data sharing. In practice a group of data owners often adopt a heterogeneous security scheme under which each pair of parties decide their own protocol to share data with diverse levels of trust. The scheme also keeps track of how the data is used. This paper studies distributed SQL query answering in the heterogeneous security setting. We define query plans by incorporating toll functions determined by data sharing agreements and reflected in the use of various security facilities. We formalize query answering as a bi-criteria optimization problem, to minimize both data sharing toll and parallel query evaluation cost. We show that this problem is PSPACE-hard for SQL and Σ_3^p-hard for SPC, and it is in NEXPTIME. Despite the hardness, we develop a set of approximate algorithms to generate distributed query plans that minimize data sharing toll and reduce parallel evaluation cost. Using real-life and synthetic data, we empirically verify the effectiveness, scalability and efficiency of our algorithms.

View Full Text

Keywords2020Data pricingsharing and marketingSIGMODWenfei Fan Previous: Next: