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.
Thu 24 OctDisplayed time zone: Beirut change
11:00 - 12:30
|Asphalion: Trustworthy Shielding against Byzantine Faults|
Ivana Vukotic SnT, University of Luxembourg, Vincent Rahli University of Birmingham, Paulo Esteves-Veríssimo SnT, University of LuxembourgDOI
|DProf: Distributed Profiler with Strong Guarantees|
|A Fault-Tolerant Programming Model for Distributed Interactive Applications|
Ragnar Mogk Technische Universität Darmstadt, Joscha Drechsler Technische Universität Darmstadt, Guido Salvaneschi Technische Universität Darmstadt, Mira Mezini Technische Universität DarmstadtDOI
|Language-Integrated Privacy-Aware Distributed Queries|
Guido Salvaneschi Technische Universität Darmstadt, Mirko Köhler Technische Universität Darmstadt, Daniel Sokolowski Technische Universität Darmstadt, Philipp Haller KTH Royal Institute of Technology, Sebastian Erdweg JGU Mainz, Mira Mezini Technische Universität DarmstadtDOI