Write a Blog >>
Thu 22 Jun 2017 16:25 - 16:55 at Vertex WS215 - Incremental computing 3: Research talks

Distributed incremental processing is an effective solution for processing large amounts of data in an efficient way. In this setting, algorithms for operator placement automatically distribute data queries the 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 ongoing research on a new methodology for privacy-aware operator placement that both prevents leakage of sensitive information and improves performance. We implement a working prototype based on previous work on (local) incremental computation.

Thu 22 Jun
Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

15:50 - 17:30: IC 2017 - Incremental computing 3: Research talks at Vertex WS215
ic-2017-papers15:50 - 16:20
Rudi HornUniversity of Edinburgh, James CheneyUniversity of Edinburgh, UK
File Attached
ic-2017-papers16:25 - 16:55
Mirko KöhlerTechnical University of Darmstadt, Philipp HallerKTH Royal Institute of Technology, Sebastian ErdwegTU Delft, Mira MeziniTU Darmstadt, Guido SalvaneschiTU Darmstadt
File Attached
ic-2017-papers17:00 - 17:30
Kyle HeadleyUniversity of Colorado Boulder
File Attached