Language-integrated privacy-aware distributed queries
Language-integrated privacy-aware distributed queries
复制标题
DOI：
10.1145/3360593
复制
发表时间：
2019-10
影响因子：
--
通讯作者：
G. Salvaneschi;M. Köhler;Daniel Sokolowski;Philipp Haller;Sebastian Erdweg;M. Mezini
中科院分区：
文献类型：
--
作者：
G. Salvaneschi;M. Köhler;Daniel Sokolowski;Philipp Haller;Sebastian Erdweg;M. Mezini
分布式查询处理是处理海量数据的有效手段。为了从分布式系统的技术细节中抽象出来，用于操作符放置的算法自动地将顺序数据查询分布在可用的处理单元上。然而，当前的操作员放置算法关注的是性能，而忽略了处理敏感数据时出现的隐私问题。我们提出了一种新的隐私感知操作员放置方法，既防止了敏感信息的泄漏，又提高了性能。重要的是，我们的方法是基于信息流类型的系统，用于数据查询来推理查询子计算的敏感性。我们的解决方案分两个阶段展开。首先，放置空间缩减使用由信息流类型系统驱动的语法制导的转换，基于隐私约束生成部署候选。其次，约束求解基于最大化性能的成本模型在候选对象中选择最佳位置。我们验证了我们的算法保留了查询的顺序行为，防止了敏感数据的泄漏。我们实现了一种新的查询语言SecQL的类型系统和放置算法，并在基准测试中展示了显著的性能改进。
Distributed query processing is an effective means for processing large amounts of data. To abstract from the technicalities of distributed systems, algorithms for operator placement automatically distribute sequential data queries over the available processing units. However, current algorithms for operator placement focus on performance and ignore privacy concerns that arise when handling sensitive data. We present a new methodology for privacy-aware operator placement that both prevents leakage of sensitive information and improves performance. Crucially, our approach is based on an information-flow type system for data queries to reason about the sensitivity of query subcomputations. Our solution unfolds in two phases. First, placement space reduction generates deployment candidates based on privacy constraints using a syntax-directed transformation driven by the information-flow type system. Second, constraint solving selects the best placement among the candidates based on a cost model that maximizes performance. We verify that our algorithm preserves the sequential behavior of queries and prevents leakage of sensitive data. We implemented the type system and placement algorithm for a new query language SecQL and demonstrate significant performance improvements in benchmarks.