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 Oct
|11:00 - 11:22|
Ivana VukoticSnT, University of Luxembourg, Vincent RahliUniversity of Birmingham, Paulo Esteves-VeríssimoSnT, University of LuxembourgDOI
|11:22 - 11:45|
|11:45 - 12:07|
Ragnar MogkTechnische Universität Darmstadt, Joscha DrechslerTechnische Universität Darmstadt, Guido SalvaneschiTechnische Universität Darmstadt, Mira MeziniTechnische Universität DarmstadtDOI
|12:07 - 12:30|
Guido SalvaneschiTechnische Universität Darmstadt, Mirko KöhlerTechnische Universität Darmstadt, Daniel SokolowskiTechnische Universität Darmstadt, Philipp HallerKTH Royal Institute of Technology, Sebastian ErdwegJGU Mainz, Mira MeziniTechnische Universität DarmstadtDOI