Back to search

University of Waterloo

Differentially Private Online Aggregation

Abstract

dc:description.abstract

Database operations are often performed in batch mode, i.e. the analyst issuing the query must wait till the database has been processed in its entirety before getting feedback. Batch mode is inadequate for large databases since queries can take several hours to process and often an analyst is satisfied with an approximation. Online aggregation greatly improves user experience and saves resources by providing continuous feedback through running confidence intervals. Further, it provides an interface for users to terminate early and allocate resources elsewhere once a sufficient accuracy level has been achieved. Until now, online aggregation has not been studied in a differentially private setting. In this work, we formulate differentially private online aggregation such that it captures the trade-offs between privacy, accuracy, and usability. Further, we develop a family of differentially private mechanisms, which includes our optimal Gap mechanisms, for answering AVG, COUNT, and SUM queries with WHERE conditions. Also, we develop various optimizations to improve the accuracy of the Gap mechanism and empirically confirm that the Gap mechanisms preform the best overall.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2022

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sivasubramaniam, Harry
Advisor dc:contributor.advisor
  • He, Xi

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/17876

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Sivasubramaniam, Harry. Differentially Private Online Aggregation. University of Waterloo, 2022. http://hdl.handle.net/10012/17876