Querying Shared Data with Security Heterogeneity
Querying Shared Data with Security Heterogeneity
复制标题
查询安全异构的共享数据
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
K. Yi
中科院分区：
文献类型：
--
作者：
Yang Cao;W. Fan;Yanghao Wang;K. Yi
对安全数据共享的需求日益增加。在实践中，一组数据所有者通常采用异构安全方案，在该方案下，每对各方决定自己的协议，以不同的信任级别共享数据。该方案还跟踪数据的使用情况。本文研究了异构安全环境下的分布式SQL查询应答。我们通过纳入由数据共享协议确定的收费功能来定义查询计划，并反映在各种安全设施的使用中。我们将查询应答形式化为双标准优化问题，以最小化数据共享费用和并行查询评估成本。我们展示了这个问题对于SQL是PSPACE-hard，对于SPC是Σ_3^p-hard，并且它在NEXPTIME中。尽管困难重重，我们还是开发了一组近似算法来生成分布式查询计划，从而最大限度地减少数据共享费用并降低并行评估成本。使用现实生活和合成数据，我们经验验证了我们的算法的有效性，可扩展性和效率。
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.
DOI：
10.1145/3299869.3319891
发表时间：
2019-06
期刊：
Proceedings of the 2019 International Conference on Management of Data
影响因子：
--
作者：
Tianhao Wang;Bolin Ding;Jingren Zhou;Cheng Hong;Zhicong Huang;Ninghui Li;S. Jha
通讯作者：
Tianhao Wang;Bolin Ding;Jingren Zhou;Cheng Hong;Zhicong Huang;Ninghui Li;S. Jha